2006 |
19 | EE | William D. Clinger,
Fabio V. Rojas:
Linear combinations of radioactive decay models for generational garbage collection.
Sci. Comput. Program. 62(2): 184-203 (2006) |
2002 |
18 | EE | Lars Thomas Hansen,
William D. Clinger:
An experimental study of renewal-older-first garbage collection.
ICFP 2002: 247-258 |
17 | EE | David Detlefs,
Ross Knippel,
William D. Clinger,
Matthias Jacob:
Concurrent Remembered Set Refinement in Generational Garbage Collection.
Java Virtual Machine Research and Technology Symposium 2002: 13-26 |
2001 |
16 | | Mitchell Wand,
William D. Clinger:
Set constraints for destructive array update optimization.
J. Funct. Program. 11(3): 319-346 (2001) |
1999 |
15 | | William D. Clinger,
Anne Hartheimer,
Eric Ost:
Implementation Strategies for First-Class Continuations.
Higher-Order and Symbolic Computation 12(1): 7-45 (1999) |
1998 |
14 | EE | Mitchell Wand,
William D. Clinger:
Set Constraints for Destructive Array Update Optimization.
ICCL 1998: 184- |
13 | | William D. Clinger:
Proper Tail Recursion and Space Efficiency.
PLDI 1998: 174-185 |
12 | | Richard Kelsey,
William D. Clinger,
Jonathan Rees:
Revised5 Report on the Algorithmic Language Scheme.
SIGPLAN Notices 33(9): 26-76 (1998) |
1997 |
11 | | William D. Clinger,
Lars Thomas Hansen:
Generational Garbage Collection and the Radioactive Decay Model.
PLDI 1997: 97-108 |
1994 |
10 | EE | William D. Clinger,
Lars Thomas Hansen:
Lambda, the Ultimate Label or a Simple Optimizing Compiler for Scheme.
LISP and Functional Programming 1994: 128-139 |
9 | EE | A. V. S. Sastry,
William D. Clinger:
Parallel Destructive Updating in Strict Functional Languages.
LISP and Functional Programming 1994: 263-272 |
1993 |
8 | | A. V. S. Sastry,
William D. Clinger,
Zena M. Ariola:
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates.
FPCA 1993: 266-275 |
1991 |
7 | | William D. Clinger,
Jonathan Rees:
Macros That Work.
POPL 1991: 155-162 |
1990 |
6 | EE | William D. Clinger:
How to read floating point numbers accurately (with retrospective)
Best of PLDI 1990: 360-371 |
5 | | William D. Clinger:
How to Read Floating-Point Numbers Accurately.
PLDI 1990: 92-101 |
1988 |
4 | EE | William D. Clinger,
Anne Hartheimer,
Eric Ost:
Implementation Strategies for Continuations.
LISP and Functional Programming 1988: 124-131 |
1984 |
3 | | William D. Clinger:
The Scheme 311 Compiler: An Exercise in Denotational Semantics.
LISP and Functional Programming 1984: 356- |
2 | | William D. Clinger,
Charles Halpern:
Alternative Semantics for McCarthy's amb.
Seminar on Concurrency 1984: 467-478 |
1982 |
1 | | William D. Clinger:
Nondeterministic Call by Need is Neither Lazy Nor by Name.
Symposium on LISP and Functional Programming 1982: 226-234 |