R. Kent Dybvig

Professor, Indiana University Computer Science Department
Ph.D. The University of North Carolina, 1987

Courses

  • H211: Introduction to Computer Science - Honors
  • P423/523: Compilers / Programming Language Implementation
  • B490/629: Advanced Compilers
  • Research Interests

  • Programming languages
  • Projects

  • The Scheme Programming Language and The Chez Scheme Version 7 User's Guide
  • Chez Scheme and Cadence Research Systems
  • Revised6 Report on Scheme
  • Portable syntax-case
  • Indiana University programming languages group
  • Links to Ph.D. Graduates

  • Sho-Huan Simon Tung (PhD 5/92; now at Yunlin Institute of Technology)
  • Carl Bruggeman (PhD 12/95; now at Ohio University)
  • Mike Ashley (PhD 5/96; now at Beckman-Coulter)
  • Bob Burger (PhD 3/97; now at Beckman-Coulter)
  • Oscar Waddell (PhD 8/99; now at Beckman-Coulter)
  • Dipanwita Sarkar (PhD 9/08; now at Microsoft Research)
  • Aziz Ghuloum (PhD 1/09; now at American University of Kuwait)
  • Selected Publications

    More complete list of publications

    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 17, 6, 687-730, November, 2007 [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].

    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].

    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].

    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]

    Subcontinuations. Robert Hieb, R. Kent Dybvig, and Claude W. Anderson, III. Lisp and Symbolic Computation 7, 1, 83-110, January 1994. [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].

    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].

    Papers published by the Association for Computing Machinery are copyrighted by ACM, Inc.