H.B.Curry, R.Feys: Combinatory logic, North-Holland, Amsterdam, 1958. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Basic Polymorphic Typechecking - Cardelli (1988) (56 citations) (Correct)
....bit of history Polymorphic typing of programs was envisioned by Strachey; his lecture notes on fundamental concepts in programming languages [Strachey 67] already contains much of the notation and terminology used today. Polymorphic types were already known as type schemas in combinatory logic [Curry 58] Extending Curry s work, and collaborating with him, Hindley introduced the idea of a principal type schema, which is the most general polymorphic type of an expression, and showed that if a combinatorial term has a type, then it has a principal type [Hindley 69] In doing so, he used a result ....
H.B.Curry, R.Feys: Combinatory logic, North-Holland, Amsterdam, 1958.
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985) (90 citations) (Correct)
....subtypes simple universal ML polymorphism Figure 2: Classification of typ systems. 36 Higher order languages have developed into parametric polymorphic languages. These can have restricted top level universal quantification (this is Milner s type system [Milner 78] with roots in Curry [Curry 58] and Hindley [Hindley 69] or general universal quantification (this is the Girard Reynolds type system [Girard 71] Reynolds 74] Up on the right we have type systems with type abstraction, characterized by existential quantification. Joining universal and existential quantifiers we obtain ....
H.B.Curry, R.Feys: Combinatory logic, North-Holland, Amsterdam, 1958.
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