BCK-combinators and linear -terms have types
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Principal types of BCK-lambda-terms
- scientific article; zbMATH DE number 1497851 (Why is no real title available?)
- On principal types of combinators
- Gödel's system \(\mathcal T\) revisited
- Linear additives
- Abstract families of abstract categorial languages
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- A type-assignment of linear erasure and duplication
- On the reification of semantic linearity
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- Weak linearization of the lambda calculus
- The number of proofs for a BCK-formula
- Filter models with polymorphic types
- The proofs of α → α in P – W
- Perpetual reductions in \(\lambda\)-calculus
- Principal type-schemes of BCI-lambda-terms
- Strong typed Böhm theorem and functional completeness on the linear lambda calculus
- Compact bracket abstraction in combinatory logic
- The Relevance Graph of a BCK-Formula
- scientific article; zbMATH DE number 3916223 (Why is no real title available?)
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)