{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:35:29Z","timestamp":1693866929656},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":6470,"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":[[1995,11]]},"DOI":"10.1016\/0743-1066(95)00037-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:44:48Z","timestamp":1027644288000},"page":"119-161","source":"Crossref","is-referenced-by-count":10,"title":["Scoping constructs in logic programming: Implementation problems and their solution"],"prefix":"10.1016","volume":"25","author":[{"given":"Gopalan","family":"Nadathur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharat","family":"Jayaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keehang","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(95)00037-K_BIB1","series-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"A\u00eft-Kaci","year":"1991"},{"key":"10.1016\/0743-1066(95)00037-K_BIB2","series-title":"Eighth International Logic Programming Conference","first-page":"857","article-title":"Naive reverse can be linear","author":"Brisset","year":"1991"},{"key":"10.1016\/0743-1066(95)00037-K_BIB3","series-title":"Programming in Prolog","author":"Clocksin","year":"1984"},{"key":"10.1016\/0743-1066(95)00037-K_BIB4","series-title":"Topics in Advanced Language Implementation","first-page":"289","article-title":"A semi-functional implementation of a higher-order logic programming language","author":"Elliott","year":"1991"},{"key":"10.1016\/0743-1066(95)00037-K_BIB5","article-title":"Specifying and Implementing Theorem Proverse in a Higher-Order Logic Programming Language","author":"Felty","year":"1989"},{"key":"10.1016\/0743-1066(95)00037-K_BIB6","series-title":"Extensions of Logic Programming: International Workshop","first-page":"223","article-title":"Extensions to logic programming motivated by the construction of a generic theorem prover","volume":"475","author":"Gunter","year":"1991"},{"key":"10.1016\/0743-1066(95)00037-K_BIB7","series-title":"Investigating a Proof-Theoretic Meta-Language for Functional Programs","author":"Hannan","year":"1990"},{"key":"10.1016\/0743-1066(95)00037-K_BIB8","series-title":"Introduction to Combinatory Logic and Lambda Calculus","author":"Hindley","year":"1986"},{"key":"10.1016\/0743-1066(95)00037-K_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(95)00037-K_BIB10","series-title":"Eighth International Logic Programming Conference","first-page":"871","article-title":"Implementation techniques for scoping constructs in logic programming","author":"Jayaraman","year":"1991"},{"issue":"1","key":"10.1016\/0743-1066(95)00037-K_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0096-0551(94)90012-4","article-title":"Implementing polymorphic typing in a logic programming language","volume":"20","author":"Kwon","year":"1994","journal-title":"Computer Languages"},{"key":"10.1016\/0743-1066(95)00037-K_BIB12","series-title":"Sixth International Logic Programming Conference","first-page":"303","article-title":"The design of an abstract machine for efficient implementation of contexts in logic programming","author":"Lamma","year":"1989"},{"key":"10.1016\/0743-1066(95)00037-K_BIB13","series-title":"Proceedings of the VIII International Congress of Logic; Methodology, and Philosophy of Science","first-page":"153","article-title":"Hereditary Harrop formulas and logic programming","author":"Miller","year":"1987"},{"key":"10.1016\/0743-1066(95)00037-K_BIB14","series-title":"Sixth International Logic Programming Conference","first-page":"268","article-title":"Lexical scoping as universal quantification","author":"Miller","year":"1989"},{"key":"10.1016\/0743-1066(95)00037-K_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","article-title":"A logical analysis of modules in logic programming","volume":"6","author":"Miller","year":"1989","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00037-K_BIB16","series-title":"IEEE Symposium on Logic Programming","first-page":"379","article-title":"A logic programming approach to manipulating formulas and programs","author":"Miller","year":"1987"},{"key":"10.1016\/0743-1066(95)00037-K_BIB17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"10.1016\/0743-1066(95)00037-K_BIB18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00881902","article-title":"A proof-procedure for the logic of hereditary Harrop formulas","volume":"11","author":"Nadathur","year":"1993","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/0743-1066(95)00037-K_BIB19","article-title":"A notation for lambda terms II: Refinements and applications","author":"Nadathur","year":"1994"},{"key":"10.1016\/0743-1066(95)00037-K_BIB20","article-title":"Implementation considerations for higher-order features in logic programming","author":"Nadathur","year":"1993"},{"key":"10.1016\/0743-1066(95)00037-K_BIB21","series-title":"Fifth International Logic Programming Conference","first-page":"810","article-title":"An overview of \u03bbProlog","author":"Nadathur","year":"1988"},{"issue":"4","key":"10.1016\/0743-1066(95)00037-K_BIB22","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/96559.96570","article-title":"Higher-order Horn clauses","volume":"37","author":"Nadathur","year":"1990","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(95)00037-K_BIB23","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(97)00184-9","article-title":"A notation for lambda terms I: A generalization of environments","author":"Nadathur","year":"1994"},{"key":"10.1016\/0743-1066(95)00037-K_BIB24","series-title":"1990 International Conference in Logic Programming","first-page":"373","article-title":"Extending definite clause grammars with scoping constructs","author":"Pareschi","year":"1990"},{"key":"10.1016\/0743-1066(95)00037-K_BIB25","series-title":"Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation","first-page":"199","article-title":"Higher-order abstract syntax","author":"Pfenning","year":"1988"},{"key":"10.1016\/0743-1066(95)00037-K_BIB26","article-title":"An abstract Prolog instruction set","author":"Warren","year":"1983"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669500037K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669500037K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:21:35Z","timestamp":1555424495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669500037K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["074310669500037K"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(95)00037-k","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}