{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:26:18Z","timestamp":1725895578195},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320361"},{"type":"electronic","value":"9783642320378"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32037-8_12","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:27:32Z","timestamp":1342830452000},"page":"179-194","source":"Crossref","is-referenced-by-count":1,"title":["Applicative Shortcut Fusion"],"prefix":"10.1007","author":[{"given":"Germ\u00e1n Andr\u00e9s","family":"Delbianco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Jaskelioff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain Theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013168. Oxford University Press (1994)","key":"12_CR1","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/10704973_2","volume-title":"Advanced Functional Programming","author":"R. Backhouse","year":"1999","unstructured":"Backhouse, R., Jansson, P., Jeuring, J., Meertens, L.: Generic Programming \u2014 An Introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 28\u2013115. Springer, Heidelberg (1999)"},{"key":"12_CR3","volume-title":"Algebra of programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de Moor, O.: Algebra of programming. Prentice-Hall, Inc., Upper Saddle River (1997)"},{"unstructured":"Bird, R.S.: Introduction to Functional Programming Using Haskell. Prentice-Hall (1998)","key":"12_CR4"},{"doi-asserted-by":"crossref","unstructured":"Fernandes, J.P., Pardo, A., Saraiva, J.: A shortcut fusion rule for circular program calculation. In: Keller, G. (ed.) Haskell, pp. 95\u2013106. ACM (2007)","key":"12_CR5","DOI":"10.1145\/1291201.1291216"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1017\/S0956796807006314","volume":"17","author":"N. Ghani","year":"2007","unstructured":"Ghani, N., Johann, P.: Monadic augment and generalised short cut fusion. Journal of Functional Programming\u00a017(6), 731\u2013776 (2007)","journal-title":"Journal of Functional Programming"},{"unstructured":"Ghani, N., Johann, P.: Short cut fusion of recursive programs with computational effects. In: Achten, P., Koopman, P., Moraz\u00e1n, M. (eds.) Trends in Functional Programming. Trends in Functional Programming, Intellect, vol.\u00a09, pp. 113\u2013128 (2009) ISBN 978-1-84150-277-9","key":"12_CR7"},{"key":"12_CR8","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":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76786-2_1","volume-title":"Datatype-Generic Programming","author":"J. Gibbons","year":"2007","unstructured":"Gibbons, J.: Datatype-Generic Programming. In: Backhouse, R., Gibbons, J., Hinze, R., Jeuring, J. (eds.) SSDGP 2006. LNCS, vol.\u00a04719, pp. 1\u201371. Springer, Heidelberg (2007)"},{"issue":"3-4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0956796809007291","volume":"19","author":"J. Gibbons","year":"2009","unstructured":"Gibbons, J., Oliveira, B.C.d.S.: The essence of the iterator pattern. Journal of Functional Programming\u00a019(3-4), 377\u2013402 (2009)","journal-title":"Journal of Functional Programming"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/165180.165214","volume-title":"FPCA 1993: Proceedings of the Conference on Functional Programming Languages and Computer Architecture","author":"A. Gill","year":"1993","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.: A short cut to deforestation. In: FPCA 1993: Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232. ACM Press, New York (1993)"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Comput. J.\u00a032(2), 98\u2013107 (1989)","journal-title":"Comput. J."},{"unstructured":"Johann, P., Ghani, N.: Monadic fold, monadic build, monadic short cut fusion. In: Proceedings of the 10th Symposium on Trends in Functional Programming (TFP 2009), pp. 9\u201323 (2009)","key":"12_CR13"},{"issue":"21","key":"12_CR14","first-page":"3431","volume":"14","author":"C. Manzino","year":"2008","unstructured":"Manzino, C., Pardo, A.: Shortcut fusion of monadic programs. Journal of Universal Computer Science\u00a014(21), 3431\u20133446 (2008)","journal-title":"Journal of Universal Computer Science"},{"unstructured":"Mart\u00ednez, M., Pardo, A.: A shortcut fusion approach to accumulations. In: Simp\u00f3sio Brasileiro de Linguagens de Programacao, SBLP 2009 (2009)","key":"12_CR15"},{"issue":"01","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796807006326","volume":"18","author":"C. McBride","year":"2008","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. Journal of Functional Programming\u00a018(01), 1\u201313 (2008)","journal-title":"Journal of Functional Programming"},{"unstructured":"Meertens, L.: Functor pulling. In: Backhouse, R., Sheard, T. (eds.) Proc. Workshop on Generic Programming (1998)","key":"12_CR17"},{"key":"12_CR18","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.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)"},{"doi-asserted-by":"crossref","unstructured":"Pardo, A., Fernandes, J.P., Saraiva, J.: Shortcut fusion rules for the derivation of circular and higher-order monadic programs. In: Puebla, G., Vidal, G. (eds.) PEPM, pp. 81\u201390. ACM (2009)","key":"12_CR19","DOI":"10.1145\/1480945.1480958"},{"doi-asserted-by":"crossref","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proc. Conference on Functional Programming Languages and Computer Architecture, pp. 306\u2013313. ACM Press (1995)","key":"12_CR20","DOI":"10.1145\/224164.224221"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"Proceedings of the 4th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA 1989","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for Free! In: Proceedings of the 4th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA 1989, pp. 347\u2013359. ACM Press, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32037-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T09:53:52Z","timestamp":1714211632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32037-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320361","9783642320378"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32037-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}