Complexity of the combinator reduction machine
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 41, 289-303
- https://doi.org/10.1016/0304-3975(85)90076-3
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education
This publication has 7 references indexed in Scilit:
- The BC-chain method for representing combinators in linear spaceNew Generation Computing, 1985
- A linear space translation of functional programs to Turner combinatorsInformation Processing Letters, 1982
- An efficient interpreter for the lambda-calculusJournal of Computer and System Sciences, 1981
- Another algorithm for bracket abstractionThe Journal of Symbolic Logic, 1979
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974