Completeness of type assignment in continuous lambda models

DOI10.1016/0304-3975(84)90005-7MaRDI QIDQ792995zbMATH OpenOpenAlexFDO

Authors Mario Coppo

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

zbMATH Keywords

completenesslambda calculustype assignmentcontinuous lambda models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• A filter lambda model and the completeness of type assignment
• Weak completeness of type assignment in -calculus models: A generalization of Hindley's result
• Computability in higher types, P 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

• scientific article; zbMATH DE number 3813583 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• A filter lambda model and the completeness of type assignment
• A theory of type polymorphism in programming
• Algebras and combinators
• Curry's type-rules are complete with respect to the F-semantics too
• Data Types as Lattices
• Lambda‐Calculus Models and Extensionality
• The completeness theorem for typing lambda-terms
• The lambda calculus, its syntax and semantics
• What is a model of the lambda calculus?
• \(\mathbb{T}^\omega\) as a universal domain

Cited in

(14)

• Constructive natural deduction and its ‘ω-set’ interpretation
• Type inference with recursive types: Syntax and semantics
• Type inference, abstract interpretation and strictness analysis
• Résultats de complétude pour des classes de types du système $\mathcal {AF}2$
• \(F\)-semantics for type assignment systems
• Computability in higher types, P and the completeness of type assignment
• A characterization of F-complete type assignments
• scientific article; zbMATH DE number 3938562 (Why is no real title available?)
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
• 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 -calculus models: A generalization of Hindley's result
• A filter lambda model and the completeness of type assignment

Describes a project that uses

Uses Software

• ML

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)