You have Guest access.
Log In
Olivier Danvy and Andrzej Filinski
Front matter
1
Program Analysis for Implicit Computational Complexity
2-24
Deriving Pre-conditions for Array Bound Check Elimination
25-38
Type Systems for Useless-Variable Elimination
39-62
Boolean Constraints for Binding-Time Analysis
63-83
Constraint Abstractions
84-102
Implementing Circularity Using Partial Evaluation
103-116
Combining Forward And Backward Analyses of Temporal Properties
117-137
Numerical Power Analysis
138-154
Run-Time Bytecode Specialization A Portable Approach to Generating Optimized Specialized Code
155-172
A New Numerical Abstract Domain Based on Difference-Bound Matrices
173-197
Partial Evaluation for Class-Based Object-Oriented Languages
198-217
Driving in the Jungle
218-237
Higher-Order Pattern Matching for Automatically Applying Fusion Transformations
238-256
Dynamic Partial Evaluation
257-275
Tag Elimination and Jones-Optimality (Preliminary Report)
276-277
Bottom-Up Deduction with Deletion and Priorities
Back matter
Neil D. Jones
Wei-Ngan Chin, Siau-Cheng Khoo and Dana N. Xu
Adam Fischbach and John Hannan
Kevin Glynn, Peter J. Stuckey, Martin Sulzmann and Harald Søndergaard
Jörgen Gustavsson and Josef Svenningsson
Julia L. Lawall
Damien Massé
Isabella Mastroeni
Hidehiko Masuhara and Akinori Yonezawa
Antoine Miné
Ulrik P. Schultz
Jens Peter Secher
Ganesh Sittampalam and Oege de Moor
Gregory T. Sullivan
Walid Taha, Henning Makholm and John Hughes
Harald Ganzinger
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info