Lightweight monadic programming in ML

Swamy, Nikhil; Guts, Nataliya; Leijen, Daan; Hicks, Michael

doi:10.1145/2034773.2034778

Cited by 27 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key difference is that monadic reflection interprets monadic computations in terms of other monadic computations, rather than abstracting over and interpreting operations. Swamy et al (2011) add support for monads in ML, providing direct-style effectful programming for a strict language. Unlike Frank, their system is based on monad transformers rather than effect handlers.…”

Section: Related Workmentioning

confidence: 99%

Doo bee doo bee doo

Convent¹,

Lindley²,

McBride³

et al. 2020

J. Funct. Prog.

View full text Add to dashboard Cite

Abstract We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar’s effect handler abstraction. Effect handlers provide an abstraction for modular effectful programming: a handler acts as an interpreter for a collection of commands whose interfaces are statically tracked by the type system. However, Frank eliminates the need for an additional effect handling construct by generalising the basic mechanism of functional abstraction itself. A function is but the special case of a Frank operator that interprets no commands. Moreover, Frank’s operators can be multihandlers which simultaneously interpret commands from several sources at once, without disturbing the direct style of functional programming with values. Effect typing in Frank employs a novel form of effect polymorphism which avoids mentioning effect variables in source code. This is achieved by propagating an ambient ability inwards, rather than accumulating unions of potential effects outwards. With the ambient ability describing the effects that are available at a certain point in the code, it can become necessary to reconfigure access to the ambient ability. A primary goal is to be able to encapsulate internal effects, eliminating a phenomenon we call effect pollution. Moreover, it is sometimes desirable to rewire the effect flow between effectful library components. We propose adaptors as a means for supporting both effect encapsulation and more general rewiring. Programming with effects and handlers is in its infancy. We contribute an exploration of future possibilities, particularly in combination with other forms of rich type systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Doo bee doo bee doo

Convent¹,

Lindley²,

McBride³

et al. 2020

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…Applying our two-step translation to lift, we obtain in F a computation-type coercion from ST a wp to ExnST a (lift wp). Through this coercion, and through F 's existing inference algorithm (Swamy et al 2011(Swamy et al , 2016, ST computations are implicitly promoted to ExnST computations whenever needed. In particular, the ST actions, get and put, are implicitly available with ExnST.…”

Section: Combining Monads: State and Exceptions In Two Waysmentioning

confidence: 99%

“…As seen above, the F implementation includes an inference algorithm (Swamy et al 2016) so that source programs may omit all explicit uses of the monadic return, bind and lift operators. We do not revisit that inference algorithm here and leave as future work a formal proof that after inference, F terms can be elaborated into EMF (along the lines of the elaboration of Swamy et al (2011)).…”

Section: Explicitly Monadic Fmentioning

confidence: 99%

Dijkstra monads for free

et al. 2017

Self Cite

View full text Add to dashboard Cite

Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads , they provide the basis on which verification tools like F*, Hoare Type Theory (HTT), and Ynot are built. We show that Dijkstra monads can be derived "for free" by applying a continuation-passing style (CPS) translation to the standard monadic definitions of the underlying computational effects. Automatically deriving Dijkstra monads in this way provides a correct-by-construction and efficient way of reasoning about user-defined effects in dependent type theories. We demonstrate these ideas in EMF*, a new dependently typed calculus, validating it via both formal proof and a prototype implementation within F*. Besides equipping F* with a more uniform and extensible effect system, EMF* enables a novel mixture of intrinsic and extrinsic proofs within F*.

show abstract

“…In work preceding their work on polymonads Swamy et al [44] presented a way to automatically insert bind and return operations into pure functional programs. Their work provides a way of writing implicitly monadic programs and also covers the integration of morphisms between different monads.…”

Section: Related Workmentioning

confidence: 99%

Supermonads: one notion to bind them all

Bracker

Nilsson

2016

Proceedings of the 9th International Symposium on Haskell

View full text Add to dashboard Cite

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.

show abstract

Lightweight monadic programming in ML

Cited by 27 publications

References 24 publications

Doo bee doo bee doo

Doo bee doo bee doo

Dijkstra monads for free

Supermonads: one notion to bind them all

Contact Info

Product

Resources

About