Abstract. Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advantages over previous approaches, it forbids polymorphism in many cases where it would be sound. We use a subtyping based approach to recover part of this lost polymorphism, without changing the type algebra itself, and this has significant applications.
Adding ML-style references to a Hindley-Milner polymorphic type system is troublesome because such a...
International audienceThis article investigates an ML-like language with by-name semantics for polym...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type system of...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
AbstractWe propose a modest conservative extension to ML that allows semi-explicit first-class polym...
Abstract. We propose a modest conservative extension to ML that al-lows semi-explicit higher-order p...
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-li...
Dealing with polymorphism in the presence of imperative features is a long-standing open problem for...
Many computer programs have the property that they work correctly on a variety of types of input; s...
Type inference for structural polymorphism ---i.e. record and variant polymorphism--- has been an ac...
We are developing a static type system for object-oriented languages that strives to guarantee stati...
We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous w...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
Flexibility of programming and efficiency of program execution are two important features of a progr...
Adding ML-style references to a Hindley-Milner polymorphic type system is troublesome because such a...
International audienceThis article investigates an ML-like language with by-name semantics for polym...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type system of...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
AbstractWe propose a modest conservative extension to ML that allows semi-explicit first-class polym...
Abstract. We propose a modest conservative extension to ML that al-lows semi-explicit higher-order p...
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-li...
Dealing with polymorphism in the presence of imperative features is a long-standing open problem for...
Many computer programs have the property that they work correctly on a variety of types of input; s...
Type inference for structural polymorphism ---i.e. record and variant polymorphism--- has been an ac...
We are developing a static type system for object-oriented languages that strives to guarantee stati...
We present a type system combining subtyping and ML-style parametric polymorphism. Unlike previous w...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
Flexibility of programming and efficiency of program execution are two important features of a progr...
Adding ML-style references to a Hindley-Milner polymorphic type system is troublesome because such a...
International audienceThis article investigates an ML-like language with by-name semantics for polym...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...