{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:06Z","timestamp":1725511806445},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540696087"},{"type":"electronic","value":"9783540696117"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-69611-7_3","type":"book-chapter","created":{"date-parts":[[2007,4,26]],"date-time":"2007-04-26T09:40:18Z","timestamp":1177580418000},"page":"50-64","source":"Crossref","is-referenced-by-count":25,"title":["Rewriting Haskell Strings"],"prefix":"10.1007","author":[{"given":"Duncan","family":"Coutts","sequence":"first","affiliation":[]},{"given":"Don","family":"Stewart","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Leshchinskiy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"The website accompanying this paper, \n                  \n                    http:\/\/www.cse.unsw.edu.au\/~dons\/papers\/CSL06.html"},{"key":"3_CR2","unstructured":"Chakravarty, M.M.T., et al.: The Haskell 98 Foreign Function Interface 1.0: An Addendum to the Haskell 98 Report (2004), \n                  \n                    http:\/\/www.cse.unsw.edu.au\/~chak\/haskell\/ffi\/"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/507635.507661","volume-title":"Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming","author":"M.M.T. Chakravarty","year":"2001","unstructured":"Chakravarty, M.M.T., Keller, G.: Functional array fusion. In: Leroy, X. (ed.) Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming, pp. 205\u2013216. ACM Press, New York (2001)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-44833-4_2","volume-title":"Advanced Functional Programming","author":"M.M.T. Chakravarty","year":"2003","unstructured":"Chakravarty, M.M.T., Keller, G.: An approach to fast arrays in Haskell. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol.\u00a02638, pp. 27\u201358. Springer, Heidelberg (2003)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/317636.317907","volume-title":"ICFP 1999: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming","author":"O. Chitil","year":"1999","unstructured":"Chitil, O.: Typer inference builds a short cut to deforestation. In: ICFP 1999: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, pp. 249\u2013260. ACM Press, New York (1999)"},{"key":"3_CR6","unstructured":"Gill, A.: Cheap Deforestation for Non-strict Functional Languages. Ph.D thesis, University of Glasgow (January 1996)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.: A short cut to deforestation. In: Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232 (June 1993)","DOI":"10.1145\/165180.165214"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-44806-3_4","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"P. Johann","year":"2001","unstructured":"Johann, P.: Short cut fusion: Proved and improved. In: Taha, W. (ed.) SAIG 2001. LNCS, vol.\u00a02196, pp. 47\u201371. Springer, Heidelberg (2001)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., 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)"},{"key":"3_CR10","unstructured":"Perry, N.: The Implementation of Practical Functional Programming Languages. Ph.D thesis, Imperial College (1991)"},{"key":"3_CR11","unstructured":"Peyton Jones, S., Tolmach, A., Hoare, T.: Playing by the rules: rewriting as a practical optimisation technique in GHC. In: Hinze, R. (ed.) Haskell Workshop 2001. ACM SIGPLAN (September 2001)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/581478.581491","volume-title":"ICFP 2002: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming","author":"J. Svenningsson","year":"2002","unstructured":"Svenningsson, J.: Shortcut fusion for accumulating parameters & zip-like functions. In: ICFP 2002: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pp. 124\u2013132. ACM Press, New York (2002)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1145\/224164.224221","volume-title":"Conf. Record 7th ACM SIGPLAN\/SIGARCH Int. 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 7th ACM SIGPLAN\/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1995, pp. 306\u2013313. ACM Press, New York (1995)"},{"key":"3_CR14","unstructured":"The GHC Team. The Glasgow Haskell Compiler (GHC) (2006), \n                  \n                    http:\/\/haskell.org\/ghc"},{"issue":"2","key":"3_CR15","first-page":"231","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: transforming programs to eliminate trees. Theoretical Computer Science (Special issue of selected papers from 2nd European Symposium on Programming)\u00a073(2), 231\u2013248 (1990)","journal-title":"Theoretical Computer Science (Special issue of selected papers from 2nd European Symposium on Programming)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69611-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:02:53Z","timestamp":1558270973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69611-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540696087","9783540696117"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69611-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}