On principal types of combinators
From MaRDI portal
Publication:1583260
DOI10.1016/S0304-3975(99)00086-9zbMath0949.68045OpenAlexW1973325143WikidataQ126436569 ScholiaQ126436569MaRDI QIDQ1583260
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00086-9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatory logic. With two sections by William Craig.
- BCK-combinators and linear \(\lambda\)-terms have types
- The lambda calculus, its syntax and semantics
- Principal types of BCK-lambda-terms
- Positive logic and \(\lambda\)-constants
- Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
- Notes on the axiomatics of the propositional calculus
- The Principal Type-Scheme of an Object in Combinatory Logic