The constrained-monad problem

Sculthorpe, Neil; Bracker, Jan; Giorgidze, George; Gill, Andy

doi:10.1145/2500365.2500602

Cited by 22 publications

(12 citation statements)

References 33 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constrained monads [37] thus do not fit into the present polymonad framework. We suspect that the introduction of constrained polymonads is possible by using techniques similar to those used when introducing constrained monads.…”

Section: Future Workmentioning

confidence: 88%

“…Over the last few years, generalizations such as constrained [37] and parameterized monads [3] have been investigated, in a quest for more flexibility and enhanced static checks partly enabled by improved support for type-level programming [20,47]. Parameterized monads have proven to be especially popular: they have been used to model session-types [34], effect systems [30,23], information flow control [9] and composable continuations [46].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polymonad programming in Haskell

Bracker

Nilsson

2015

Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages

Self Cite

View full text Add to dashboard Cite

Polymonads were recently introduced by Hicks et al. as a unified approach to programming with different notions of monads. Their work was mainly focused on foundational aspects of the approach. In this article, we show how to incorporate the notion of polymonads into Haskell, which is the first time this has been done in a full-scale language. In particular, we show how polymonads can be represented in Haskell, give a justification of the representation through proofs in Agda, and provide a plugin for the Glasgow Haskell Compiler (GHC) that enables their use in practice. Finally, we demonstrate the utility of our system by means of examples concerned with session types and the parameterized effect monad. This work provides a common representation of a number of existing approaches to generalized monads in Haskell.

show abstract

Section: Future Workmentioning

confidence: 88%

Section: Introductionmentioning

confidence: 99%

Polymonad programming in Haskell

Bracker

Nilsson

2015

Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages

Self Cite

View full text Add to dashboard Cite

show abstract

“…In some cases, a deep embedding together with normalization can provide an alternative way to work with constrained monads without going beyond the standard monad class [40].…”

Section: Monadic Notionsmentioning

confidence: 99%

“…However, this is not the case. The vectors [40,47] briefly mentioned in Section 2 require an equality constraint on the Return instance and they also require a constraint on a in the Bind instance. Another example where constraints in any of these locations are necessary would be embedded domain specific languages [8,36].…”

Section: Representation In Haskellmentioning

confidence: 99%

Supermonads: one notion to bind them all

Bracker

Nilsson

2016

Proceedings of the 9th International Symposium on Haskell

Self Cite

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

“…There are also tagless-final DSLs [6], where there is no early commitment to a specific embedding, but instead class overloading in used to specify the API. Several Haskell DSLs, including Feldspar [37] and Obsidian [8], reify the structure of monadic code [40,41] to generate external imperative code. Other DSLs, including CoPilot [38] and Ivory [24], use a shallow embedding of statements to capture the monadic structure.…”

Section: Other Related Workmentioning

confidence: 99%

The remote monad design pattern

et al. 2015

Self Cite

View full text Add to dashboard Cite

Remote Procedure Calls are expensive. This paper demonstrates how to reduce the cost of calling remote procedures from Haskell by using the remote monad design pattern, which amortizes the cost of remote calls. This gives the Haskell community access to remote capabilities that are not directly supported, at a surprisingly inexpensive cost.We explore the remote monad design pattern through six models of remote execution patterns, using a simulated Internet of Things toaster as a running example. We consider the expressiveness and optimizations enabled by each remote execution model, and assess the feasibility of our approach. We then present a full-scale case study: a Haskell library that provides a Foreign Function Interface to the JavaScript Canvas API. Finally, we discuss existing instances of the remote monad design pattern found in Haskell libraries.

show abstract

The constrained-monad problem

Cited by 22 publications

References 33 publications

Polymonad programming in Haskell

Polymonad programming in Haskell

Supermonads: one notion to bind them all

The remote monad design pattern

Contact Info

Product

Resources

About