We consider the problem of representing heterogeneous collections of objects in a typed polymorphic programming language in such a way that common properties of members of a collection, such as having commonly named field with a common type can be expressed in the type system. The use of such collections is widespread in object-oriented and database programming and has so far been achieved in statically typed systems only through the use of a single dynamic type, which effectively hides all the structure of a value. In this paper we exploit a system of types and kinds (sets of types) to represent dynamic values with some known properties. The type system is shown to be sound and to have a complete type inference algorithm
We present a typed polymorphic calculus that supports a general mechanism for view definition and ob...
This paper presents a type-inference system for Scheme that is designed to be used by students in an...
A polytypic value is one that is defined by induction on the structure of types. In Haskell types ar...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Central features of object-oriented programming are method inheritance and data abstraction attained...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
Our objective is to understand the notion of type in programming languages, present a model of typed...
A polytypic value is one that is defined by induction on the structure of types. In Haskell types ar...
National audienceTopological collections allow to consider uniformly many data structures in program...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
There exists an identifiable programming style based on the widespread use of type information handl...
We present a typed polymorphic calculus that supports a general mechanism for view definition and ob...
This paper presents a type-inference system for Scheme that is designed to be used by students in an...
A polytypic value is one that is defined by induction on the structure of types. In Haskell types ar...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Central features of object-oriented programming are method inheritance and data abstraction attained...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
Our objective is to understand the notion of type in programming languages, present a model of typed...
A polytypic value is one that is defined by induction on the structure of types. In Haskell types ar...
National audienceTopological collections allow to consider uniformly many data structures in program...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
There exists an identifiable programming style based on the widespread use of type information handl...
We present a typed polymorphic calculus that supports a general mechanism for view definition and ob...
This paper presents a type-inference system for Scheme that is designed to be used by students in an...
A polytypic value is one that is defined by induction on the structure of types. In Haskell types ar...