{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:24Z","timestamp":1720437744762},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90023-7","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"159-189","source":"Crossref","is-referenced-by-count":17,"special_numbering":"C","title":["Transformational programming and the paragraph problem"],"prefix":"10.1016","volume":"6","author":[{"given":"R.S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90023-7_BIB1","article-title":"Report on a wide spectrum language for program specification and development","author":"Bauer","year":"1981"},{"key":"10.1016\/0167-6423(86)90023-7_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6423(81)90006-X","article-title":"Programming in a wide spectrum language: A collection of examples","volume":"1","author":"Bauer","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(86)90023-7_BIB3","series-title":"Molloy","author":"Beckett","year":"1959"},{"issue":"4","key":"10.1016\/0167-6423(86)90023-7_BIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","article-title":"Tabulation techniques for recursive programs","volume":"12","author":"Bird","year":"1980","journal-title":"ACM Comput. Surveys"},{"issue":"4","key":"10.1016\/0167-6423(86)90023-7_BIB5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","article-title":"The promotion and accumulation strategies in transformational programming","volume":"6","author":"Bird","year":"1984","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"10.1016\/0167-6423(86)90023-7_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00264249","article-title":"Using circular programs to avoid multiple traversals of data","volume":"21","author":"Bird","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(86)90023-7_BIB7","series-title":"Textverarbeitung und Informatik","first-page":"75","article-title":"Zur Spezifikation von Programmen f\u00fcr die Textverabeitung","volume":"30","author":"Broy","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(86)90023-7_BIB8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(86)90023-7_BIB9","series-title":"Unification of functional and logic programming","author":"Darlington","year":"1983"},{"key":"10.1016\/0167-6423(86)90023-7_BIB10","series-title":"Selected Writings on Computing: A Personal Perspective","author":"Dijkstra","year":"1982"},{"issue":"1","key":"10.1016\/0167-6423(86)90023-7_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357153.357154","article-title":"A system for assisting program transformation","volume":"4","author":"Feather","year":"1982","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"10.1016\/0167-6423(86)90023-7_BIB12","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"issue":"11","key":"10.1016\/0167-6423(86)90023-7_BIB13","first-page":"1119","article-title":"Breaking paragraphs into lines","volume":"11","author":"Knuth","year":"1981","journal-title":"Software: Practice & Experience"},{"key":"10.1016\/0167-6423(86)90023-7_BIB14","series-title":"Presentation at WG2.1 meeting","author":"Meertens","year":"1983"},{"key":"10.1016\/0167-6423(86)90023-7_BIB15","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01946816","article-title":"Programming by action clusters","volume":"9","author":"Naur","year":"1976","journal-title":"BIT"},{"key":"10.1016\/0167-6423(86)90023-7_BIB16","series-title":"Tools and Notations for Program Construction","article-title":"Formal system specifications: notations and examples","author":"Surfin","year":"1982"},{"key":"10.1016\/0167-6423(86)90023-7_BIB17","series-title":"Functional Programming and its Applications","article-title":"Recursion equations as a programming language","author":"Turner","year":"1982"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:13Z","timestamp":1553442613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":17,"alternative-id":["0167642386900237"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90023-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}