Just do it: Simple monadic equational reasoning

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2011, Pages 2-14

  Gibbons, Jeremy ^a   Hinze, Ralf ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Algebraic specification; Equational reasoning; Lawvere theories; Monads

Indexed keywords

ALGEBRAIC SPECIFICATIONS; AXIOMATIC APPROACH; COMPUTATIONAL EFFECTS; EQUATIONAL REASONING; FUNCTIONAL EVALUATION; LAWVERE THEORY; MONADS;

COMPUTER PROGRAMMING LANGUAGES;

FUNCTIONAL PROGRAMMING;

EID: 80054080740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2034773.2034777     Document Type: Conference Paper

References (40)

1. N. Benton, J. Hughes, and E. Moggi. Monads and effects. In G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, editors, APPSEM 2000, volume 2395 of LNCS, pages 42-122. Springer, 2002.
2. L. Erkök and J. Launchbury. Recursive monadic bindings. In ICFP, pages 174-185. ACM, September 2000.
3. M. Erwig and S. Kollmansberger. Probabilistic functional programming in Haskell. J. Funct. Prog., 16(1):21-34, 2006.
4. J. Gibbons and R. Bird. Effective reasoning about effectful traversals. Work in progress, Mar. 2011.
5. M. Giry. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis, volume 915 of LNM, pages 68-85. Springer, 1981.
6. S. Goncharov, L. Schröder, and T. Mossakowski. Kleene monads: Handling iteration in a framework of generic effects. In CALCO, volume 5728 of LNCS, pages 18-33, 2009.
7. R. Hinze. Prolog's control constructs in a functional setting: Axioms and implementation. Intern. J. Found. Comput. Sci., 12(2):125-170, 2001.
8. C. A. R. Hoare. A couple of novelties in the propositional calculus. Z. Math. Logik Grundlag. Math., 31(2):173-178, 1985.
9. G. Hutton and D. Fulger. Reasoning about effects: Seeing the wood through the trees. In TFP, May 2008.
10. M. Hyland and J. Power. The category theoretic understanding of universal algebra: Lawvere theories and monads. Electron. Notes Theoret. Comput. Sci., 172:437-458, 2007.
11. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In LICS, pages 186-195, 1989.
12. F.W. Lawvere. The category of probabilistic mappings. Preprint-we haven't managed to obtain a copy of this manuscript, 1962.
13. F. W. Lawvere. Functorial Semantics of Algebraic Theories. PhD thesis, Columbia University, 1963. Also available with commentary as Theory and Applications of Categories Reprint 5.
14. S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.
15. A. McIver and C. Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Springer Verlag, 2005.
16. E. Moggi. Notions of computation and monads. Inform. & Comput., 93(1), 1991.
17. A. Nanevski, G. Morrisett, and L. Birkedal. Hoare Type Theory, polymorphism and separation. J. Funct. Prog., 18(5,6):865-911, 2008.
18. A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal. Ynot: Dependent types for imperative programs. In ICFP, pages 229-240, 2008.
19. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In POPL, pages 268-280, 2004.
20. B. O'Sullivan, J. Goerzen, and D. Stewart. Real World Haskell. O'Reilly, 2008.
21. S. Peyton Jones. Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. In T. Hoare, M. Broy, and R. Steinbrüggen, editors, Engineering Theories of Software Construction, volume 180 of NATO Science Series, pages 47-96. IOS Press, 2001.
22. S. Peyton Jones. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
23. S. Peyton Jones and P. Wadler. Imperative functional programming. In POPL, pages 71-84, 1993.
24. G. Plotkin and J. Power. Notions of computation determine monads. In FOSSACS, volume 2303 of LNCS, pages 342-356, 2002.
25. G. Plotkin and J. Power. Algebraic operations and generic effects. Appl. Cat. Struct., 11(1):69-94, 2003.
26. G. D. Plotkin and M. Pretnar. Handlers of algebraic effects. In ESOP, volume 5502 of LNCS, pages 80-94, 2009.
27. N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In POPL, pages 154-165, 2002.
28. J. Rosenhouse. The Monty Hall Problem: The Remarkable Story of Math's Most Contentious Brain Teaser. Oxford University Press, 2009.
29. L. Schröder and T. Mossakowski. HASCASL: Integrated higher-order specification and program development. Theoretical Comput. Sci., 410(12-13):1217-1260, 2009.
30. W. Swierstra. A Functional Specification of Effects. PhD thesis, University of Nottingham, November 2008.
31. W. Swierstra. A Hoare logic for the state monad. In TPHOLs, volume 5674 of LNCS, pages 440-451. Springer-Verlag, 2009.
32. W. Swierstra and T. Altenkirch. Beauty in the beast. In Haskell Workshop, pages 25-36, 2007.
33. R. Tix. Continuous D-Cones: Convexity and Powerdomain Constructions. PhD thesis, Technische Universität Darmstadt, 1999.
34. D. Varacca and G. Winskel. Distributing probability over nondeterminism. Math. Struct. Comput. Sci., 16(1):87-113, 2006.
35. M. Vos Savant. Ask Marilyn. Parade Magazine, 9th September 1990. See also http://www.marilynvossavant.com/articles/gameshow.html.
36. P. Wadler. A critique of Abelson and Sussman: Why calculating is better than scheming. SIGPLAN Not., 22(3):8, 1987.
37. P. Wadler. Comprehending monads. Math. Struct. Comput. Sci., 2(4):461-493, 1992.
38. P. Wadler. Monads for functional programming. In M. Broy, editor, Program Design Calculi: Proceedings of the Marktoberdorf Summer School, 1992.
39. A. Yakeley, et al. MonadPlus reform proposal. http://www.haskell.org/ haskellwiki/MonadPlus-reform-proposal, Jan. 2006.
40. W. Yi and K. G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47-61, 1992.