Handlers in action

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

Volumn , Issue , 2013, Pages 145-158

  Kammar, Ohad ^a   Lindley, Sam ^b   Oury, Nicolas ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^c NONE

Author keywords

Algebraic effects; Continuations; Effect handlers; Effect typing; Haskell; Modularity; Monads

Indexed keywords

ALGEBRAIC EFFECTS; CONTINUATIONS; EFFECT HANDLERS; EFFECT TYPING; HASKELL; MODULARITY; MONADS;

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING;

ALGEBRA;

EID: 84887165140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2500365.2500590     Document Type: Conference Paper

References (46)

1. Z. M. Ariola, H. Herbelin, and A. Sabry. A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation, 22(3): 233-273, 2009.
2. A. Bauer and M. Pretnar. Programming with algebraic effects and handlers. CoRR, abs/1203.1539, 2012.
3. N. Benton and A. Kennedy. Exceptional syntax. J. Funct. Program., 11(4): 395-410, 2001.
4. N. Benton, J. Hughes, and E. Moggi. Monads and effects. In APPSEM 2000. Springer-Verlag, 2002.
5. M. Blume, U. A. Acar, and W. Chae. Exception handlers as extensible cases. In APLAS. Springer-Verlag, 2008.
6. E. Brady. Programming and reasoning with algebraic effects and dependent types. In ICFP. ACM, 2013.
7. B. C. d. S. Oliveira, T. Schrijvers, and W. R. Cook. MRI: Modular reasoning about interference in incremental programming. J. Funct. Program., 22(6): 797-852, 2012.
8. O. Danvy and A. Filinski. Abstracting control. In LFP. ACM, 1990.
9. M. Felleisen. The theory and practice of first-class prompts. In POPL. ACM, 1988.
10. A. Filinski. Representing layered monads. In POPL. ACM, 1999.
11. A. Filinski. Monads in action. In POPL. ACM, 2010.
12. A. Gill. The mtl package (2.1.2), 2012. http://hackage.haskell.org/ package/mtl.
13. G. Gonzalez. pipes-2.5: Faster and slimmer, 2012. http://www. haskellforall.com/2012/10/pipes-25-faster-and-slimmer.html.
14. G. Gonzalez. The pipes package (3.2.0), 2013. http://hackage.haskell.org/ package/pipes.
15. M. Hyland, G. D. Plotkin, and J. Power. Combining effects: Sum and tensor. Theoret. Comput. Sci., pages 70-99, 2006.
16. M. Jaskelioff. Monatron: An extensible monad transformer library. In IFL. Springer-Verlag, 2008.
17. M. Jaskelioff and E. Moggi. Monad transformers as monoid transformers. Theoret. Comput. Sci., 411(51-52), 2010.
18. M. P. Jones. Functional programming with overloading and higher-order polymorphism. In Advanced Functional Programming, 1995.
19. O. Kammar and G. D. Plotkin. Algebraic foundations for effect-dependent optimisations. In POPL. ACM, 2012.
20. S. Katsumata. Relating computational effects by ⊇⊇-lifting. Inf. Comput, 222, 2013.
21. O. Kiselyov. Iteratees. In FLOPS. Springer-Verlag, 2012.
22. O. Kiselyov and C.-c. Shan. Embedded probabilistic programming. In DSL. Springer-Verlag, 2009.
23. X. Leroy and F. Pessaux. Type-based analysis of uncaught exceptions. ACM Trans. Program. Lang. Syst., pages 340-377, 2000.
24. P. B. Levy. Call-By-Push-Value: A Functional/Imperative Synthesis, Volume 2 of Semantics Structures in Computation. Springer, 2004.
25. S. Liang, P. Hudak, and M. P. Jones. Monad transformers and modular interpreters. In POPL. ACM, 1995.
26. S. Lindley. Extensional rewriting with sums. In TLCA. Springer-Verlag, 2007.
27. S. Lindley and J. Cheney. Row-based effect types for database integration. In TLDI. ACM, 2012.
28. G. Mainland. Why it's nice to be quoted: quasiquoting for Haskell. In Haskell. ACM, 2007.
29. C. McBride. Frank (0.3), 2012. http://hackage.haskell.org/package/Frank.
30. E. Moggi. Computational lambda-calculus and monads. In LICS. IEEE Computer Society, 1989.
31. B. O'Sullivan. The criterion package (0.8.0.0), 2013. http://hackage.haskell.org/package/criterion.
32. A. S. Patricia Johann and J. Voigtländer. A generic operational metatheory for algebraic effects. In LICS. IEEE Computer Society, 2010.
33. G. D. Plotkin and J. Power. Adequacy for algebraic effects. In FoSSaCS. Springer-Verlag, 2001.
34. G. D. Plotkin and J. Power. Notions of computation determine monads. In FoSSaCS. Springer-Verlag, 2002.
35. G. D. Plotkin and J. Power. Algebraic operations and generic effects. Appl. Categ. Structures, 11(1): 69-94, 2003.
36. G. D. Plotkin and M. Pretnar. Handlers of algebraic effects. In ESOP. Springer-Verlag, 2009.
37. D. Rémy. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
38. T. Schrijvers and B. C. d. S. Oliveira. Monads, zippers and views: virtualizing the monad stack. In ICFP. ACM, 2011.
39. C.-c. Shan. A static simulation of dynamic delimited control. HigherOrder and Symbolic Computation, 20(4): 371-401, 2007.
40. T. Sheard and S. L. P. Jones. Template meta-programming for Haskell. SIGPLAN Notices, 37(12): 60-75, 2002.
41. S. Staton. Two cotensors in one: Presentations of algebraic theories for local state and fresh names. Electr. Notes Theor. Comput. Sci., 249: 471-490, 2009.
42. N. Swamy, N. Guts, D. Leijen, and M. Hicks. Lightweight monadic programming in ML. In ICFP. ACM, 2011.
43. W. Swierstra. Data types à la carte. J. Funct. Program., 18(4): 423-436, 2008.
44. S. Visscher. The effects package (0.2.2), 2012. http://hackage.haskell. org/package/effects.
45. J. Voigtländer. Asymptotic improvement of computations over free monads. In MPC. Springer-Verlag, 2008.
46. P. Wadler. Monads for functional programming. In Advanced Functional Programming. Springer-Verlag, 1995.