Lazy memo-functions
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 129-146
- https://doi.org/10.1007/3-540-15975-4_34
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient compilation of lazy evaluationPublished by Association for Computing Machinery (ACM) ,1984
- Super-combinators a new implementation method for applicative languagesPublished by Association for Computing Machinery (ACM) ,1982
- Applicative cachingPublished by Association for Computing Machinery (ACM) ,1981
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979
- An example of hierarchical design and proofCommunications of the ACM, 1978
- List processing in real time on a serial computerCommunications of the ACM, 1978
- Garbage collecting a heap which includes a scatter tableInformation Processing Letters, 1976
- Elimination of recursive calls using a small table of “randomly” selected function valuesBIT Numerical Mathematics, 1976
- “Memo” Functions and Machine LearningNature, 1968