拡張可能作用 ― モナド変換子に取って代わるもの 9 - shiatsumat/fp-papers GitHub Wiki

参照

[1] A. Bauer and M. Pretnar. Programming with algebraic effects and handlers. arXiv:1203.1539 [cs.PL], 2012.

[2] E. C. Brady. Programming and reasoning with algebraic effects and dependent types. In ICFP [11], page To Appear.

[3] R. Cartwright and M. Felleisen. Extensible denotational language specifications. In M. Hagiya and J. C. Mitchell, editors, Theor. Aspects of Comp. Soft., number 789 in LNCS, pages 244-272. Springer, 1994.

[4] D. Espinosa. Modular denotational semantics. Unpublished manuscript, 1993.

[5] D. Espinosa. Building interpreters by transforming stratified monads. Unpublished manuscript, 1994.

[6] D. A. Espinosa. Semantic Lego. PhD thesis, Columbia University, New York, NY, USA, 1995. UMI Order No. GAX95-33546.

[7] A. Filinski. Representing monads. In POPL [26], pages 446-457.

[8] A. Filinski. Representing layered monads. In POPL ’99, pages 175-188, New York, NY, USA, 1999. ACM.

[9] R. Hinze. Deriving backtracking monad transformers. In ICFP ’00, pages 186-197. ACM Press, 2000.

[10] J. Hughes. The design of a pretty-printing library. In First Intl. Spring School on Adv. Functional Programming Techniques, pages 53-96, London, UK, UK, 1995. Springer-Verlag.

[11] ICFP. ICFP ’13, 2013. ACM Press.

[12] M. Jaskelioff and E. Moggi. Monad transformers as monoid transformers. Theor. Comp. Science, 411(51/52):4441 . 4466, 2010.

[13] O. Kammar, S. Lindley, and N. Oury. Handlers in action. In ICFP

[11], page To Appear.

[14] D. King and P. Wadler. Combining monads. In J. Launchbury and P. Sansom, editors, Functional Programming, Glasgow 1992, Workshops in Computing, pages 134-143. Springer London, 1993.

[15] O. Kiselyov, R. Lämmel, and K. Schupke. Strongly typed heterogeneous collections. In Proc. 2004 workshop on Haskell, pages 96-107, New York, NY, USA, 2004. ACM.

[16] O. Kiselyov, C.-c. Shan, and A. Sabry. Delimited dynamic binding. In ICFP ’06, pages 26-37. ACM Press, 2006.

[17] D. Leijen. Koka: A language with row-polymorphic effect inference. In 1st Workshop on Higher-Order Programming with Effects (HOPE 2012). ACM, September 2012.

[18] S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In POPL ’95, pages 333-343. ACM Press, 1995.

[19] C. Lüth and N. Ghani. Composing monads using coproducts. In ICFP ’02, pages 133-144. ACM Press, 2002.

[20] S. Marlow. An extensible dynamically-typed hierarchy of exceptions. In Proc. 2006 Haskell Workshop, pages 96-106. ACM Press, 2006.

[21] C. McBride. The Frank manual. https://personal.cis.strath.ac.uk/conor.mcbride/pub/Frank/, 2012.

[22] E. Moggi. Computational lambda-calculus and monads. In LICS, pages 14-23, Piscataway, NJ, USA, 1989. IEEE Press.

[23] E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Edinburgh Univ., 1989.

[24] B. O’Sullivan, J. Goerzen, and D. Stewart. Real world Haskell - code you can believe in. O’Reilly, 2008.

[25] G. Plotkin and M. Pretnar. Handlers of algebraic effects. In ESOP ’09, pages 80-94, Berlin, Heidelberg, 2009. Springer-Verlag.

[26] POPL. POPL ’94, 1994. ACM Press.

[27] T. Schrijvers and B. C. Oliveira. Monads, zippers and views: virtualizing the monad stack. In ICFP ’11, pages 32-44, New York, NY, USA, 2011. ACM.

[28] M. Shields and E. Meijer. Type-indexed rows. In POPL ’01, pages 261-275, London, United Kingdom, Jan. 17.19, 2001. ACM Press.

[29] G. L. Steele, Jr. How to compose monads. Technical report, Thinking Machines Corporation, Cambridge, Massachusetts, July 1993.

[30] G. L. Steele, Jr. Building interpreters by composing monads. In POPL [26], pages 472-492.

[31] N. Swamy, N. Guts, D. Leijen, and M. Hicks. Lightweight monadic programming in ML. In ICFP ’11, pages 15-27, Sept. 2011.

[32] W. Swierstra. Data types à la carte. J. Funct. Program., 18(4):423.436, July 2008.

[33] S. Visscher. Control.effects, 2012. URL http://github.com/sjoerdvisscher/effects.

[34] P. Wadler. The essence of functional programming. In POPL ’92, pages 1-14, New York, NY, USA, 1992. ACM.