The converse principal type-scheme theorem in lambda calculus

DOI10.1007/BF00370332zbMath0786.03014MaRDI QIDQ1194107

Sachio Hirokawa

Publication date: 27 September 1992

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\)-calculusadjoint termsBCIW-\(\lambda\)-termsconverse principal type-scheme theoremprincipal type-assignment figures

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Principal type-schemes of BCI-lambda-terms ⋮ Two beta-equal lambda-I-terms with no types in common ⋮ Most general first order theorems are not recursively enumerable

Cites Work

• Unnamed Item
• Unnamed Item
• Condensed detachment is complete for relevance logic: A computer-aided proof
• Principal types of BCK-lambda-terms
• Principal type-schemes and condensed detachment
• PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS
• The Principal Type-Scheme of an Object in Combinatory Logic

This page was built for publication: The converse principal type-scheme theorem in lambda calculus