Abstract

Abstract. In this paper we define an inductive set that is bijective with the ff-equated lambda-terms. Unlike de-Bruijn indices, however, our inductive definition includes names and reasoning about this definition is very similar to informal reasoning on paper. For this we provide a structural induction principle that requires to prove the lambda-case for fresh binders only. The main technical novelty of this work is that it is compatible with the axiom-of-choice (unlike earlier nominal logic work by Pitts et al); thus we were able to implement all results in Isabelle/HOL and use them to formalise the standard proofs for Church-Rosser and strongnormalisation. Keywords. Lambda-calculus, nominal logic, structural induction, theoremassistants.

Citations

269	Higher-order abstract syntax - Pfenning, Elliott - 1988
266	The Lambda Calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics - Barendregt - 1985
174	A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 - GABBAY, PITTS - 2001
142	Nominal logic, a first order theory of names and binding - PITTS
132	Proofs and Types, volume 7 of Cambridge Tracts - Girard, Lafont, et al. - 1988
110	Mechanized metatheory for the masses: the POPLMark Challenge - Aydemir, Bohannon, et al. - 2005
95	Higher-order unification via explicit substitutions - Hardin, Kirchner
78	On equivalence and canonical forms in the LF type theory - Harper, Pfenning - 2005
69	Automating recursive type definitions in higher order logic - Melham - 1989
62	S.: Engineering formal metatheory - Aydemir, Charguéraud, et al. - 2008
49	Five axioms of alpha conversion - Gordon, Melham
49	Classical Logic and Computation - Urban - 2000
42	The design and implementation of Typed Scheme - Tobin-Hochstadt, Felleisen - 2008
38	Alpha-structural recursion and induction - Pitts
37	Higher-order abstract syntax in Coq - Despeyroux, Felty, et al. - 1995
32	Combining higher order abstract syntax with tactical theorem proving and (co)induction - Ambler, Crole, et al. - 2002
29	A mechanisation of name-carrying syntax up to alpha-conversion - Gordon - 1994
28	Polymorphic Typing of an Algorithmic Language - Leroy - 1992
19	M.: Barendregt’s Variable Convention in Rule Inductions - Urban, Berghofer, et al. - 2007
17	A recursion combinator for nominal datatypes implemented in Isabelle/HOL - Urban, Berghofer - 2006
13	Disjunction and existence under implications in elementary intuitionistic formalisms - Kleene - 1962
13	Recursive function definition for types with binders - Norrish - 2004
12	Formalising the pi-Calculus using Nominal Logic - Bengtson, Parrow - 2007
11	A formal treatment of the Barendregt variable convention in rule inductions - Urban, Norrish - 2005
10	Using Axiomatic Type Classes - Wenzel
9	A Formalization of the Strong Normalisation Proof for System F - Altenkirch - 1993
8	Parallel reductions in lambda-calculus - Takahashi - 1995
7	Defining Functions on Equivalence Classes - Paulson
6	A design structure for higher order quotients - Homeier - 2005
6	Isabelle HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS - Nipkow, Paulson, et al. - 2002
5	Logical Relations and a Case Study in Equivalence Checking - Crary - 2005
5	Wellfounded Schematic Definitions - Slind - 2000
4	Structured induction proofs in Isabelle/Isar - Wenzel
3	A Theory of Inductive Definitions With -Equivalence - Gabbay
2	Mechanising�-Calculus Using a Classical First Order Theory of Terms with Permutation. Higher Order and Symbolic Computation - Norrish - 2006
1	A Theory of Inductive Definitions With ff-equivalence - Gabbay - 1995
1	Higher-order logic theorem proving and its applications, volume 780 of LNCS - Gordon, Melham - 1993
1	Nominal Reasoning Techniques in Coq (work in progress - Aydemir, Bohannon, et al. - 2006