Generic accumulations

IFIP Advances in Information and Communication Technology

Volumn 115, Issue , 2003, Pages 49-78

  Pardo, Alberto ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION TECHNOLOGY;

INDUCTIVE-TYPE; INTERMEDIATE RESULTS;

RECURSIVE FUNCTIONS;

EID: 84904360233     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35672-3_3     Document Type: Conference Paper

References (30)

1. R. Aubin. Mechanizing Structural Induction: Part I and II. Theoretical Computer Science, 9: 329-362, 1979
2. R. Backhouse, P. Jansson, J. Jeuring, and L. Meertens. Generic ProgrammingAn Introduction-. In Advanced Functional Programming, LNCS 1608. SpringerVerlag, 1999
3. R. Bird. Introduction to Functional Programming using Haskell (2nd edition). Prentice-Hall, UK, 1998
4. R. S. Bird. The Promotion and Accumulation Strategies in Transformational Programming. A CM Transactions on Programming Languages and Systems, 6(4), October 1984
5. R. S. Bird and O. de Moor. Algebra of Programming. Prentice Hall, UK, 1997
6. R. S. Bird, P. F. Hoogendijk, and O. De Moor. Generic Programming with Relations and Functors. Journal of Functional Programming, 6(1): 1-28, 1996
7. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, 1979
8. R. M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. JACM, 24(1): 44-67, January 1977
9. R. Cockett and T. Fukushima. About Charity. Technical Report 92/480/18, University of Calgary, June 1992
10. R. Cockett and D. Spencer. Strong Categorical Datatypes 1. In R. A. C. Seely, editor, International Meeting on Category Theory 1991, volume 13 of Canadian Mathematical Society Conference Proceedings, pages 141-169, 1991
11. M. M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, The Netherlands, 1992
12. M. M. Fokkinga. Datatype Laws without Signatures. Mathematical Struct ures in Computer Science, 6: 1-32, 1996
13. J. Gibbons. Upwards and Downwards Accumulations on Trees. In R. S. Bird, C. C. Morgan, and J. C P. Woodcock, editors, Mathematics of Program Construction, LNCS 669. Springer-Verlag, 1993
14. J. Gibbons. Polytypic Downwards Accumulations. In Mathematics of Program Construction, LNCS 1422. Springer-Verlag, 1998
15. J. Gibbons. Generic Downwards Accumulations. Science of Computer Progra mming, 37(1-3): 37-65, 2000
16. J. Gibbons and G. Jones. The Under-Appreciated Unfold. In Proc. 3rd. ACM SIGPLAN International Conference on Functional Programming. ACM, September 1998
17. M. C. Henson. Elements of Functional Programmi ng. Computer Science Texts. Blackwell Scientific Publications, 1987
18. R. Hinze. Polytypic Programming with Ease. In 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'g9), Tsukuba, Japan., Lecture Notes in Compute r Scien ce Vol. 1722, pages 21-36. Springer-Verlag, 1999
19. Z. Hu, H. Iwasaki, and M. Takeichi. Calculating Accumulations. Technical Report METR 96-03, Faculty of Engineering, University of Tokyo, March 1996
20. B. Jacobs. Parameters and P arameterization in Specification, using distributive categories. Fundamenta Informaticae, 24(3): 209-250, 1995
21. B. Jacobs and J. Rutten. A tutorial on (co)a lgebras and (co)induction. Bulletin of EATCS, 62: 222-259, 1997
22. J. Jeuring. Theories for Algorithm Calculation. PhD thesis, Utrecht Universit y, 1993
23. D. J. Lehmann and M. B. Smith. Algebraic specificat ion of data types. Mathe matical Systems Theory, 14: 97-139, 1981
24. G. Malcolm. Data Structures and Program Transformation. S cience of Computer Programming, 14: 255-279, 1990
25. E. G. Manes and M. A. Arbib. Algebraic Approaches to Program S emantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986
26. Z. Manna and R. Waldinger. The Deductive Foundations of Computer Programming. Addison-Wesley, 1993
27. E. Meijer, M. Fokkinga, and R. Paterson. Func tional Prog ramming with Bananas, Lenses, Envelopes a nd Barbed Wire. In Proce edings of Functional Programming Languages and Computer Architecture'91, LNCS 523. SpringerVerlag, August 1991
28. A. Pardo. Towards Merging Recurs ion and Comonads. In Workshop on Generic Programming, Ponte de Lima, Portugal, July 2000. Technical Report UU-CS-2000-19, Utrecht University
29. A. Pardo. A Calculational Approach to Recursive Programs with Effects. PhD thesis, Technische Universitiit Darmstadt, O c tobe r 200 1
30. L. C. Paulson. ML for the Working Programmer. Cambridge University Press, Cambridge, UK, 1991