Completeness of type assignment in continuous lambda models
From MaRDI portal
Publication:792995
DOI10.1016/0304-3975(84)90005-7zbMath0538.03012OpenAlexW1966921172MaRDI QIDQ792995
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90005-7
Related Items (10)
\(F\)-semantics for type assignment systems ⋮ A characterization of F-complete type assignments ⋮ Constructive natural deduction and its ‘ω-set’ interpretation ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Strictness, totality, and non-standard-type inference ⋮ Type inference with recursive types: Syntax and semantics ⋮ Type inference, abstract interpretation and strictness analysis ⋮ Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\mathbb{T}^\omega\) as a universal domain
- The lambda calculus, its syntax and semantics
- Algebras and combinators
- 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
- Lambda‐Calculus Models and Extensionality
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Data Types as Lattices
- What is a model of the lambda calculus?
This page was built for publication: Completeness of type assignment in continuous lambda models
