Supermonads: one notion to bind them all

Bracker, Jan and Nilsson, Henrik (2016) Supermonads: one notion to bind them all. In: Proceedings of the 9th International Symposium on Haskell (Haskell '16), 22-23 September 2016, Nara, Japan.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (348kB) | Preview

Abstract

Several popular generalizations of monads have been implemented in Haskell. Unfortunately, because the shape of the associated type constructors do not match the standard Haskell monad interface, each such implementation provides its own type class and versions of associated library functions. Furthermore, simultaneous use of different monadic notions can be cumbersome as it in general is necessary to be explicit about which notion is used where. In this paper we introduce supermonads: an encoding of monadic notions that captures several different generalizations along with a version of the standard library of monadic functions that work uniformly with all of them. As standard Haskell type inference does not work for supermonads due to their generality, our supermonad implementation is accompanied with a language extension, in the form of a plugin for the Glasgow Haskell Compiler (GHC), that allows type inference for supermonads, obviating the need for manual annotations.

Item Type: Conference or Workshop Item (Paper)
Keywords: Functional programming, Glasgow Haskell Compiler, Haskell, Monads, Syntactic support, Type checker plugin
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Nilsson, Henrik
Date Deposited: 01 Sep 2016 09:25
Last Modified: 26 Sep 2016 15:25
URI: http://eprints.nottingham.ac.uk/id/eprint/36156

Actions (Archive Staff Only)

Edit View Edit View