Partial parametrization eliminates multiple traversals of data structures
- 1 February 1987
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 24 (1) , 57-77
- https://doi.org/10.1007/bf00290706
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lazy memo-functionsLecture Notes in Computer Science, 1985
- Using circular programs to eliminate multiple traversals of dataActa Informatica, 1984
- A proposal for standard MLPublished by Association for Computing Machinery (ACM) ,1984
- Super-combinators a new implementation method for applicative languagesPublished by Association for Computing Machinery (ACM) ,1982
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Fourth international colloquium on automata, languages and programmingTheoretical Computer Science, 1976
- A lazy evaluatorPublished by Association for Computing Machinery (ACM) ,1976
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974