{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:18:52Z","timestamp":1648783132537},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4472,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0661(04)80904-6","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"88-127","source":"Crossref","is-referenced-by-count":3,"title":["Deforestation, program transformation, and cut-elimination"],"prefix":"10.1016","volume":"44","author":[{"given":"Robin","family":"Cockett","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB1","unstructured":"Aldwinckle J., On the proof theory of model checking (to appear)."},{"issue":"1","key":"10.1016\/S1571-0661(04)80904-6_NEWBIB2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1997","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Cockett R. and S. Lack, Restriction categories II: Partial map classification, Theoretical Computer Science (to appear).","DOI":"10.1016\/S0304-3975(01)00245-6"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB4","unstructured":"Cockett R. and D. Spencer, Strong categorical datatypes I, in: R. A. G. Seely, editor, International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings (1992), pp. 141\u2013169."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00099-5","article-title":"Strong categorical datatypes II: A term logic for categorical programming","volume":"139","author":"Cockett","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB6","unstructured":"Fuhrmann, A. B. C. and A. Simpson, Equational lifting monads, Theoretical Computer Science (to appear)."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB7","unstructured":"Ghani N., \u201cAdjoint Rewriting,\u201d Ph.D. thesis, University of Edinburgh (1995)."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB8","series-title":"\u201cCategorical Logic and Type Theory,\u201d","author":"Jacobs","year":"1999"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional mu-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB10","unstructured":"Marlow S., \u201cDeforestation for Higher-Order Functional Programs,\u201d Ph.D. thesis, University of Glasgow (1996)."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB11","unstructured":"Santocanale L., \u201cSur les \u03bc-treillis libre,\u201d Ph.D. thesis, Univerite de Quebec a Montreal (1999)."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB12","unstructured":"Scott, T. A. P. D. M. H. P., Normalization by evaluation for typed lambda calculus with coproducts (2001), extended abstract. URL http:\/\/www.cs.nott.ac.uk\/~txa\/drafts\/coprod.ps"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB13","unstructured":"Slind K., \u201cReasoning about Terminating Functional Programs,\u201d Ph.D. thesis, TU Munich (1999). URL http:\/\/www.cl.cam.ac.uk\/users\/kxs"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB14","series-title":"\u201cThe Collected Papers of Gerhard Gentzen,\u201d","year":"1969"},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB15","unstructured":"Telford, A. J. and D. A. Turner, Ensuring termination in esfp, in: 15th British Colloquium in Theoretical Computer Science, 1999."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB16","unstructured":"Turner D., Elementary strong functional programming, in: R. Plasmeijer and P. Hartel, editors, First International Symposium on Functional Programming Languages in Education, number 1022 in LNCS (1996)."},{"key":"10.1016\/S1571-0661(04)80904-6_NEWBIB17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation: transforming programs to eliminate trees","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:56:05Z","timestamp":1549173365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104809046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S1571066104809046"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80904-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}