On Mon, Feb 20, 2012 at 7:42 PM, Roman Cheplyaka <r...@ro-che.info> wrote:
> Is there any other interpretation in which the Reader monad obeys the > laws? If "selective strictness" (the seq combinator) would exclude function types, the difference between undefined and \_ -> undefined could not be observed. This reminds me of the different language levels used by the free theorem generator [1] and the discussions whether seq should have a type-class constraint.. Sebastian [1]: http://www-ps.iai.uni-bonn.de/cgi-bin/free-theorems-webui.cgi
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
