Y. Futamura. RIMS Symposia on Software Science and Engineering, volume 147 of Lecture Notes in Computer Science, Springer, (1983)
DOI: 10.1007/3-540-11980-9_13
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.
%0 Book Section
%1 Futamura:83
%A Futamura, Yoshihiko
%B RIMS Symposia on Software Science and Engineering
%D 1983
%E Goto, Eiichi
%E Furukawa, Koichi
%E Nakajima, Reiji
%E Nakata, Ikuo
%E Yonezawa, Akinori
%I Springer
%K Futamura Optimization PartialEvaluation Projections
%P 1--35
%R 10.1007/3-540-11980-9_13
%T Partial Computation of Programs
%U http://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/103401
%V 147
%X 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.
%@ 978-3-540-11980-7
@incollection{Futamura:83,
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.},
added-at = {2015-07-10T23:40:51.000+0200},
author = {Futamura, Yoshihiko},
biburl = {https://www.bibsonomy.org/bibtex/20616982b1d607332f28783da885ed367/gron},
booktitle = {RIMS Symposia on Software Science and Engineering},
description = {Partial computation of programs - Springer},
doi = {10.1007/3-540-11980-9_13},
editor = {Goto, Eiichi and Furukawa, Koichi and Nakajima, Reiji and Nakata, Ikuo and Yonezawa, Akinori},
interhash = {d775ab2186f9a27795cbca654d19cc37},
intrahash = {0616982b1d607332f28783da885ed367},
isbn = {978-3-540-11980-7},
keywords = {Futamura Optimization PartialEvaluation Projections},
language = {English},
pages = {1--35},
pdf = {http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/103401/1/0482-14.pdf},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2015-07-10T23:40:51.000+0200},
title = {{Partial Computation of Programs}},
url = {http://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/103401},
volume = 147,
year = 1983
}