In these notes, we prove some general theorems for establishing properties of untyped λ-terms, using a variant of the reducibility method. These theorems apply to (pure) λ-terms typable in the systems of conjunctive types DΩ and D. As applications, we give simple proofs of the characterizations of the terms having head-normal forms, of the normalizable terms, and of the strongly normalizing terms. We also give a characterization of the terms having weak head-normal forms. This last result appears to be new
AbstractIn this paper we introduce Curryfied term rewriting systems, and a notion of partial type as...
AbstractIn this paper, a notation influenced by de Bruijn's syntax of the λ-calculus is used to desc...
AbstractThe main purpose of this paper is to take apart the reducibility method in order to understa...
In these notes, we prove some general theorems for establishing properties of untyped λ-terms, using...
It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
Typing untyped Lambda-terms, or Reducibility strikes again! It was observed by Curry that when (unty...
. It was observed by Curry that when (untyped) -terms can be assigned types, for example, simple typ...
It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
AbstractThe main purpose of this paper is to take apart the reducibility method in order to understa...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
AbstractIn this paper we introduce Curryfied term rewriting systems, and a notion of partial type as...
AbstractIn this paper, a notation influenced by de Bruijn's syntax of the λ-calculus is used to desc...
AbstractThe main purpose of this paper is to take apart the reducibility method in order to understa...
In these notes, we prove some general theorems for establishing properties of untyped λ-terms, using...
It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
Typing untyped Lambda-terms, or Reducibility strikes again! It was observed by Curry that when (unty...
. It was observed by Curry that when (untyped) -terms can be assigned types, for example, simple typ...
It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple type...
AbstractThe main purpose of this paper is to take apart the reducibility method in order to understa...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
AbstractIn this paper we introduce Curryfied term rewriting systems, and a notion of partial type as...
AbstractIn this paper, a notation influenced by de Bruijn's syntax of the λ-calculus is used to desc...
AbstractThe main purpose of this paper is to take apart the reducibility method in order to understa...