Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Kent Dybvig
Person information
- affiliation: Indiana University, Bloomington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b3]Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton van Straaten, Robert Bruce Findler, Jacob Matthews:
Revised6 Report on the Algorithmic Language Scheme. Cambridge University Press 2010, ISBN 978-0-521-19399-3, pp. 1-301- 2009
- [b2]R. Kent Dybvig:
The Scheme Programming Language, Fourth Edition. MIT Press 2009, ISBN 978-0-262-51298-5, pp. I-XII, 1-491 - 2003
- [b1]R. Kent Dybvig:
The Scheme Programming Language, Third Edition. MIT Press 2003, ISBN 978-0-262-54148-0, pp. I-XI, 1-295
Journal Articles
- 2019
- [j17]Matthew Flatt, Caner Derici, R. Kent Dybvig, Andrew W. Keep, Gustavo E. Massaccesi, Sarah Spall, Sam Tobin-Hochstadt, Jon Zeppieri:
Rebuilding racket on chez scheme (experience report). Proc. ACM Program. Lang. 3(ICFP): 78:1-78:15 (2019) - 2014
- [j16]Andrew W. Keep, R. Kent Dybvig:
A run-time representation of scheme record types. J. Funct. Program. 24(6): 675-716 (2014) - 2008
- [j15]Olivier Danvy, R. Kent Dybvig, Julia Lawall, Peter Thiemann:
Editorial. High. Order Symb. Comput. 21(3): 237-238 (2008) - 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) - 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. High. Order Symb. Comput. 18(3-4): 299-326 (2005) - 2000
- [j11]R. Kent Dybvig:
From Macrogeneration to Syntactic Abstraction. High. Order Symb. Comput. 13(1/2): 57-63 (2000) - 1998
- [j10]Oscar Waddell, R. Kent Dybvig:
Visualizing Partial Evaluation. ACM Comput. Surv. 30(3es): 24 (1998) - [j9]Sanjeev Kumar, Carl Bruggeman, R. Kent Dybvig:
Threads Yield Continuations. LISP Symb. Comput. 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. High. Order Symb. Comput. 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) - 1996
- [j6]Sho-Huan Simon Tung, R. Kent Dybvig:
Reliable Interactive Programming with Modules. LISP Symb. Comput. 9(4): 343-358 (1996) - 1994
- [j5]Robert Hieb, R. Kent Dybvig, Claude W. Anderson III:
Subcontinuations. LISP Symb. Comput. 7(1): 83-110 (1994) - 1992
- [j4]R. Kent Dybvig, Robert Hieb, Carl Bruggeman:
Syntactic Abstraction in Scheme. LISP Symb. Comput. 5(4): 295-326 (1992) - 1990
- [j3]R. Kent Dybvig, Robert Hieb:
A New Approach to Procedures with Variable Arity. LISP Symb. Comput. 3(3): 229-244 (1990) - 1989
- [j2]R. Kent Dybvig, Robert Hieb:
Engines From Continuations. Comput. Lang. 14(2): 109-123 (1989) - 1988
- [j1]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: A General Macro Mechanism. LISP Symb. Comput. 1(1): 53-75 (1988)
Conference and Workshop Papers
- 2020
- [c26]Matthew Flatt, R. Kent Dybvig:
Compiler and runtime support for continuation marks. PLDI 2020: 45-58 - 2015
- [c25]William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig:
Profile-guided meta-programming. PLDI 2015: 403-412 - 2013
- [c24]Andrew W. Keep, R. Kent Dybvig:
A nanopass framework for commercial compiler development. ICFP 2013: 343-350 - 2012
- [c23]Andrew W. Keep, Alex Hearn, R. Kent Dybvig:
Optimizing closures in O(0) time. Scheme@ICFP 2012: 30-35 - [c22]Andrew W. Keep, R. Kent Dybvig:
A sufficiently smart compiler for procedural records. Scheme@ICFP 2012: 36-46 - 2011
- [c21]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 - 2008
- [c20]Michael D. Adams, R. Kent Dybvig:
Efficient nondestructive equality checking for trees and graphs. ICFP 2008: 179-188 - 2007
- [c19]Abdulaziz Ghuloum, R. Kent Dybvig:
Implicit phasing for R6RS libraries. ICFP 2007: 303-314 - 2006
- [c18]R. Kent Dybvig:
The development of Chez Scheme. ICFP 2006: 1-12 - 2004
- [c17]Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig:
A nanopass infrastructure for compiler education. ICFP 2004: 201-212 - 1999
- [c16]Oscar Waddell, R. Kent Dybvig:
Extending the Scope of Syntactic Abstraction. POPL 1999: 203-215 - 1998
- [c15]Robert G. Burger, R. Kent Dybvig:
An Infrastructure for Profile-Driven Dynamic Recompilation. ICCL 1998: 240-251 - 1997
- [c14]Oscar Waddell, R. Kent Dybvig:
Fast and Effective Procedure Inlining. SAS 1997: 35-52 - 1996
- [c13]Carl Bruggeman, Oscar Waddell, R. Kent Dybvig:
Representing Control in the Presence of One-Shot Continuations. PLDI 1996: 99-107 - [c12]Robert G. Burger, R. Kent Dybvig:
Printing Floating-Point Numbers Quickly and Accurately. PLDI 1996: 108-116 - 1995
- [c11]Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman:
Compiler Construction Using Scheme. FPLE 1995: 251-267 - [c10]Robert G. Burger, Oscar Waddell, R. Kent Dybvig:
Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling. PLDI 1995: 130-138 - 1994
- [c9]J. Michael Ashley, R. Kent Dybvig:
An Efficient Implementation of Multiple Return Values in Scheme. LISP and Functional Programming 1994: 140-149 - 1993
- [c8]R. Kent Dybvig, Carl Bruggeman, David Eby:
Guardians in a Generation-Based Garbage Collector. PLDI 1993: 207-216 - 1992
- [c7]Suresh Srinivas, R. Kent Dybvig:
Superscalar Floating-Point Vector Computation in Scheme. CONPAR 1992: 811-812 - [c6]Carl Bruggeman, R. Kent Dybvig:
A New Architecture Design Paradigm for Parallel Computing in Scheme. Parallel Symbolic Computing 1992: 362-379 - 1990
- [c5]Robert Hieb, R. Kent Dybvig, Carl Bruggeman:
Representing Control in the Presence of First-Class Continuations. PLDI 1990: 66-77 - [c4]Robert Hieb, R. Kent Dybvig:
Continuations and Concurrency. PPoPP 1990: 128-136 - 1988
- [c3]R. Kent Dybvig, Robert Hieb:
A Variable-Arity Procedural Interface. LISP and Functional Programming 1988: 106-115 - 1986
- [c2]R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes:
Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150 - 1985
- [c1]R. Kent Dybvig, Bruce T. Smith:
A semantic editor. SLIPE 1985: 74-82
Informal and Other Publications
- 2012
- [i1]Yin Wang, R. Kent Dybvig:
Register Allocation By Model Transformer Semantics. CoRR abs/1202.5539 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-23 23:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
