Streaming representation-changers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3125, Issue , 2004, Pages 142-168

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

AUTOMATIC FUSION; DATA REPRESENTATIONS; HYLOMORPHISM;

DATA HANDLING;

EID: 33746092110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27764-4_9     Document Type: Article

References (40)

1. Lex Augusteijn. Sorting morphisms. In S. D. Swierstra, P. R. Henriques, and J. N. Oliveira, editors, Advanced Functional Programming, volume 1608 of Lecture Notes in Computer Science, pages 1-27, 1998.
2. M. Beeler, R. W. Gosper, and R. Schroeppel. Hakmem. AIM 239, MIT, February 1972.
3. Richard Bird and Oege de Moor. The Algebra of Programming. Prentice-Hall, 1996.
4. Richard Bird and Jeremy Gibbons. Arithmetic coding with folds and unfolds. In Johan Jeuring and Simon Peyton Jones, editors, Advanced Functional Programming 4, volume 2638 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
5. Richard S. Bird. Introduction to Functional Programming Using Haskell. Prentice-Hall, 1998.
6. Richard S. Bird and Philip L. Wadler. An Introduction to Functional Programming. Prentice-Hall, 1988.
7. Eerke Boiten. The many disguises of accumulation. Technical Report 91-26, Department of Informatics, University of Nijmegen, December 1991.
8. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
9. Jeremy Gibbons. Algebras for Tree Algorithms. D. Phil, thesis, Programming Research Group, Oxford University, 1991. Available as Technical Monograph PRG-94. ISBN 0-902928-72-4.
10. Jeremy Gibbons. Polytypic downwards accumulations. In Johan Jeuring, editor, Proceedings of Mathematics of Program Construction, volume 1422 of Lecture Notes in Computer Science, Marstrand, Sweden, June 1998. Springer-Verlag.
11. Jeremy Gibbons. Generic downwards accumulations. Science of Computer Programming, 37:37-65, 2000.
12. Jeremy Gibbons. Calculating functional programs. In Roland Backhouse, Roy Croie, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 148-203. Springer-Verlag, 2002.
13. Jeremy Gibbons. Origami programming. In Jeremy Gibbons and Oege de Moor, editors, The Fun of Programming, Cornerstones in Computing. Palgrave, 2003.
14. Jeremy Gibbons. An unbounded spigot algorithm for the digits of π. Draft, November 2003.
15. Jeremy Gibbons and Graham Hutton. Proof methods for corecursive programs. Submitted for publication, March 2004.
16. Jeremy Gibbons and Geraint Jones. The under-appreciated unfold. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, pages 273-279, Baltimore, Maryland, September 1998.
17. Bill Gosper. Continued fraction arithmetic. Unpublished manuscript, 1981.
18. Tatsuya Hagino. A typed lambda calculus with categorical type constructors. In D. H. Pitt, A. Poigné, and D. E. Rydeheard, editors, Category Theory and Computer Science, volume 283 of Lecture Notes in Computer Science, pages 140-157. Springer-Verlag, September 1987.
19. C. A. R. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
20. John Hughes. Why functional programming matters. Computer Journal, 32(2):98-107, April 1989. Also in [36].
21. Graham Hutton and Erik Meijer. Back to basics: Deriving representation changers functionally. Journal of Functional Programming, 6(1):181-188, 1996.
22. M. A. Jackson. Principles of Program Design. Academic Press, 1975.
23. Bart Jacobs. Mongruences and cofree coalgebras. In Algebraic Methodology and Software Technology, volume 936 of Lecture Notes in Computer Science, 1995.
24. Simon Peyton Jones. Arbitrary precision arithmetic using continued fractions. INDRA Working Paper 1530, Dept of CS, University College, London, January 1984.
25. Simon Peyton Jones. The Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
26. David Lester. Vuillemin's exact real arithmetic. In Rogardt Heldal, Carsten Kehler Holst, and Philip Wadler, editors, Glasgow Functional Programming Workshop, pages 225-238, 1991.
27. David Lester. Effective continued fractions. In Proceedings of the Fifteenth IEEE Arithmetic Conference, 2001.
28. Grant Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255-279, 1990.
29. Lambert Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413-424, 1992.
30. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In John Hughes, editor, Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 124-144. Springer-Verlag, 1991.
31. Alberto Pardo. Generic accumulations. In Jeremy Gibbons and Johan Jeuring, editors, Generic Programming, pages 49-78. Kluwer Academic Publishers, 2003. Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloß Dagstuhl, July 2002. ISBN 1-4020-7374-7.
32. Peter John Potts. Exact Real Arithmetic using Möbius Transformations. PhD thesis, Imperial College, London, July 1998.
33. Stanley Rabinowitz and Stan Wagon. A spigot algorithm for the digits of π. American Mathematical Monthly, 102(3):195-203, 1995.
34. John C. Reynolds. Definitional interpreters for higher-order programming languages. Higher Order and Symbolic Computing, 11(4):363-397, 1998. Reprinted from the Proceedings of the 25th ACM National Conference, 1972.
35. Doaitse Swierstra and Oege de Moor. Virtual data structures. In Bernhard Möller, Helmut Partsch, and Steve Schumann, editors, IFIP TC2/WG2.1 State-of-the-Art Report on Formal Program Development, volume 755 of Lecture Notes in Computer Science, pages 355-371. Springer-Verlag, 1993.
36. David A. Turner, editor. Research Topics in Functional Programming. University of Texas at Austin, Addison-Wesley, 1990.
37. Varmo Vene and Tarmo Uustalu. Functional programming with apomorphisms (corecursion). Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, 47(3):147-161, 1998. 9th Nordic Workshop on Programming Theory.
38. Jean Vuillemin. Exact real arithmetic with continued fractions. IEEE Transactions on Computers, 39(8):1087-1105, August 1990.
39. Philip Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.
40. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, June 1987.