{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:49:49Z","timestamp":1725749389720},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409219"},{"type":"electronic","value":"9783642409226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40922-6_9","type":"book-chapter","created":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T07:12:51Z","timestamp":1380006771000},"page":"120-134","source":"Crossref","is-referenced-by-count":1,"title":["Multiple Intermediate Structure Deforestation by Shortcut Fusion"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Pardo","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o Paulo","family":"Fernandes","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Saraiva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.: A short cut to deforestation. In: Functional Programming Languages and Computer Architecture. ACM (1993)","key":"9_CR1","DOI":"10.1145\/165180.165214"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"R. Bird","year":"1984","unstructured":"Bird, R.: Using circular programs to eliminate multiple traversals of data. Acta Informatica\u00a021, 239\u2013250 (1984)","journal-title":"Acta Informatica"},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10990-011-9076-x","volume":"24","author":"A. Pardo","year":"2011","unstructured":"Pardo, A., Fernandes, J.P., Saraiva, J.: Shortcut fusion rules for the derivation of circular and higher-order programs. Higher-Order and Symbolic Computation\u00a024(1-2), 115\u2013149 (2011)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-78969-7_13","volume-title":"Functional and Logic Programming","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Semantics and pragmatics of new shortcut fusion rules. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 163\u2013179. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796808006990","volume":"19","author":"D. Swierstra","year":"2009","unstructured":"Swierstra, D., Chitil, O.: Linear, bounded, functional pretty-printing. Journal of Functional Programming\u00a019(1), 1\u201316 (2009)","journal-title":"Journal of Functional Programming"},{"doi-asserted-by":"crossref","unstructured":"Onoue, Y., Hu, Z., Iwasaki, H., Takeichi, M.: A Calculational Fusion System HYLO. In: IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, pp. 76\u2013106. Chapman & Hall (1997)","key":"9_CR6","DOI":"10.1007\/978-0-387-35264-0_4"},{"doi-asserted-by":"crossref","unstructured":"Launchbury, J., Sheard, T.: Warm fusion: Deriving build-catas from recursive definitions. In: Funct. Prog. Lang. and Computer Architecture. ACM (1995)","key":"9_CR7","DOI":"10.1145\/224164.224223"},{"doi-asserted-by":"crossref","unstructured":"Johnsson, T.: Attribute grammars as a functional programming paradigm. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 154\u2013173. Springer, Heidelberg (1987)","key":"9_CR8","DOI":"10.1007\/3-540-18317-5_10"},{"unstructured":"de Moor, O., Backhouse, K., Swierstra, S.D.: First-class attribute grammars. Informatica (Slovenia)\u00a024(3) (2000)","key":"9_CR9"},{"doi-asserted-by":"crossref","unstructured":"Fernandes, J.P., Saraiva, J.: Tools and Libraries to Model and Manipulate Circular Programs. In: Workshop on Partial Eval. and Program Manipulation. ACM (2007)","key":"9_CR10","DOI":"10.1145\/1244381.1244399"},{"doi-asserted-by":"crossref","unstructured":"Fernandes, J.P., Saraiva, J., Seidel, D., Voigtl\u00e4nder, J.: Strictification of circular programs. In: Workshop on Partial Eval. and Program Manipulation. ACM (2011)","key":"9_CR11","DOI":"10.1145\/1929501.1929526"},{"doi-asserted-by":"crossref","unstructured":"Johann, P., Voigtl\u00e4nder, J.: Free theorems in the presence of seq. In: Symposium on Principles of Programming Languages, pp. 99\u2013110. ACM (2004)","key":"9_CR12","DOI":"10.1145\/982962.964010"},{"doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: Functional Programming Languages and Computer Architecture. ACM (1989)","key":"9_CR13","DOI":"10.1145\/99370.99404"},{"unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice-Hall Inernational Series in Computer Science, vol.\u00a0100. Prentice-Hall (1997)","key":"9_CR14"},{"issue":"21","key":"9_CR15","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":"Ghani, N., Johann, P.: Short cut fusion for effects. In: TFP 2008. Trends in Functional Programming, vol.\u00a09, pp. 113\u2013128. Intellect (2009)","key":"9_CR16"},{"issue":"4","key":"9_CR17","doi-asserted-by":"crossref","first-page":"541","DOI":"10.3233\/FI-1989-12407","volume":"12","author":"A. Pettorossi","year":"1989","unstructured":"Pettorossi, A., Skowron, A.: The lambda abstraction strategy for program derivation. Fundamenta Informaticae\u00a012(4), 541\u2013561 (1989)","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"crossref","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Functional Programming Languages and Computer Architecture, pp. 306\u2013313. ACM (1995)","key":"9_CR18","DOI":"10.1145\/224164.224221"},{"unstructured":"Fernandes, J.P.: Desing, Implementation and Calculation of Circular Programs. PhD thesis, Dept. of Informatics, Univ. of Minho, Portugal (2009)","key":"9_CR19"}],"container-title":["Lecture Notes in Computer Science","Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40922-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T20:21:29Z","timestamp":1646598089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40922-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409219","9783642409226"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40922-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}