Two beta-equal lambda-I-terms with no types in common

DOI10.1016/0304-3975(95)00147-6zbMath0873.03013OpenAlexW2093615652MaRDI QIDQ672135

Martin W. Bunder, J. Roger Hindley

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00147-6

zbMATH Keywords

\(\lambda\)-calculusCurry-style type-assignment system for simple type-theory

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• The converse principal type-scheme theorem in lambda calculus
• The Principal Type-Scheme of an Object in Combinatory Logic

This page was built for publication: Two beta-equal lambda-I-terms with no types in common