R. K. Dybvig

Publications87
h-index23
Citations3,055
Highly Influential Citations215
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • D. Friedman
  • 161 Publications • 6,514 Citations
  • M. Felleisen
  • 323 Publications • 13,990 Citations
  • M. Flatt
  • 175 Publications • 7,981 Citations
  • M. Wand
  • 145 Publications • 6,616 Citations
  • Publications
  • Influence
Revised5 Report on the Algorithmic Language Scheme
The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis…
View on ACM
Revised4 report on the algorithmic language scheme
The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis…
View on ACM
The Scheme Programming Language
This thoroughly updated edition of The Scheme Programming Language provides an introduction to Scheme and a definitive reference for standard Scheme, presented in a clear and concise manner. Written…
Syntactic abstraction in scheme
TLDR
An efficient macro system is described that prevents inadvertent capturing while maintaining the correlation between source and object code.
View on Springer
Revised6 Report on the Algorithmic Language Scheme
TLDR
Scheme demonstrates that a very small number of rules for forming expressions, with no restrictions on how they are composed, suffice to form a practical and efficient programming language that is flexible enough to support most of the major programming paradigms in use today.
View on Cambridge Press
A monadic framework for delimited continuations
TLDR
It is shown that standard CPS is sufficient to explain the common control operators for delimited continuations, and an implementation as a Scheme library is presented, which results in a monadic framework for typed and encapsulated delimite continuations.
View on Cambridge Press
Revised 5 Report on the Algorithmic Language
Representing control in the presence of one-shot continuations
TLDR
One-shot continuations are introduced, how they interact with traditional multi-shot continuation mechanisms are shown, and a stack-based implementation of control is described that handles both one-shot and multi- shot continuations.
View on ACM
A practical and flexible flow analysis for higher-order languages
TLDR
The analysis described in this article unifies and extends previous work on flow analysis for higher-order languages supporting assignment and control operators and is parameterized over two polyvariance operators and a projection operator.
View on ACM
Three implementation models for scheme
This dissertation presents three implementation models for the Scheme Programming Language. The first is a heap-based model used in some form in most Scheme implementations to date; the second is a…
...
...