We investigate final coalgebras in nominal sets. This allows us to definetypes of infinite data with binding for which all constructions automaticallyrespect alpha equivalence. We give applications to the infinitary lambdacalculus.Comment: 52 pages, accepted for publication in LMC
Kurz et al. have recently shown that infinite lambda-trees with finitely many free variables modulo ...
AbstractWe describe a class of models of the lambda calculus that generalize and simplify the quanti...
Lambda definability is characterized in categorical models of simply typed lambda calculus with type...
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data wit...
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a...
The lambda calculus is fundamental in computer science. It resists an algebraic treatment because of...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
Proof principles for reasoning about various semantics of untyped \u3bb-calculus are discussed. The ...
The question addressed in this paper is how to correctly approximate infinite data given by systems ...
AbstractLambda definability is characterized in categorical models of simply typed lambda calculus w...
Combining ideas coming from Stone duality and Reynolds parametricity, weformulate in a clean and pri...
AbstractThe variety (equational class) of lambda abstraction algebras was introduced to algebraize t...
Kurz et al. have recently shown that infinite lambda-trees with finitely many free variables modulo ...
AbstractWe describe a class of models of the lambda calculus that generalize and simplify the quanti...
Lambda definability is characterized in categorical models of simply typed lambda calculus with type...
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data wit...
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a...
The lambda calculus is fundamental in computer science. It resists an algebraic treatment because of...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type ...
Proof principles for reasoning about various semantics of untyped \u3bb-calculus are discussed. The ...
The question addressed in this paper is how to correctly approximate infinite data given by systems ...
AbstractLambda definability is characterized in categorical models of simply typed lambda calculus w...
Combining ideas coming from Stone duality and Reynolds parametricity, weformulate in a clean and pri...
AbstractThe variety (equational class) of lambda abstraction algebras was introduced to algebraize t...
Kurz et al. have recently shown that infinite lambda-trees with finitely many free variables modulo ...
AbstractWe describe a class of models of the lambda calculus that generalize and simplify the quanti...
Lambda definability is characterized in categorical models of simply typed lambda calculus with type...
DOI
Add to ORKG