Thumbnail
Access Restriction
Subscribed

Author Kaes, Stefan
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
Abstract We present a unified approach to type inference in the presence of overloading and coercions based on the concept of constrained types. We define a generic inference system, show that subtyping and overloading can be treated as a special instance of this system and develop a simple algorithm to compute principal types. We prove the decidability of type inference for the class of decomposable predicates and develop a canonical representation for principal types based on most accurate simplifications of constraint sets. Finally, we investigate the extension of our techniques to recursive types.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-01-01
Publisher Place New York
Journal ACM SIGPLAN Lisp Pointers (LIPO)
Volume Number V
Issue Number 1
Page Count 12
Starting Page 193
Ending Page 204


Open content in new tab

   Open content in new tab
Source: ACM Digital Library