Abstract
This paper attempts to clarify the difference between partial and ordinary computation. Partial computation of a computer program is by definition "specializing a general program based upon its operating environment into a more efficient program". It also shows the usefulness of partial computation. Finally, the formal theory of partial computation, technical problems in making it practical, and its future research problems are discussed. The main purpose of this paper is to make partial computation effectiveness widely known. However, two new results are also reported:(1)a partial computation compiler, and(2)a tabulation technique to terminate partial computation.
Cite
CITATION STYLE
Futamura, Y. (1983). Partial computation of programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 147 LNCS, pp. 1–35). Springer Verlag. https://doi.org/10.1007/3-540-11980-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
