{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:57:54Z","timestamp":1743015474156,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_34","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"442-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Axioms for Delimited Continuations in the CPS Hierarchy"],"prefix":"10.1007","author":[{"given":"Yukiyoshi","family":"Kameyama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Asai, K.: Online Partial Evaluation for Shift and Reset. In: Proc. ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pp. 19\u201330 (2002)","DOI":"10.1145\/509799.503034"},{"key":"34_CR2","unstructured":"Asai, K.: Offline Partial Evaluation for Shift and Reset. In: Proc. ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (to appear)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations. Proc. Fourth ACM SIGPLAN Workshop on Continuations, Technical Report CSR-04-1, School of Computer Science, University of Birmingham, pp. 25\u201334 (2004)","DOI":"10.7146\/brics.v11i29.21854"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Type-directed partial evaluation. In: Proc. 23rd Symposium on Principles of Programming Languages, pp. 242\u2013257 (1996)","DOI":"10.1145\/237721.237784"},{"key":"34_CR5","unstructured":"Danvy, O.: On evaluation contexts, continuations, and the rest of the computation. In: Proc. Fourth ACM SIGPLAN Workshop on Continuations, Technical Report CSR-04-1, School of Computer Science, University of Birmingham, pp. 13\u201323 (2004)"},{"key":"34_CR6","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Technical Report 89\/12, DIKU, University of Copenhagen (1989)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting Control. In: Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 151\u2013160 (1990)","DOI":"10.1145\/91556.91622"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science\u00a02(4), 361\u2013391 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-49099-X_15","volume-title":"Programming Languages and Systems","author":"O. Danvy","year":"1999","unstructured":"Danvy, O., Yang, Z.: An Operational Investigation of the CPS Hierarchy. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 224\u2013242. Springer, Heidelberg (1999)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: The Theory and Practice of First-Class Prompts. In: Proc. 15th Symposium on Principles of Programming Languages, pp. 180\u2013190 (1988)","DOI":"10.1145\/73560.73576"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing Layered Monads. In: Proc. 26th Symposium on Principles of Programming Languages, pp. 175\u2013188 (1999)","DOI":"10.1145\/292540.292557"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Friedman, H.: Classically and intuitionistically provably recursive functions. Lecture Notes in Mathematics, vol.\u00a0699, pp. 21\u201328 (1978)","DOI":"10.1007\/BFb0103100"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Griffin, T.: A Formulae-as-Types Notion of Control. In: Proc. 17th Symposium on Principles of Programming Languages, pp. 47\u201358 (1990)","DOI":"10.1145\/96709.96714"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Gunter, C.A., R\u00e9my, D., Riecke, J.G.: A Generalization of Exceptions and Control in ML-Like Languages. In: Proc. Functional Programming and Computer Architecture, pp. 12\u201323 (1995)","DOI":"10.1145\/224164.224173"},{"key":"34_CR15","first-page":"453","volume":"6","author":"R. Hieb","year":"1993","unstructured":"Hieb, R., Dybvig, R., Anderson, C.W.: Subcontinuations. Lisp and Symbolic Computation\u00a06, 453\u2013484 (1993)","journal-title":"Lisp and Symbolic Computation"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-44929-9_34","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"Y. Kameyama","year":"2000","unstructured":"Kameyama, Y.: A type-theoretic study on partial continuations. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, p. 489. Springer, Heidelberg (2000)"},{"key":"34_CR17","unstructured":"Kameyama, Y.: Axiomatizing higher level delimited continuations. In: Proc. 3rd ACM SIGPLAN Workshop on Continuations, Technical Report 545, Computer Science Department, Indiana University, pp. 49\u201353 (2004)"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Kameyama, Y., Hasegawa, M.: A Sound and Complete Axiomatization of Delimited Continuations. In: Proc. ACM International Conference on Functional Programming, pp. 177\u2013188 (2003)","DOI":"10.1145\/944746.944722"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Lawall, J., Danvy, O.: Continuation-based partial evaluation. In: Proc. 1994 ACM Conference on LISP and Functional Programming, pp. 227\u2013238 (1994)","DOI":"10.1145\/182590.182483"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Computational Lambda-Calculus and Monads. In: Proc. 4th Symposium on Logic in Computer Science, pp. 14\u201328 (1989)","DOI":"10.1109\/LICS.1989.39155"},{"key":"34_CR21","unstructured":"Murthy, C.: Control operators, hierarchies, and pseudo-classical type systems: Atranslation at work. In: Proc. First ACM Workshop on Continuations, Technical Report STAN-CS-92-1426, Stanford University, pp. 49\u201372 (1992)"},{"key":"34_CR22","unstructured":"Sabry, A.: Note on Axiomatizing the Semantics of Control Operators. Technical Report CIS-TR-96-03, Dept. of Computer Science, University of Oregon (1996)"},{"issue":"3-4","key":"34_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Sabry, A., Felleisen, M.: Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic Computation\u00a06(3-4), 289\u2013360 (1993)","journal-title":"Lisp and Symbolic Computation"},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45407-1_14","volume-title":"Advances in Exception Handling Techniques","author":"T. Sekiguchi","year":"2001","unstructured":"Sekiguchi, T., Sakamoto, T., Yonezawa, A.: Portable implementation of continuation operators in imperative languages by exception handling. In: Romanovsky, A., Dony, C., Knudsen, J.L., Tripathi, A.R. (eds.) ECOOP-WS 2000. LNCS, vol.\u00a02022, pp. 217\u2013233. Springer, Heidelberg (2001)"},{"key":"34_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-24725-8_20","volume-title":"Programming Languages and Systems","author":"H. Thielecke","year":"2004","unstructured":"H. Thielecke. Answer type polymorphism in call-by-name continuation passing. In Proc. 13th European Symposium on Programming, Lecture Notes in Computer Science 2986, pages 279\u2013293, 2004."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:01:01Z","timestamp":1739919661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}