AbstractWe use a perception of second-order typing in the λ-Calculus, as conveying semantic properties of expressions in models over λ-expressions, to exhibit natural and uniform proofs of theorems of Girard (1971/1972) and of Coppo, Dezani and Veneri (1981) about the relations between typing properties and computational properties of λ-expressions (solvability, normalizability, strong normalizability), and of some generalizations of these theorems
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractWe use a perception of second-order typing in the λ-Calculus, as conveying semantic properti...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
In this paper we describe a method to prove the normalization property for a large variety of typed ...
AbstractMendler, N.P., Inductive types and type constraints in the second-order lambda calculus, Ann...
Colloque avec actes et comité de lecture. internationale.International audiencePure Pattern Type Sys...
This is an informal explanation of the main concepts and results of [Sev96]. We consider typed and u...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Président : Mariangiola DezaniRapporteurs : Gilles Dowek, Herman GeuversExaminateurs : Adam Cichon, ...
Abstract. The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which origina...
We analyze the computational complexity of type inference for untyped -terms in the second-order pol...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractWe use a perception of second-order typing in the λ-Calculus, as conveying semantic properti...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
In any model of typed λ-calculus conianing some basic arithmetic, a functional p - * (procedure—* e...
In this paper we describe a method to prove the normalization property for a large variety of typed ...
AbstractMendler, N.P., Inductive types and type constraints in the second-order lambda calculus, Ann...
Colloque avec actes et comité de lecture. internationale.International audiencePure Pattern Type Sys...
This is an informal explanation of the main concepts and results of [Sev96]. We consider typed and u...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Président : Mariangiola DezaniRapporteurs : Gilles Dowek, Herman GeuversExaminateurs : Adam Cichon, ...
Abstract. The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which origina...
We analyze the computational complexity of type inference for untyped -terms in the second-order pol...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
We present a general method for proving properties of typed λ-terms. This method is obtained by intr...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
DOI
Add to ORKG