this paper, we point out that the failure of the -rule, and the subsequent need for a non-equational class of models, is not due to the lambda calculus itself, but to the way free variables are usually interpreted in these models. An equation M = N between open terms is usually said to be satisfied in a lambda algebra A if it holds for all substitutions of elements of A for the free variables. We call this the local interpretation, and define M = N to hol
In this paper we give an outline of recent results concerning theories and models of the untyped lam...
http://www.youtube.com/watch?v=SJaMtBKnN-IThis thesis is about rewriting in the typed lambda-calculu...
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda ter...
This paper serves as a self-contained, tutorial introduction to combinatory models of the untyped la...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
An elementary, purely algebraic definition of model for the untyped lambda calculus is given. This d...
AbstractThe variety (equational class) of lambda abstraction algebras was introduced to algebraize t...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
In this paper we give an outline of recent algebraic results concerning theories and models of the u...
International audienceThe linear-algebraic lambda-calculus and the algebraic lambda-calculus are unt...
AbstractA lambda theory satisfies an equation between contexts, where a context is aλ-term with some...
The lambda calculus is fundamental in computer science. It resists an algebraic treatment because of...
The revised edition contains a new chapter which provides an elegant description of the semantics. T...
29 pagesInternational audienceWe introduce an extension of the pure lambda-calculus by endowing the ...
In this paper we give an outline of recent results concerning theories and models of the untyped lam...
http://www.youtube.com/watch?v=SJaMtBKnN-IThis thesis is about rewriting in the typed lambda-calculu...
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda ter...
This paper serves as a self-contained, tutorial introduction to combinatory models of the untyped la...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
An elementary, purely algebraic definition of model for the untyped lambda calculus is given. This d...
AbstractThe variety (equational class) of lambda abstraction algebras was introduced to algebraize t...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
This dissertation examines some aspects of the relationship between λ calculus and universal algebr...
In this paper we give an outline of recent algebraic results concerning theories and models of the u...
International audienceThe linear-algebraic lambda-calculus and the algebraic lambda-calculus are unt...
AbstractA lambda theory satisfies an equation between contexts, where a context is aλ-term with some...
The lambda calculus is fundamental in computer science. It resists an algebraic treatment because of...
The revised edition contains a new chapter which provides an elegant description of the semantics. T...
29 pagesInternational audienceWe introduce an extension of the pure lambda-calculus by endowing the ...
In this paper we give an outline of recent results concerning theories and models of the untyped lam...
http://www.youtube.com/watch?v=SJaMtBKnN-IThis thesis is about rewriting in the typed lambda-calculu...
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda ter...