Lightweight monadic programming in ML

@inproceedings{Swamy2011LightweightMP,
  title={Lightweight monadic programming in ML},
  author={Nikhil Swamy and Nataliya Guts and Daan Leijen and Michael Hicks},
  booktitle={ICFP},
  year={2011}
}
Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional reactive programming, parsing, and information flow tracking, not to mention effectful functionality like state and I/O. In this paper, we present a type-based rewriting algorithm to make programming with arbitrary monads as easy as using ML's built-in support for state and I/O. Developers write programs using monadic values of type m τ as if they were of type τ, and our… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS
32 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A theory of qualified types

  • Mark P. Jones
  • In ESOP,
  • 1992
Highly Influential
6 Excerpts

Coercions in Hindley-Milner sys tems

  • Z. Luo, R. Kießling
  • In Proc. of Types
  • 2004
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…