<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Are continuations really the mother of all monads?</title>
	<atom:link href="http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/</link>
	<description>Math, Computer Science,  and Education</description>
	<lastBuildDate>Fri, 30 Dec 2011 22:45:19 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Mauro Jaskelioff</title>
		<link>http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/#comment-153</link>
		<dc:creator><![CDATA[Mauro Jaskelioff]]></dc:creator>
		<pubDate>Thu, 24 Nov 2011 15:03:59 +0000</pubDate>
		<guid isPermaLink="false">http://blog.melding-monads.com/?p=132#comment-153</guid>
		<description><![CDATA[I&#039;d like to clarify the comment by lpsmith. My point in Modular Monad Transformers, is that the lifting in the MTL of callCC through StateT behaved differently than other liftings of callCC in the library (that&#039;s why I argue is not the correct one). Furthermore I provided a uniform way of lifting callCC through *any* monad transformer, which I think is the correct, uniform, way of doing it.
Consequently, lifting callCC (as defined in the paper) should be a simple matter of post-composing lift.]]></description>
		<content:encoded><![CDATA[<p>I&#8217;d like to clarify the comment by lpsmith. My point in Modular Monad Transformers, is that the lifting in the MTL of callCC through StateT behaved differently than other liftings of callCC in the library (that&#8217;s why I argue is not the correct one). Furthermore I provided a uniform way of lifting callCC through *any* monad transformer, which I think is the correct, uniform, way of doing it.<br />
Consequently, lifting callCC (as defined in the paper) should be a simple matter of post-composing lift.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: lpsmith</title>
		<link>http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/#comment-132</link>
		<dc:creator><![CDATA[lpsmith]]></dc:creator>
		<pubDate>Sun, 31 Jul 2011 16:09:30 +0000</pubDate>
		<guid isPermaLink="false">http://blog.melding-monads.com/?p=132#comment-132</guid>
		<description><![CDATA[In a conversation with Edward Kmett,  he suggested that the Lazy State Monad is, arguably,  not a monad in the categorical sense,  because &lt;code&gt;fmap id ≠ id&lt;/code&gt;.   In particular,   &lt;code&gt;fmap id ⊥ = λ _ → (⊥,⊥)&lt;/code&gt;.]]></description>
		<content:encoded><![CDATA[<p>In a conversation with Edward Kmett,  he suggested that the Lazy State Monad is, arguably,  not a monad in the categorical sense,  because <code>fmap id ≠ id</code>.   In particular,   <code>fmap id ⊥ = λ _ → (⊥,⊥)</code>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: lpsmith</title>
		<link>http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/#comment-65</link>
		<dc:creator><![CDATA[lpsmith]]></dc:creator>
		<pubDate>Sat, 06 Feb 2010 21:47:20 +0000</pubDate>
		<guid isPermaLink="false">http://blog.melding-monads.com/?p=132#comment-65</guid>
		<description><![CDATA[It was pointed out to me by Russell O&#039;Connor, Dan Doel, and others that &lt;code&gt;StateT st (Cont r)&lt;/code&gt; is in fact the exact same monad as &lt;code&gt;ContT r (State st)&lt;/code&gt; in the context of the Monad Transformer Library.   However, &lt;a href=&quot;http://www.fceia.unr.edu.ar/~mauro/&quot; rel=&quot;nofollow&quot;&gt;Mauro Jaskelioff&lt;/a&gt; in his paper &lt;a href=&quot;http://www.fceia.unr.edu.ar/~mauro/pubs/mmt/mmt.pdf&quot; rel=&quot;nofollow&quot;&gt;Modular Monad Transformers&lt;/a&gt;  argues in Section 4 that it is more natural for &lt;code&gt;callCC&lt;/code&gt; to be lifted differently in the &lt;code&gt;StateT st (Cont r)&lt;/code&gt; case,  so that it differs from the instance of &lt;code&gt;callCC&lt;/code&gt; for &lt;code&gt;ContT r (State st)&lt;/code&gt;.    According to Jaskelioff,  the MTL&#039;s lifting is correct in the second case,  but not in the first.

The two liftings are also mentioned in Monad Transformers and Modular Interpreters in Section 8.3,  which includes a few other references to where each has appeared in the literature.]]></description>
		<content:encoded><![CDATA[<p>It was pointed out to me by Russell O&#8217;Connor, Dan Doel, and others that <code>StateT st (Cont r)</code> is in fact the exact same monad as <code>ContT r (State st)</code> in the context of the Monad Transformer Library.   However, <a href="http://www.fceia.unr.edu.ar/~mauro/" rel="nofollow">Mauro Jaskelioff</a> in his paper <a href="http://www.fceia.unr.edu.ar/~mauro/pubs/mmt/mmt.pdf" rel="nofollow">Modular Monad Transformers</a>  argues in Section 4 that it is more natural for <code>callCC</code> to be lifted differently in the <code>StateT st (Cont r)</code> case,  so that it differs from the instance of <code>callCC</code> for <code>ContT r (State st)</code>.    According to Jaskelioff,  the MTL&#8217;s lifting is correct in the second case,  but not in the first.</p>
<p>The two liftings are also mentioned in Monad Transformers and Modular Interpreters in Section 8.3,  which includes a few other references to where each has appeared in the literature.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Noam Zeilberger</title>
		<link>http://blog.melding-monads.com/2009/12/20/are-continuations-really-the-mother-of-all-monads/#comment-46</link>
		<dc:creator><![CDATA[Noam Zeilberger]]></dc:creator>
		<pubDate>Tue, 22 Dec 2009 20:22:39 +0000</pubDate>
		<guid isPermaLink="false">http://blog.melding-monads.com/?p=132#comment-46</guid>
		<description><![CDATA[&gt; One thing is clear, however: its tricky to generalize Filinski’s Representing Monads to lazy evaluation, if indeed it is possible to do so fully.

You should read &lt;a href=&quot;http://www.osl.iu.edu/publications/prints/2009/garcia09popl-lazy.pdf&quot; rel=&quot;nofollow&quot;&gt;Lazy Evaluation and Delimited Control&lt;/a&gt; by Garcia, Lumsdaine and Sabry.  I don&#039;t fully understand the paper yet, but I think it gives some sort of affirmative answer.]]></description>
		<content:encoded><![CDATA[<p>&gt; One thing is clear, however: its tricky to generalize Filinski’s Representing Monads to lazy evaluation, if indeed it is possible to do so fully.</p>
<p>You should read <a href="http://www.osl.iu.edu/publications/prints/2009/garcia09popl-lazy.pdf" rel="nofollow">Lazy Evaluation and Delimited Control</a> by Garcia, Lumsdaine and Sabry.  I don&#8217;t fully understand the paper yet, but I think it gives some sort of affirmative answer.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

