R. Kent Dybvig

According to our database1, R. Kent Dybvig authored at least 47 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Compiler and runtime support for continuation marks.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
Rebuilding racket on chez scheme (experience report).
Proc. ACM Program. Lang., 2019

2015
Profile-guided meta-programming.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

2014
A run-time representation of scheme record types.
J. Funct. Program., 2014

2013
A nanopass framework for commercial compiler development.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Register Allocation By Model Transformer Semantics
CoRR, 2012

Optimizing closures in O(0) time.
Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, 2012

A sufficiently smart compiler for procedural records.
Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, 2012

2011
Flow-sensitive type recovery in linear-log time.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2010
Revised6 Report on the Algorithmic Language Scheme.
Cambridge University Press, ISBN: 978-0-521-19399-3, 2010

2009
The Scheme Programming Language, Fourth Edition.
MIT Press, ISBN: 978-0-262-51298-5, 2009

2008
Editorial.
High. Order Symb. Comput., 2008

Efficient nondestructive equality checking for trees and graphs.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
A monadic framework for delimited continuations.
J. Funct. Program., 2007

Implicit phasing for R6RS libraries.
Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

2006
The development of Chez Scheme.
Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, 2006

2005
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct.
High. Order Symb. Comput., 2005

Educational Pearl: A Nanopass framework for compiler education.
J. Funct. Program., 2005

2004
A nanopass infrastructure for compiler education.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003
The Scheme Programming Language, Third Edition.
MIT Press, ISBN: 978-0-262-54148-0, 2003

2000
From Macrogeneration to Syntactic Abstraction.
High. Order Symb. Comput., 2000

1999
Extending the Scope of Syntactic Abstraction.
Proceedings of the POPL '99, 1999

1998
A Practical and Flexible Flow Analysis for Higher-Order Languages.
ACM Trans. Program. Lang. Syst., 1998

Threads Yield Continuations.
LISP Symb. Comput., 1998

Revised Report on the Algorithmic Language Scheme.
High. Order Symb. Comput., 1998

Visualizing Partial Evaluation.
ACM Comput. Surv., 1998

An Infrastructure for Profile-Driven Dynamic Recompilation.
Proceedings of the 1998 International Conference on Computer Languages, 1998

1997
Fast and Effective Procedure Inlining.
Proceedings of the Static Analysis, 4th International Symposium, 1997

1996
Reliable Interactive Programming with Modules.
LISP Symb. Comput., 1996

Printing Floating-Point Numbers Quickly and Accurately.
Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), 1996

Representing Control in the Presence of One-Shot Continuations.
Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), 1996

1995
Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling.
Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation (PLDI), 1995

Compiler Construction Using Scheme.
Proceedings of the Functional Programming Languages in Education, 1995

1994
Subcontinuations.
LISP Symb. Comput., 1994

An Efficient Implementation of Multiple Return Values in Scheme.
Proceedings of the 1994 ACM Conference on LISP and Functional Programming, 1994

1993
Guardians in a Generation-Based Garbage Collector.
Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI), 1993

1992
Syntactic Abstraction in Scheme.
LISP Symb. Comput., 1992

A New Architecture Design Paradigm for Parallel Computing in Scheme.
Proceedings of the Parallel Symbolic Computing: Languages, 1992

Superscalar Floating-Point Vector Computation in Scheme.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1990
A New Approach to Procedures with Variable Arity.
LISP Symb. Comput., 1990

Continuations and Concurrency.
Proceedings of the Second ACM SIGPLAN Symposium on Princiles & Practice of Parallel Programming (PPOPP), 1990

Representing Control in the Presence of First-Class Continuations.
Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), 1990

1989
Engines From Continuations.
Comput. Lang., 1989

1988
Expansion-Passing Style: A General Macro Mechanism.
LISP Symb. Comput., 1988

A Variable-Arity Procedural Interface.
Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1986
Expansion-Passing Style: Beyond Conventional Macros.
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

1985
A semantic editor.
ACM SIGPLAN Notices, 1985


  Loading...