Proofs of a set of hybrid let-polymorphic type inference algorithms

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 307
  • Download : 0
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type system, and find a condition on two instance algorithms so that one algorithm should find type errors earlier than the other. By instantiating the generalized algorithm with different parameters, we can obtain not only the two opposite algorithms (the bottom-up standard algorithm W and the top-down algorithm M) but also other hybrid algorithms which are used in real compilers. Such instances' soundness and completeness follow automatically, and their relative earliness in detecting type-errors is determined by checking a simple condition. The set of instances of the generalized algorithm is a superset of those used in the two most popular ML compilers: SML/NJ and OCaml.
Publisher
Springer
Issue Date
2004
Language
English
Article Type
Article
Citation

NEW GENERATION COMPUTING, v.22, no.1, pp.1 - 36

ISSN
0288-3635
DOI
10.1007/BF03037279
URI
http://hdl.handle.net/10203/80178
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0