Yukiyoshi Kameyama, Masahito Hasegawa  Home/Search
Context Related
| kurims.kyotou.ac.jp/~hass...icfp03.pdf 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: kurims.kyotou.ac.jp/~hassei/p... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept as the standard (unlimited) continuation, but it represents part of the rest of the computation, rather than the whole rest of computation. In the literature, the semantics of shift and reset has been given by a CPS-translation only. This paper gives a direct axiomatization of calculus with shift and reset, namely, we... (Update)
Cited by: More
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy (Correct)
Active bibliography (related documents): More All
0.8: A Modal Calculus for Effect Handling - Nanevski (2003) (Correct)
0.6: CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1998) (Correct)
0.5: A Scheme-to-Java Translator with Soft Typing - Nagata, Sumii, Yonezawa (Correct)
Similar documents based on text: More All
0.5: Towards Logical Understanding of Delimited Continuations - Kameyama (2001) (Correct)
0.4: Towards Logical Understanding of Delimited Continuations.. - Kameyama (2000) (Correct)
0.3: Parameterizations and Fixed-Point Operators on Control.. - Kakutani, Hasegawa (Correct)
Related documents from co-citation: More All
3: Type-directed partial evaluation - Danvy
2: Control operators (context) - Felleisen, Friedman - 1986
2: Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
BibTeX entry: (Update)
Yukiyoshi Kameyama and Masahito Hasegawa. A sound and complete axiomatization of delimited continuations. In Olin Shivers, editor, Proceedings of the 2003. http://citeseer.ist.psu.edu/kameyama03sound.html More
@misc{ kameyama03sound,
author = "Y. Kameyama and M. Hasegawa",
title = "A sound and complete axiomatization of delimited continuations",
text = "Yukiyoshi Kameyama and Masahito Hasegawa. A sound and complete axiomatization
of delimited continuations. In Olin Shivers, editor, Proceedings of the
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/kameyama03sound.html" }
Citations (may not include all citations):291 Computational Lambda-Calculus and Monads - Moggi - 1989
283 Theoretical Computer Science (context) - Plotkin, Call-by-Value et al. - 1975
158 Reasoning about Programs in Continuation-Passing Style - Sabry, Felleisen - 1993
138 The Revised Report on the Syntactic Theories of Sequential C.. - Felleisen, Hieb - 1992
81 The Theory and Practice of First-Class Prompts (context) - Felleisen - 1988
67 Representing Monads - Filinski - 1994
66 Abstracting Control - Danvy, Filinski - 1990
61 Continuations: A Mathematical Semantics for Handling Full Ju.. (context) - Strachey, Wadsworth - 2000
55 Representing Control: a Study of the CPS Transformation - Danvy, Filinski - 1992
50 Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
26 Cogen in Six Lines - Thiemann - 1996
24 A Dynamic Extent Control Operator for Partial Continuations - Queinnec, Serpette - 1991
23 Revised 5 Report on the Algorithmic Language Scheme (context) - Abelson - 1998
15 A Generalization of Exceptions and Control in ML-Like Langua.. - Gunter, Remy et al. - 1995
15 Sound and Complete Axiomatisations of Call-by-Value Control .. - Hofmann - 1995
12 Lisp and Symbolic Computation (context) - Hieb, Dybvig et al. - 1993
12 Higher-Order and Symbolic Computation (context) - Berdine, O'Hearn et al. - 2002
10 Formalizing Implementation Strategies for First-Class Contin.. - Danvy - 1990
10 and Pseudo-Classical Type Systems: A-Translation at Work (context) - Murthy, Hierarchies - 1992
9 ACM Transactions on Programming Languages and Systems (context) - Sabry, Wadler et al. - 1997
6 Note on Axiomatizing the Semantics of Control Operators (context) - Sabry - 1996
6 A Type-Theoretic Study on Partial Continuations - Kameyama - 2000
4 A First-Order One-Pass CPS Transformation (context) - Danvy, Nielsen - 2002
3 the Call-by-Value CPS Transform and its Semantics - Fuhrmann, Thielecke
3 Final shift callcc Direct Implementation Shift and Reset - Sperber, for et al. - 2002
2 ects: Monadic and CPS Transformations into the Linear Lambda.. (context) - Hasegawa - 2002
2 ects to Typed Continuation Passing (context) - Thielecke - 2003
2 Portable Implementation of Continuation Operators in Imperat.. - Sekiguchi, Sakamoto et al. - 2022
2 Online Partial Evaluation for Shift and Reset - Asai - 2002
2 Reflections on Reflections - Barthe, Hatcli et al. - 1997
1 the Semantics of Delimited Continuations (context) - Hasegawa - 2003
1 An Implementation of Transparent Migration on Standard Schem.. - Sumii - 2000
Documents on the same site (http://www.kurims.kyoto-u.ac.jp/~hassei/papers/): More
Girard Translation and Logical Predicates - Hasegawa (2000) (Correct)
Types and Models for Higher-Order Action Calculi - Gardner, Hasegawa (1997) (Correct)
Decomposing Typed Lambda Calculus Into a Couple of Categorical.. - Hasegawa (1995) (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