Extension of ML type system with a sorted equation theory on types

Didier Rémy 1
1 FORMEL
INRIA Rocquencourt
Abstract : We extend the ML language by alowing a sorted regular equational theory on types for which unification is decidable and unitary. We prove that the extension keeps principal typings and subject reduction. A new set of typing rules is proposed so that type generalization is simpler and more efficient. We consider typing problems as general unification problems, which we solve with a formalism of unificands. Unificands naturally deal with sharing between types and lead to a more efficient type inference algorithm by splitting it into more elementary steps.
Type de document :
Rapport
[Research Report] RR-1766, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00077006
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:49:34
Dernière modification le : lundi 8 janvier 2018 - 16:54:04
Document(s) archivé(s) le : lundi 5 avril 2010 - 21:29:24

Fichiers

Identifiants

  • HAL Id : inria-00077006, version 1

Collections

Citation

Didier Rémy. Extension of ML type system with a sorted equation theory on types. [Research Report] RR-1766, INRIA. 1992. 〈inria-00077006〉

Partager

Métriques

Consultations de la notice

138

Téléchargements de fichiers

121