Higher-Order and Symbolic Computation
Volume 18, Issue 1/2 (2005) Special issue in memory of Bob Paige
| pp. 5-6 |
Editorial
Olivier Danvy, Fritz Henglein, Harry Mairson, and Alberto Pettorossi [editorial] |
| pp. 7-8 |
Robert Paige (1947-1999)
Harry Mairson [local copy] |
| pp. 9-12 |
Remembrances of Bob Paige
Alan Siegel [local copy] |
| pp. 13-14 |
An Appreciation of Bob Paige
Martin Davis [local copy] |
| pp. 15-50 |
Transformational Derivation of an Improved Alias Analysis Algorithm
Deepak Goyal [abstract] |
| pp. 51-78 |
Least Reflexive Points of Relations
Jules Desharnais and Bernhard Möller [abstract] |
| pp. 79-120 |
Relativizations for the Logic-Automata Connection
Nils Klarlund [abstract] |
| pp. 121-210 |
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Alberto Pettorossi, Maurizio Proietti, and Sophie Renault [abstract] |
| pp. 211-235 |
An NSF Proposal
Robert Paige [local copy] |
Volume 18, Issue 3/4 (2005) Special isssue on the algorithmic language Scheme
| pp. 243-244 |
Editorial
Matthias Felleisen, Julia Lawall, Manuel Serrano and Olin Shivers [editorial] |
| pp. 245-269 |
Selectors Make Set-Based Analysis Too Hard
Philippe Meunier, Robert Bruce Findler, Paul Steckler and Mitchell Wand [abstract] |
| pp. 271-298 |
BIT: A Very Compact Scheme System for Microcontrollers
Danny Dubé and Marc Feeley [abstract] |
| pp. 299-326 |
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's
Recursive Binding Construct
Oscar Waddell, Dipanwita Sarkar and R. Kent Dybvig [abstract] |
| pp. 327-354 |
Integrating User-Level Threads with Processes in Scsh
Martin Gasbichler and Michael Sperber [abstract] |
| pp. 355-370 |
Implementing Metcast in Scheme
Oleg Kiselyov [abstract] |
| pp. 371-388 |
A Variadic Extension of Curry's Fixed-Point Combinator
Mayer Goldberg [abstract] |