Results 1 
5 of
5
Compound Types for Java
, 1998
"... Type compatibility can be defined based on name equivalence, that is, explicit declarations, or on structural matching. We argue that component software has demands for both. For types expressing individual contracts, name equivalence should be used so that references are made to external semantical ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
Type compatibility can be defined based on name equivalence, that is, explicit declarations, or on structural matching. We argue that component software has demands for both. For types expressing individual contracts, name equivalence should be used so that references are made to external semantical specifications. For types that are composed of several such contracts, the structure of this composition should decide about compatibility. We introduce
Principality and Type Inference for Intersection Types Using Expansion Variables
, 2003
"... Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, if possible. We define an intersection type system which has principal typ ..."
Abstract

Cited by 26 (12 self)
 Add to MetaCart
Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, if possible. We define an intersection type system which has principal typings and types exactly the strongly normalizable #terms. More interestingly, every finiterank restriction of this system (using Leivant's first notion of rank) has principal typings and also has decidable type inference.
Expansion: the Crucial Mechanism for Type Inference with Intersection Types: Survey and Explanation
 In: (ITRS ’04
, 2005
"... The operation of expansion on typings was introduced at the end of the 1970s by Coppo, Dezani, and Venneri for reasoning about the possible typings of a term when using intersection types. Until recently, it has remained somewhat mysterious and unfamiliar, even though it is essential for carrying ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
The operation of expansion on typings was introduced at the end of the 1970s by Coppo, Dezani, and Venneri for reasoning about the possible typings of a term when using intersection types. Until recently, it has remained somewhat mysterious and unfamiliar, even though it is essential for carrying out compositional type inference. The fundamental idea of expansion is to be able to calculate the effect on the final judgement of a typing derivation of inserting a use of the intersectionintroduction typing rule at some (possibly deeply nested) position, without actually needing to build the new derivation.
A TYPE ASSIGNMENT FOR THE STRONGLY NORMALIZABILE λTERMS
"... Dedicated to H.B. Curry on the occasion of his 80th birthday ..."
Intersection Types and λdefinability
, 2001
"... This paper presents a novel method to compare computational properties of λterms typeable with intersection types, with respect to terms typeable with Curry types. We introduce a translation from intersection typing derivations to Curry typeable terms which is preserved by βreduction: this allows ..."
Abstract
 Add to MetaCart
This paper presents a novel method to compare computational properties of λterms typeable with intersection types, with respect to terms typeable with Curry types. We introduce a translation from intersection typing derivations to Curry typeable terms which is preserved by βreduction: this allows to simulate a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach proves strong normalization for the intersection system naturally by means of purely syntactical techniques. The paper extends the results presented in [Bucciarelli, De Lorenzis, Piperno, Salvo, Some Computational Properties of Intersection Types, LICS’99] to the whole intersection type system of Barendregt, Coppo and Dezani, thus providing a complete proof of a conjecture proposed by Leivant in 1990: all functions uniformly definable using intersection types are already definable using Curry types. 1.