{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T22:27:25Z","timestamp":1673044045902},"reference-count":22,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1016\/j.scico.2012.09.002","type":"journal-article","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T19:02:45Z","timestamp":1349377365000},"page":"1121-1136","source":"Crossref","is-referenced-by-count":2,"title":["A shortcut fusion approach to accumulations"],"prefix":"10.1016","volume":"78","author":[{"given":"M\u00f3nica","family":"Mart\u00ednez","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Pardo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.scico.2012.09.002_br000005","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF03037434","article-title":"Calculating accumulations","volume":"17","author":"Hu","year":"1999","journal-title":"New Generation Computing"},{"issue":"1\u20133","key":"10.1016\/j.scico.2012.09.002_br000010","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6423(99)00022-2","article-title":"Generic downwards accumulations","volume":"37","author":"Gibbons","year":"2000","journal-title":"Science of Computer Programming"},{"key":"10.1016\/j.scico.2012.09.002_br000015","series-title":"International Conference on Functional Programming","first-page":"124","article-title":"Shortcut fusion for accumulating parameters & zip-like functions","author":"Svenningsson","year":"2002"},{"key":"10.1016\/j.scico.2012.09.002_br000020","doi-asserted-by":"crossref","unstructured":"S. Nishimura, Fusion with stacks and accumulating parameters, in: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, Verona, Italy, August 24\u201325, 2004, pp. 101\u2013112.","DOI":"10.1145\/1014007.1014018"},{"key":"10.1016\/j.scico.2012.09.002_br000025","series-title":"IFIP TC2\/WG2.1 Working Conference on Generic Programming","first-page":"49","article-title":"Generic accumulations","author":"Pardo","year":"2003"},{"issue":"3","key":"10.1016\/j.scico.2012.09.002_br000030","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1017\/S0956796803004933","article-title":"Composition of functions with accumulating parameters","volume":"14","author":"Voigtl\u00e4nder","year":"2004","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/j.scico.2012.09.002_br000035","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/B:LISP.0000029450.36668.cb","article-title":"Using circular programs to deforest in accumulating parameters","volume":"17","author":"Voigtl\u00e4nder","year":"2004","journal-title":"Higher\u2013Order and Symbolic Computation"},{"key":"10.1016\/j.scico.2012.09.002_br000040","series-title":"Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"143","article-title":"Lightweight fusion by fixed point promotion","author":"Ohori","year":"2007"},{"issue":"5\u20136","key":"10.1016\/j.scico.2012.09.002_br000045","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1017\/S095679680800693X","article-title":"Algebraic fusion of functions with an accumulating parameter and its improvement","volume":"18","author":"ya~Katsumata","year":"2008","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/j.scico.2012.09.002_br000050","series-title":"International Conference on Functional Programming Languages and Computer Architecture","first-page":"223","article-title":"A short cut to deforestation","author":"Gill","year":"1993"},{"key":"10.1016\/j.scico.2012.09.002_br000055","unstructured":"S.P. Jones, Haskell 98 language and libraries, Journal of Functional Programming 13 (1)."},{"key":"10.1016\/j.scico.2012.09.002_br000060","series-title":"31st Symposium on Principles of Programming Languages","first-page":"99","article-title":"Free theorems in the presence of seq","author":"Johann","year":"2004"},{"key":"10.1016\/j.scico.2012.09.002_br000065","series-title":"International Conference on Functional Programming and Computer Architecture","first-page":"347","article-title":"Theorems for free!","author":"Wadler","year":"1989"},{"key":"10.1016\/j.scico.2012.09.002_br000070","series-title":"Introduction to Functional Programming Using Haskell","author":"Bird","year":"1998"},{"issue":"1","key":"10.1016\/j.scico.2012.09.002_br000075","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A Transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/j.scico.2012.09.002_br000080","series-title":"Domain Theory","first-page":"1","volume":"vol. 3","author":"Abramsky","year":"1994"},{"key":"10.1016\/j.scico.2012.09.002_br000085","series-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","first-page":"148","article-title":"Calculating functional programs","volume":"vol. 2297","author":"Gibbons","year":"2002"},{"key":"10.1016\/j.scico.2012.09.002_br000090","series-title":"International Conference on Functional Programming Languages and Computer Architecture","first-page":"306","article-title":"Shortcut to deforestation in calculational form","author":"Takano","year":"1995"},{"key":"10.1016\/j.scico.2012.09.002_br000095","series-title":"International Conference on Functional Programming","first-page":"249","article-title":"Type inference builds a short cut to deforestation","author":"Chitil","year":"1999"},{"key":"10.1016\/j.scico.2012.09.002_br000100","unstructured":"O. Chitil, Type-inference based deforestation of functional programs, Ph.D. Thesis, RWTH Aachen, 2000."},{"key":"10.1016\/j.scico.2012.09.002_br000105","series-title":"International Conference on Functional Programming Languages and Computer Architecture","first-page":"314","article-title":"Warm fusion: deriving build-catas from recursive definitions","author":"Launchbury","year":"1995"},{"key":"10.1016\/j.scico.2012.09.002_br000110","series-title":"Advanced Functional Programming","first-page":"159","article-title":"Heap profiling for space efficiency","volume":"vol. 1129","author":"Runciman","year":"1996"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642312001670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642312001670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T13:51:38Z","timestamp":1584021098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642312001670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["S0167642312001670"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2012.09.002","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}