Traditional techniques for implementing polymorphism use a universal representation for
objects of unknown type. Often, this forces a compiler to use universal representations even …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

We present a new approach to the polymorphic typing of data accepting in-place
modification in ML-like languages. This approach is based on restrictions over type …

We present a type system combining subtyping and ML-style parametric polymorphism.
Unlike previous work, our system supports type inference and has compact principal types …

This paper presents a program transformation that allows languages with polymorphic
typing (eg ML) to be implemented with unboxed, multi-word data representations. The …

We study an extension of the Hindley/Milner system with explicit type scheme annotations
and type declarations. The system can express polymorphic function arguments, user …

The benefits of strong typing to disciplined programming, to compile-time error detection and
to program verification are well known. Strong typing is especially natural for functional …

Run-time type dispatch enables a variety of advanced optimization techniques for
polymorphic languages, including tag-free garbage collection, unboxed function arguments …

We study two partial type inference methods for a language combining subtyping and
impredicative polymorphism. Both methods are local in the sense that missing annotations …

Languages like ML and Haskell encourage the view of values as first-class entities that can
be passed as arguments or results of functions, or stored as components of data structures …