Principal type-schemes of BCI-lambda-terms
From MaRDI portal
Publication:5096242
DOI10.1007/3-540-54415-1_68zbMath1496.03060OpenAlexW2161468530MaRDI QIDQ5096242
Publication date: 16 August 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-54415-1_68
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear logic
- BCK-combinators and linear \(\lambda\)-terms have types
- Condensed detachment is complete for relevance logic: A computer-aided proof
- The converse principal type-scheme theorem in lambda calculus
- Principal types of BCK-lambda-terms
- BCK and BCI logics, condensed detachment and the 2-property
- Principal type-schemes and condensed detachment
- PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS
- The Principal Type-Scheme of an Object in Combinatory Logic
- Über Tautologien, in Welchen Keine Variable Mehr Als Zweimal Vorkommt
This page was built for publication: Principal type-schemes of BCI-lambda-terms