Partial Evaluation: International Seminar, Dagstuhl Castle, Germany, February 12 - 16, 1996. Selected Papers / Edition 1

by Olivier Danvy, Robert Glïck, Peter Thiemann

Overview

Partial Evaluation has reached a point where theory and techniques have matured, substantial systems have been developed, and realistic applications can benefit from partial evaluation.

This book is based on the International Seminar on Partial Evaluation held in Dagstuhl Castle, Germany in February 1996. The 24 strictly refereed full papers included evaluate the progress achieved in the field during the last decade. Also included is a detailed preface by the volume editors and a subject index. All in all, this book competently reports the state of the art and future perspectives in partial evaluation and is thus compulsory reading for anybody interested in the area.

Product Details

ISBN-13:	9783540615804
Publisher:	Springer Berlin Heidelberg
Publication date:	09/26/1996
Series:	Lecture Notes in Computer Science , #1110
Edition description:	1996
Pages:	520
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

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.