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

DOI10.1016/0304-3975(91)90032-WzbMath0733.03008OpenAlexW1992594006MaRDI QIDQ809993

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

zbMATH Keywords

lambda calculusinterpretationweakly complete lambda-theories

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Completeness of type assignment in continuous lambda models
• The completeness theorem for typing lambda-terms
• 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