| 2008 |
|---|
| 33 | EE | Michael D. Adams,
R. Kent Dybvig:
Efficient nondestructive equality checking for trees and graphs.
ICFP 2008: 179-188 |
| 2007 |
|---|
| 32 | EE | Abdulaziz Ghuloum,
R. Kent Dybvig:
Implicit phasing for R6RS libraries.
ICFP 2007: 303-314 |
| 31 | EE | R. Kent Dybvig,
Simon L. Peyton Jones,
A. M. R. Sabry:
A monadic framework for delimited continuations.
J. Funct. Program. 17(6): 687-730 (2007) |
| 2006 |
|---|
| 30 | EE | R. Kent Dybvig:
The development of Chez Scheme.
ICFP 2006: 1-12 |
| 2005 |
|---|
| 29 | EE | Oscar Waddell,
Dipanwita Sarkar,
R. Kent Dybvig:
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct.
Higher-Order and Symbolic Computation 18(3-4): 299-326 (2005) |
| 28 | EE | Dipanwita Sarkar,
Oscar Waddell,
R. Kent Dybvig:
Educational Pearl: A Nanopass framework for compiler education.
J. Funct. Program. 15(5): 653-667 (2005) |
| 2004 |
|---|
| 27 | EE | Dipanwita Sarkar,
Oscar Waddell,
R. Kent Dybvig:
A nanopass infrastructure for compiler education.
ICFP 2004: 201-212 |
| 2000 |
|---|
| 26 | | R. Kent Dybvig:
From Macrogeneration to Syntactic Abstraction.
Higher-Order and Symbolic Computation 13(1/2): 57-63 (2000) |
| 1999 |
|---|
| 25 | EE | Oscar Waddell,
R. Kent Dybvig:
Extending the Scope of Syntactic Abstraction.
POPL 1999: 203-215 |
| 1998 |
|---|
| 24 | EE | Robert G. Burger,
R. Kent Dybvig:
An Infrastructure for Profile-Driven Dynamic Recompilation.
ICCL 1998: 240- |
| 23 | EE | Oscar Waddell,
R. Kent Dybvig:
Visualizing Partial Evaluation.
ACM Comput. Surv. 30(3es): 24 (1998) |
| 22 | EE | J. Michael Ashley,
R. Kent Dybvig:
A Practical and Flexible Flow Analysis for Higher-Order Languages.
ACM Trans. Program. Lang. Syst. 20(4): 845-868 (1998) |
| 21 | | Harold Abelson,
R. Kent Dybvig,
Christopher T. Haynes,
Guillermo Juan Rozas,
N. I. Adams IV,
Daniel P. Friedman,
Eugene E. Kohlbecker,
Guy L. Steele Jr.,
David H. Bartley,
Robert H. Halstead Jr.,
Don Oxley,
Gerald J. Sussman,
G. Brooks,
Chris Hanson,
Kent M. Pitman,
Mitchell Wand:
Revised Report on the Algorithmic Language Scheme.
Higher-Order and Symbolic Computation 11(1): 7-105 (1998) |
| 20 | | Sanjeev Kumar,
Carl Bruggeman,
R. Kent Dybvig:
Threads Yield Continuations.
Lisp and Symbolic Computation 10(3): 223-236 (1998) |
| 1997 |
|---|
| 19 | | Oscar Waddell,
R. Kent Dybvig:
Fast and Effective Procedure Inlining.
SAS 1997: 35-52 |
| 1996 |
|---|
| 18 | | Robert G. Burger,
R. Kent Dybvig:
Printing Floating-Point Numbers Quickly and Accurately.
PLDI 1996: 108-116 |
| 17 | | Carl Bruggeman,
Oscar Waddell,
R. Kent Dybvig:
Representing Control in the Presence of One-Shot Continuations.
PLDI 1996: 99-107 |
| 16 | | Sho-Huan Simon Tung,
R. Kent Dybvig:
Reliable Interactive Programming with Modules.
Lisp and Symbolic Computation 9(4): 343-358 (1996) |
| 1995 |
|---|
| 15 | | Eric Hilsdale,
J. Michael Ashley,
R. Kent Dybvig,
Daniel P. Friedman:
Compiler Construction Using Scheme.
FPLE 1995: 251-267 |
| 14 | | Robert G. Burger,
Oscar Waddell,
R. Kent Dybvig:
Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling.
PLDI 1995: 130-138 |
| 1994 |
|---|
| 13 | EE | J. Michael Ashley,
R. Kent Dybvig:
An Efficient Implementation of Multiple Return Values in Scheme.
LISP and Functional Programming 1994: 140-149 |
| 12 | | Robert Hieb,
R. Kent Dybvig,
Claude W. Anderson III:
Subcontinuations.
Lisp and Symbolic Computation 7(1): 83-110 (1994) |
| 1993 |
|---|
| 11 | | R. Kent Dybvig,
Carl Bruggeman,
David Eby:
Guardians in a Generation-Based Garbage Collector.
PLDI 1993: 207-216 |
| 1992 |
|---|
| 10 | | Suresh Srinivas,
R. Kent Dybvig:
Superscalar Floating-Point Vector Computation in Scheme.
CONPAR 1992: 811-812 |
| 9 | | Carl Bruggeman,
R. Kent Dybvig:
A New Architecture Design Paradigm for Parallel Computing in Scheme.
Parallel Symbolic Computing 1992: 362-379 |
| 8 | | R. Kent Dybvig,
Robert Hieb,
Carl Bruggeman:
Syntactic Abstraction in Scheme.
Lisp and Symbolic Computation 5(4): 295-326 (1992) |
| 1990 |
|---|
| 7 | | Robert Hieb,
R. Kent Dybvig,
Carl Bruggeman:
Representing Control in the Presence of First-Class Continuations.
PLDI 1990: 66-77 |
| 6 | | Robert Hieb,
R. Kent Dybvig:
Continuations and Concurrency.
PPOPP 1990: 128-136 |
| 5 | | R. Kent Dybvig,
Robert Hieb:
A New Approach to Procedures with Variable Arity.
Lisp and Symbolic Computation 3(3): 229-244 (1990) |
| 1989 |
|---|
| 4 | | R. Kent Dybvig,
Robert Hieb:
Engines From Continuations.
Comput. Lang. 14(2): 109-123 (1989) |
| 1988 |
|---|
| 3 | EE | R. Kent Dybvig,
Robert Hieb:
A Variable-Arity Procedural Interface.
LISP and Functional Programming 1988: 106-115 |
| 2 | | R. Kent Dybvig,
Daniel P. Friedman,
Christopher T. Haynes:
Expansion-Passing Style: A General Macro Mechanism.
Lisp and Symbolic Computation 1(1): 53-75 (1988) |
| 1986 |
|---|
| 1 | | R. Kent Dybvig,
Daniel P. Friedman,
Christopher T. Haynes:
Expansion-Passing Style: Beyond Conventional Macros.
LISP and Functional Programming 1986: 143-150 |
