International audienceWorking in the untyped lambda calculus, we study Morris's λ-theory H +. Introduced in 1968, this is the original extensional theory of contextual equivalence. On the syntactic side, we show that this λ-theory validates the ω-rule, thus settling a long-standing open problem. On the semantic side, we provide sufficient and necessary conditions for relational graph models to be fully abstract for H +. We show that a relational graph model captures Morris's observational preorder exactly when it is extensional and λ-König. Intuitively, a model is λ-König when every λ-definable tree has an infinite path which is witnessed by some element of the model. Both results follows from a weak separability property enjoyed by terms d...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
preprint Mars 2005The paper surveys the knowledge we have acquired these last ten years about the la...
International audienceWe describe the breadth-first traversal algorithm by Martin Hofmann that uses ...
International audienceWorking in the untyped lambda calculus, we study Morris's λ-theory H +. Introd...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
AbstractWe define the class of relational graph models and study the induced order- and equational- ...
AbstractThere are essentially two ways of looking at the computational behaviours of λ-terms. One co...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
AbstractThe main result of the paper is a constructive proof of the following equivalence: two pureλ...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
We study the relational graph models that constitute a natural subclass ofrelational models of lambd...
We generalize Baeten and Boerbom's method of forcing, and apply it to show that there is a fixed seq...
International audienceWe define the class of relational graph models and study the induced order-and...
AbstractIntroductionBohm's theorem: applications to Computer Science Theory - BOTH 2001This part of ...
to appear in MSCSInternational audienceA longstanding open problem in lambda calculus is whether the...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
preprint Mars 2005The paper surveys the knowledge we have acquired these last ten years about the la...
International audienceWe describe the breadth-first traversal algorithm by Martin Hofmann that uses ...
International audienceWorking in the untyped lambda calculus, we study Morris's λ-theory H +. Introd...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
AbstractWe define the class of relational graph models and study the induced order- and equational- ...
AbstractThere are essentially two ways of looking at the computational behaviours of λ-terms. One co...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
AbstractThe main result of the paper is a constructive proof of the following equivalence: two pureλ...
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotation...
We study the relational graph models that constitute a natural subclass ofrelational models of lambd...
We generalize Baeten and Boerbom's method of forcing, and apply it to show that there is a fixed seq...
International audienceWe define the class of relational graph models and study the induced order-and...
AbstractIntroductionBohm's theorem: applications to Computer Science Theory - BOTH 2001This part of ...
to appear in MSCSInternational audienceA longstanding open problem in lambda calculus is whether the...
AbstractWe generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence...
preprint Mars 2005The paper surveys the knowledge we have acquired these last ten years about the la...
International audienceWe describe the breadth-first traversal algorithm by Martin Hofmann that uses ...