{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:15Z","timestamp":1725487995229},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425588"},{"type":"electronic","value":"9783540448068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44806-3_4","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T14:21:36Z","timestamp":1184941296000},"page":"47-71","source":"Crossref","is-referenced-by-count":13,"title":["Short Cut Fusion: Proved and Improved"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Johann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abadi, M. \u22a4\u22a4-closed relations and admissibility. Mathematical Structures in Computer Science 10, pp. 313\u2013320, 2000.","key":"4_CR1","DOI":"10.1017\/S0960129500003054"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"E. Bainbridge","year":"1990","unstructured":"Bainbridge, E., Freyd, P., Scedrov, A., and Scott, P.J. Functorial polymorphism. Theoretical Computer Science 70, pp. 35\u201364, 1990. Corrigendum in Theoretical Computer Science 71, p. 431, 1990.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Chitil, O. Type inference builds a short cut to deforestation. In Proceedings, International Conference on Functional Programming, pp. 249\u2013260, 1999.","key":"4_CR3","DOI":"10.1145\/317765.317907"},{"unstructured":"Gill, A. Cheap Deforetation for Non-strict Functional Languages. PhD thesis, Glasgow University, 1996.","key":"4_CR4"},{"doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., and Peyton Jones, S. L. A short cut to deforestation. In Proceedings, Conference on Functional Languages and Computer Architecture, pp. 223\u2013232, 1993.","key":"4_CR5","DOI":"10.1145\/165180.165214"},{"doi-asserted-by":"crossref","unstructured":"Hu, Z., Iwasaki, H., and Takeichi, M. Deriving structural hylomorphisms from recursive definitions. in Proceedings, International Conference in Functional Programming, pp. 73\u201382, 1996.","key":"4_CR6","DOI":"10.1145\/232627.232637"},{"unstructured":"Johann, P. An implementation of warm fusion. Available at ftp:\/\/ftp.cse.ogi.edu\/pub\/pacsoft\/wf\/ , 1997.","key":"4_CR7"},{"doi-asserted-by":"crossref","unstructured":"Johann, P. and Visser, E. Warm fusion in Stratego: A case study in generation of program transformation systems. Annals of Mathematics and Artifical Intelligence 29 (1-4), pp. 1\u201334, 2000.","key":"4_CR8","DOI":"10.1023\/A:1018956702672"},{"unstructured":"N\u00e9meth, L. Catamorphism Based Program Transformations for Non-strict Functional Languages. Draft, PhD thesis, Glasgow University, 2000.","key":"4_CR9"},{"doi-asserted-by":"crossref","unstructured":"Onoue, Y., Hu, Z., Iwasaki, H., and Takeichi, M. A calculational system HYLO. In Proceedings, IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, pp. 76\u2013106, 1997.","key":"4_CR10","DOI":"10.1007\/978-0-387-35264-0_4"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G Plotkin","year":"1975","unstructured":"Plotkin, G. Call-by-name, call-by-value, and the lambda calculus. Theoretical Computer Science 1, pp. 125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"4_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BFb0055063","volume-title":"Proceedings, International Colloquium on Automata, Languages, and Programming","author":"A. Pitts","year":"1998","unstructured":"Pitts, A. Existential types: Logical relations and operational equivalence. In Proceedings, International Colloquium on Automata, Languages, and Programming, LNCS vol. 1443, pp. 309\u2013326, 1998."},{"unstructured":"Pitts, A. Parametric Polymorphism, Recursive Types, and Operational Equivalence. Unpublished Manuscript.","key":"4_CR13"},{"doi-asserted-by":"crossref","unstructured":"Pitts, A. Parametric Polymorphism and Operational Equivalence. Mathematical Structures in Computer Science 10, pp. 1\u201339, 2000.","key":"4_CR14","DOI":"10.1017\/S0960129500003066"},{"doi-asserted-by":"crossref","unstructured":"Takano, A. and Meijer, E. Short cut deforetation in calculational form. In Proceedings, Conference on Functional Programming and Computer Architecture, pp. 324\u2013333, 1995.","key":"4_CR15","DOI":"10.1145\/224164.224221"},{"key":"4_CR16","first-page":"513","volume":"83","author":"J. C. Reynolds","year":"1983","unstructured":"Reynolds, J. C. Types, abstraction, and parametric polymorphism. Information Processing 83, pp. 513\u2013523, 1983.","journal-title":"Information Processing"},{"doi-asserted-by":"crossref","unstructured":"Sheard, T. and Fegaras, L. A fold for all seasons. In Proceedings, Conference on Functional Programming and Computer Architecture, pp. 233\u2013242, 1993.","key":"4_CR17","DOI":"10.1145\/165180.165216"},{"doi-asserted-by":"crossref","unstructured":"Wadler, P. Theorems for Free! In Proceedings, Conference on Functional Programming and Computer Architecture, pp. 347\u2013359, 1989.","key":"4_CR18","DOI":"10.1145\/99370.99404"}],"container-title":["Lecture Notes in Computer Science","Semantics, Applications, and Implementation of Program Generation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44806-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T06:59:01Z","timestamp":1556693941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44806-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425588","9783540448068"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44806-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}