Add to ORKGWe 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
AbstractNominal logic is an extension of first-order logic with features useful for reasoning about ...
In this thesis I introduce a new approach to the automated analysis of the reduction behaviour of A...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...
AbstractWe formulate principles of induction and recursion for a variant of lambda calculus in its o...
We formulate principles of induction and recursion for a variant of lambda calculus in its original ...
AbstractIn [Stoughton, A., Substitution revisited, Theor. Comput. Sci. 59 (1988), pp. 317–325], Alle...
There is growing evidence for the usefulness of name permutations when dealing with syntax involving...
AbstractTwo-level lambda-calculus is designed to provide a mathematical model of capturing substitut...
Substitution in the lambda calculus is a complex operation that traditional presentations of beta co...
AbstractWe describe in this paper formalisations for the properties of weakening, type-substitutivit...
Two-level lambda-calculus is designed to provide a mathematical model of capturing substitution, als...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
The issue of whether embedding algebraic theories in higher-order theories such as the simply typed ...
AbstractA definition of simultaneous substitution for the lambda calculus is presented that is easie...
AbstractNominal logic is an extension of first-order logic with features useful for reasoning about ...
In this thesis I introduce a new approach to the automated analysis of the reduction behaviour of A...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...
AbstractWe formulate principles of induction and recursion for a variant of lambda calculus in its o...
We formulate principles of induction and recursion for a variant of lambda calculus in its original ...
AbstractIn [Stoughton, A., Substitution revisited, Theor. Comput. Sci. 59 (1988), pp. 317–325], Alle...
There is growing evidence for the usefulness of name permutations when dealing with syntax involving...
AbstractTwo-level lambda-calculus is designed to provide a mathematical model of capturing substitut...
Substitution in the lambda calculus is a complex operation that traditional presentations of beta co...
AbstractWe describe in this paper formalisations for the properties of weakening, type-substitutivit...
Two-level lambda-calculus is designed to provide a mathematical model of capturing substitution, als...
Higher-order abstract syntax is a central representation technique in logical frameworks which maps ...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
The issue of whether embedding algebraic theories in higher-order theories such as the simply typed ...
AbstractA definition of simultaneous substitution for the lambda calculus is presented that is easie...
AbstractNominal logic is an extension of first-order logic with features useful for reasoning about ...
In this thesis I introduce a new approach to the automated analysis of the reduction behaviour of A...
We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of...