{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:41Z","timestamp":1725662861297},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540089216"},{"type":"electronic","value":"9783540357575"}],"license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_89","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:37:21Z","timestamp":1330169841000},"page":"416-425","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improving memory utilization in transforming recursive programs"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pettorossi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Burstall, R.M. and J. Darlington \"A Transformation System for Developing Recursive Programs\" J.A.C.M. Vol.24 No.1 pp.44\u201367 (Jan 77)","DOI":"10.1145\/321992.321996"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00263742","volume":"6","author":"J. Darlington","year":"1976","unstructured":"Darlington, J. and R.M. Burstall \"A System which Automatically Improves Programs\" Acta Informatica Vol.6 pp.41\u201360 (1976)","journal-title":"Acta Informatica"},{"key":"38_CR3","unstructured":"Schwarz, J. \"Using Annotations to Make Recursion Equations Behave\" D.A.I. Research Report No.43 Edinburgh University (Sept. 77)"},{"key":"38_CR4","unstructured":"Stoy, J. \"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory\" The M.I.T. Press (1977)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Tennent, R.D. \"The Denotational Semantics of Programming Languages\" C.A.C.M. Vol. 19 No.8 (Aug 76)","DOI":"10.1145\/360303.360308"},{"key":"38_CR6","unstructured":"Pettorossi, A. \"A Method for Improving Memory Utilization in Recursive Programming\" Report of Istituto di Automatica. Rome Univ. Italy (to be published)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:32:07Z","timestamp":1578508327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_89"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]},"assertion":[{"value":"24 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}