An alternate proof of Statman's finite completeness theorem

DOI10.1016/j.ipl.2012.04.014zbMath1243.03017OpenAlexW2273291048MaRDI QIDQ436624

Igor Walukiewicz, B. Srivathsan

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.014

zbMATH Keywords

formal semanticstheory of computationsimply typed lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

The IO and OI hierarchies revisited

Cites Work

• Unnamed Item
• On the membership problem for non-linear abstract categorial grammars
• Recognizability in the Simply Typed Lambda-Calculus
• Completeness, invariance and λ-definability
• Completeness in the theory of types
• The Clausal Theory of Types

This page was built for publication: An alternate proof of Statman's finite completeness theorem