Completeness of type assignment in continuous lambda models
From MaRDI portal
Publication:792995
DOI10.1016/0304-3975(84)90005-7zbMATH Open0538.03012OpenAlexW1966921172MaRDI QIDQ792995FDOQ792995
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
Recommendations
- A filter lambda model and the completeness of type assignment
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
- Computability in higher types, P\(\omega\) and the completeness of type assignment
- \(F\)-semantics for type assignment systems
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
Cites Work
- A theory of type polymorphism in programming
- Title not available (Why is that?)
- \(\mathbb{T}^\omega\) as a universal domain
- Data Types as Lattices
- Algebras and combinators
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- A filter lambda model and the completeness of type assignment
- The lambda calculus, its syntax and semantics
- Title not available (Why is that?)
- Lambda‐Calculus Models and Extensionality
- The completeness theorem for typing lambda-terms
- What is a model of the lambda calculus?
- Title not available (Why is that?)
- Curry's type-rules are complete with respect to the F-semantics too
Cited In (13)
- Type inference with recursive types: Syntax and semantics
- Type inference, abstract interpretation and strictness analysis
- \(F\)-semantics for type assignment systems
- Computability in higher types, P\(\omega\) and the completeness of type assignment
- A characterization of F-complete type assignments
- Title not available (Why is that?)
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
- 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
- Strictness, totality, and non-standard-type inference
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
- A filter lambda model and the completeness of type assignment
- Constructive natural deduction and its ‘ω-set’ interpretation
Uses Software
This page was built for publication: Completeness of type assignment in continuous lambda models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792995)
