On Mon, Feb 20, 2012 at 7:42 PM, Roman Cheplyaka <span dir="ltr"><<a href="mailto:roma@ro-che.info">roma@ro-che.info</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Is there any other interpretation in which the Reader monad obeys the<br>
laws?</blockquote><div><br></div><div>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..</div>
<div><br></div><div>Sebastian</div><div><br></div><div>[1]: <a href="http://www-ps.iai.uni-bonn.de/cgi-bin/free-theorems-webui.cgi">http://www-ps.iai.uni-bonn.de/cgi-bin/free-theorems-webui.cgi</a></div></div>