{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:09Z","timestamp":1725549189849},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_26","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"374-388","source":"Crossref","is-referenced-by-count":6,"title":["A Hierarchy for Delimited Continuations in Call-by-Name"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Saurin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_68","volume-title":"Automata, Languages and Programming","author":"Z. Ariola","year":"2003","unstructured":"Ariola, Z., Herbelin, H.: Minimal classical logic and control operators. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719. Springer, Heidelberg (2003)"},{"key":"26_CR2","unstructured":"Ariola, Z., Herbelin, H.: Control Reduction Theories: the Benefit of Structural Substitution. In: JFP. Includes a Historical Note by Matthias Felleisen (2007)"},{"key":"26_CR3","series-title":"Lect. Notes in Pure and App. Math. Series","volume-title":"Logic and Algebra 1994","author":"A. Berarducci","year":"1996","unstructured":"Berarducci, A.: Infinite \u03bb-calculus and non-sensible models. In: Logic and Algebra 1994. Lect. Notes in Pure and App. Math. Series, vol.\u00a0180. Marcel Dekker, New York (1996)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Berarducci, A., Dezani, M.: Infinite \u03bb-calculus and types. TCS, 212 (1999)","DOI":"10.1016\/S0304-3975(98)00135-2"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Logical Meth. in Comp. Science\u00a01(2) (2005)","DOI":"10.2168\/LMCS-1(2:5)2005"},{"key":"26_CR6","unstructured":"B\u00f6hm, C.: Alcune propriet\u00e0 delle forme \u03b2\u03b7-normali nel \u03bbK-calcolo. Publicazioni dell\u2019Istituto per le Applicazioni del Calcolo\u00a0696 (1968)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LISP and Funct. Prog. (1990)","DOI":"10.1145\/91556.91622"},{"key":"26_CR8","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":"26_CR9","doi-asserted-by":"crossref","unstructured":"David, R., Py, W.: \u03bb\u03bc-calculus and B\u00f6hm\u2019s theorem. J. of Symb. Logic (2001)","DOI":"10.2307\/2694930"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BFb0017475","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"P. Groote de","year":"1994","unstructured":"de Groote, P.: A CPS-translation of the \u03bb\u03bc-calculus. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 85\u201399. Springer, Heidelberg (1994)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"de Groote, P.: An environment machine for the \u03bb-calculus. MSCS\u00a08 (1998)","DOI":"10.1017\/S0960129598002667"},{"key":"26_CR12","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., Friedman, D.P., Kohlbecker, E.E., Duba, B.F.: A syntactic theory of sequential control. TCS\u00a052, 205\u2013237 (1987)","journal-title":"TCS"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/174675.178047","volume-title":"POPL 1994","author":"A. Filinski","year":"1994","unstructured":"Filinski, A.: Representing monads. In: POPL 1994, pp. 446\u2013457. ACM, New York (1994)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Fujita, K.: A sound and complete cps-translation for \u03bb-calculus. In: TLCA (2003)","DOI":"10.1007\/3-540-44904-3_9"},{"key":"26_CR15","volume-title":"POPL","author":"T. Griffin","year":"1990","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: POPL. IEEE, Los Alamitos (1990)"},{"key":"26_CR16","volume-title":"POPL","author":"H. Herbelin","year":"2008","unstructured":"Herbelin, H., Ghilezan, S.: An approach to CBN delimited continuations. In: POPL. ACM Sigplan, New York (2008)"},{"key":"26_CR17","first-page":"479","volume-title":"Essays in Comb. Logic, \u03bb-Calculus, and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-type notion of construction, 1969. In: Essays in Comb. Logic, \u03bb-Calculus, and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Kameyama, Y., Hasegawa, M.: A Sound and Complete Axiomatization of Delimited Continuations. In: ICFP 2003, pp. 177\u2013188. SIGPLAN Notices (2003)","DOI":"10.1145\/944705.944722"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Kameyama, Y.: Axioms for control operators in the cps hierarchy. In: HOSC (2007)","DOI":"10.1007\/s10990-007-9009-x"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"R. Kennaway","year":"1997","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculus. TCS\u00a0175(1), 93\u2013125 (1997)","journal-title":"TCS"},{"key":"26_CR21","unstructured":"Kiselyov, O.: Call-by-name linguistic side effects. In: ESSLLI 2008 Workshop on Symmetric calculi and Ludics for the semantic interpretation (2008)"},{"key":"26_CR22","unstructured":"Krivine, J.-L.: Lambda-calculus, Types and Models. Ellis Horwood (1993)"},{"key":"26_CR23","unstructured":"Krivine, J.-L.: A call-by-name lambda-calculus machine. In: HOSC (2005)"},{"key":"26_CR24","unstructured":"Lafont, Y., Reus, B., Streicher, T.: Continuations semantics or expressing implication by negation. Tech. Rep. 9321, Ludwig-Maximilians-Universit\u00e4t (1993)"},{"key":"26_CR25","volume-title":"Logic In Computer Science","author":"S. Lassen","year":"2006","unstructured":"Lassen, S.: Head normal form bisimulation for pairs and the \u03bb-calculus. In: Logic In Computer Science. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"26_CR26","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-55460-2_27","volume-title":"Logic Programming","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Free deduction: An analysis of \u201dcomputations\u201d in classical logic. In: Voronkov, A. (ed.) RCLP 1990 and RCLP 1991. LNCS (LNAI), vol.\u00a0592, pp. 361\u2013380. Springer, Heidelberg (1992)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624. Springer, Heidelberg (1992)"},{"issue":"4","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.2307\/2275652","volume":"62","author":"M. Parigot","year":"1997","unstructured":"Parigot, M.: Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic\u00a062(4), 1461\u20131479 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR29","unstructured":"Py, W.: Confluence en \u03bb\u03bc-calcul. PhD thesis, Universit\u00e9 de Savoie (1998)"},{"key":"26_CR30","unstructured":"Saurin, A.: A hierarchy for delimited continuations in call-by-name. long version at, http:\/\/www.pps.jussieu.fr\/~saurin\/Publi\/LM_hierarchy_long.pdf"},{"key":"26_CR31","volume-title":"LICS","author":"A. Saurin","year":"2005","unstructured":"Saurin, A.: Separation with streams in the \u039b\u03bc-calculus. In: LICS. IEEE, Los Alamitos (2005)"},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-87531-4_13","volume-title":"Computer Science Logic","author":"A. Saurin","year":"2008","unstructured":"Saurin, A.: On the relations between the syntactic theories of \u03bb\u03bc-calculi. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 154\u2013168. Springer, Heidelberg (2008)"},{"key":"26_CR33","unstructured":"Saurin, A.: Une \u00e9tude logique du contr\u00f4le, appliqu\u00e9e \u00e0 la programmation fonctionnelle et logique. PhD thesis, \u00c9cole Polytechnique (September 2008)"},{"key":"26_CR34","unstructured":"Saurin, A.: Typing streams in the \u039b\u03bc-calculus. ACM ToCL (to appear)"},{"key":"26_CR35","doi-asserted-by":"crossref","unstructured":"Saurin, A.: Standardization and B\u00f6hm trees for \u039b\u03bc-calculus. In: FLOPS 2010. LNCS, vol. 6009. Springer, Heidelberg (to appear, 2010)","DOI":"10.1007\/978-3-642-12251-4_11"},{"issue":"6","key":"26_CR36","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S0956796898003141","volume":"8","author":"T. Streicher","year":"1998","unstructured":"Streicher, T., Reus, B.: Classical logic, continuation semantics and abstract machines. Journal of Functional Programming\u00a08(6), 543\u2013572 (1998)","journal-title":"Journal of Functional Programming"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:02Z","timestamp":1606186022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}