\(F\)-semantics for type assignment systems

DOI10.1016/0304-3975(94)90080-9zbMath0811.68095OpenAlexW2065770910MaRDI QIDQ1329739

Hirofumi Yokouchi

Publication date: 31 July 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90080-9

zbMATH Keywords

\(F\)-semanticspolymorphic type assignment system

Mathematics Subject Classification ID

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

Related Items

Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ Infinite \(\lambda\)-calculus and types

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The semantics of second-order lambda calculus
• Completeness of type assignment in continuous lambda models
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A characterization of F-complete type assignments
• Polymorphic type inference and containment
• An extension of basic functionality theory for \(\lambda\)-calculus
• Filter models with polymorphic types
• 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
• Categorical semantics for higher order polymorphic lambda calculus
• Functional Characters of Solvable Terms
• A semantics for type checking
• Parallel reductions in \(\lambda\)-calculus