Alpha-structural recursion and induction

Alpha-structural recursion and induction (2006)

by Andrew M. Pitts

Venue:	Journal of the ACM
Citations:	38 - 6 self

Datum	Value	Source
TITLE	Alpha-structural recursion and induction	INFERENCE
AUTHOR NAME	Andrew M. Pitts	SVM HeaderParse 0.2
AUTHOR AFFIL	; Cambridge University Computer Laboratory; Version distributed at the; International Summer School On Applied Semantics	SVM HeaderParse 0.2
AUTHOR ADDR	; Cambridge CB3 0FD, UK; Frauenchiemsee, Germany	SVM HeaderParse 0.2
ABSTRACT	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 formalisation 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 paper explains the idea in as concrete a way as possible and gives a new derivation within higher-order logic of principles of α-structural recursion and induction for α-equivalence classes from the ordinary versions of these principles for abstract syntax trees.	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2006	INFERENCE
VOLUME	53	INFERENCE
CITATIONS	29 found	ParsCit 1.0