R. Kent Dybvig

47 papers A* 8A 6B 2Journal 18Unranked 10
YearRankTypeTitle / Venue / Authors
2020 A* conf
Compiler and runtime support for continuation marks.
PLDI
Matthew Flatt, R. Kent Dybvig
2019 J jnl
Rebuilding racket on chez scheme (experience report).
Proc. ACM Program. Lang.
Matthew Flatt, Caner Derici, R. Kent Dybvig, Andrew W. Keep, Gustavo E. Massaccesi, Sarah Spall, Sam Tobin-Hochstadt, Jon Zeppieri
2015 A* conf
Profile-guided meta-programming.
PLDI
William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig
2014 J jnl
A run-time representation of scheme record types.
J. Funct. Program.
Andrew W. Keep, R. Kent Dybvig
2013 A conf
A nanopass framework for commercial compiler development.
ICFP
Andrew W. Keep, R. Kent Dybvig
2012 — conf
A sufficiently smart compiler for procedural records.
Scheme@ICFP
Andrew W. Keep, R. Kent Dybvig
2012 — conf
Optimizing closures in O(0) time.
Scheme@ICFP
Andrew W. Keep, Alex Hearn, R. Kent Dybvig
2012 J jnl
Register Allocation By Model Transformer Semantics
CoRR
Yin Wang, R. Kent Dybvig
2011 A conf
Flow-sensitive type recovery in linear-log time.
OOPSLA
Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig
2010 — book
Revised6 Report on the Algorithmic Language Scheme.
Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton van Straaten, Robert Bruce Findler, Jacob Matthews
2009 — book
The Scheme Programming Language, Fourth Edition.
R. Kent Dybvig
2008 J jnl
Editorial.
High. Order Symb. Comput.
Olivier Danvy, R. Kent Dybvig, Julia Lawall, Peter Thiemann
2008 A conf
Efficient nondestructive equality checking for trees and graphs.
ICFP
Michael D. Adams, R. Kent Dybvig
2007 J jnl
A monadic framework for delimited continuations.
J. Funct. Program.
R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry
2007 A conf
Implicit phasing for R6RS libraries.
ICFP
Abdulaziz Ghuloum, R. Kent Dybvig
2006 A conf
The development of Chez Scheme.
ICFP
R. Kent Dybvig
2005 J jnl
Educational Pearl: A Nanopass framework for compiler education.
J. Funct. Program.
Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig
2005 J jnl
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct.
High. Order Symb. Comput.
Oscar Waddell, Dipanwita Sarkar, R. Kent Dybvig
2004 A conf
A nanopass infrastructure for compiler education.
ICFP
Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig
2003 — book
The Scheme Programming Language, Third Edition.
R. Kent Dybvig
2000 J jnl
From Macrogeneration to Syntactic Abstraction.
High. Order Symb. Comput.
R. Kent Dybvig
1999 A* conf
Extending the Scope of Syntactic Abstraction.
POPL
Oscar Waddell, R. Kent Dybvig
1998 J jnl
A Practical and Flexible Flow Analysis for Higher-Order Languages.
ACM Trans. Program. Lang. Syst.
J. Michael Ashley, R. Kent Dybvig
1998 — conf
An Infrastructure for Profile-Driven Dynamic Recompilation.
ICCL
Robert G. Burger, R. Kent Dybvig
1998 J jnl
Revised Report on the Algorithmic Language Scheme.
High. Order Symb. Comput.
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
1998 J jnl
Threads Yield Continuations.
LISP Symb. Comput.
Sanjeev Kumar, Carl Bruggeman, R. Kent Dybvig
1998 J jnl
Visualizing Partial Evaluation.
ACM Comput. Surv.
Oscar Waddell, R. Kent Dybvig
1997 B conf
Fast and Effective Procedure Inlining.
SAS
Oscar Waddell, R. Kent Dybvig
1996 A* conf
Printing Floating-Point Numbers Quickly and Accurately.
PLDI
Robert G. Burger, R. Kent Dybvig
1996 J jnl
Reliable Interactive Programming with Modules.
LISP Symb. Comput.
Sho-Huan Simon Tung, R. Kent Dybvig
1996 A* conf
Representing Control in the Presence of One-Shot Continuations.
PLDI
Carl Bruggeman, Oscar Waddell, R. Kent Dybvig
1995 — conf
Compiler Construction Using Scheme.
FPLE
Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman
1995 A* conf
Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling.
PLDI
Robert G. Burger, Oscar Waddell, R. Kent Dybvig
1994 — conf
An Efficient Implementation of Multiple Return Values in Scheme.
LISP and Functional Programming
J. Michael Ashley, R. Kent Dybvig
1994 J jnl
Subcontinuations.
LISP Symb. Comput.
Robert Hieb, R. Kent Dybvig, Claude W. Anderson III
1993 A* conf
Guardians in a Generation-Based Garbage Collector.
PLDI
R. Kent Dybvig, Carl Bruggeman, David Eby
1992 — conf
A New Architecture Design Paradigm for Parallel Computing in Scheme.
Parallel Symbolic Computing
Carl Bruggeman, R. Kent Dybvig
1992 — conf
Superscalar Floating-Point Vector Computation in Scheme.
CONPAR
Suresh Srinivas, R. Kent Dybvig
1992 J jnl
Syntactic Abstraction in Scheme.
LISP Symb. Comput.
R. Kent Dybvig, Robert Hieb, Carl Bruggeman
1990 J jnl
A New Approach to Procedures with Variable Arity.
LISP Symb. Comput.
R. Kent Dybvig, Robert Hieb
1990 B conf
Continuations and Concurrency.
PPoPP
Robert Hieb, R. Kent Dybvig
1990 A* conf
Representing Control in the Presence of First-Class Continuations.
PLDI
Robert Hieb, R. Kent Dybvig, Carl Bruggeman
1989 J jnl
Engines From Continuations.
Comput. Lang.
R. Kent Dybvig, Robert Hieb
1988 — conf
A Variable-Arity Procedural Interface.
LISP and Functional Programming
R. Kent Dybvig, Robert Hieb
1988 J jnl
Expansion-Passing Style: A General Macro Mechanism.
LISP Symb. Comput.
R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes
1986 — conf
Expansion-Passing Style: Beyond Conventional Macros.
LISP and Functional Programming
R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes
1985 — conf
A semantic editor.
SLIPE
R. Kent Dybvig, Bruce T. Smith