Higher-Order and Symbolic Computation
Volume 14, Issue 1 (March 2001)
| p. 5 |
Editorial
Olivier Danvy and Carolyn Talcott [editorial] |
| pp. 7-34 |
A Generic Reification Technique for Object-Oriented Reflective Languages
Rémi Douence and Mario Südholt [abstract | full text] |
| pp. 35-57 |
Functional Differentiation of Computer Programs
Jerzy Karczmarczuk [abstract | full text] |
| pp. 59-91 |
A Per Model of Secure Information Flow in Sequential Programs
Andrei Sabelfeld and David Sands [abstract | full text] |
Volume 14, Issue 2/3 (September 2001) Special Issue on the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2000)
| pp. 99-100 |
Editorial
Olivier Danvy and Julia L. Lawall [editorial] |
| pp. 101-142 |
A Hybrid Approach to Online and Offline Partial Evaluation
Eijiro Sumii and Naoki Kobayashi [abstract | full text] |
| pp. 143-172 |
Regular Tree Languages as an Abstract Domain in Program Specialisation
John P. Gallagher and Julio C. Peralta [abstract | full text] |
| pp. 173-219 |
The Second Futamura Projection for Type-Directed Partial Evaluation
Bernd Grobauer, Zhe Yang [abstract | full text] |
| pp. 221-260 |
Type-Based Useless-Variable Elimination
Naoki Kobayashi [abstract | full text] |
| pp. 261-300 |
Calculating Sized Types
Wei-Ngan Chin and Siau-Cheng Khoo [abstract | full text] |
Volume 14, Issue 4 (December 2001)
| p. 307 |
Editorial
Olivier Danvy, Takayasu Ito and Carolyn Talcott [editorial] |
| pp. 309-356 |
A Network Protocol Stack in Standard ML
Edoardo Biagioni, Robert Harper and Peter Lee [abstract | full text] |
| pp. 357-386 |
Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation
Luc Moreau [abstract | full text] |
| pp. 387-409 |
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition
Yong Xiao, Amr Sabry and Zena M. Ariola [abstract | full text] |