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

DOI10.1016/0304-3975(95)00147-6zbMATH Open0873.03013OpenAlexW2093615652MaRDI QIDQ672135FDOQ672135

Authors: 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

Recommendations

• On polymorphic types of untyped terms
• The \(I\)-types of system \(\mathcal F\)
• On polymorphic types of untyped terms
• Principal types of BCK-lambda-terms
• Types of I-free hereditary right maximal terms

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Principal Type-Scheme of an Object in Combinatory Logic
• The converse principal type-scheme theorem in lambda calculus

Cited In (1)

• The \(I\)-types of system \(\mathcal F\)

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

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