Weak completeness of type assignment in -calculus models: A generalization of Hindley's result

DOI10.1016/0304-3975(91)90032-WzbMATH Open0733.03008OpenAlexW1992594006MaRDI QIDQ809993FDOQ809993

Authors: N. E. Zubov 

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90032-w

Recommendations

• A filter lambda model and the completeness of type assignment
• Completeness of type assignment in continuous lambda models
• Typed Lambda Calculi and Applications
• Term-space semantics of typed lambda calculus
• A characterization of F-complete type assignments

zbMATH Keywords

interpretationlambda calculusweakly complete lambda-theories

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatory logic and lambda calculus (03B40)

Cites Work

• Combinatory logic. With two sections by William Craig.
• Title not available (Why is that?)
• A filter lambda model and the completeness of type assignment
• The completeness theorem for typing lambda-terms
• Completeness of type assignment in continuous lambda models
• Title not available (Why is that?)

Cited In (5)

• HM(X) type inference is CLP(X) solving
• Completeness of type assignment in continuous lambda models
• Typed Lambda Calculi and Applications
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
• A filter lambda model and the completeness of type assignment

This page was built for publication: Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809993)