{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:05Z","timestamp":1725566165279},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223801"},{"type":"electronic","value":"9783540277644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27764-4_9","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T19:25:20Z","timestamp":1284578720000},"page":"142-168","source":"Crossref","is-referenced-by-count":8,"title":["Streaming Representation-Changers"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10704973_1","volume-title":"Advanced Functional Programming","author":"L. Augusteijn","year":"1999","unstructured":"Augusteijn, L.: Sorting morphisms. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 1\u201327. Springer, Heidelberg (1999)"},{"key":"9_CR2","unstructured":"Beeler, M., Gosper, R.W., Schroeppel, R.: Hakmem. AIM 239, MIT (February 1972)"},{"key":"9_CR3","volume-title":"The Algebra of Programming","author":"R. Bird","year":"1996","unstructured":"Bird, R., de Moor, O.: The Algebra of Programming. Prentice-Hall, Englewood Cliffs (1996)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44833-4_1","volume-title":"Advanced Functional Programming","author":"R. Bird","year":"2003","unstructured":"Bird, R., Gibbons, J.: Arithmetic coding with folds and unfolds. In: Jeuring, J., Jones, S.L.P. (eds.) AFP 2002. LNCS, vol.\u00a02638, Springer, Heidelberg (2003)"},{"key":"9_CR5","volume-title":"Introduction to Functional Programming Using Haskell","author":"R.S. Bird","year":"1998","unstructured":"Bird, R.S.: Introduction to Functional Programming Using Haskell. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"9_CR6","volume-title":"An Introduction to Functional Programming","author":"R.S. Bird","year":"1988","unstructured":"Bird, R.S., Wadler, P.L.: An Introduction to Functional Programming. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"9_CR7","unstructured":"Boiten, E.: The many disguises of accumulation. Technical Report 91-26, Department of Informatics, University of Nijmegen (December 1991)"},{"key":"9_CR8","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software","author":"E. Gamma","year":"1995","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading (1995)"},{"key":"9_CR9","unstructured":"Gibbons, J.: Algebras for Tree Algorithms. D.Phil. thesis, Programming Research Group, Oxford University (1991), Available as Technical Monograph PRG-94. ISBN 0-902928-72-4"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054292","volume-title":"Mathematics of Program Construction","author":"J. Gibbons","year":"1998","unstructured":"Gibbons, J.: Polytypic downwards accumulations. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol.\u00a01422, Springer, Heidelberg (1998)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6423(99)00022-2","volume":"37","author":"J. Gibbons","year":"2000","unstructured":"Gibbons, J.: Generic downwards accumulations. Science of Computer Programming\u00a037, 37\u201365 (2000)","journal-title":"Science of Computer Programming"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-47797-7_5","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","author":"J. Gibbons","year":"2002","unstructured":"Gibbons, J.: Chapter 5 Calculating Functional Programs. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol.\u00a02297, pp. 149\u2013203. Springer, Heidelberg (2002)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Gibbons, J.: Origami programming. In: Gibbons, J., de Moor, O. (eds.) The Fun of Programming, Cornerstones in Computing, Palgrave (2003)","DOI":"10.1007\/978-1-349-91518-7_3"},{"key":"9_CR14","unstructured":"Gibbons, J.: An unbounded spigot algorithm for the digits of \u03c0. Draft (November 2003)"},{"key":"9_CR15","unstructured":"Gibbons, J., Hutton, G.: Proof methods for corecursive programs (submitted for publication) (March 2004)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gibbons, J., Jones, G.: The under-appreciated unfold. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, pp. 273\u2013279 (1998)","DOI":"10.1145\/289423.289455"},{"key":"9_CR17","unstructured":"Gosper, B.: Continued fraction arithmetic. Unpublished manuscript (1981)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-18508-9_24","volume-title":"Category Theory and Computer Science","author":"T. Hagino","year":"1987","unstructured":"Hagino, T.: A typed lambda calculus with categorical type constructors. In: Pitt, D.H., Rydeheard, D.E., Poign\u00e9, A. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0283, pp. 140\u2013157. Springer, Heidelberg (1987)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Quicksort. Computer Journal 5, 10\u201315 (1962)","DOI":"10.1093\/comjnl\/5.1.10"},{"issue":"2","key":"9_CR20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J. Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Computer Journal\u00a032(2), 98\u2013107 (1989), Also in [36]","journal-title":"Computer Journal"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/S0956796800001623","volume":"6","author":"G. Hutton","year":"1996","unstructured":"Hutton, G., Meijer, E.: Back to basics: Deriving representation changers functionally. Journal of Functional Programming\u00a06(1), 181\u2013188 (1996)","journal-title":"Journal of Functional Programming"},{"key":"9_CR22","volume-title":"Principles of Program Design","author":"M.A. Jackson","year":"1975","unstructured":"Jackson, M.A.: Principles of Program Design. Academic Press, London (1975)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Algebraic Methodology and Software Technology","author":"B. Jacobs","year":"1995","unstructured":"Jacobs, B.: Mongruences and cofree coalgebras. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, Springer, Heidelberg (1995)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Jones, S.P.: Arbitrary precision arithmetic using continued fractions. INDRA Working Paper 1530, Dept of CS, University College, London (January 1984)","DOI":"10.1017\/CBO9780511759550"},{"key":"9_CR25","volume-title":"The Haskell 98 Language and Libraries: The Revised Report","author":"S.P. Jones","year":"2003","unstructured":"Jones, S.P.: The Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Lester, D.: Vuillemin\u2019s exact real arithmetic. In: Heldal, R., Holst, C.K., Wadler, P. (eds.) Glasgow Functional Programming Workshop, pp. 225\u2013238 (1991)","DOI":"10.1007\/978-1-4471-3196-0_18"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Lester, D.: Effective continued fractions. In: Proceedings of the Fifteenth IEEE Arithmetic Conference (2001)","DOI":"10.1109\/ARITH.2001.930116"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G. Malcolm","year":"1990","unstructured":"Malcolm, G.: Data structures and program transformation. Science of Computer Programming\u00a014, 255\u2013279 (1990)","journal-title":"Science of Computer Programming"},{"issue":"5","key":"9_CR29","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L. Meertens","year":"1992","unstructured":"Meertens, L.: Paramorphisms. Formal Aspects of Computing\u00a04(5), 413\u2013424 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"9_CR30","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":"9_CR31","doi-asserted-by":"crossref","unstructured":"Pardo, A.: Generic accumulations. In: Gibbons, J., Jeuring, J. (eds.) Generic Programming, pp. 49\u201378. Kluwer Academic Publishers, Dordrecht (2003), Proceedings of the IFIP TC2Working Conference on Generic Programming, Schlo\u00df Dagstuhl (July 2002) ISBN 1-4020-7374-7","DOI":"10.1007\/978-0-387-35672-3_3"},{"key":"9_CR32","unstructured":"Potts, P.J.: Exact Real Arithmetic using M\u00f6bius Transformations. PhD thesis, Imperial College, London (July 1998)"},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"195","DOI":"10.2307\/2975006","volume":"102","author":"S. Rabinowitz","year":"1995","unstructured":"Rabinowitz, S., Wagon, S.: A spigot algorithm for the digits of \u03c0. American Mathematical Monthly\u00a0102(3), 195\u2013203 (1995)","journal-title":"American Mathematical Monthly"},{"key":"9_CR34","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Higher Order and Symbolic Computing\u00a011(4), 363\u2013397 (1998), Reprinted from the Proceedings of the 25th ACM National Conference (1972)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-57499-9_26","volume-title":"Formal Program Development","author":"D. Swierstra","year":"1993","unstructured":"Swierstra, D., de Moor, O.: Virtual data structures. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, pp. 355\u2013371. Springer, Heidelberg (1993)"},{"key":"9_CR36","unstructured":"Turner, D.A. (ed.): Research Topics in Functional Programming. University of Texas at Austin, Addison-Wesley (1990)"},{"key":"9_CR37","unstructured":"Vene, V., Uustalu, T.: Functional programming with apomorphisms (corecursion). In: Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, vol.\u00a047(3), pp. 147\u2013161 (1998) 9th Nordic Workshop on Programming Theory"},{"issue":"8","key":"9_CR38","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/12.57047","volume":"39","author":"J. Vuillemin","year":"1990","unstructured":"Vuillemin, J.: Exact real arithmetic with continued fractions. IEEE Transactions on Computers\u00a039(8), 1087\u20131105 (1990)","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR39","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a073, 231\u2013248 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"9_CR40","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Communications of the ACM\u00a030(6), 520\u2013540 (1987)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27764-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:19:21Z","timestamp":1605759561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27764-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223801","9783540277644"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27764-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}