Name
Abstract | ||
|---|---|---|
In this paper we characterise precisely the sets of terms whose abstractions can be defined using the following partial bases of combinators: {B, B',I}, {B,B'I,W}, {B,B',I,K}, {B,T,I}, {B,T,I,W} and {B,T,I,K}. The reduction axioms for B' and T areB'XYZ right-pointing open triangle Y(XZ), TXYZ right-pointing open triangle YXZ.The first two B'-bases correspond via type-assignment to two interesting implicational logics. T has the re-ordering property of B' but not its bracketing property, and turns out to be strictly stronger than B' but strictly weaker than CI whose reduction axiom is CIXY right-pointing open triangle YX. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0304-3975(94)90114-7 | THEORETICAL COMPUTER SCIENCE |
DocType | Volume | Issue |
Journal | 135 | 2 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Trigg | 1 | 0 | 0.34 |
| J. Roger Hindley | 2 | 203 | 82.67 |
| Martin W. Bunder | 3 | 64 | 16.78 |