Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
R. Kent Dybvig
2010 – today
- 2012
[i1]Yin Wang, R. Kent Dybvig: Register Allocation By Model Transformer Semantics. CoRR abs/1202.5539 (2012)- 2011
- [c20]Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig: Flow-sensitive type recovery in linear-log time. OOPSLA 2011: 483-498
2000 – 2009
- 2009
- [b2]R. Kent Dybvig: The Scheme Programming Language (4. ed.). MIT Press 2009, ISBN 978-0-262-51298-5, pp. I-XII, 1-491
- 2008
- [j15]Olivier Danvy, R. Kent Dybvig, Julia L. Lawall, Peter Thiemann: Editorial. Higher-Order and Symbolic Computation 21(3): 237-238 (2008)
- [c19]Michael D. Adams, R. Kent Dybvig: Efficient nondestructive equality checking for trees and graphs. ICFP 2008: 179-188
- 2007
- [j14]R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry: A monadic framework for delimited continuations. J. Funct. Program. 17(6): 687-730 (2007)
- [c18]
- 2006
- [c17]
- 2005
- [j13]Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig: Educational Pearl: A Nanopass framework for compiler education. J. Funct. Program. 15(5): 653-667 (2005)
- [j12]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)
- 2004
- [c16]Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig: A nanopass infrastructure for compiler education. ICFP 2004: 201-212
- 2003
- [b1]R. Kent Dybvig: The scheme programming language (3. ed.). MIT Press 2003, ISBN 978-0-262-54148-0, pp. I-XI, 1-295
- 2000
- [j11]R. Kent Dybvig: From Macrogeneration to Syntactic Abstraction. Higher-Order and Symbolic Computation 13(1/2): 57-63 (2000)
1990 – 1999
- 1999
- [c15]
- 1998
- [j10]
- [j9]Sanjeev Kumar, Carl Bruggeman, R. Kent Dybvig: Threads Yield Continuations. Lisp and Symbolic Computation 10(3): 223-236 (1998)
- [j8]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)
- [j7]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)
- [c14]Robert G. Burger, R. Kent Dybvig: An Infrastructure for Profile-Driven Dynamic Recompilation. ICCL 1998: 240-
- 1997
- [c13]
- 1996
- [j6]Sho-Huan Simon Tung, R. Kent Dybvig: Reliable Interactive Programming with Modules. Lisp and Symbolic Computation 9(4): 343-358 (1996)
- [c12]Carl Bruggeman, Oscar Waddell, R. Kent Dybvig: Representing Control in the Presence of One-Shot Continuations. PLDI 1996: 99-107
- [c11]Robert G. Burger, R. Kent Dybvig: Printing Floating-Point Numbers Quickly and Accurately. PLDI 1996: 108-116
- 1995
- [c10]Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman: Compiler Construction Using Scheme. FPLE 1995: 251-267
- [c9]Robert G. Burger, Oscar Waddell, R. Kent Dybvig: Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling. PLDI 1995: 130-138
- 1994
- [j5]Robert Hieb, R. Kent Dybvig, Claude W. Anderson III: Subcontinuations. Lisp and Symbolic Computation 7(1): 83-110 (1994)
- [c8]J. Michael Ashley, R. Kent Dybvig: An Efficient Implementation of Multiple Return Values in Scheme. LISP and Functional Programming 1994: 140-149
- 1993
- [c7]R. Kent Dybvig, Carl Bruggeman, David Eby: Guardians in a Generation-Based Garbage Collector. PLDI 1993: 207-216
- 1992
- [j4]R. Kent Dybvig, Robert Hieb, Carl Bruggeman: Syntactic Abstraction in Scheme. Lisp and Symbolic Computation 5(4): 295-326 (1992)
- [c6]Suresh Srinivas, R. Kent Dybvig: Superscalar Floating-Point Vector Computation in Scheme. CONPAR 1992: 811-812
- [c5]Carl Bruggeman, R. Kent Dybvig: A New Architecture Design Paradigm for Parallel Computing in Scheme. Parallel Symbolic Computing 1992: 362-379
- 1990
- [j3]R. Kent Dybvig, Robert Hieb: A New Approach to Procedures with Variable Arity. Lisp and Symbolic Computation 3(3): 229-244 (1990)
- [c4]Robert Hieb, R. Kent Dybvig, Carl Bruggeman: Representing Control in the Presence of First-Class Continuations. PLDI 1990: 66-77
- [c3]
1980 – 1989
- 1989
- [j2]
- 1988
- [j1]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)
- [c2]R. Kent Dybvig, Robert Hieb: A Variable-Arity Procedural Interface. LISP and Functional Programming 1988: 106-115
- 1986
- [c1]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:29 CET by the dblp team