BCK-combinators and linear -terms have types
From MaRDI portal
DOI10.1016/0304-3975(89)90100-XzbMATH Open0671.03010OpenAlexW1968532969MaRDI QIDQ1119620FDOQ1119620
Authors: J. Roger Hindley
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90100-x
Recommendations
Cites Work
Cited In (20)
- Title not available (Why is that?)
- Filter models with polymorphic types
- Principal types of BCK-lambda-terms
- Weak linearization of the lambda calculus
- Compact bracket abstraction in combinatory logic
- The Relevance Graph of a BCK-Formula
- Title not available (Why is that?)
- Perpetual reductions in \(\lambda\)-calculus
- The proofs of α → α in P – W
- Gödel's system \(\mathcal T\) revisited
- Title not available (Why is that?)
- Principal type-schemes of BCI-lambda-terms
- Abstract families of abstract categorial languages
- The number of proofs for a BCK-formula
- On the reification of semantic linearity
- Linear additives
- A type-assignment of linear erasure and duplication
- Strong typed Böhm theorem and functional completeness on the linear lambda calculus
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- On principal types of combinators
This page was built for publication: BCK-combinators and linear \(\lambda\)-terms have types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119620)