DOIAbstract
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the notion of “candidat de monovalence”. The proof is inspired from Girard's proof of the normalizability for the same calculus
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the notion of “candidat de monovalence”. The proof is inspired from Girard's proof of the normalizability for the same calculus
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the ...
International audienceNous donnons une preuve simple de 3 théorèmes " de base " du lambda calcul pur...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
We attempt to elucidate the conditions required on Girard\u27s candidates of reducibility (in French...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
The Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reducti...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
AbstractThe technical contribution of this paper is threefold.First we show how to encode functional...
AbstractWe present a general method for constructing extensional models for the Girard-Reynolds poly...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the ...
International audienceNous donnons une preuve simple de 3 théorèmes " de base " du lambda calcul pur...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
AbstractWe give a proof of the Church-Rosser property for polymorphic lambda calculus using the noti...
We attempt to elucidate the conditions required on Girard\u27s candidates of reducibility (in French...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
The Church-Rosser theorem in the type-free $lambda$-calculus is well investigated both for $beta$-eq...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
The Church-Rosser theorem states that the lambda-calculus is confluent under alpha- and beta-reducti...
5th International Workshop on Confluence5th International Workshop on ConfluenceWe present a short p...
AbstractThe technical contribution of this paper is threefold.First we show how to encode functional...
AbstractWe present a general method for constructing extensional models for the Girard-Reynolds poly...
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, ...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
We introduce a ¿-calculus notation which enables us to detect in a term, more ß-redexes than in the ...
International audienceNous donnons une preuve simple de 3 théorèmes " de base " du lambda calcul pur...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
Add to ORKG