{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:16Z","timestamp":1761596716981},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":9545,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0743-1066(87)90016-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"157-176","source":"Crossref","is-referenced-by-count":34,"title":["Logic continuations"],"prefix":"10.1016","volume":"4","author":[{"given":"Christopher T.","family":"Haynes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(87)90016-1_BIB1","series-title":"Structure and Interpretation of Computer Programs","author":"Abelson","year":"1985"},{"key":"10.1016\/0743-1066(87)90016-1_BIB2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1145\/359545.359566","article-title":"Shallow Binding in Lisp 1.5","volume":"21","author":"Baker","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(87)90016-1_BIB3","doi-asserted-by":"crossref","unstructured":"Bartley, D.H. and Jensen, J.C., The Implementation of PC Scheme, in: Proceedings of the 1986 ACM Conference on LISP and Functional Programming, pp. 86\u201393.","DOI":"10.1145\/319838.319852"},{"key":"10.1016\/0743-1066(87)90016-1_BIB4","series-title":"Logic Programming","first-page":"83","article-title":"The Memory Management of prolog Implementations","author":"Bruynooghe","year":"1982"},{"key":"10.1016\/0743-1066(87)90016-1_BIB5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF03037326","article-title":"On Implementing Prolog in Functional Programming","volume":"2","author":"Carlsson","year":"1984","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(87)90016-1_BIB6","series-title":"Programming in Prolog","author":"Clocksin","year":"1984"},{"key":"10.1016\/0743-1066(87)90016-1_BIB7","series-title":"The Scheme Programming Language","author":"Dybvig","year":"1987"},{"key":"10.1016\/0743-1066(87)90016-1_BIB8","series-title":"Computer Science Department Technical Report No. 182","article-title":"Transliterating Prolog into Scheme","author":"Felleisen","year":"1985"},{"key":"10.1016\/0743-1066(87)90016-1_BIB9","unstructured":"Felleisen, M. and Friedman, D.P., Control Operators, the SECD-Machine, and the \u03bb-Calculus, in: Formal Description of Programming Concepts III, North-Holland, Amsterdam, to appear."},{"key":"10.1016\/0743-1066(87)90016-1_BIB10","series-title":"Symposium on Logic in Computer Science","first-page":"131","article-title":"Reasoning with Continuations","author":"Felleisen","year":"1986"},{"key":"10.1016\/0743-1066(87)90016-1_BIB11_1","first-page":"245","article-title":"Embedding Continuations in Procedural Objects","author":"Friedman","year":"1985","journal-title":"Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(87)90016-1_BIB11_2","series-title":"Computer Science Department Technical Report No. 183","year":"1985"},{"key":"10.1016\/0743-1066(87)90016-1_BIB12","series-title":"Program Transformation and Programming Environments","first-page":"263","article-title":"Programming with Continuations","author":"Friedman","year":"1984"},{"key":"10.1016\/0743-1066(87)90016-1_BIB13","author":"Hanson","year":"1984","journal-title":"Dynamic Binding in Scheme"},{"key":"10.1016\/0743-1066(87)90016-1_BIB14","first-page":"18","article-title":"Abstracting Timed Preemption with Engines","author":"Haynes","year":"1984","journal-title":"Computer Languages"},{"key":"10.1016\/0743-1066(87)90016-1_BIB15","series-title":"Implementations of PROLOG","first-page":"117","article-title":"How to Implement Prolog on a lisp Machine","author":"Kahn","year":"1984"},{"key":"10.1016\/0743-1066(87)90016-1_BIB16","series-title":"Prolog for Programmers","author":"Klu\u017aniak","year":"1985"},{"key":"10.1016\/0743-1066(87)90016-1_BIB17","series-title":"Computer Science Department Technical Report No. 155","article-title":"eu-Prolog","author":"Kohlbecker","year":"1984"},{"key":"10.1016\/0743-1066(87)90016-1_BIB18","series-title":"Logic Programming","first-page":"315","article-title":"qlog\u2014the Programming Environment for Prolog","author":"Komorowski","year":"1982"},{"key":"10.1016\/0743-1066(87)90016-1_BIB19","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/13310.13333","article-title":"orbit: An Optimizing Compiler for Scheme","volume":"21","author":"Kranz","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0743-1066(87)90016-1_BIB20_1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","article-title":"A Correspondence between algol 60 and Church's Lambda Notation","volume":"8","author":"Landin","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(87)90016-1_BIB20_2","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/363791.363804","article-title":"A Correspondence between algol 60 and Church's Lambda Notation","volume":"8","author":"Landin","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-1066(87)90016-1_BIB21","doi-asserted-by":"crossref","unstructured":"McDermot, D., An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped lisp, in: Conference Record of the 1980 LISP Conference, ACM Order No. 552800, pp. 154\u2013162.","DOI":"10.1145\/800087.802801"},{"key":"10.1016\/0743-1066(87)90016-1_BIB22","series-title":"Implementations of PROLOG","first-page":"147","article-title":"Integrating Prolog in the poplog environment","author":"Mellish","year":"1984"},{"issue":"12","key":"10.1016\/0743-1066(87)90016-1_BIB23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/15042.15043","volume":"21","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0743-1066(87)90016-1_BIB24","first-page":"717","article-title":"Definitional Interpreters for Higher-Order Programming Languages","author":"Reynolds","year":"1972","journal-title":"Proceedings of the 25th ACM National Conference"},{"key":"10.1016\/0743-1066(87)90016-1_BIB25","series-title":"Logic Programming","first-page":"299","article-title":"loglisp: Motivation, Design and Implementation","author":"Robinon","year":"1982"},{"key":"10.1016\/0743-1066(87)90016-1_BIB26","first-page":"384","article-title":"Review of Foundations of Logic Programming by J.W. Lloyd","volume":"27","author":"Shapiro","year":"1986","journal-title":"Comput. Rev."},{"key":"10.1016\/0743-1066(87)90016-1_BIB27","series-title":"Proceedings of Joint Computer Conference 41","first-page":"1171","article-title":"From planner to conniver\u2014a Genetic Approach","author":"Sussman","year":"1973"},{"key":"10.1016\/0743-1066(87)90016-1_BIB28","first-page":"254","article-title":"An(other) Integration of Logic and Functional Programming","author":"Srivastava","year":"1985","journal-title":"Proceedings of the IEEE Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(87)90016-1_BIB29","series-title":"Artificial Intelligence Memo No. 349","article-title":"Scheme: An Interpreter for Extended Lambda Calculus","author":"Sussman","year":"1975"},{"key":"10.1016\/0743-1066(87)90016-1_BIB30","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/322169.322183","article-title":"Continuation-Based Program Transformation Strategies","volume":"27","author":"Wand","year":"1980","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/0743-1066(87)90016-1_BIB31","doi-asserted-by":"crossref","unstructured":"Wand, M., Continuation-Based Multiprocessing, in: Conference Record of the 1980 LISP Conference, ACM Order No. 552800, pp. 154\u2013162.","DOI":"10.1145\/800087.802786"},{"key":"10.1016\/0743-1066(87)90016-1_BIB32","series-title":"Computer Science Department Technical Report No. 134","article-title":"A Semantic algebra for Logic Programming","author":"Wand","year":"1983"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106687900161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106687900161?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:36Z","timestamp":1555127676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106687900161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0743106687900161"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(87)90016-1","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}