首页 | 本学科首页   官方微博 | 高级检索  
     


Essence of generalized partial computation
Authors:Yoshihiko Futamura

Kenroku Nogi and Akihiko Takano

Affiliation:

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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号