![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Higher-Order and Symbolic Computation, Volume 18
Volume 18, Number 1-2, June 2005
- Olivier Danvy
, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
:
Editorial. 5-6 - Harry G. Mairson:
Robert Paige (1947-1999). 7-8 - Alan Siegel:
Remembrances of Bob Paige. 9-11 - Martin Davis:
An Appreciation of Bob Paige. 13-13 - Deepak Goyal:
Transformational Derivation of an Improved Alias Analysis Algorithm. 15-49 - Jules Desharnais, Bernhard Möller:
Least Reflexive Points of Relations. 51-77 - Nils Klarlund:
Relativizations for the Logic-Automata Connection. 79-120 - Alberto Pettorossi
, Maurizio Proietti
, Sophie Renault:
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. 121-210 - Robert Paige:
An NSF Proposal. 211-235
Volume 18, Number 3-4, December 2005
- Matthias Felleisen, Julia Lawall, Manuel Serrano, Olin Shivers:
Editorial. 243-244 - Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand:
Selectors Make Set-Based Analysis Too Hard. 245-269 - Danny Dubé, Marc Feeley:
BIT: A Very Compact Scheme System for Microcontrollers. 271-298 - Oscar Waddell, Dipanwita Sarkar
, R. Kent Dybvig:
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct. 299-326 - Martin Gasbichler, Michael Sperber:
Integrating User-Level Threads with Processes in Scsh. 327-354 - Oleg Kiselyov:
Implementing Metcast in Scheme. 355-370 - Mayer Goldberg:
A Variadic Extension of Curry's Fixed-Point Combinator. 371-388
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.