A semantics for static type inference

DOI10.1006/inco.1994.1018zbMath0803.68067OpenAlexW2040064689MaRDI QIDQ1322480

Gordon D. Plotkin

Publication date: 8 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7a46c0df730986869227c744f8604723b34d4ea2

zbMATH Keywords

completenessprogramming languagesuntyped \(\lambda\)-calculus\(F\)- deducibilityCurry's systempolymorphic types intersection typesstatic type inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

Order-incompleteness and finite lambda reduction models ⋮ Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Term-space semantics of typed lambda calculus ⋮ Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Generalized filter models ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models