{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T23:10:26Z","timestamp":1681513826600},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9009-x","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T16:13:29Z","timestamp":1193156009000},"page":"339-369","source":"Crossref","is-referenced-by-count":8,"title":["Axioms for control operators in the CPS hierarchy"],"prefix":"10.1007","volume":"20","author":[{"given":"Yukiyoshi","family":"Kameyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9009_CR1","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of continuations and prompts. In: Proc. ACM SIGPLAN International Conference on Functional Programming, pp. 40\u201353 (2004)","DOI":"10.1145\/1016850.1016860"},{"key":"9009_CR2","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\/503032.503034"},{"key":"9009_CR3","doi-asserted-by":"crossref","unstructured":"Asai, K.: Offline partial evaluation for shift and reset. In: Proc. 2004 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 3\u201314 (2004)","DOI":"10.1145\/1014007.1014009"},{"issue":"2\u20133","key":"9009_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1020891112409","volume":"15","author":"J. Berdine","year":"2002","unstructured":"Berdine, J., O\u2019Hearn, P., Reddy, U., Thielecke, H.: Linear continuation passing. Higher-Order Symb. Comput. 15(2\u20133), 181\u2013208 (2002)","journal-title":"Higher-Order Symb. Comput."},{"key":"9009_CR5","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations. In: Proc. Fourth ACM SIGPLAN Workshop on Continuations, pp. 25\u201334. Technical Report CSR-04-1, School of Computer Science, University of Birmingham (2004)","DOI":"10.7146\/brics.v11i29.21854"},{"key":"9009_CR6","doi-asserted-by":"crossref","unstructured":"Biernacki, D., Danvy, O.: On the dynamic extent of delimited continuations. Technical Report BRICS-RS-05-2, BRICS, University of Aarhus, Denmark (2005)","DOI":"10.7146\/brics.v12i2.21868"},{"key":"9009_CR7","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":"9009_CR8","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Technical Report 89\/12, DIKU, University of Copenhagen (1989)"},{"key":"9009_CR9","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":"9009_CR10","doi-asserted-by":"crossref","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. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9009_CR11","doi-asserted-by":"crossref","unstructured":"Danvy, O., Yang, Z.: An operational investigation of the CPS hierarchy. In: Proc. 8th European Symposium on Programming, pp. 224\u2013242 (1999)","DOI":"10.1007\/3-540-49099-X_15"},{"key":"9009_CR12","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":"9009_CR13","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: Proc. 21st Symposium on Principles of Programming Languages, pp. 446\u2013457 (1994)","DOI":"10.1145\/174675.178047"},{"key":"9009_CR14","unstructured":"Filinski, A.: Controlling effects. Ph.D. Thesis, Carnegie Mellon University, available as Technical Report CMU-CS-96-119 (1996)"},{"key":"9009_CR15","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":"9009_CR16","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 237\u2013247 (1993)","DOI":"10.1145\/173262.155113"},{"key":"9009_CR17","doi-asserted-by":"crossref","unstructured":"Friedman, H.: Classically and intuitionistically provably recursive functions. In: Lecture Notes in Mathematics, vol.\u00a0699, pp. 21\u201328 (1978)","DOI":"10.1007\/BFb0103100"},{"key":"9009_CR18","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":"9009_CR19","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":"9009_CR20","first-page":"453","volume":"6","author":"R. Hieb","year":"1993","unstructured":"Hieb, R., Dybvig, R., Anderson, C.W.: Subcontinuations. Lisp Symb. Comput. 6, 453\u2013484 (1993)","journal-title":"Lisp Symb. Comput."},{"key":"9009_CR21","doi-asserted-by":"crossref","unstructured":"Kameyama, Y.: A type-theoretic study on partial continuations. In: Proc. IFIP International Conference on Theoretical Computer Science, pp. 489\u2013504 (2000)","DOI":"10.1007\/3-540-44929-9_34"},{"key":"9009_CR22","unstructured":"Kameyama, Y.: Axiomatizing higher level delimited continuations. In: Proc. 3rd ACM SIGPLAN Workshop on Continuations, pp. 49\u201353. Technical Report 545, Computer Science Department, Indiana University (2004)"},{"key":"9009_CR23","doi-asserted-by":"crossref","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Proc. ACM SIGPLAN International Conference on Functional Programming, pp. 177\u2013188 (2003)","DOI":"10.1145\/944705.944722"},{"key":"9009_CR24","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\/182409.182483"},{"key":"9009_CR25","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":"9009_CR26","unstructured":"Murthy, C.: Control operators, hierarchies, and pseudo-classical type systems: a-translation at work. In: Proc. First ACM Workshop on Continuations, pp. 49\u201372. Technical Report STAN-CS-92-1426, Stanford University (1992)"},{"key":"9009_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value, and the \u03bb-calculus. Theor. Comput. Sci. 1, 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"9009_CR28","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\u20134","key":"9009_CR29","doi-asserted-by":"crossref","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 Symb. Comput. 6(3\u20134), 289\u2013360 (1993)","journal-title":"Lisp Symb. Comput."},{"key":"9009_CR30","doi-asserted-by":"crossref","unstructured":"Sekiguchi, T., Sakamoto, T., Yonezawa, A.: Portable implementation of continuation operators in imperative languages by exception handling. In: Advances in Exception Handling Techniques, pp. 217\u2013233 (2001)","DOI":"10.1007\/3-540-45407-1_14"},{"key":"9009_CR31","unstructured":"Shan, C.: Shift to control. In: Proc. 5th Workshop on Scheme and Functional Programming, pp. 99\u2013107 (2004)"},{"key":"9009_CR32","doi-asserted-by":"crossref","unstructured":"Thielecke, H.: From control effects to typed continuation passing. In: Proc. 30th Symposium on Principles of Programming Languages, pp. 139\u2013149 (2003)","DOI":"10.1145\/604131.604144"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9009-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9009-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9009-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:41Z","timestamp":1559352581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9009-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9009-x","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}