{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:28:39Z","timestamp":1767929319283,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642242755","type":"print"},{"value":"9783642242762","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24276-2_2","type":"book-chapter","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T10:49:23Z","timestamp":1318243763000},"page":"19-37","source":"Crossref","is-referenced-by-count":15,"title":["Theory and Practice of Fusion"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Hinze","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Harper","sequence":"additional","affiliation":[]},{"given":"Daniel W. H.","family":"James","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-1(2:1)2005","volume":"1","author":"V. Capretta","year":"2005","unstructured":"Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science\u00a01(2), 1\u201328 (2005)","journal-title":"Logical Methods in Computer Science"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V. Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Information and Computation\u00a0204(4), 437\u2013468 (2006)","journal-title":"Information and Computation"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chin, W.N.: Safe Fusion of Functional Expressions. In: LISP and functional programming, pp. 11\u201320 (1992)","DOI":"10.1145\/141471.141494"},{"key":"2_CR4","series-title":"Annals of Mathematics Studies","volume-title":"The calculi of lambda-conversion","author":"A. Church","year":"1941","unstructured":"Church, A.: The calculi of lambda-conversion. Annals of Mathematics Studies, vol.\u00a06. Princeton University Press, Princeton (1941)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Coutts, D., Leshchinskiy, R., Stewart, D.: Stream Fusion: From Lists to Streams to Nothing At All. In: ICFP 2007, pp. 315\u2013326 (2007)","DOI":"10.1145\/1291151.1291199"},{"key":"2_CR6","unstructured":"Fegaras, L., Sheard, T., Zhou, T.: Improving Programs which Recurse over Multiple Inductive Structures. In: PEPM 1994 (June 1994)"},{"key":"2_CR7","unstructured":"Fokkinga, M.M., Meijer, E.: Program calculation properties of continuous algebras. Technical Report CS-R9104. CWI, Amsterdam (January 1991)"},{"key":"2_CR8","series-title":"LMS Lecture Note Series","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/CBO9780511525902.006","volume-title":"Applications of Categories in Computer Science","author":"P.J. Freyd","year":"1992","unstructured":"Freyd, P.J.: Remarks on algebraically compact categories. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Applications of Categories in Computer Science. LMS Lecture Note Series, vol.\u00a0177, pp. 95\u2013106. Cambridge University Press, Cambridge (1992)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.L.: A Short Cut to Deforestation. Functional programming languages and computer architecture, 223\u2013232 (1993)","DOI":"10.1145\/165180.165214"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Hinze, R., Harper, T., James, D.W.H.: Theory and Practice of Fusion. Tech. Rep. CS-RR-11-01. Oxford University Computing Laboratory (2011)","DOI":"10.1007\/978-3-642-24276-2_2"},{"key":"2_CR11","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: An Extension of The Acid Rain Theorem. Functional and Logic Programming, 91\u2013105 (1996)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-73228-0_16","volume-title":"Typed Lambda Calculi and Applications","author":"P. Johann","year":"2007","unstructured":"Johann, P., Ghani, N.: Initial algebra semantics is enough! In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 207\u2013222. Springer, Heidelberg (2007)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"Lambek, J.: A fixpoint theorem for complete categories. Math. Zeitschr.\u00a0103, 151\u2013161 (1968)","journal-title":"Math. Zeitschr."},{"key":"2_CR14","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics. Springer, Berlin (1998)","edition":"2"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"Functional Programming Languages and Computer Architecture","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 124\u2013144. Springer, Heidelberg (1991)"},{"key":"2_CR16","first-page":"513","volume-title":"Information Processing 1983","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Mason, R.E.A. (ed.) Information Processing 1983, pp. 513\u2013523. North-Holland, Amsterdam (1983)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Sheard, T., Fegaras, L.: A Fold for All Seasons. Functional programming languages and computer architecture, 233\u2013242 (1993)","DOI":"10.1145\/165180.165216"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Svenningsson, J.: Shortcut fusion for Accumulating Parameters & Zip-like Functions. In: ICFP 2002, pp. 124\u2013132 (2002)","DOI":"10.1145\/581478.581491"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. Functional programming languages and computer architecture, 306\u2013313 (1995)","DOI":"10.1145\/224164.224221"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Voigtl\u00e4nder, J.: Proving correctness via free theorems: the case of the destroy\/build-rule. Partial Eval. and Semantics-Based Prog. Manip. 13\u201320 (2008)","DOI":"10.1145\/1328408.1328412"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: FPCA, pp. 347\u2013359 (1989)","DOI":"10.1145\/99370.99404"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: transforming programs to eliminate trees. Theoretical Computer Science\u00a073(2), 231\u2013248 (1990)","journal-title":"Theoretical Computer Science"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-13321-3_22","volume-title":"Mathematics of Program Construction","author":"M. Wang","year":"2010","unstructured":"Wang, M., Gibbons, J., Matsuda, K., Hu, Z.: Gradual refinement: Blending pattern matching with data abstraction. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol.\u00a06120, pp. 397\u2013425. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24276-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T17:17:49Z","timestamp":1639070269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24276-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242755","9783642242762"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24276-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}