Curry's type-rules are complete with respect to the F-semantics too
From MaRDI portal
Publication:1839243
DOI10.1016/0304-3975(83)90141-XzbMath0512.03010OpenAlexW2083844489MaRDI QIDQ1839243
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90141-x
Related Items (10)
\(F\)-semantics for type assignment systems ⋮ A characterization of F-complete type assignments ⋮ Polymorphic type inference and containment ⋮ A completeness result for a realisability semantics for an intersection type system ⋮ A semantics for type checking ⋮ Type inference with simple subtypes ⋮ Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ A completeness result for the simply typed \(\lambda \mu \)-calculus ⋮ The Relevance of Semantic Subtyping ⋮ Completeness of type assignment in continuous lambda models
Cites Work
This page was built for publication: Curry's type-rules are complete with respect to the F-semantics too
