{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T01:39:31Z","timestamp":1698197971606},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T00:00:00Z","timestamp":1390348800000},"content-version":"unspecified","delay-in-days":21,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2014,1]]},"abstract":"Abstract<\/jats:title>We give a framework for delimited control with multiple prompts, in the style of Parigot's \u03bb\u03bc-calculus, through a series of incremental extensions by starting with the pure \u03bb-calculus. Each language inherits the semantics and reduction theory of its parent, giving a systematic way to describe each level of control. For each language of interest, we fully characterize its semantics in terms of a reduction semantics, operational semantics, continuation-passing style transform, and abstract machine. Furthermore, the control operations are expressed in terms of fine-grained primitives that can be used to build well-known, higher-level control operators. In order to illustrate the expressive power provided by various languages, we show how other computational effects can be encoded in terms of these control operators.<\/jats:p>","DOI":"10.1017\/s0956796813000312","type":"journal-article","created":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T14:55:31Z","timestamp":1390402531000},"page":"1-55","source":"Crossref","is-referenced-by-count":4,"title":["Delimited control and computational effects"],"prefix":"10.1017","volume":"24","author":[{"given":"PAUL","family":"DOWNEN","sequence":"first","affiliation":[]},{"given":"ZENA M.","family":"ARIOLA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,1,22]]},"reference":[{"key":"S0956796813000312_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292557"},{"key":"S0956796813000312_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(91)90036-W"},{"key":"S0956796813000312_ref6","volume-title":"A Functional Abstraction of Typed Contexts","author":"Danvy","year":"1989"},{"key":"S0956796813000312_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9010-4"},{"key":"S0956796813000312_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006612"},{"key":"S0956796813000312_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"S0956796813000312_ref2","first-page":"6","volume-title":"First International Workshop on the Theory and Practice of Delimited Continuations","author":"Ariola","year":"2011"},{"key":"S0956796813000312_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159808"},{"key":"S0956796813000312_ref30","first-page":"717","volume-title":"Proceedings of the 25th ACM National Conference.","author":"Reynolds","year":"1972"},{"key":"S0956796813000312_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"S0956796813000312_ref8","first-page":"234","volume-title":"Procedings of the 21st European Symposium on Programming.","author":"Downen","year":"2012"},{"key":"S0956796813000312_ref9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1017\/S0956796807006259","article-title":"A monadic framework for delimited continuations","volume":"17","author":"Dybvig","year":"2007","journal-title":"J. Funct. Program."},{"key":"S0956796813000312_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"S0956796813000312_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1989.39155"},{"key":"S0956796813000312_ref32","first-page":"67","article-title":"Control delimiters and their hierarchies","volume":"3","author":"Sitaram","year":"1990","journal-title":"LISP Symb. Comput."},{"key":"S0956796813000312_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034786"},{"key":"S0956796813000312_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061"},{"key":"S0956796813000312_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944722"},{"key":"S0956796813000312_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91626"},{"key":"S0956796813000312_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12251-4_22"},{"key":"S0956796813000312_ref4","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-1(2:5)2005"},{"key":"S0956796813000312_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90109-5"},{"key":"S0956796813000312_ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010087314987"},{"key":"S0956796813000312_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"S0956796813000312_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291178"},{"key":"S0956796813000312_ref15","first-page":"52","volume-title":"LISP and Functional Programming","author":"Felleisen","year":"1988"},{"key":"S0956796813000312_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"S0956796813000312_ref16","first-page":"446","volume-title":"Principles of Programming Languages '94.","author":"Filinski","year":"1994"},{"key":"S0956796813000312_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9006-0"},{"key":"S0956796813000312_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17945-3_12"},{"key":"S0956796813000312_ref5","unstructured":"Danvy, O. (2004) On evaluation contexts, continuations, and the rest of the computation. In ACM Sigplan Continuations Workshop, pp. 13\u201323."},{"key":"S0956796813000312_ref19","first-page":"12","volume-title":"Functional Programming Languages and Computer Architecture '95.","author":"Gunter","year":"1995"},{"key":"S0956796813000312_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35182-2_21"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796813000312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T07:29:56Z","timestamp":1627975796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796813000312\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S0956796813000312"],"URL":"https:\/\/doi.org\/10.1017\/s0956796813000312","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}