Abstract:Abstract. Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a certain endofunctor on the category of nominal sets. We show that the terms of the infinitary lambda-calculus form the final coalgebra for the same functor. This allows us to give a corecursion principle for alpha-equivalence classes of finite and infinite terms. As an application, we give corecursive definitions of substitution and of infinite normal forms (Böhm, Lévy-Longo and Berarducci trees).
“…Moreover the map [−] α : T ∞ Σ → (T Σ /= α ) ∞ is not surjective in general, as shown by Example 5.20. In the case of the infinitary λ-calculus we solved this issue by restricting our attention to terms with finitely many free variables [KPSdV12]. We do the same in the case of a general binding signature.…”
Section: Nominal Coalgebraic Data Types For Bindingmentioning
confidence: 99%
“…In [KPSdV12] we showed that this nominal set is isomorphic to (Λ ∞ ffv /= α , ·) and to the carrier of the final coalgebra of the Nom-functor L α . Hence, for each α-equivalence class of infinitary terms with finitely many variables we can find a representative.…”
Section: )))mentioning
confidence: 99%
“…is surjective can be proved by going back to the syntax as in [KPSdV12], just that this time, due to generalising from λ-calculus to binding signatures, the notation becomes even heavier and quite unpleasant. Therefore, we will give a semantic proof in the next section, so that surjectivity becomes a consequence of Theorem 5.72.…”
Section: Proof First We Have To Define the Map [−]mentioning
confidence: 99%
“…Then the bound variables of xλy.y can be computed as supp(xλy.y) \ supp([xλy.y] α ) = {x, y} \ {x} = {y}. Of course, this calculation depends on being able to assume that the bound variables and free variables of xλy.y do not overlap, or, in the terminology of [KPSdV12], that xλy.y is α-safe. The next definition gives a semantic formulation of an element being safe with respect to a map, which now does not need to be a quotient by α-equivalence.…”
Section: Bound Variables Safe Maps and Safe Squaresmentioning
confidence: 99%
“…We prove that the set of equivalence classes of infinitary terms with finitely many free variables is the final coalgebra of a Nom-functor. Our running example is the infinitary λ-calculus, and indeed the results of [KPSdV12] are particular instances of the main theorems in this section.…”
Section: Alpha Corecursion Principle For Nominal Coalgebraic Data Typesmentioning
Abstract. We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
“…Moreover the map [−] α : T ∞ Σ → (T Σ /= α ) ∞ is not surjective in general, as shown by Example 5.20. In the case of the infinitary λ-calculus we solved this issue by restricting our attention to terms with finitely many free variables [KPSdV12]. We do the same in the case of a general binding signature.…”
Section: Nominal Coalgebraic Data Types For Bindingmentioning
confidence: 99%
“…In [KPSdV12] we showed that this nominal set is isomorphic to (Λ ∞ ffv /= α , ·) and to the carrier of the final coalgebra of the Nom-functor L α . Hence, for each α-equivalence class of infinitary terms with finitely many variables we can find a representative.…”
Section: )))mentioning
confidence: 99%
“…is surjective can be proved by going back to the syntax as in [KPSdV12], just that this time, due to generalising from λ-calculus to binding signatures, the notation becomes even heavier and quite unpleasant. Therefore, we will give a semantic proof in the next section, so that surjectivity becomes a consequence of Theorem 5.72.…”
Section: Proof First We Have To Define the Map [−]mentioning
confidence: 99%
“…Then the bound variables of xλy.y can be computed as supp(xλy.y) \ supp([xλy.y] α ) = {x, y} \ {x} = {y}. Of course, this calculation depends on being able to assume that the bound variables and free variables of xλy.y do not overlap, or, in the terminology of [KPSdV12], that xλy.y is α-safe. The next definition gives a semantic formulation of an element being safe with respect to a map, which now does not need to be a quotient by α-equivalence.…”
Section: Bound Variables Safe Maps and Safe Squaresmentioning
confidence: 99%
“…We prove that the set of equivalence classes of infinitary terms with finitely many free variables is the final coalgebra of a Nom-functor. Our running example is the infinitary λ-calculus, and indeed the results of [KPSdV12] are particular instances of the main theorems in this section.…”
Section: Alpha Corecursion Principle For Nominal Coalgebraic Data Typesmentioning
Abstract. We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
We present a new and formal coinductive proof of confluence and normalisation of Böhm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not merely a coinductive reformulation of any earlier proofs. We formalised the proof in the Coq proof assistant.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.