{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:35:23Z","timestamp":1770280523492,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80568-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"248-271","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Adjunction Models For Call-By-Push-Value With Stacks"],"prefix":"10.1016","volume":"69","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-4049(93)90035-R","article-title":"Introduction to extensive and distributive categories","volume":"84","author":"Carboni","year":"1993","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0960129500000232","article-title":"Introduction to distributive categories","volume":"3","author":"Cockett","year":"1993","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Curien P.-L. and H. Herbelin, The duality of computation., in: Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP-00), ACM Sigplan Notices 35.9 (2000), pp. 233\u2013243.","DOI":"10.1145\/357766.351262"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB4","series-title":"Formal Description of Programming Concepts","first-page":"193","article-title":"Control operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB5","unstructured":"Filinski A., \u201cControlling Effects,\u201d Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (1996)."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Fiore M., G. D. Plotkin and D. Turi, Abstract syntax and variable binding, in: G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99) (1999), pp. 193\u2013202.","DOI":"10.1109\/LICS.1999.782615"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","article-title":"On full abstraction for PCF: I, II, and III","volume":"163","author":"Hyland","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(98)00356-9","article-title":"A fully abstract semantics for a higher-order functional language with nondeterministic computation","volume":"228","author":"Jeffrey","year":"1999","journal-title":"TCS: Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Laird J., Full abstraction for functional languages with control, in: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Warsaw, Poland, 1997, pp. 58\u201367.","DOI":"10.1109\/LICS.1997.614931"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB10","unstructured":"Laird J., \u201cA Semantic Analysis of Control,\u201d Ph.D. thesis, University of Edinburgh (1998)."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB11","series-title":"\u201cIntroduction to Higher Order Categorical Logic,\u201d","author":"Lambek","year":"1986"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Lawvere, F. W., \u201cFunctional Semantics of Algebraic Theories,\u201d Ph.D. thesis, Columbia University (1963).","DOI":"10.1073\/pnas.50.5.869"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB13","unstructured":"Levy, P. B., \u03bb-calculus and cartesian closed categories (1996), essay for Part III of the Mathematical Tripos, Cambridge University, manuscript."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB14","first-page":"228","article-title":"Call-by-push-value: a subsuming paradigm (extended abstract)","volume":"1581","author":"Levy","year":"1999"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB15","unstructured":"Levy, P. B., \u201cCall-by-push-value,\u201d Ph.D. thesis, Queen Mary, University of London (2001)."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB16","unstructured":"Levy, P. B., H. Thielecke and A. J. Power, Modelling environments in call-by-value programming languages, submitted."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB18","unstructured":"Plotkin, G. D., Lectures on predomains and partial functions (1985), course notes, Center for the Study of Language and Information, Stanford."},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S096012950000311X","article-title":"Control categories and duality: On the categorical semantics of the lambda-mu calculus","volume":"11","author":"Selinger","year":"2001","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80568-1_NEWBIB20","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1017\/S0956796898003141","article-title":"Classical logic, continuation semantics and abstract machines","volume":"8","author":"Streicher","year":"1998","journal-title":"Journal of Functional Programming"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805681?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805681?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:54:28Z","timestamp":1549173268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":20,"alternative-id":["S1571066104805681"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80568-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}