A semantics for type checking

DOI10.1007/3-540-54415-1_38zbMath1493.68092OpenAlexW1546709952MaRDI QIDQ5096209

Gordon D. Plotkin

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_38

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

\(F\)-semantics for type assignment systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Polymorphic type inference and containment
• A theory of type polymorphism in programming
• The completeness theorem for typing lambda-terms
• Curry's type-rules are complete with respect to the F-semantics too
• A filter lambda model and the completeness of type assignment