AbstractI give a proof of the confluence of combinatory strong reduction that does not use the one of λ-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
To appear in TCSInternational audienceI give a proof of the confluence of combinatory strong reducti...
To appear in TCSInternational audienceI give a proof of the confluence of combinatory strong reducti...
AbstractI give a proof of the confluence of combinatory strong reduction that does not use the one o...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
AbstractCombinatory logic claims to do the same work as λ-calculus but with a simpler language and a...
. We introduce a simple translation from -calculus to combinatory logic (cl) such that: A is an sn -...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
In the calculus Λ co of possibly non-wellfounded λ-terms, standardization is proved for a parallel n...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
To appear in TCSInternational audienceI give a proof of the confluence of combinatory strong reducti...
To appear in TCSInternational audienceI give a proof of the confluence of combinatory strong reducti...
AbstractI give a proof of the confluence of combinatory strong reduction that does not use the one o...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
AbstractCombinatory logic claims to do the same work as λ-calculus but with a simpler language and a...
. We introduce a simple translation from -calculus to combinatory logic (cl) such that: A is an sn -...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
In the calculus Λ co of possibly non-wellfounded λ-terms, standardization is proved for a parallel n...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
International audienceWe present normalization for intuitionistic combinatorial proofs (ICPs) and re...
DOI
Add to ORKG