Partial evaluation

From Wikipedia, the free encyclopedia

Programming
evaluation

Eager
Function
Lazy
Minimal
Partial
Remote
Strategy

In computing, partial evaluation is a technique for program optimization by specialization.

A computer program is seen as a mapping prog of input data into output data:

prog: {Istatic, Idynamic} \rightarrow O

Istatic, the static data, is the part of the input data known at compile time.

The partial evaluator transforms {prog, Istatic} into prog* i.e. precomputes all static input at compile time. prog* is called the "residual program", and the act of partial evaluation is said to "residualize" prog to prog*.

prog: {Istatic, Idynamic} \rightarrow O becomes prog*: Idynamic \rightarrow O which in general runs more efficiently.

Contents

A particularly interesting example of this, first described in the 1970s by Yoshihiko Futamura, is when prog is an interpreter for a programming language.

If Istatic is source code designed to run inside said interpreter, then partial evaluation of the interpreter with respect to this data/program produces prog*, a version of the interpreter that only runs that source code, is written in the implementation language of the interpreter, does not require the source code to be resupplied, and runs faster than the original combination of the interpreter and the source. In this case prog* is effectively a compiled version of Istatic.

This technique is known as the first Futamura projection, of which there are three:

  1. Compiling by specializing an interpreter
  2. Compiler generation by self-application
  3. Compiler generator generation by double self-application

  • Yoshihiko Futamura. Partial Evaluation of Computation Process -- An Approach to a Compiler-Compiler Systems . Computers . Controls 2(5):45-50, 1971. Reprinted in Higher-Order and Symbolic Computation 12(4):381-391, 1999, with a foreword
  • Charles Consel and Olivier Danvy. Tutorial Notes on Partial Evaluation Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages pp. 493-501, 1993

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.