Metamorphisms: Streaming representation-changers

Science of Computer Programming

Volumn 65, Issue 2, 2007, Pages 108-139

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Conversion; Data representations; Folds; Fusion; Online algorithms; Streaming; Unfolds

Indexed keywords

ALGORITHMS; DATA REDUCTION; METADATA; ONLINE SYSTEMS; VIRTUAL REALITY;

DATA CONVERSION; DATA FUSION; DATA REPRESENTATION; FOLDS; ONLINE ALGORITHMS;

DATA STRUCTURES;

EID: 33846860597     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.01.006     Document Type: Article

References (47)

1. Augusteijn L. Sorting morphisms. In: Swierstra S.D., Henriques P.R., and Oliveira J.N. (Eds). Advanced Functional Programming. Lecture Notes in Computer Science vol. 1608 (1998) 1-27
2. Beeler M., Gosper B., and Schroeppel R. Hakmem. AIM 239 (February 1972), MIT
3. Benson R. Streaming API for XML. JSR 173 (March 2004), Java Community Process
4. Bird R., and de Moor O. The Algebra of Programming (1996), Prentice-Hall
5. Bird R., and Gibbons J. Arithmetic coding with folds and unfolds. In: Jeuring J., and Jones S.P. (Eds). Advanced Functional Programming 4. Lecture Notes in Computer Science vol. 2638 (2003), Springer-Verlag 1-26
6. Bird R.S. Introduction to Functional Programming Using Haskell (1998), Prentice-Hall
7. Bird R.S., and Wadler P.L. An Introduction to Functional Programming (1988), Prentice-Hall
8. Eerke Boiten, The many disguises of accumulation, Technical Report 91-26, Department of Informatics, University of Nijmegen, December 1991
9. Edalat A., and Potts P.J. A new representation for exact real numbers. Electronic Notes in Theoretical Computer Science 6 (1997) 119-132
10. Gamma E., Helm R., Johnson R., and Vlissides J. Design Patterns: Elements of Reusable Object-Oriented Software (1995), Addison-Wesley
11. Jeremy Gibbons, Algebras for Tree Algorithms. D.Phil. Thesis, Programming Research Group, Oxford University, Available as Technical Monograph PRG-94, ISBN 0-902928-72-4, 1991
12. Gibbons J. Polytypic downwards accumulations. In: Jeuring J. (Ed). Proceedings of Mathematics of Program Construction. Lecture Notes in Computer Science vol. 1422 (June 1998), Springer-Verlag, Marstrand, Sweden 207-233
13. Gibbons J. Generic downwards accumulations. Science of Computer Programming 37 (2000) 37-65
14. Gibbons J. Calculating functional programs. In: Backhouse R., Crole R., and Gibbons J. (Eds). Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Lecture Notes in Computer Science vol. 2297 (2002), Springer-Verlag 148-203
15. Gibbons J. Origami programming. In: Gibbons J., and de~Moor O. (Eds). The Fun of Programming. Cornerstones in Computing (2003), Palgrave 41-60
16. Gibbons J. Streaming representation-changers. In: Kozen D. (Ed). Mathematics of Program Construction. Lecture Notes in Computer Science vol. 3125 (July 2004) 142-168
17. Gibbons J. An unbounded spigot algorithm for the digits of π. American Mathematical Monthly 113 4 (2006)
18. Gibbons J., and Hutton G. Proof methods for corecursive programs. Fundamenta Informatica 66 4 (2005) 353-366
19. Jeremy Gibbons, Geraint Jones, The under-appreciated unfold. in: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, pp. 273-279
20. Bill Gosper, Continued fraction arithmetic, 1981 (unpublished manuscript)
21. Hagino T. A typed lambda calculus with categorical type constructors. In: Pitt D.H., Poigné A., and Rydeheard D.E. (Eds). Category Theory and Computer Science. Lecture Notes in Computer Science vol. 283 (1987), Springer-Verlag 140-157
22. Hoare T. Quicksort. Computer Journal 5 (1962) 10-15
23. Hughes J. Why functional programming matters. Computer Journal 32 2 (1989) 98-107 Also in [43]
24. John Hughes, Doaitse Swierstra, Polish parsers, step by step, in: International Conference on Functional Programming, 2003, pp. 239-248
25. Hutton G., and Meijer E. Back to basics: Deriving representation changers functionally. Journal of Functional Programming 6 1 (1996) 181-188
26. Jackson M. Principles of Program Design (1975), Academic Press
27. Jacobs B. Mongruences and cofree coalgebras. Algebraic Methodology and Software Technology. Lecture Notes in Computer Science vol. 936 (1995) 245-260
28. Knuth D.E. The Art of Computer Programming, Volume 1: Fundamental Algorithms (1968), Addison-Wesley
29. Knuth D.E. The Art of Computer Programming, Volume 2: Seminumerical Algorithms (1969), Addison-Wesley
30. David Lester, Vuillemin's exact real arithmetic, in: Rogardt Heldal, Carsten Kehler Holst, Philip Wadler (Eds.), Glasgow Functional Programming Workshop, 1991, pp. 225-238
31. David Lester, Effective continued fractions, in: Proceedings of the Fifteenth IEEE Arithmetic Conference, 2001, pp. 163-172
32. Malcolm G. Data structures and program transformation. Science of Computer Programming 14 (1990) 255-279
33. Meertens L. Paramorphisms. Formal Aspects of Computing 4 5 (1992) 413-424
34. Meijer E., Fokkinga M., and Paterson R. Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes J. (Ed). Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science vol. 523 (1991), Springer-Verlag 124-144
35. Pardo A. Generic accumulations. In: Gibbons J., and Jeuring J. (Eds). Generic Programming (Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloß Dagstuhl, July 2002) (2003), Kluwer Academic Publishers. 1-4020-7374-7 49-78
36. Jones S.P. The Haskell 98 Language and Libraries: The Revised Report (2003), Cambridge University Press
37. Jones S.L.P. Arbitrary precision arithmetic using continued fractions. INDRA Note 1530 (January 1984), University College London
38. Peter John Potts, Exact Real Arithmetic using Möbius Transformations, Ph.D. Thesis, Imperial College, London, July 1998
39. Rabinowitz S., and Wagon S. A spigot algorithm for the digits of π. American Mathematical Monthly 102 3 (1995) 195-203
40. Reynolds J.C. Definitional interpreters for higher-order programming languages. Higher Order and Symbolic Computing 11 4 (1998) 363-397 Reprinted from the Proceedings of the 25th ACM National Conference, 1972
41. Sullivan L.H. The tall office building artistically considered. Lippincott's Magazine (1896)
42. Swierstra D., and de Moor O. Virtual data structures. In: Möller B., Partsch H., and Schumann S. (Eds). IFIP TC2/WG2.1 State-of-the-Art Report on Formal Program Development. Lecture Notes in Computer Science vol. 755 (1993), Springer-Verlag 355-371
43. In: Turner D.~A. (Ed). Research Topics in Functional Programming (1990), University of Texas at Austin, Addison-Wesley
44. Vene V., and Uustalu T. Functional programming with apomorphisms (corecursion). 9th Nordic Workshop on Programming Theory. Proceedings of the Estonian Academy of Sciences: Physics, Mathematics 47 3 (1998) 147-161
45. Vuillemin J. Exact real arithmetic with continued fractions. IEEE Transactions on Computers 39 8 (1990) 1087-1105
46. Wadler P. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science 73 (1990) 231-248
47. Witten I.~H., Neal R.~M., and Cleary J.~G. Arithmetic coding for data compression. Communications of the ACM 30 6 (1987) 520-540