We describe an extension of ML with records where inheritance is given by ML generic polymorphism. All common operations on records but concatenation are supported, in particular the free extension of records. Other operations such as renaming of fields are added. The solution relies on an extension of ML, where the language of types is sorted and considered modulo equations, and on a record extension of types. The solution is simple and modular and the type inference algorithm is efficient in practice. Inf'erence de Types pour les Objets Enregistrements dans une Extension Naturelle de ML Abstract Nous pr'esentons une extension de ML avec des objets enregistrements o`u l'h'eritage est obtenu `a partir du polymorphisme g&...
The polymorphic type discipline, as in the ML language, fits well within purely applicative language...
We present a type inference system for a language with object-oriented features such as polymorphic ...
We present a new predicative and decidable type system, called ML , suitable for languages that inte...
We describe an extension of ML with records where inheritance is given by ML generic poly-morphism. ...
Projet FORMELWe extend term unification techniques used to type extensible records in order to solve...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-li...
We extend the ML language by allowing a sorted regular equational theory on types for which unificat...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
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 ...
A Simple Semantics for ML Polymorphism We give a framework for denotational semantics for the polymo...
AbstractWe propose a modest conservative extension to ML that allows semi-explicit first-class polym...
The polymorphic type discipline, as in the ML language, fits well within purely applicative language...
We present a type inference system for a language with object-oriented features such as polymorphic ...
We present a new predicative and decidable type system, called ML , suitable for languages that inte...
We describe an extension of ML with records where inheritance is given by ML generic poly-morphism. ...
Projet FORMELWe extend term unification techniques used to type extensible records in order to solve...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-li...
We extend the ML language by allowing a sorted regular equational theory on types for which unificat...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
AbstractThe Hindley/Milner discipline for polymorphic type inference in functional programming langu...
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 ...
A Simple Semantics for ML Polymorphism We give a framework for denotational semantics for the polymo...
AbstractWe propose a modest conservative extension to ML that allows semi-explicit first-class polym...
The polymorphic type discipline, as in the ML language, fits well within purely applicative language...
We present a type inference system for a language with object-oriented features such as polymorphic ...
We present a new predicative and decidable type system, called ML , suitable for languages that inte...