Unified notions of generalised monads and applicative functorsTools Bracker, Jan (2018) Unified notions of generalised monads and applicative functors. PhD thesis, University of Nottingham.
AbstractMonads and applicative functors are staple design patterns to handle effects in pure functional programming, especially in Haskell with its built-in syntactic support. Over the last decade, however, practical needs and theoretical research have given rise to generalisations of monads and applicative functors. Examples are graded, indexed and constrained monads. The problem with these generalisations is that no unified representation of standard and generalised monads or applicatives exists in theory or practice. As a result, in Haskell, each generalisation has its own representation and library of functions. Hence, interoperability among the different notions is hampered and code is duplicated.
Actions (Archive Staff Only)
|