A bibliography on partial evaluation
ACM SIGPLAN Notices
Partial evaluation applied to numerical computation
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Using types to avoid redundant specialization
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tutorial notes on partial evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
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.