Fritz Henglein. Polymorphic Type Inference and Semi-Unification. PhD thesis, Courant Institute of Mathematical Sciences, New York University, 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Polymorphic Type Checking by Interpretation of Code - Kahrs (1992) (Correct)
....NIL = 0 length (CONS x xs) 1 length xs The research reported here was partially supported by SERC grant GR E 78463. 1 Miranda is a trademark of Software Research Limited. 2 In a certain sense, type inference for ML types is also not decidable, because semi unification is undecidable, see [6, 4]. But it is well behaved: there are decision procedures that almost always find the most general ML type, and the semi unification algorithm can be supplied with an occur check that almost always guarantees termination. 1 The above type definition is parameterised (the asterisk) by the component ....
Fritz Henglein. Polymorphic Type Inference and Semi-Unification. PhD thesis, Courant Institute of Mathematical Sciences, New York University, 1989.
Polymorphic Type Checking by Interpretation of Code - Stefan Kahrs (1992) (Correct)
.... . The reason is simple: If the function The research reported here was partially supported by SERC grant GR E 78463. 1 Miranda is a trademark of Software Research Limited. 2 In a certain sense, type inference for ML types is also not decidable, because semi unification is undecidable, see [5, 4]. But it is well behaved: there are decision procedures that almost always find the most general ML type, and the semi unification algorithm can be supplied with an occur check that almost always guarantees termination. 3 Ada is a trademark of the US DoD. is polymorphic, then it does not ....
Fritz Henglein. Polymorphic Type Inference and Semi-Unification. PhD thesis, Courant Institute of Mathematical Sciences, New York University, 1989.
Extending the Type Checker of SML by Polymorphic Recursion: A.. - Emms, Leiß (1997) (Correct)
....valrec x = e : fx : Gamma g . The system still has the subject reduction property, is type sound, and has the principal types property. Mycroft proposed a semi algorithm to compute principal types for ML typable terms, but on every untypable term, this semi algorithm diverges. Henglein[4, 5] and Lei [13, 14] proposed semi algorithms based on semiunification, which terminate also on all known examples of terms untypable in the Milner Mycroft system. Actually, semiunification is equivalent to Milner Mycroft typability, cf. Henglein[5] and Kfoury e.a. 12] But unfortunately, ....
F. Henglein. Polymorphic Type Inference and Semi-Unification. PhD thesis, Courant Institute of Mathematical Sciences, May 1989. Technical Report 443, Computer Science Department, New York University.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC