{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:56:00Z","timestamp":1725684960284},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_25","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T09:21:09Z","timestamp":1337505669000},"page":"317-331","source":"Crossref","is-referenced-by-count":2,"title":["Explicit Binds: Effortless Efficiency with and without Trees"],"prefix":"10.1007","author":[{"given":"Tarmo","family":"Uustalu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P.-L., Levy, J.-J.: Explicit substitutions. J. of Funct. Program.\u00a01(4), 375\u2013416 (1991)","journal-title":"J. of Funct. Program."},{"key":"25_CR2","unstructured":"Fegaras, L.: Using the parametricity theorem for program fusion. Tech. report CSE-96-001. Oregon Grad. Inst. (1996)"},{"key":"25_CR3","first-page":"113","volume-title":"Trends in Functional Programming","author":"N. Ghani","year":"2009","unstructured":"Ghani, N., Johann, P.: Short cut fusion for effects. In: Achten, P., Koopman, P., Moraz\u00e1n, M. (eds.) Trends in Functional Programming, vol.\u00a09, pp. 113\u2013128. Intellect, Bristol (2009)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-30477-7_22","volume-title":"Programming Languages and Systems","author":"N. Ghani","year":"2004","unstructured":"Ghani, N., Uustalu, T., Vene, V.: Build, Augment and Destroy, Universally. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol.\u00a03302, pp. 327\u2013347. Springer, Heidelberg (2004)"},{"key":"25_CR5","first-page":"65","volume-title":"Trends in Functional Programming","author":"N. Ghani","year":"2006","unstructured":"Ghani, N., Uustalu, T., Vene, V.: Generalizing the augment combinator. In: Loidl, H.-W. (ed.) Trends in Functional Programming, vol.\u00a05, pp. 65\u201378. Intellect, Bristol (2006)"},{"key":"25_CR6","unstructured":"Gill, A.: Cheap Deforestation for Non-strict Functional Languages. PhD thesis. University of Glasgow (1996)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S0956796809007175","volume":"19","author":"A. Gill","year":"2009","unstructured":"Gill, A., Hutton, G.: The worker\/wrapper transformation. J. of Funct. Program.\u00a019(2), 227\u2013251 (2009)","journal-title":"J. of Funct. Program."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/165180.165214","volume-title":"Conf. Record of 6th ACM SIGPLAN\/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1993","author":"A. Gill","year":"1993","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.L.: A short cut to deforestation. In: Conf. Record of 6th ACM SIGPLAN\/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1993, Copenhagen, pp. 223\u2013232. ACM Press, New York (1993)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(86)90059-1","volume":"22","author":"J. Hughes","year":"1986","unstructured":"Hughes, J.: A novel representation of lists and its application to the function \u2018reverse\u2019. Inf. Process. Lett.\u00a022(3), 141\u2013144 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"3-4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0956796810000122","volume":"20","author":"G. Hutton","year":"2010","unstructured":"Hutton, G., Jaskelioff, M., Gill, A.: Factorising folds for faster functions. J. of Funct. Program.\u00a020(3-4), 353\u2013373 (2010)","journal-title":"J. of Funct. Program."},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022982420888","volume":"15","author":"P. Johann","year":"2002","unstructured":"Johann, P.: A generalization of short-cut fusion and its correctness proof. Higher-Order and Symb. Comput.\u00a015(4), 273\u2013300 (2002)","journal-title":"Higher-Order and Symb. Comput."},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1017\/S0956796802004409","volume":"13","author":"P. Johann","year":"2003","unstructured":"Johann, P.: Short-cut fusion is correct. J. of Funct. Program.\u00a013(4), 797\u2013814 (2003)","journal-title":"J. of Funct. Program."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/S0960129503004109","volume":"14","author":"C. J\u00fcrgensen","year":"2004","unstructured":"J\u00fcrgensen, C., Vogler, H.: Syntactic composition of top-down tree transducers is short cut fusion. Math. Struct. in Comput. Sci.\u00a014(2), 215\u2013282 (2004)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"25_CR14","unstructured":"Kmett, E.: Kan extensions 1\u20133. Posts on the author\u2019s blog \u2018The Comonad.Reader\u2019 (2008), \n                  \n                    http:\/\/comonad.com\/reader\/"},{"key":"25_CR15","unstructured":"Kmett, E.: Free monads for less 1\u20133. Posts on the author\u2019s blog \u2018The Comonad.Reader\u2019 (2011), \n                  \n                    http:\/\/comonad.com\/reader\/"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/10705424_8","volume-title":"Functional and Logic Programming","author":"A. K\u00fchnemann","year":"1999","unstructured":"K\u00fchnemann, A.: Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers. In: Middeldorp, A., Sato, T. (eds.) FLOPS 1999. LNCS, vol.\u00a01722, pp. 114\u2013130. Springer, Heidelberg (1999)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11784180_15","volume-title":"Algebraic Methodology and Software Technology","author":"A. K\u00fchnemann","year":"2006","unstructured":"K\u00fchnemann, A., Maletti, A.: The Substitution Vanishes. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 173\u2013188. Springer, Heidelberg (2006)"},{"issue":"21","key":"25_CR18","first-page":"3431","volume":"14","author":"C. Manzino","year":"2008","unstructured":"Manzino, C., Pardo, A.: Shortcut fusion of monadic programs. J. of Univ. Comput. Sci.\u00a014(21), 3431\u20133446 (2008)","journal-title":"J. of Univ. Comput. Sci."},{"key":"25_CR19","unstructured":"Pavlovic, D.: Logic of build fusion. Techn. report KES.U.00.9. Kestrel Inst. (2000)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/3540543961_30","volume-title":"Functional Programming Languages and Computer Architecture","author":"S.L. Peyton Jones","year":"1991","unstructured":"Peyton Jones, S.L., Launchbury, J.: Unboxed Values as First Class Citizens in a Non-strict Functional Language. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 636\u2013666. Springer, Heidelberg (1991)"},{"key":"25_CR21","series-title":"Electron. Proc. in Theor. Comput. Sci.","first-page":"89","volume-title":"Proc. of 9th Wksh. on Quantitative Aspects of Programming Languages, QAPL 2011","author":"D. Seidel","year":"2011","unstructured":"Seidel, D., Voigtl\u00e4nder, J.: Improvements for free. In: Massink, M., Norman, G. (eds.) Proc. of 9th Wksh. on Quantitative Aspects of Programming Languages, QAPL 2011, Saarbr\u00fccken. Electron. Proc. in Theor. Comput. Sci., vol.\u00a057, pp. 89\u2013103. Elsevier, Amsterdam (2011)"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/581478.581491","volume-title":"Proc. of 7th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2002","author":"J. Svenningsson","year":"2002","unstructured":"Svenningsson, J.: Shortcut fusion for accumulating parameters & zip-like functions. In: Proc. of 7th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 2002, Pittsburgh, PA, pp. 124\u2013132. ACM Press, New York (2002)"},{"key":"25_CR23","first-page":"306","volume-title":"Conf. Record of 7th ACM SIGPLAN\/SIGARCH Conf. on Functional Programming Languages and Computer Architecture, FPCA 1995","author":"A. Takano","year":"1995","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Conf. Record of 7th ACM SIGPLAN\/SIGARCH Conf. on Functional Programming Languages and Computer Architecture, FPCA 1995, La Jolla, pp. 306\u2013316. ACM Press, New York (1995)"},{"issue":"4","key":"25_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ita:2003022","volume":"37","author":"T. Uustalu","year":"2003","unstructured":"Uustalu, T.: Generalizing substitution. Theor. Inform. and Appl.\u00a037(4), 315\u2013336 (2003)","journal-title":"Theor. Inform. and Appl."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11894100_5","volume-title":"Central European Functional Programming School","author":"T. Uustalu","year":"2006","unstructured":"Uustalu, T., Vene, V.: The Essence of Dataflow Programming. In: Horv\u00e1th, Z. (ed.) CEFP 2005. LNCS, vol.\u00a04164, pp. 135\u2013167. Springer, Heidelberg (2006)"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-70594-9_20","volume-title":"Mathematics of Program Construction","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Asymptotic Improvement of Computations over Free Monads. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 388\u2013403. Springer, Heidelberg (2008)"},{"key":"25_CR27","first-page":"14","volume-title":"Proc. of 7th Int. Conf. on Functional Programming, ICFP 2002","author":"J. Voigtl\u00e4nder","year":"2002","unstructured":"Voigtl\u00e4nder, J.: Concatenate, reverse and map vanish for free. In: Proc. of 7th Int. Conf. on Functional Programming, ICFP 2002, Pittsburgh, PA, pp. 14\u201325. ACM Press, New York (2002)"},{"issue":"2","key":"25_CR28","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. Theor. Comput. Sci.\u00a073(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR29","unstructured":"Wadler, P.: Recursive types for free! Unpublished note (1990)"},{"key":"25_CR30","unstructured":"Wadler, P.: The concatenate vanishes. Unpublished note (1987, updated 1989)"},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"Proc. of 4th Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1989","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: Proc. of 4th Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1989, London, pp. 347\u2013359. ACM Press, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:17:31Z","timestamp":1620112651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}