On principal types of combinators
From MaRDI portal
Publication:1583260
DOI10.1016/S0304-3975(99)00086-9zbMATH Open0949.68045OpenAlexW1973325143WikidataQ126436569 ScholiaQ126436569MaRDI QIDQ1583260FDOQ1583260
Authors: Sabine Broda, Luís Damas 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatory logic. With two sections by William Craig.
- The lambda calculus, its syntax and semantics
- The Principal Type-Scheme of an Object in Combinatory Logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on the axiomatics of the propositional calculus
- Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
- Principal types of BCK-lambda-terms
- Positive logic and \(\lambda\)-constants
- BCK-combinators and linear \(\lambda\)-terms have types
Cited In (9)
- Title not available (Why is that?)
- The converse principal type-scheme theorem in lambda calculus
- BCK-combinators and linear \(\lambda\)-terms have types
- Principal types of BCK-lambda-terms
- Restoration of types in reflexive combinatory logic
- The involutions-as-principal types/application-as-unification analogy
- Principal type-schemes of BCI-lambda-terms
- Title not available (Why is that?)
- On Principal Types of BCK-λ-Terms
Uses Software
This page was built for publication: On principal types of combinators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583260)
