A recursive do for Haskell

Erkök, Levent; Launchbury, John

doi:10.1145/581690.581693

Cited by 20 publications

(21 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At this stage we have no such claim. But one does notice several variations and extensions of Arrows appearing, such as Biarrows [1], or a need for recursion schemes, and thus the need for a foundation, of monads/Arrows [7,3,19]. Our categorical reformulation as monoids might give guidance for the proper formulation of such variations.…”

Section: Discussionmentioning

confidence: 99%

Arrows, like Monads, are Monoids

Heunen

Jacobs

2006

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Monads are by now well-established as programming construct in functional languages. Recently, the notion of "Arrow" was introduced by Hughes as an extension, not with one, but with two type parameters. At first, these Arrows may look somewhat arbitrary. Here we show that they are categorically fairly civilised, by showing that they correspond to monoids in suitable subcategories of bifunctors C op × C → C. This shows that, at a suitable level of abstraction, arrows are like monads -which are monoids in categories of functors C → C. Freyd categories have been introduced by Power and Robinson to model computational effects, well before Hughes' Arrows appeared. It is often claimed (informally) that Arrows are simply Freyd categories. We shall make this claim precise by showing how monoids in categories of bifunctors exactly correspond to Freyd categories.

show abstract

Section: Discussionmentioning

confidence: 99%

Arrows, like Monads, are Monoids

Heunen

Jacobs

2006

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Crucially, there are not any external effects inside our inner monad. We build send using recursive do notation [16,17]. If our list of Prims contains only Commands, then we send it asynchronously to our remote device.…”

Section: The Remote Applicative Functormentioning

confidence: 99%

The remote monad design pattern

et al. 2015

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

“…Indeed, z is a value computed by g (knil , kcons) but in turn used by knil and kcons. An interesting feature of this law is the fact that the introduction of the circularity needs the use of a recursive binding within a monadic computation, and therefore require the monad to be recursive [8]. A recursive do (mdo-notation) is supported by Haskell for those monads that are declared an instance of the MonadFix class.…”

Section: Law 21 (Pfold/mbuildp For Lists)mentioning

confidence: 99%

“…Observe that the introduction of the circularity on z requires the monad to be recursive [8] as it is necessary the use of a circular binding within a monadic computation. In Haskell terms, this can be expressed using the mdo-notation provided that the monad is an instance of the MonadFix class.…”

Section: Monadic Shortcut Fusionmentioning

confidence: 99%

Shortcut fusion rules for the derivation of circular and higher-order monadic programs

Pardo

Fernandes

Saraiva

2009

Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Functional programs often combine separate parts using intermediate data structures for communicating results. These programs are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs.Recently, we have extended standard shortcut fusion: in addition to intermediate structures, the program parts may now communicate context information, and it still is possible to eliminate those structures. This is achieved by transforming the original function composition into a circular program. This new technique, however, has been studied in the context of purely functional programs only. In this paper, we propose an extension to this new form of fusion, but in the context of monadic programming: we derive monadic circular programs from strict ones, maintaining the global effects. Later, the circularities in the derived programs are traded by highorder definitions, using a well-known program transformation technique. We finally obtain very efficient deforested programs.An important feature of our extensions is that they can be uniformly defined for a wide class of data types and monads, using generic calculation rules.

show abstract

A recursive do for Haskell

Cited by 20 publications

References 7 publications

Arrows, like Monads, are Monoids

Arrows, like Monads, are Monoids

The remote monad design pattern

Shortcut fusion rules for the derivation of circular and higher-order monadic programs

Contact Info

Product

Resources

About