From HaskellWiki
Jump to navigation Jump to search

MList is a monadic-list, aiming to be an alternative to lazy I/O.

MList is parameterized on a monadic type, such that folding the list executes actions of that monad.

A value of type: MList IO a represents a list of a's whose evaluation continually requires executing actions in IO.

MLists do not cache results -- re-iterating an MList will re-execute the actions in the MList.