Abstract
The complexity of the computation of recursive programs by the combinator reduction machine is studied. The number of the reduction steps in compared between the two models of computation. The main theorem states that the time required by the reduction machine is linear in that of the program scheme. The coefficient of the linearity was shown to be O(n2), where n is the maximal number of variables of the functions being used. For the analysis of the combinator codes, the notion of extended combinator code is introduced.
| Original language | English |
|---|---|
| Pages (from-to) | 289-303 |
| Number of pages | 15 |
| Journal | Theoretical Computer Science |
| Volume | 41 |
| Issue number | C |
| DOIs | |
| Publication status | Published - 1985 |
| Externally published | Yes |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Complexity of the combinator reduction machine. / Hirokawa, Sachio.
In: Theoretical Computer Science, Vol. 41, No. C, 1985, p. 289-303.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Complexity of the combinator reduction machine
AU - Hirokawa, Sachio
PY - 1985
Y1 - 1985
N2 - The complexity of the computation of recursive programs by the combinator reduction machine is studied. The number of the reduction steps in compared between the two models of computation. The main theorem states that the time required by the reduction machine is linear in that of the program scheme. The coefficient of the linearity was shown to be O(n2), where n is the maximal number of variables of the functions being used. For the analysis of the combinator codes, the notion of extended combinator code is introduced.
AB - The complexity of the computation of recursive programs by the combinator reduction machine is studied. The number of the reduction steps in compared between the two models of computation. The main theorem states that the time required by the reduction machine is linear in that of the program scheme. The coefficient of the linearity was shown to be O(n2), where n is the maximal number of variables of the functions being used. For the analysis of the combinator codes, the notion of extended combinator code is introduced.
UR - http://www.scopus.com/inward/record.url?scp=0022304455&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022304455&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(85)90076-3
DO - 10.1016/0304-3975(85)90076-3
M3 - Article
AN - SCOPUS:0022304455
VL - 41
SP - 289
EP - 303
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - C
ER -