Logical equivalence for subtyping object and recursive types (2006)
Van Bakel, Steffen, De'Liguoro, Ugo
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment...
The Heart of Intersection Type Assignment (2006)
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to...
Logical equivalence for subtyping object and recursive types (2006)
Van Bakel, Steffen, De'Liguoro, Ugo
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment...
The Heart of Intersection Type Assignment (2006)
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to...
The Heart of Intersection Type Assignment (2006)
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to...
The Heart of Intersection Type Assignment (2006)
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to...
The Heart of Intersection Type Assignment (2006)
This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to...
Logical equivalence for subtyping object and recursive types (2006)
Van Bakel, Steffen, De'Liguoro, Ugo
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment...
The language X: circuits, computations and Classical Logic. (2005)
Van Bakel, Steffen, Lengrand, Stéphane, Lescanne, Pierre
(eng) X is an untyped language for describing circuits by composition of basic components. This language is well suited to describe structures which we call "circuits" and which are made of parts...
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing (2004)
This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of an earlier paper and shows a strong normalization result for this reduction. Using...
Principal Type Schemes for the Strict Type Assignment System (1993)
We study the strict type assignment system, a restriction of the intersection type discipline, and prove that it has the principal type property. We define, for a term M, the principal pair (of basis...