{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:34:13Z","timestamp":1725838453836},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662488980"},{"type":"electronic","value":"9783662488997"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_21","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T03:59:28Z","timestamp":1448078368000},"page":"297-312","source":"Crossref","is-referenced-by-count":0,"title":["On Subexponentials, Synthetic Connectives, and\u00a0Multi-level Delimited Control"],"prefix":"10.1007","author":[{"given":"Chuck","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J-M Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297\u2013347 (1992)","journal-title":"J. Logic Comput."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10990-007-9006-0","volume":"22","author":"ZM Ariola","year":"2009","unstructured":"Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of delimited continuations. High. Order Symbolic Comput. 22(3), 233\u2013273 (2009)","journal-title":"High. Order Symbolic Comput."},{"key":"21_CR3","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1017\/CBO9780511629150.011","volume-title":"Advances in Linear Logic","author":"V Danos","year":"1995","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: LKT and LKQ: sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol. 222, pp. 211\u2013224. Cambridge University Press, Cambridge (1995)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BFb0022564","volume-title":"Kurt G\u00f6del Colloquium","author":"V Danos","year":"1993","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: The structure of exponentials: uncovering the dynamics of linear logic proofs. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) Kurt G\u00f6del Colloquium. LNCS, vol. 713, pp. 159\u2013171. Springer, Heidelberg (1993)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LISP and Functional Programming, pp. 151\u2013160 (1990)","DOI":"10.1145\/91556.91622"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: The theory and practice of first-class prompts. In: 15th ACM Symposium on Principles of Programming Languages, pp. 180\u2013190. ACM, New York (1988)","DOI":"10.1145\/73560.73576"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J-Y Girard","year":"1991","unstructured":"Girard, J.-Y.: A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1, 255\u2013296 (1991)","journal-title":"Math. Struct. Comput. Sci."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Griffin, T.: The formulae-as-types notion of control. In: 17th Annual ACM Symposium on Principles of Programming Languages, pp. 47\u201357 (1990)","DOI":"10.1145\/96709.96714"},{"issue":"11","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.apal.2011.12.008","volume":"163","author":"D Ilik","year":"2012","unstructured":"Ilik, D.: Delimited control operators prove double-negation shift. Ann. Pure Appl. Logic 163(11), 1549\u20131559 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-540-30124-0_34","volume-title":"Computer Science Logic","author":"Y Kameyama","year":"2004","unstructured":"Kameyama, Y.: Axioms for delimited continuations in the CPS hierarchy. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 442\u2013457. Springer, Heidelberg (2004)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-78969-7_18","volume-title":"Functional and Logic Programming","author":"Y Kameyama","year":"2008","unstructured":"Kameyama, Y., Yonezawa, T.: Typed dynamic control operators for delimited continuations. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 239\u2013254. Springer, Heidelberg (2008)"},{"issue":"46","key":"21_CR12","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2009.07.041","volume":"410","author":"C Liang","year":"2009","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theor. Comput. Sci. 410(46), 4747\u20134768 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR13","unstructured":"Liang, C., Miller, D.: On subexponentials, synthetic connectives, and multi-level delimited control - long version (2015). Unpublished manuscript available online at \n                    http:\/\/www.lix.polytechnique.fr\/Labo\/Dale.Miller\/papers\/subdelim-long.pdf"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-35182-2_21","volume-title":"Programming Languages and Systems","author":"M Materzok","year":"2012","unstructured":"Materzok, M., Biernacki, D.: A dynamic interpretation of the CPS hierarchy. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 296\u2013311. Springer, Heidelberg (2012)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pp. 129\u2013140 (2009)","DOI":"10.1145\/1599410.1599427"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Ong, C.H.L., Stewart, C.: A Curry-Howard foundation for functional computation with control. In: Symposium on Principles of Programming Languages, pp. 215\u2013227 (1997)","DOI":"10.1145\/263699.263722"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","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.: \n                    \n                      \n                    \n                    $$\\lambda \\mu $$\n                  -calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-12032-9_26","volume-title":"Foundations of Software Science and Computational Structures","author":"A Saurin","year":"2010","unstructured":"Saurin, A.: A hierarchy for delimited continuations in call-by-name. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 374\u2013388. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:28:00Z","timestamp":1559330880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}