Thumbnail
Access Restriction
Subscribed

Author Mycroft, Alan ♦ Dolan, Stephen
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Type inference ♦ Algebra ♦ Subtyping ♦ Polymorphism
Abstract 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. We demonstrate this system in the minimal language MLsub, which types a strict superset of core ML programs. This is made possible by keeping a strict separation between the types used to describe inputs and those used to describe outputs, and extending the classical unification algorithm to handle subtyping constraints between these input and output types. Principal types are kept compact by type simplification, which exploits deep connections between subtyping and the algebra of regular languages. An implementation is available online.
Description Affiliation: University of Cambridge, UK (Dolan, Stephen; Mycroft, Alan)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 52
Issue Number 1
Page Count 13
Starting Page 60
Ending Page 72


Open content in new tab

   Open content in new tab
Source: ACM Digital Library