Extension of ML type system with a sorted equation theory on types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

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

Didier Rémy
  • Function : Author
  • PersonId : 915856

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1766.pdf (437.52 Ko) Télécharger le fichier

Dates and versions

inria-00077006 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077006 , version 1

Cite

Didier Rémy. Extension of ML type system with a sorted equation theory on types. [Research Report] RR-1766, INRIA. 1992. ⟨inria-00077006⟩
93 View
331 Download

Share

Gmail Facebook X LinkedIn More