Department of Information and Computers, School of Science and Engineering, Waseda University, Ohokubo 3-4-1, Sinjuku-ku, Tokyo 169, Japan
Advanced Research Laboratory, Hitachi Ltd., Hatoyama-machi, Saitama 350-03, Japan
Abstract:
Generalized partial computation (GPC) is a program optimization principle based on partial computation and theorem proving. Conventional partial computation methods (or partial evaluators) explicitly make use of only given parameter values to partially evaluate programs. However, GPC explicitly utilizes not only given values but also the following information: (1) logical structure of a program to be partially evaluated; (2) abstract data type of a programming language. The main purpose of this paper is to present comprehensible examples of GPC. Graphical notations, called GPC trees, are introduced to visibly describe GPC processes.