AbstractCurien (1985) defines a translation of the λc-calculus in the Pure Combinatory Categorical Logic and establishes an equivalence theorem between these two theories. The rewriting system SUBST simulates in particular the substitution of the λc-calculus. This system is locally confluent. We shall show here that it is also noetherian
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
AbstractMethods of proving that a term-rewriting system terminates are presented. They are based on ...
International audienceWe study the termination of rewriting modulo a set of equations in the Calculu...
AbstractCurien (1985) defines a translation of the λc-calculus in the Pure Combinatory Categorical L...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
AbstractThe Strong Categorical Combinatory Logic (CCL, CCLβηSP), developed by Curien (1986) is, when...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo, inspired by ...
AbstractThe last few years have seen the development of the rewriting calculus (or rho-calculus, ρCa...
Our main aim is to present the connection between λ-calculus and Cartesian closed categories both in...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
Communicated by Editor’s name We present a general theorem capturing conditions required for the ter...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
AbstractMethods of proving that a term-rewriting system terminates are presented. They are based on ...
International audienceWe study the termination of rewriting modulo a set of equations in the Calculu...
AbstractCurien (1985) defines a translation of the λc-calculus in the Pure Combinatory Categorical L...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
AbstractThe Strong Categorical Combinatory Logic (CCL, CCLβηSP), developed by Curien (1986) is, when...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo, inspired by ...
AbstractThe last few years have seen the development of the rewriting calculus (or rho-calculus, ρCa...
Our main aim is to present the connection between λ-calculus and Cartesian closed categories both in...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
Communicated by Editor’s name We present a general theorem capturing conditions required for the ter...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
International audienceThe last few years have seen the development of the \emph{rewriting calculus} ...
AbstractMethods of proving that a term-rewriting system terminates are presented. They are based on ...
International audienceWe study the termination of rewriting modulo a set of equations in the Calculu...
DOI
Add to ORKG