{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T14:38:30Z","timestamp":1700059110233},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1998,11]]},"abstract":"One of the goals of this paper is to demonstrate that denotational semantics is useful \nfor operational issues like implementation of functional languages by abstract machines. \nThis is exemplified in a tutorial way by studying the case of extensional untyped call-by-name \n\u03bb-calculus with Felleisen's control operator [Cscr ]. \nWe derive the transition rules for an \nabstract machine from a continuation semantics which appears as a generalization of the \n\u00ac\u00ac-translation known from logic. The resulting abstract machine \nappears as an extension of Krivine's machine implementing head reduction. Though \nthe result, namely Krivine's machine, \nis well known our method of deriving it from continuation semantics is new and applicable to \nother languages (as e.g. call-by-value variants). Further new results \nare that Scott's D<\/jats:italic>\u221e<\/jats:sub>-models \nare all instances of continuation models. Moreover, we extend our continuation semantics to \nParigot's \u03bb\u03bc-calculus from which we derive an extension of Krivine's \nmachine for \u03bb\u03bc-calculus. The relation between continuation semantics \nand the abstract machines is made precise by \nproving computational adequacy results employing an elegant method introduced by Pitts.<\/jats:p>","DOI":"10.1017\/s0956796898003141","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:26:15Z","timestamp":1027776375000},"page":"543-572","source":"Crossref","is-referenced-by-count":64,"title":["Classical logic, continuation semantics and abstract machines"],"prefix":"10.1017","volume":"8","author":[{"given":"Th.","family":"STREICHER","sequence":"first","affiliation":[]},{"given":"B.","family":"REUS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1998,11,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796898003141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T19:55:54Z","timestamp":1557518154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796898003141\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0956796898003141"],"URL":"https:\/\/doi.org\/10.1017\/s0956796898003141","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}