Martin Gasbichler, Michael Sperber  Home/Search
Context Related
| pu.informatik.unituebingen...icfp02.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: readscheme.org/whats_new (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating shift and reset via call/cc. Typical applications of these operators exhibit space savings and a significant overall performance gain. Our technique is based upon the popular incremental stack/heap strategy for representing continuations. We present implementation details as well as some benchmark measurements for... (Update)
Context of citations to this paper: More
.... Danvy and Filinski s shift and reset operators [6, 7] are most widely used and e#cient implementations for them have been proposed [11, 13]. An important merit of their operators is that a clean and rigorous semantics is given through a CPStranslation. Moreover, Filinski [11]...
Cited by: More
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy (Correct)
A Sound and Complete Axiomatization of Delimited Continuations - Kameyama, Hasegawa (2003) (Correct)
Active bibliography (related documents): More All
0.6: Online Type-Directed Partial Evaluation for.. - Sumii, Kobayashi (1999) (Correct)
0.5: Formalizing Implementation Strategies for First-Class Continuations - Danvy (2000) (Correct)
0.3: Two Flavors of Offline Partial Evaluation - Helsen, Thiemann (1998) (Correct)
Similar documents based on text: More All
0.6: Functional Logic Overloading - Neubauer, Thiemann, Gasbichler.. (2001) (Correct)
0.5: Back to Direct Style II: First-Class Continuations - Danvy, Lawall (1992) (Correct)
0.4: Partial Continuations as the Difference of Continuations A.. - Moreau, Queinnec (1994) (Correct)
Related documents from co-citation: More All
3: Lisp and Symbolic Computation (context) - Robert, Kent et al. - 1994
3: The theory and practice of first-class prompts (context) - Felleisen - 1988
3: Representing monads - Filinski - 1994
BibTeX entry: (Update)
M. Gasbichler and M. Sperber. Final shift for call/cc: Direct Implementation of Shift and Reset. In Proc. 7th pages 271--282, 2002. http://citeseer.ist.psu.edu/gasbichler02final.html More
@misc{ gasbichler02final,
author = "Martin Gasbichler and Michael Sperber",
title = "Final Shift for Call/cc: Direct Implementation of Shift and Reset",
text = "M. Gasbichler and M. Sperber. Final shift for call/cc: Direct Implementation
of Shift and Reset. In Proc. 7th pages 271--282, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/gasbichler02final.html" }
Citations (may not include all citations):122 Type-directed partial evaluation - Danvy - 1998
81 The theory and practice of first-class prompts (context) - Felleisen - 1988
67 Representing control in the presence of first-class continua.. - Hieb, Dybvig et al. - 1990
67 Representing monads - Filinski - 1994
66 Abstracting control - Danvy, Filinski - 1990
55 Representing control: A study of the CPS transformation - Danvy, Filinski - 1992
43 A tractable Scheme implementation - Kelsey, Rees - 1995
41 Continuation-based partial evaluation - Lawall, Danvy - 1994
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
23 Representing control in the presence of one-shot continuatio.. - Bruggeman, Waddell et al. - 1996
20 A scheme for a higher-level semantic algebra (context) - Clinger, Friedman et al. - 1985
19 Monadic parsing in Haskell - Hutton, Meijer - 1998
17 Representing layered monads - Filinski - 1999
15 A generalization of exceptions and control in ML-like langua.. - Gunter, emy et al. - 1995
10 Strong normalization by type-directed partial evaluation and.. - Balat, Danvy - 1998
10 Formalizing implementation strategies for first-class contin.. - Danvy - 2000
10 Combinators for program generation (context) - Thiemann - 1999
8 Partial continuations as the difference of continuations ---.. - Moreau, Queinnec - 1994
7 Safe-for-space threads in Standard ML - Biagioni, Cline et al. - 1998
6 Pre-Scheme: A Scheme dialect for systems programming - Kelsey - 1997
5 Computer Science Department (context) - Felleisen, Friedman et al. - 1987
4 A hybrid approach to online and offline partial evaluation - Sumii, Kobayashi - 2001
4 The PGG System---User Manual - Thiemann - 2000
3 Control Transfer in Operating System Kernels - Draves - 1994
3 dkpub danvyPaperlawall danvy lfp extended (context) - Lawall, Continuation et al. - 1995
2 Implementation strategies for first-class continuations (context) - Clinger, Hartheimer et al. - 1999
2 Two flavors of offline partial evaluation - Helsen, Thiemann - 1998
Documents on the same site (http://library.readscheme.org/whats_new.html): More
The Structure and Interpretation of the Computer.. - Felleisen.. (2002) (Correct)
Processes vs. User-Level Threads in SCSH - Gasbichler, Sperber (Correct)
XML, XPath, XSLT implementations as SXML, SXPath, and SXSLT - Kiselyov, Lisovsky (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC