Flow-sensitive sub-zero control-flow analysis in linear-log time. Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, and R. Kent Dybvig. Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, OOPSLA '11, pages 483-498,. October, 2011. [abstract, bibtex].
Ftypes: Structured foreign types. Andrew W. Keep and R. Kent Dybvig. Scheme 2011: Workshop on Scheme and Functional Programming, October 2011 [abstract, bibtex].
Enabling cross-library optimization and compile-time error checking in the presence of procedural macros. Andrew W. Keep and R. Kent Dybvig. Proceedings of the 2010 Workshop on Scheme and Functional Programming, 66-76, August 2010 [abstract, bibtex].
Fixing letrec (reloaded). Abdulaziz Ghuloum and R. Kent Dybvig. Proceedings of the 2009 Workshop on Scheme and Functional Programming, 57-65, August 2009 [abstract, bibtex].
The Scheme Programming Language, 4th edition. R. Kent Dybvig. MIT Press, 2009 [bibtex].
The Chez Scheme Version 8 User's Guide. R. Kent Dybvig. Cadence Research Systems, 2009 [bibtex].
Efficient nondestructive equality checking for trees and graphs. Michael D. Adams and R. Kent Dybvig. Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, 179-188, September, 2008 [abstract, bibtex].
Implicit phasing for R6RS libraries. Abdulaziz Ghuloum and R. Kent Dybvig. Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 303-314, September, 2007 [abstract, bibtex].
Syntactic abstraction: the syntax-case expander. R. Kent Dybvig. In Andy Oram and Greg Wilson, Beautiful Code: Leading Programmers Explain How They Think, 407--428, June 2007 [bibtex].
The development of Chez Scheme. R. Kent Dybvig. Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, 1-12, September, 2006 (invited paper/talk) [abstract, bibtex, talk].
A monadic framework for delimited continuations. R. Kent Dybvig, Simon Peyton Jones, and Amr Sabry, Journal of Functional Programming (to appear) [abstract, bibtex].
A nanopass framework for compiler education. Dipanwita Sarkar, Oscar Waddell, and R. Kent Dybvig. Journal of Functional Programming 15, 5 (Educational Pearl), 653-667, September 2005 [abstract, bibtex].
Chez Scheme Version 7 User's Guide. R. Kent Dybvig. Cadence Research Systems, 2005 [bibtex, print version]
Fixing letrec: A faithful yet efficient implementation of Scheme's recursive binding construct. Oscar Waddell, Dipanwita Sarkar, and R. Kent Dybvig. Journal of Higher-Order and Symbolic Computation 18, 3/4, 299-326, 2005 [abstract, bibtex].
Abstraction and Performance from Explicit Monadic Reflection. Jonathan Sobel, Erik Hilsdale, R.~Kent Dybvig, and Daniel~P.~Friedman, ACM SIGPLAN Workshop on Scheme and Functional Programming. September, 2005. [abstract, bibtex].
The Scheme Programming Language, third edition. R. Kent Dybvig. MIT Press, 2002 [bibtex].
From macrogeneration to syntactic abstraction. R. Kent Dybvig. Journal of Higher-Order and Symbolic Computation 13, 1--2, Special Issue on Christopher Strachey, April 2000, 57--63. [abstract].
Extending the scope of syntactic abstraction. Oscar Waddell and R. Kent Dybvig. Conference Record of POPL'99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 203--213, January 1999. [abstract].
Chez Scheme User's Guide. R. Kent Dybvig. Cadence Research Systems, 1998.
Visualizing partial evaluation. Oscar Waddell and R. Kent Dybvig. ACM Computing Surveys Symposium on Partial Evaluation, 30(3es):24-es, September 1998.
A practical and flexible flow analysis for higher-order languages. J. Michael Ashley and R. Kent Dybvig. ACM Transactions on Programming Languages and Systems 20, 4, 845-868, July 1988. [abstract, bibtex]
An infrastructure for profile-driven dynamic recompilation. Robert G. Burger and R. Kent Dybvig. In IEEE Computer Society 1998 International Conference on Computer Languages, pages 240-251, May 1998. [abstract]
Threads yield continuations. Sanjeev Kumar, Carl Bruggeman, and R. Kent Dybvig. LISP and Symbolic Computation 10, 3, 223-236, May 1998. [abstract].
Fast and effective procedure inlining. Oscar Waddell and R. Kent Dybvig. Extended version of a paper that appeared in the Proceedings of the Fourth International Symposium on Static Analysis (SAS '97) Springer-Verlag Lecture Notes in Computer Science 1302, 35-52, September 1997. [abstract]
Reliable interactive programming with modules. Sho-Huan Simon Tung and R. Kent Dybvig. Lisp and Symbolic Computation 9, 4, 343-358, December 1996. [abstract]
The Scheme Programming Language, second edition. R. Kent Dybvig. Prentice Hall, 1996.
Representing control in the presence of one-shot continuations. Carl Bruggeman, Oscar Waddell, and R. Kent Dybvig. ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation, June 1996. [abstract].
Printing floating point numbers quickly and accurately. Robert G. Burger and R. Kent Dybvig. ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation, June 1996. [abstract].
Compiler construction using Scheme. Erik Hilsdale, J. Michael Ashley, R. Kent Dybvig, and Daniel P. Friedman. First International Symposium, Functional Programming Languages in Education, LNCS Volume 1022, 1995, pp. 251-267, 1995. [abstract].
Register allocation using lazy saves, eager restores, and greedy shuffling. Robert G. Burger, Oscar Waddell, and R. Kent Dybvig. ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, pp. 130-138, June 1995. [abstract].
An efficient implementation of multiple return values in Scheme. J. Michael Ashley and R. Kent Dybvig. 1994 ACM Conference on LISP and Functional Programming, pp. 140-149, June 1994. [abstract].
Don't stop the BiBOP: Flexible and efficient storage management for dynamically typed languages. R. Kent Dybvig, David Eby, and Carl Bruggeman. Indiana University technical report #400, March 1994. [abstract].
Subcontinuations. Robert Hieb, R. Kent Dybvig, and Claude W. Anderson, III. Lisp and Symbolic Computation 7, 1, 83-110, January 1994. [abstract].
Guardians in a generation-based collector. R. Kent Dybvig, David Eby, and Carl Bruggeman, ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation, 207-216, June 1993. [abstract].
Syntactic abstraction in Scheme. R. Kent Dybvig, Robert Hieb, and Carl Bruggeman. Lisp and Symbolic Computation 5, 4, pp. 83-110, December 1992. [abstract].
Writing hygienic macros in Scheme with syntax-case. Kent Dybvig. Indiana University Computer Science Department Technical Report #356, 1992. [abstract].
A new approach to procedures with variable arity. R. Kent Dybvig and Robert Hieb, Lisp and Symbolic Computation 3, 3, 229-244, September 1990. [abstract].
Representing control in the presence of first-class continuations. Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, 66-77, June 1990. [abstract].
Destination-driven code generation. R. Kent Dybvig, Robert Hieb, and Tom Butler. Indiana University Computer Science Department Technical Report #302, February 1990. [abstract].
Engines from continuations. R. Kent Dybvig and Robert Hieb. Journal of Computer Languages 14, 2, 109-123, 1989. [abstract].
Expansion-passing style: A general macro mechanism. R. Kent Dybvig, Daniel P. Friedman, and Christopher T. Haynes. Lisp and Symbolic Computation 1, 1, 53-75, June 1988. [abstract].
Three Implementation Models for Scheme. R. Kent Dybvig. University of North Carolina Computer Science Technical Report 87-011 [Ph.D. Dissertation], April 1987. [abstract].
Papers published by the Association for Computing Machinery are copyrighted by ACM, Inc.