AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, coproducts, and a terminal type. We prove the following theorem: The equations provable in this calculus are precisely those true in any set-theoretic model with an infinite base type
AbstractWe investigate the system obtained by adding an algebraic rewriting system R to an untyped l...
. We introduce a notion of Grothendieck logical relation and use it to characterise the definability...
The search for mathematical models of computational phenomena often leads to problems that are of in...
AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, ...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, th...
AbstractMitchell, J.C. and E. Moggi, Kripke-style models for typed lambda calculus, Annals of Pure a...
AbstractA lambda theory satisfies an equation between contexts, where a context is aλ-term with some...
The search for mathematical models of computational phenomena often leads to problems that are of in...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
International audienceProof-functional logical connectives allow reasoning about the structure of lo...
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda ter...
International audienceWe present an explicitly typed lambda calculus "à la Church" based on the uni...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
AbstractWe investigate the system obtained by adding an algebraic rewriting system R to an untyped l...
. We introduce a notion of Grothendieck logical relation and use it to characterise the definability...
The search for mathematical models of computational phenomena often leads to problems that are of in...
AbstractWe consider the lambda calculus obtained from the simply typed calculus by adding products, ...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, th...
AbstractMitchell, J.C. and E. Moggi, Kripke-style models for typed lambda calculus, Annals of Pure a...
AbstractA lambda theory satisfies an equation between contexts, where a context is aλ-term with some...
The search for mathematical models of computational phenomena often leads to problems that are of in...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
International audienceProof-functional logical connectives allow reasoning about the structure of lo...
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda ter...
International audienceWe present an explicitly typed lambda calculus "à la Church" based on the uni...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
AbstractWe investigate the system obtained by adding an algebraic rewriting system R to an untyped l...
. We introduce a notion of Grothendieck logical relation and use it to characterise the definability...
The search for mathematical models of computational phenomena often leads to problems that are of in...
DOI
Add to ORKG