Principal Type Schemes for the Strict Type Assignment System

DOI10.1093/logcom/3.6.643zbMath0802.68024OpenAlexW1964383531MaRDI QIDQ4286211

Steffen van Bakel

Publication date: 27 March 1994

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/3.6.643

zbMATH Keywords

lambda calculusintersection typestype assignment systemsapproximate normal formsprinciple type scheme

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Related Items (9)

Intersection type assignment systems ⋮ Normalization results for typeable rewrite systems ⋮ A completeness result for a realisability semantics for an intersection type system ⋮ On strong normalization and type inference in the intersection type discipline ⋮ Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Approximation and normalization results for typeable term rewriting systems ⋮ Intersection types for \(\lambda\)-trees ⋮ Normalization, approximation, and semantics for combinator systems

This page was built for publication: Principal Type Schemes for the Strict Type Assignment System