Filter models with polymorphic types

DOI10.1016/0304-3975(92)90070-VzbMath0745.68035OpenAlexW1980550545MaRDI QIDQ1186431

Bart Jacobs, Ines Margaria, Maddalena Zacchi

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90070-v

zbMATH Keywords

polymorphic types

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items

\(F\)-semantics for type assignment systems, Order-incompleteness and finite lambda reduction models, Principality and type inference for intersection types using expansion variables, Intersection type assignment systems, Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus, Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves, Generalized filter models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• Polymorphic type inference and containment
• BCK-combinators and linear \(\lambda\)-terms have types
• A filter lambda model and the completeness of type assignment
• Lambda‐Calculus Models and Extensionality