Add to ORKG5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short proof of the Church-Rosser property for the lambda-calculus enjoying two distinguishing features: Firstly, it employs the Z-property, resulting in a short and elegant proof; and secondly, it is formalized in the nominal higher-order logic available for the proof assistant Isabelle/HOL
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
E Abstract... We give a detailed, informal proof of the Church-Rosser property for the untyped A-cal...
AbstractIn ordinary lambda calculus the occurrences of a bound variable are made recognizable by the...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
Abstract: We present the Isabelle/HOL formalisation of some key equa-tional properties of the untype...
The Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reducti...
We formalize the Z property introduced by Dehornoy and van Oostrom. First we show that for any abstr...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
We prove a general purpose abstract Church-Rosser result that captures most existing such results th...
AbstractWe present the titular proof development that has been verified in Isabelle/HOL. As a first,...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
AbstractThe simplest proofs of the Church Rosser Property are usually done by the syntactic method o...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
E Abstract... We give a detailed, informal proof of the Church-Rosser property for the untyped A-cal...
AbstractIn ordinary lambda calculus the occurrences of a bound variable are made recognizable by the...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
Abstract: We present the Isabelle/HOL formalisation of some key equa-tional properties of the untype...
The Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reducti...
We formalize the Z property introduced by Dehornoy and van Oostrom. First we show that for any abstr...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
We prove a general purpose abstract Church-Rosser result that captures most existing such results th...
AbstractWe present the titular proof development that has been verified in Isabelle/HOL. As a first,...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
AbstractThe simplest proofs of the Church Rosser Property are usually done by the syntactic method o...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
E Abstract... We give a detailed, informal proof of the Church-Rosser property for the untyped A-cal...
AbstractIn ordinary lambda calculus the occurrences of a bound variable are made recognizable by the...