Idioma:

Alpha-structural recursion and induction

PITTS, Andrew M

Journal of the ACM, 2006-05, Vol.53 (3), p.459-506 [Periódico revisado por pares]

New York, NY: Association for Computing Machinery

Texto completo disponível

Citações Citado por

Enviar para

Título:
Alpha-structural recursion and induction
Autor: PITTS, Andrew M
Assuntos: Applied sciences ; Calculus ; Computer programming ; Computer science; control theory; systems ; Derivation ; Exact sciences and technology ; Invariants ; Language ; Language theory and syntactical analysis ; Mathematical analysis ; Names ; Permutations ; Programming languages ; Recursion ; Semantics ; Studies ; Syntax ; Theoretical computing ; Theory ; Trees ; Variables
É parte de: Journal of the ACM, 2006-05, Vol.53 (3), p.459-506
Notas: ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
Descrição: The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permuting names. The use of permutations gives rise to an attractively simple formalization of common, but often technically incorrect uses of structural recursion and induction for abstract syntax modulo α-equivalence. At the heart of this approach is the notion of finitely supported mathematical objects. This article explains the idea in as concrete a way as possible and gives a new derivation within higher-order classical logic of principles of α- structural recursion and induction for α-equivalence classes from the ordinary versions of these principles for abstract syntax trees.
Editor: New York, NY: Association for Computing Machinery
Idioma: Inglês

Links

View record in Pascal Francis

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Alpha-structural recursion and induction

PITTS, Andrew M

New York, NY: Association for Computing Machinery

Buscando em bases de dados remotas. Favor aguardar.