L.Cardelli: Basic polymorphic typechecking, AT&T Bell Laboratories Computing Science Technical Report 119, 1984. Also in "Polymorphism newsletters", II.1, Jan 1984. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) Self-citation (Cardelli) (Correct)
....is done by Robinson s unification algorithm [Robinson 65] which also takes care of propagating information across all the instances of the same variable, so that incompatible uses of the same variable are detected. An introductory exposition of polymorphic type inference can be found in [Cardelli 84a] This inference algorithm is not limited to polymorphic languages. It could be added to any monomorphic typed language, with the restriction that at the end of type checking all the type variables should disappear. Expressions like fun (x) x would be ambiguous, and one would have to write fun ....
L.Cardelli: Basic polymorphic typechecking, AT&T Bell Laboratories Computing Science Technical Report 119, 1984. Also in "Polymorphism newsletters", II.1, Jan 1984.
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