Kenichi Asai (2002):
Online partial evaluation for shift and reset.
In: Peter Thiemann: Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), Portland, Oregon, USA, January 14-15, 2002.
ACM,
pp. 19–30,
doi:10.1145/503032.503034.
Kenichi Asai (2004):
Offline partial evaluation for shift and reset.
In: Nevin Heintze & Peter Sestoft: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulatiog, 2004, Verona, Italy, August 24-25, 2004.
ACM,
pp. 3–14,
doi:10.1145/1014007.1014009.
Ulrich Berger & Helmut Schwichtenberg (1991):
An Inverse of the Evaluation Functional for Typed lambda-calculus.
In: Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, 15-18 July, 1991, Amsterdam, The Netherlands.
IEEE Computer Society,
pp. 203–211,
doi:10.1109/LICS.1991.151645.
Malgorzata Biernacka & Dariusz Biernacki (2009):
Context-based proofs of termination for typed delimited-control operators.
In: Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming,
PPDP '09.
ACM,
New York, NY, USA,
pp. 289–300,
doi:10.1145/1599410.1599446.
Catarina Coquand (1993):
From Semantics to Rules: A Machine Assisted Analysis.
In: CSL '93,
Lecture Notes in Computer Science 832.
Springer,
pp. 91–105,
doi:10.1007/BFb0049326.
Olivier Danvy (1999):
Type-Directed Partial Evaluation.
In: John Hatcliff, Torben Mogensen & Peter Thiemann: Partial Evaluation,
Lecture Notes in Computer Science 1706.
Springer Berlin / Heidelberg,
pp. 367–411,
doi:10.1007/3-540-47018-2_16.
Olivier Danvy & Andrzej Filinski (1989):
A Functional Abstraction of Typed Contexts.
Technical Report.
Computer Science Department, University of Copenhagen.
DIKU Rapport 89/12.
Olivier Danvy & Andrzej Filinski (1990):
Abstracting Control.
In: LISP and Functional Programming,
pp. 151–160,
doi:10.1145/91556.91622.
Olivier Danvy & Andrzej Filinski (1992):
Representing Control: A Study of the CPS Transformation.
Mathematical Structures in Computer Science 2(4),
pp. 361–391,
doi:10.1017/S0960129500001535.
Andrzej Filinski (1996):
Controlling Effects.
School of Computer Science, Carnegie Mellon University.
Technical Report CMU-CS-96-119 (144pp.).
Benjamin Grégoire & Xavier Leroy (2002):
A compiled implementation of strong reduction.
SIGPLAN Not. 37(9),
pp. 235–246,
doi:10.1145/583852.581501.
Danko Ilik (2012):
Delimited control operators prove Double-negation Shift.
Annals of Pure and Applied Logic 163(11),
pp. 1549 – 1559,
doi:10.1016/j.apal.2011.12.008.
Danko Ilik (2013):
Continuation-passing style models complete for intuitionistic logic.
Annals of Pure and Applied Logic 164(6),
pp. 651 – 663,
doi:10.1016/j.apal.2012.05.003.
Danko Ilik, Gyesik Lee & Hugo Herbelin (2010):
Kripke models for classical logic.
Annals of Pure and Applied Logic 161(11),
pp. 1367 – 1378,
doi:10.1016/j.apal.2010.04.007.
Special Issue: Classical Logic and Computation (2008).
Yukiyoshi Kameyama (2007):
Axioms for control operators in the CPS hierarchy.
Higher Order Symbol. Comput. 20(4),
pp. 339–369,
doi:10.1007/s10990-007-9009-x.
Yukiyoshi Kameyama & Asami Tanaka (2010):
Equational axiomatization of call-by-name delimited control.
In: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming,
PPDP '10.
ACM,
New York, NY, USA,
pp. 77–86,
doi:10.1145/1836089.1836100.
A. S. Troelstra & D. van Dalen (1988):
Constructivism in mathematics. Vol. I.
Studies in Logic and the Foundations of Mathematics 121.
North-Holland Publishing Co.,
Amsterdam,
doi:10.1016/S0049-237X(09)70523-3.
An introduction.
Kanae Tsushima & Kenichi Asai (2009):
Towards Type-Directed Partial Evaluation for Shift and Reset.
In: Informal proceedings of the 2009 Workshop on Normalization by Evaluation,
Los Angeles, California,
pp. 57–64.
eptcs@eptcs.org