{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:38:56Z","timestamp":1762270736828,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":10245,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1985,7]]},"DOI":"10.1016\/0743-1066(85)90012-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"77-91","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Prolog program transformations and tree manipulation algorithms"],"prefix":"10.1016","volume":"2","author":[{"given":"Hiroshi","family":"Nakagawa","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0743-1066(85)90012-3_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/322326.322339","article-title":"Contributions to the Theory of Logic Programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(85)90012-3_BIB2","article-title":"Syntax-Directed, Semantics-Supported Program Synthesis","volume":"14","author":"Bibel","year":"1980"},{"issue":"No 1","key":"10.1016\/0743-1066(85)90012-3_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/321992.321996","article-title":"A Transformation System for Developing Recursive Programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(85)90012-3_BIB4","article-title":"The Synthesis of Implementations for Abstract Data Types","author":"Darlington","year":"1981","journal-title":"Computer Program Synthesis Methodologies, Proceedings of NATO Advanced Study Institute"},{"key":"10.1016\/0743-1066(85)90012-3_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(81)90014-X","article-title":"An Experimental Program Transformation and Synthesis System","volume":"16","author":"Darlington","year":"1981","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(85)90012-3_BIB6","series-title":"Logic Programming","article-title":"Program Transformation by Data Structure Mapping","author":"Hansson","year":"1982"},{"issue":"No. 2","key":"10.1016\/0743-1066(85)90012-3_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/322248.322258","article-title":"Derivation of Logic Programs","volume":"29","author":"Hogger","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(85)90012-3_BIB8","article-title":"A Partial Evaluation of Lisp Programs written in PROLOG","author":"Kahn","year":"1982","journal-title":"1st International Logic Program Conference"},{"key":"10.1016\/0743-1066(85)90012-3_BIB9","article-title":"Transformation of Logic Programs into Functional Programs","author":"Reddy","year":"1984","journal-title":"International Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(85)90012-3_BIB10","article-title":"Unfold\u29f8fold transformation of logic programs","author":"Tamaki","year":"1984","journal-title":"Proceedings of the 2nd International Logic Programming Conference"},{"key":"10.1016\/0743-1066(85)90012-3_BIB11","article-title":"Transformational Logic Program Synthesis","author":"Sato","year":"1984","journal-title":"FGCS'84"},{"issue":"No. 1","key":"10.1016\/0743-1066(85)90012-3_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/322169.322183","article-title":"Continuation-Based Program Transformation Strategies","volume":"27","author":"Wand","year":"1980","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:25:59Z","timestamp":1762269959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106685900123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0743106685900123"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(85)90012-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"type":"print","value":"0743-1066"}],"subject":[],"published":{"date-parts":[[1985,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Prolog program transformations and tree manipulation algorithms","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-1066(85)90012-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1985 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}