Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory
Artikel i vetenskaplig tidskrift, 2016

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.

substitution

Författare

Ernesto Copello

Universidad ORT Uruguay

Alvaro Tasistro

Universidad ORT Uruguay

Nora Szasz

Universidad ORT Uruguay

Ana Bove

Chalmers, Data- och informationsteknik, Datavetenskap

Maribel Fernandez

King's College London

Electronic Notes in Theoretical Computer Science

1571-0661 (ISSN)

Vol. 323 109-124

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1016/j.entcs.2016.06.008