Combining datatypes and effects

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

Volumn 3622 LNCS, Issue , 2005, Pages 171-209

  Pardo, Alberto ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING; ENCAPSULATION; MATHEMATICAL MODELS; SPECIFICATIONS;

ALGEBRAIC LAWS; FUNCTIONAL PROGRAMS; RECURSION SCHEMES; RECURSIVE PROGRAMS;

DATABASE SYSTEMS;

EID: 33646022280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546382_4     Document Type: Conference Paper

References (31)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
2. N. Benton, J. Hughes, and E. Moggi. Monads and Effects. In APPSEM 2000 Summer School, LNCS 2395. Springer-Verlag, 2002.
3. R. Bird. Introduction to Functional Programming using Haskell, 2nd edition. Prentice-Hall, UK, 1998.
4. R.S. Bird and O. de Moor. Algebra of Programming. Prentice Hall, UK, 1997.
5. Chih-Ping Chen and P. Hudak. Rolling Your Own Mutable ADT - A Connection Between Linear Types and Monads. In 24th Symposium on Principles of Programming Languages, pages 54-66. ACM, January 1997.
6. M.M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, The Netherlands, 1992.
7. M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994.
8. J. Gibbons. Calculating Functional Programs. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, LNCS 2297, pages 148-203. Springer-Verlag, January 2002.
9. J. Gibbons and G. Jones. The Under-Appreciated Unfold. In 3rd. International Conference on Functional Programming. ACM, September 1998.
10. A. Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, UK, 1996.
11. A. Gill, J. Launchbury, and S. Peyton Jones. A Shortcut to Deforestation. In Conference on Functional Programming and Computer Architecture, 1993.
12. G. Hutton. Fold and Unfold for Program Semantics. In 3rd. International Conference on Functional Programming. ACM, September 1998.
13. S. Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign language calls in Haskell. In Engineering theories of software construction, Marktoberdorf Summer School 2000. NATO ASI Series, IOS press, 2001.
14. S. Peyton Jones and J. Launchbury. Lazy functional state threads. In Symposium on Programming Language Design and Implementation (PLDI'94), pages 24-35. ACM, 1994.
15. D. King. Functional Programming and Graph Algorithms. PhD thesis, Department of Computing Science, University of Glasgow, UK, March 1996.
16. D. King and J. Launchbury. Structuring depth-first search algorithms in Haskell. In 22nd Symposium on Principles of Programming Languages, pages 344-354. ACM, 1995.
17. J. Launchbury. Graph Algorithms with a Functional Flavour. In Advanced Functional Programming, LNCS 925. Springer-Verlag, 1995.
18. E. Meijer, M. Fokkinga, and R. Paterson. Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In Functional Programming Languages and Computer Architecture'91, LNCS 523. Springer-Verlag, August 1991.
19. E. Meijer and G. Hutton. Bananas in space: Extending fold and unfold to exponential types. In Functional Programming Languages and Computer Architecture'95, pages 324-333, 1995.
20. E. Meijer and J. Jeuring. Merging Monads and Folds for Functional Programming. In Advanced Functional Programming, LNCS 925, pages 228-266. Springer-Verlag, 1995.
21. E. Moggi. Notions of Computation and Monads. Information and Computation, 93:55-92, 1991.
22. P.S. Mulry. Lifting Theorems for Kleisli Categories. In 9th International Conference on Mathematical Foundations of Programming Semantics, LNCS 802, pages 304-319. Springer-Verlag, 1993.
23. Y. Onoue, Z. Hu, H. Iwasaki, and M. Takeichi. A Calculational Fusion System HYLO. In IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, pages 76-106. Chapman &: Hall, February 1997.
24. A. Pardo. A Calculational Approach to Recursive Programs with Effects. PhD thesis, Technische Universität Darmstadt, October 2001.
25. A. Pardo. Fusion of Recursive Programs with Computational Effects. Theoretical Computer Science, 260:165-207, 2001.
26. S. Peyton-Jones and P. Wadler. Imperative Functional Programming. In 20th Annual Symposium on Principles of Programming Languages, Charlotte, North Carolina, 1993. ACM.
27. A. Takano and E. Meijer. Shortcut to Deforestation in Calculational Form. In Functional Programming Languages and Computer Architecture'95, 1995.
28. D. Tuijnman. A Categorical Approach to Functional Programming. PhD thesis, Fakultät für Informatik, Universität Ulm, Germany, January 1996.
29. P. Wadler. Theorems for free! In 4th International Conference on Functional Programming and Computer Architecture, London, 1989.
30. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.
31. P. Wadler. Monads for functional programming. In Advanced Functional Programming, LNCS 925. Springer-Verlag, 1995.