Simple and compositional reification of monadic embedded languages

Authors:
Josef David Svenningsson;Bo Joel Svensson
Affiliations:
Chalmers University of Technology, Gothenburg, Sweden;Chalmers University of Technology, Gothenburg, Sweden
Venue:
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Year:
2013

Citing 6
Cited 0

The Haskell School of Expression: Learning Functional Programming through Multimedia

The Haskell School of Expression: Learning Functional Programming through Multimedia
Data types à la carte

Journal of Functional Programming
Expressive array constructs in an embedded GPU kernel programming language

DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
A generic abstract syntax model for embedded languages

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Generic monadic constructs for embedded languages

IFL'11 Proceedings of the 23rd international conference on Implementation and Application of Functional Languages
The constrained-monad problem

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

When writing embedded domain specific languages in Haskell, it is often convenient to be able to make an instance of the Monad class to take advantage of the do-notation and the extensive monad libraries. Commonly it is desirable to compile such languages rather than just interpret them. This introduces the problem of monad reification, i.e. observing the structure of the monadic computation. We present a solution to the monad reification problem and illustrate it with a small robot control language. Monad reification is not new but the novelty of our approach is in its directness, simplicity and compositionality.