AbstractAs a partial solution to the problem of combining static and dynamic typing in a language with parametric polymorphism, this paper introduces a new form of type expressions which represent partial type information. These expressions are meant to capture the type information statically derivable from heterogeneous objects. The new ground types form a semilattice of subtypes and require type inference based on inclusion constraints. We discuss the existence and form of principal types under this extension and present a semi-decision procedure for the complete type inference problem
International audienceWe present a type system that combines, in a controlled way, first-order polym...
A partial type inference technique should come with a simple and precise specification, so that user...
How Good is Local Type Inference? A partial type inference technique should come with a simple and p...
As a partial solution to the problem of combining static and dynamic typing in a language with param...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
AbstractWe extend polymorphic type inference with a very general notion of subtype based on the conc...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
Type inference is a key component of modern statically typed programming languages. It allows progra...
AbstractWe extend type constraints with kind constraints to increase the expressiveness of constrain...
Simple, partial type-inference for System F based on type-containment We explore partial type-infere...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
We explore partial type-inference for System F based on type-containment. We consider both cases of ...
Many computer programs have the property that they work correctly on a variety of types of input; s...
to find the "best" or "most general" type (called the principal type in the case...
International audienceWe present a type system that combines, in a controlled way, first-order polym...
A partial type inference technique should come with a simple and precise specification, so that user...
How Good is Local Type Inference? A partial type inference technique should come with a simple and p...
As a partial solution to the problem of combining static and dynamic typing in a language with param...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
AbstractWe extend polymorphic type inference with a very general notion of subtype based on the conc...
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalen...
Type inference is a key component of modern statically typed programming languages. It allows progra...
AbstractWe extend type constraints with kind constraints to increase the expressiveness of constrain...
Simple, partial type-inference for System F based on type-containment We explore partial type-infere...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
We explore partial type-inference for System F based on type-containment. We consider both cases of ...
Many computer programs have the property that they work correctly on a variety of types of input; s...
to find the "best" or "most general" type (called the principal type in the case...
International audienceWe present a type system that combines, in a controlled way, first-order polym...
A partial type inference technique should come with a simple and precise specification, so that user...
How Good is Local Type Inference? A partial type inference technique should come with a simple and p...