Partial Evaluation

An automatic interprocedural analysis for the understanding of scientific application programs.- Practical aspects of specialization of Algol-like programs.- Synchronization analyses for multiple recursion parameters.- A uniform approach for compile-time and run-time specialization.- Pragmatics of type-directed partial evaluation.- Compiler generation for interactive graphics using intermediate code.- Regular approximation of computation paths in logic and functional languages.- A roadmap to metacomputation by supercompilation.- Reasoning about hierarchies of online program specialization systems.- Type specialisation for the ?-calculus; or, a new paradigm for partial evaluation based on type inference.- What not to do when writing an interpreter for specialisation.- Efficiently generating efficient generating extensions in prolog.- Global control for partial deduction through characteristic atoms and global trees.- Squeezing intermediate construction in equational programs.- Evolution of partial evaluators: Removing inherited limits.- A Self-Applicable supercompiler.- Multi-Level Lambda-Calculi: An algebraic description.- A comparative revisitation of some program transformation techniques.- A theory of logic program specialization and generalization for dealing with input data properties.- Program specialization via program slicing.- Specialization of imperative programs through analysis of relational expressions.- ML pattern match compilation and partial evaluation.- Self-applicable online partial evaluation.- Metacomputation: Metasystem transitions plus supercompilation.