Recursive monadic bindings

Erkök, Levent; Launchbury, John

doi:10.1145/351240.351257

Cited by 35 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

Section: The Remote Applicative Functormentioning

confidence: 99%

The remote monad design pattern

et al. 2015

View full text Add to dashboard Cite

show abstract

“…This was used in the second version of the original Lava, which required that programs be written in value-recursive monadic style [EL00]. This avoids the pitfalls of observable sharing but requires that circuits be constructed using a totally different notation -for example, mdo must be used instead of Haskell's recursive let..in.…”

Section: Related Workmentioning

confidence: 99%

“…This is illustrated by the following two examples; the first shows recursion inside the brackets, which produces feedback: This distinction between recursion inside the brackets and recursion outside the brackets is closely related to monadic value recursion [EL00]. In fact, a term which uses recursion (LetRec) inside the brackets will be flattened to a GArrow term which relies on ga loop.…”

Section: Flatteningmentioning

confidence: 99%

Hardware Design with Generalized Arrows

Megacz

2012

Implementation and Application of Functional Languages

View full text Add to dashboard Cite

Abstract. Instances of the GArrow type class (Figure 2) are called generalized arrows. The GArrow class generalizes Control.Arrow by allowing any type-level monoid to take the place of the cartesian product (,) and by replacing arr with the "structural" functions usually defined in terms of it. This paper presents the first nontrivial application of generalized arrows. Previously, GHC had been extended 1 with environment classifiers and an additional compiler pass which implements the flattening transformation [Meg11]. In the present work this facility has been augmented to allow for programs in which level-0 terms consist of unrestricted Haskell, while level-1 terms are limited to a small κ-calculus [Has95] based language. The flattened, GArrow-parameterized term is then instantiated with the instance GArrowVerilog, which renders the term as a Verilog program, which is then synthesized and run on an FPGA.The sample application presented here is a bit-serial circuit which searches for SHA-256 hash collisions. The circuit has been synthesized on a Xilinx Spartan-6 FPGA and functions correctly.

show abstract

“…Still, strictness should not be confused with impurity, and to underline this distinction, we will assume a very general semantics that is open to both both lazy and strict interpretation in this paper. We hope to be able to report on the specifics of strictness in Timber in later work, especially concerning the treatment of recursive values and imprecise exceptions [4,11,8].…”

Section: The Functional Layermentioning

confidence: 99%

Programming Languages and Systems

Ohori¹

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a three-layered semantics of Timber, a language designed for programming real-time systems in a reactive, object-oriented style. The innermost layer amounts to a traditional deterministic, pure, functional language, around which we formulate a middle layer of concurrent objects, in terms of a monadic transition semantics. The outermost layer, where the language is married to deadline-driven scheduling theory, is where we define message ordering and CPU allocation to actions. Our main contributions are a formalized notion of a time-constrained reaction, and a demonstration of how scheduling theory, process calculii, and the lambda calculus can be jointly applied to obtain a direct and succinct semantics of a complex, real-world programming language with well-defined real-time behavior.

show abstract

Recursive monadic bindings

Cited by 35 publications

References 12 publications

The remote monad design pattern

The remote monad design pattern

Hardware Design with Generalized Arrows

Programming Languages and Systems

Contact Info

Product

Resources

About