{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:57Z","timestamp":1725483717041},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_34","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"489-504","source":"Crossref","is-referenced-by-count":5,"title":["A Type-Theoretic Study on Partial Continuations"],"prefix":"10.1007","author":[{"given":"Yukiyoshi","family":"Kameyama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"34_CR1","unstructured":"Kelsey, R., W. Clinger, and J. Rees (eds.): Revised5 Report on the Algorithmic Language Scheme, 1998."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Danvy, O. and A. Filinski: Abstracting Control, Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 151\u2013160, 1990.","DOI":"10.1145\/91556.91622"},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Danvy, O. and A. Filinski: Representing Control: a Study of the CPS Transformation, Mathematical Structures in Computer Science 2(4), pp. 361\u2013391, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0014054","volume-title":"Typed Lambda Calculi and its Applications","author":"P. Groote de","year":"1995","unstructured":"de Groote, P.: A Simple Calculus of Exception Handling, Typed Lambda Calculi and its Applications (Dezani-Ciancaglini, M. and G. Plotkineds.), Lecture Notes in Computer Science 902, pp. 201\u2013215. Springer, 1995."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., D. Friedman, E. Kohlbecker, and B. Duba: A Syntactic Theory of Sequential Control, Theoretical Computer Science 52, pp. 205\u2013237, 1987.","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: The Theory and Practice of First-Class Prompts, Proc. 15th ACM Symp. on Principles of Programming Languages, pp. 180\u2013190, 1988.","DOI":"10.1145\/73560.73576"},{"key":"34_CR7","unstructured":"Felleisen, M., M. Wand, D. Friedman, and B. Duba Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps, Proc. 1988 ACM Conf. on Lisp and Functional Programming, pp. 52\u201362, 1988."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., and R. Hieb: The Revised Report on the Syntactic Theories of Sequential Control and State, Theoretical Computer Science 103, pp. 235\u2013271, 1992.","journal-title":"Theoretical Computer Science"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing Monads, Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 446\u2013457, 1994.","DOI":"10.1145\/174675.178047"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Griffin, T.: A Formulae-as-Types Notion of Control, Conference Record of 17th ACM Symp. on Principles of Programming Languages, pp. 47\u201358, 1990.","DOI":"10.1145\/96709.96714"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Gunter, C. A., D. Remy, and J. G. Riecke: A Generalization of Exceptions and Control in ML-Like Languages, Functional Programming and Computer Architecture, pp. 12\u201323, 1995.","DOI":"10.1145\/224164.224173"},{"issue":"4","key":"34_CR12","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S095679680000085X","volume":"3","author":"R. Harper","year":"1993","unstructured":"Harper, R., B. Duba, and D. Macqueen Typing First-Class Continuations in ML, J. Functional Programming 3(4), pp. 465\u2013484, 1993.","journal-title":"J. Functional Programming"},{"key":"34_CR13","first-page":"453","volume":"6","author":"R. Hieb","year":"1993","unstructured":"Hieb, R., R. Dybvig, and C.W. Anderson: Subcontinuations, Lisp and Symbolic Computation 6, pp. 453\u2013484, 1993.","journal-title":"Subcontinuations, Lisp and Symbolic Computation"},{"key":"34_CR14","unstructured":"Kameyama, Y. and M. Sato: Strong Normalizability of the Non-deterministic Catch\/Throw Calculii, Theoretical Computer Science, to appear."},{"key":"34_CR15","volume-title":"Workshop on Programming and Programming Languages (PPL2000)","author":"Y. Kameyama","year":"2000","unstructured":"Kameyama, Y.: A Type System for Delimited Continuations (Preliminary Version), Workshop on Programming and Programming Languages (PPL2000), Japan Society for Software Science and Technology, Kanzanji, Japan, Mar. 2000."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Ong, C.-H. L. and C.A. Stewart: A Curry-Howard Foundation for Functional Computation, Proc. 24th ACM Symposium on Principles of Programming Languages, pp. 215\u2013227, 1997.","DOI":"10.1145\/263699.263722"},{"key":"34_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: \u03bb\u03bc-calculus: An Algorithmic Interpretation of Classical Natural Deduction, Lecture Notes in Computer Science 624, Springer, pp. 190\u2013201, 1992."},{"issue":"1","key":"34_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(96)00170-3","volume":"175","author":"M. Sato","year":"1997","unstructured":"Sato, M.: Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules, Theoretical Computer Science Vol. 175, No. 1, pp. 75\u201392, 1997.","journal-title":"Theoretical Computer Science"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0747-7171(89)80045-8","volume":"7","author":"M. Takahashi","year":"1989","unstructured":"Takahashi, M: Parallel Reductions in \u03bb-Calculus, J. Symbolic Computation 7, 1989, pp. 113\u2013123.","journal-title":"J. Symbolic Computation"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Queinnec, C. and B. Serpette: A Dynamic Extent Control Operator for Partial Continuation, Proc. 18th ACM Symp. on Principles of Programming Languages, pp. 174\u2013184, 1991.","DOI":"10.1145\/99583.99610"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:40:46Z","timestamp":1556376046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}