Partial Evaluation as a Means of Language Extensibility.

摘要

An optimization technique known as partial evaluation is explored. A partial evaluator optimizes code by making use of static information about program values. Our partial evaluator is designed to optimize mainly applicative code. Un-checked assertions are used to identify applicative constructs in the input code and guide the partial evaluator. Side-effects in the input code are retained but are not optimized. This thesis is part of a larger project devoted to language extensibility. Source language constructs will be transformed into kernel language constructs by syntactic transforms. These transforms will add applicative code for type-checking, etc. To assess the effectiveness of the partial evaluator, some examples of kernel language programs are partially evaluated, and the results discussed. Originator-supplied keywords include: Programming Language Optimization, Implementation, and Extensibility; and Partial Evaluation.