Add to ORKGThe Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reductions. The standard proof of this result is due to Tait and Martin-Loef. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the beta-eta-calculus.National Science Foundation CCF-063502
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
(avec annexes)International audienceWe present an extension of the lambda(eta)-calculus with a case ...
International audienceWe define an extension of lambda-calculus with linear combinations, endowing t...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the ...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
AbstractThis note provides a short elementary proof of the fact that the reduction sequence discover...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
E Abstract... We give a detailed, informal proof of the Church-Rosser property for the untyped A-cal...
We attempt to elucidate the conditions required on Girard\u27s candidates of reducibility (in French...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
(avec annexes)International audienceWe present an extension of the lambda(eta)-calculus with a case ...
International audienceWe define an extension of lambda-calculus with linear combinations, endowing t...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the ...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
AbstractThis note provides a short elementary proof of the fact that the reduction sequence discover...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
E Abstract... We give a detailed, informal proof of the Church-Rosser property for the untyped A-cal...
We attempt to elucidate the conditions required on Girard\u27s candidates of reducibility (in French...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
(avec annexes)International audienceWe present an extension of the lambda(eta)-calculus with a case ...
International audienceWe define an extension of lambda-calculus with linear combinations, endowing t...