Principles of Alpha-Induction and Recursion for the Lambda Calculus in Constructive Type Theory
Paper in proceeding, 2015

We formulate principles of induction and recursion for a variant of lambda calculus in its original syntax (i.e., with only one sort of names) where alpha-conversion is based upon name swapping as in nominal abstract syntax. The principles allow to work modulo alpha-conversion and implement the Barendregt variable convention. We derive them all from the simple structural induction principle on concrete terms and work out applications to some fundamental meta-theoretical results, such as the substitution lemma for alpha-conversion and the lemma on substitution composition. The whole work is implemented in Agda.


Ernesto Copello

Alvaro Tasistro

Nora Szasz

Ana Bove

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Maribel Fernandez



Subject Categories

Computer and Information Science

Computer Science

More information