Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- R. Kent Dybvig
Indiana University, Bloomington, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 47 matches
- 2020
- Matthew Flatt, R. Kent Dybvig:
Compiler and runtime support for continuation marks. PLDI 2020: 45-58 - 2019
- 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) - 2015
- William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig:
Profile-guided meta-programming. PLDI 2015: 403-412 - 2014
- Andrew W. Keep, R. Kent Dybvig:
A run-time representation of scheme record types. J. Funct. Program. 24(6): 675-716 (2014) - 2013
- Andrew W. Keep, R. Kent Dybvig:
A nanopass framework for commercial compiler development. ICFP 2013: 343-350 - 2012
- Andrew W. Keep, R. Kent Dybvig:
A sufficiently smart compiler for procedural records. Scheme@ICFP 2012: 36-46 - Andrew W. Keep, Alex Hearn, R. Kent Dybvig:
Optimizing closures in O(0) time. Scheme@ICFP 2012: 30-35 - Yin Wang, R. Kent Dybvig:
Register Allocation By Model Transformer Semantics. CoRR abs/1202.5539 (2012) - 2011
- 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 - 2010
- 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
- R. Kent Dybvig:
The Scheme Programming Language, Fourth Edition. MIT Press 2009, ISBN 978-0-262-51298-5, pp. I-XII, 1-491 - 2008
- Olivier Danvy, R. Kent Dybvig, Julia Lawall, Peter Thiemann:
Editorial. High. Order Symb. Comput. 21(3): 237-238 (2008) - Michael D. Adams, R. Kent Dybvig:
Efficient nondestructive equality checking for trees and graphs. ICFP 2008: 179-188 - 2007
- R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry:
A monadic framework for delimited continuations. J. Funct. Program. 17(6): 687-730 (2007) - Abdulaziz Ghuloum, R. Kent Dybvig:
Implicit phasing for R6RS libraries. ICFP 2007: 303-314 - 2006
- R. Kent Dybvig:
The development of Chez Scheme. ICFP 2006: 1-12 - 2005
- Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig:
Educational Pearl: A Nanopass framework for compiler education. J. Funct. Program. 15(5): 653-667 (2005) - 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) - 2004
- Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig:
A nanopass infrastructure for compiler education. ICFP 2004: 201-212 - 2003
- R. Kent Dybvig:
The Scheme Programming Language, Third Edition. MIT Press 2003, ISBN 978-0-262-54148-0, pp. I-XI, 1-295 - 2000
- R. Kent Dybvig:
From Macrogeneration to Syntactic Abstraction. High. Order Symb. Comput. 13(1/2): 57-63 (2000) - 1999
- Oscar Waddell, R. Kent Dybvig:
Extending the Scope of Syntactic Abstraction. POPL 1999: 203-215 - 1998
- Oscar Waddell, R. Kent Dybvig:
Visualizing Partial Evaluation. ACM Comput. Surv. 30(3es): 24 (1998) - 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) - Sanjeev Kumar, Carl Bruggeman, R. Kent Dybvig:
Threads Yield Continuations. LISP Symb. Comput. 10(3): 223-236 (1998) - 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) - Robert G. Burger, R. Kent Dybvig:
An Infrastructure for Profile-Driven Dynamic Recompilation. ICCL 1998: 240-251 - 1997
- Oscar Waddell, R. Kent Dybvig:
Fast and Effective Procedure Inlining. SAS 1997: 35-52 - 1996
- Sho-Huan Simon Tung, R. Kent Dybvig:
Reliable Interactive Programming with Modules. LISP Symb. Comput. 9(4): 343-358 (1996) - Carl Bruggeman, Oscar Waddell, R. Kent Dybvig:
Representing Control in the Presence of One-Shot Continuations. PLDI 1996: 99-107
skipping 17 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-10 00:53 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint