{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T17:53:07Z","timestamp":1673632387692},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10990-011-9076-x","type":"journal-article","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T15:45:23Z","timestamp":1311263123000},"page":"115-149","source":"Crossref","is-referenced-by-count":6,"title":["Shortcut fusion rules for the derivation of circular and higher-order programs"],"prefix":"10.1007","volume":"24","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","published-online":{"date-parts":[[2011,7,22]]},"reference":[{"key":"9076_CR1","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, pp. 1\u2013168. Clarendon, Oxford (1994)"},{"key":"9076_CR2","unstructured":"Baier, H., Kugler, D., Margraf, M.: Elliptic curve cryptography based on ISO 15946. Technical report, Federal Office for Information Security (2007)"},{"key":"9076_CR3","doi-asserted-by":"crossref","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 Inform. 21, 239\u2013250 (1984)","journal-title":"Acta Inform."},{"key":"9076_CR4","series-title":"Prentice-Hall International Series in Computer Science","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de\u00a0Moor, O.: Algebra of Programming. Prentice-Hall International Series in Computer Science, vol.\u00a0100. Prentice Hall, New York (1997)"},{"key":"9076_CR5","unstructured":"Chitil, O.: Type-inference based deforestation of functional programs. Ph.D. thesis, RWTH Aachen (October 2000)"},{"key":"9076_CR6","series-title":"Canadian Mathematical Society Conference Proceedings","first-page":"141","volume-title":"International Meeting on Category Theory 1991","author":"R. Cockett","year":"1991","unstructured":"Cockett, R., Spencer, D.: Strong categorical datatypes I. In: Seely, R.A.C. (ed.) International Meeting on Category Theory 1991. Canadian Mathematical Society Conference Proceedings, vol.\u00a013, pp. 141\u2013169 (1991)"},{"key":"9076_CR7","volume-title":"POPL\u201906: Proc. of the 33rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages","author":"N.A. Danielsson","year":"2006","unstructured":"Danielsson, N.A., Hughes, J., Jansson, P., Gibbons, J.: Fast and loose reasoning is morally correct. In: POPL\u201906: Proc. of the 33rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. ACM, New York (2006)"},{"key":"9076_CR8","volume-title":"ICFP\u201902: Proc. of the 7th ACM SIGPLAN Int. Conf. on Functional Programming","author":"O. Danvy","year":"2002","unstructured":"Danvy, O., Goldberg, M.: There and back again. In: ICFP\u201902: Proc. of the 7th ACM SIGPLAN Int. Conf. on Functional Programming. ACM, New York (2002)"},{"key":"9076_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-40048-6_10","volume-title":"GCSE\u201999: Proc. of the 1st International Symposium on Generative and Component-Based Software Engineering","author":"O. Moor de","year":"2000","unstructured":"de\u00a0Moor, O., Peyton Jones, S.L., Van Wyk, E.: Aspect-oriented compilers. In: GCSE\u201999: Proc. of the 1st International Symposium on Generative and Component-Based Software Engineering, pp. 121\u2013133. Springer, Berlin (2000)"},{"key":"9076_CR10","doi-asserted-by":"crossref","unstructured":"Dijkstra, A., Swierstra, D.: Typing Haskell with an attribute grammar. Technical report, Inst. of Information and Computing Sciences, Utrecht University (2004)","DOI":"10.1007\/11546382_1"},{"key":"9076_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/581690.581693","volume-title":"Haskell\u201902: Proceedings of the ACM SIGPLAN Haskell Workshop","author":"L. Erk\u00f6k","year":"2002","unstructured":"Erk\u00f6k, L., Launchbury, J.: A recursive do for Haskell. In: Haskell\u201902: Proceedings of the ACM SIGPLAN Haskell Workshop, pp.\u00a029\u201337. ACM, New York (2002)"},{"key":"9076_CR12","unstructured":"Fernandes, J.P.: Design, implementation and calculation of circular programs. Ph.D. thesis, Department of Informatics, University of Minho, Portugal (March 2009)"},{"key":"9076_CR13","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/1244381.1244399","volume-title":"PEPM\u201907: Proc. of the ACM SIGPLAN 2007 Symposium on Partial Evaluation and Program Manipulation","author":"J.P. Fernandes","year":"2007","unstructured":"Fernandes, J.P., Saraiva, J.: Tools and libraries to model and manipulate circular programs. In: PEPM\u201907: Proc. of the ACM SIGPLAN 2007 Symposium on Partial Evaluation and Program Manipulation, pp.\u00a0102\u2013111. ACM, New York (2007)"},{"key":"9076_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/1291201.1291216","volume-title":"Proceedings of the ACM SIGPLAN Haskell Workshop","author":"J.P. Fernandes","year":"2007","unstructured":"Fernandes, J.P., Pardo, A., Saraiva, J.: A shortcut fusion rule for circular program calculation. In: Proceedings of the ACM SIGPLAN Haskell Workshop, pp.\u00a095\u2013106. ACM, New York (2007)"},{"key":"9076_CR15","volume-title":"Symposium on Trends in Functional Programming","author":"N. Ghani","year":"2008","unstructured":"Ghani, N., Johann, P.: Short cut fusion of recursive programs with computational effects. In: Symposium on Trends in Functional Programming (2008)"},{"key":"9076_CR16","series-title":"LNCS","first-page":"148","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","author":"J. Gibbons","year":"2002","unstructured":"Gibbons, J.: Calculating functional programs. In: Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol.\u00a02297, pp. 148\u2013203. Springer, Berlin (2002)"},{"key":"9076_CR17","unstructured":"Gill, A.: Cheap deforestation for non-strict functional languages. Ph.D. thesis, Department of Computing Science, University of Glasgow, UK (1996)"},{"key":"9076_CR18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/165180.165214","volume-title":"Conference on Functional Programming Languages and Computer Architecture","author":"A. Gill","year":"1993","unstructured":"Gill, A., Launchbury, J., Peyton\u00a0Jones, S.L.: A short cut to deforestation. In: Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232 (1993)"},{"key":"9076_CR19","volume-title":"Summer School on Generic Programming","author":"R. Hinze","year":"2002","unstructured":"Hinze, R., Jeuring, J.: Generic Haskell: practice and theory. In: Summer School on Generic Programming (2002)"},{"issue":"4","key":"9076_CR20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1017\/S0956796898003050","volume":"8","author":"G. Hutton","year":"1998","unstructured":"Hutton, G., Meijer, E.: Monadic parsing in Haskell. J. Funct. Program. 8(4), 437\u2013444 (1998)","journal-title":"J. Funct. Program."},{"key":"9076_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/964001.964010","volume-title":"POPL\u201904: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Johann","year":"2004","unstructured":"Johann, P., Voigtl\u00e4nder, J.: Free theorems in the presence of seq. In: POPL\u201904: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.\u00a099\u2013110. ACM, New York (2004)"},{"key":"9076_CR22","volume-title":"Functional Programming Languages and Computer Architecture","author":"T. Johnsson","year":"1987","unstructured":"Johnsson, T.: Attribute grammars as a functional programming paradigm. In: Functional Programming Languages and Computer Architecture (1987)"},{"key":"9076_CR23","unstructured":"Jones, G., Gibbons, J.: Linear-time breadth-first tree algorithms an exercise in the arithmetic of folds and zips. Technical Report 71, Dept. of Computer Science, University of Auckland (1993)"},{"key":"9076_CR24","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/BFb0026439","volume-title":"CC\u201998: Proceedings of the 7th International Conference on Compiler Construction","author":"U. Kastens","year":"1998","unstructured":"Kastens, U., Pfahler, P., Jung, M.T.: The eli system. In: CC\u201998: Proceedings of the 7th International Conference on Compiler Construction, pp.\u00a0294\u2013297. Springer, London (1998)"},{"key":"9076_CR25","volume-title":"Computing Science in the Netherlands","author":"M. Kuiper","year":"1987","unstructured":"Kuiper, M., Swierstra, D.: Using attribute grammars to derive efficient functional programs. In: Computing Science in the Netherlands (1987)"},{"key":"9076_CR26","series-title":"LNCS","volume-title":"Proceedings of the Second Symposium on Programs as Data Objects (PADO)","author":"J.L. Lawall","year":"2001","unstructured":"Lawall, J.L.: Implementing circularity using partial evaluation. In: Proceedings of the Second Symposium on Programs as Data Objects (PADO). LNCS, vol. 2053. Springer, Berlin (2001)"},{"issue":"21","key":"9076_CR27","first-page":"3431","volume":"14","author":"C. Manzino","year":"2008","unstructured":"Manzino, C., Pardo, A.: Shortcut fusion of monadic programs. J. Univers. Comput. Sci. 14(21), 3431\u20133446 (2008)","journal-title":"J. Univers. Comput. Sci."},{"key":"9076_CR28","unstructured":"Marlow, S., Peyton\u00a0Jones, S.: The new GHC\/Hugs Runtime System (1999)"},{"key":"9076_CR29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/1190216.1190241","volume-title":"POPL\u201907: Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"A. Ohori","year":"2007","unstructured":"Ohori, A., Sasano, I.: Lightweight fusion by fixed point promotion. In: POPL\u201907: Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 143\u2013154. ACM, New York (2007)"},{"issue":"9","key":"9076_CR30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/357766.351253","volume":"35","author":"C. Okasaki","year":"2000","unstructured":"Okasaki, C.: Breadth-first numbering: lessons from a small exercise in algorithm design. ACM SIGPLAN Not. 35(9), 131\u2013136 (2000)","journal-title":"ACM SIGPLAN Not."},{"key":"9076_CR31","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-0-387-35264-0_4","volume-title":"IFIP TC 2 Working Conference on Algorithmic Languages and Calculi","author":"Y. Onoue","year":"1997","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, Le Bischenberg, France, pp. 76\u2013106. Chapman & Hall, London (1997)"},{"issue":"2","key":"9076_CR32","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/210376.197409","volume":"27","author":"J. Paakki","year":"1995","unstructured":"Paakki, J.: Attribute grammar paradigms\u2014a high-level methodology in language implementation. ACM Comput. Surv. 27(2), 196\u2013255 (1995)","journal-title":"ACM Comput. Surv."},{"key":"9076_CR33","first-page":"49","volume-title":"IFIP TC2\/WG2.1 Working Conference on Generic Programming","author":"A. Pardo","year":"2003","unstructured":"Pardo, A.: Generic accumulations. In: IFIP TC2\/WG2.1 Working Conference on Generic Programming, pp.\u00a049\u201378. Kluwer Academic, Dordrecht (2003)"},{"key":"9076_CR34","unstructured":"Pardo, A.: A calculational approach to recursive programs with effects. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (October 2001)"},{"key":"9076_CR35","first-page":"541","volume-title":"Fundamenta Informaticae XII","author":"A. Pettorossi","year":"1987","unstructured":"Pettorossi, A., Skowron, A.: The lambda abstraction strategy for program derivation. In: Fundamenta Informaticae XII, pp. 541\u2013561 (1987)"},{"key":"9076_CR36","volume-title":"Second International Conference on Generative Programming and Component Engineering (GPCE)","author":"D. Swierstra","year":"2003","unstructured":"Swierstra, D.: Tutorial on attribute grammars. In: Second International Conference on Generative Programming and Component Engineering (GPCE) (2003)"},{"issue":"01","key":"9076_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796808006990","volume":"19","author":"D. Swierstra","year":"2009","unstructured":"Swierstra, D., Chitil, O.: Linear, bounded, functional pretty-printing. J. Funct. Program. 19(01), 1\u201316 (2009)","journal-title":"J. Funct. Program."},{"key":"9076_CR38","first-page":"306","volume-title":"Proc. Conference on Functional Programming Languages and Computer Architecture","author":"A. Takano","year":"1995","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proc. Conference on Functional Programming Languages and Computer Architecture, pp. 306\u2013313. ACM, New York (1995)"},{"key":"9076_CR39","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-540-78969-7_13","volume-title":"Proc. of the 2008 International Symposium on Functional and Logic Programming","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Semantics and pragmatics of new shortcut fusion rules. In: Proc. of the 2008 International Symposium on Functional and Logic Programming, pp. 163\u2013179. Springer, Berlin (2008)"},{"key":"9076_CR40","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/B:LISP.0000029450.36668.cb","volume":"17","author":"J. Voigtl\u00e4nder","year":"2004","unstructured":"Voigtl\u00e4nder, J.: Using circular programs to deforest in accumulating parameters. High.-Order Symb. Comput. 17, 129\u2013163 (2004)","journal-title":"High.-Order Symb. Comput."},{"key":"9076_CR41","volume-title":"4th International Conference on Functional Programming and Computer Architecture","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: 4th International Conference on Functional Programming and Computer Architecture. ACM, London (1989)"},{"key":"9076_CR42","doi-asserted-by":"crossref","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. 73, 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-011-9076-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-011-9076-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-011-9076-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T05:20:56Z","timestamp":1560403256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-011-9076-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9076"],"URL":"https:\/\/doi.org\/10.1007\/s10990-011-9076-x","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}