Bringing Back Monad Comprehensions
George Giorgidze • Torsten Grust • Nils Schweinsberg • Jeroen Weijers
Proceedings of the ACM SIGPLAN Haskell Symposium (Haskell 2011), Tokyo, Japan. ACM, 2011.
This paper is about a Glasgow Haskell Compiler (GHC) extension that generalises Haskell’s list comprehension notation to monads. The monad comprehension notation implemented by the extension supports generator and filter clauses, as was the case in the Haskell 1.4 standard. In addition, the extension generalises the recently proposed parallel and SQL-like list comprehension notations to monads. The aforementioned generalisations are formally defined in this paper. The extension will be available in GHC 7.2.
This paper gives several instructive examples that we hope will facilitate wide adoption of the extension by the Haskell community. We also argue why the
do notation is not always a good fit for monadic libraries and embedded domain-specific languages, especially for those that are based on collection monads. Should the question of how to integrate the extension into the Haskell standard arise, the paper proposes a solution to the problem that led to the removal of the monad comprehension notation from the language standard.
Also available: Video