<?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: Honours + LXDE</title>
	<atom:link href="http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/feed/" rel="self" type="application/rss+xml" />
	<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/</link>
	<description>Getting into blogging before it&#039;s too late</description>
	<lastBuildDate>Sun, 16 Jun 2013 06:28:36 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Graph Theoretic Analysis of Relationships within Discrete Data &#171; &#60;&#60;Insert Name Here&#62;&#62;</title>
		<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/#comment-25</link>
		<dc:creator><![CDATA[Graph Theoretic Analysis of Relationships within Discrete Data &#171; &#60;&#60;Insert Name Here&#62;&#62;]]></dc:creator>
		<pubDate>Mon, 03 Nov 2008 04:28:41 +0000</pubDate>
		<guid isPermaLink="false">http://ivanmiljenovic.wordpress.com/?p=15#comment-25</guid>
		<description><![CDATA[[...] introduced me to Tying the Knot); and to Imam Tashdid ul Alam and Brad Clow, who commented on my draft. Finally, I&#8217;m sorry Gwern but C Pre-Processing still isn&#8217;t supported yet in [...]]]></description>
		<content:encoded><![CDATA[<p>[...] introduced me to Tying the Knot); and to Imam Tashdid ul Alam and Brad Clow, who commented on my draft. Finally, I&#8217;m sorry Gwern but C Pre-Processing still isn&#8217;t supported yet in [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ivanmiljenovic</title>
		<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/#comment-24</link>
		<dc:creator><![CDATA[ivanmiljenovic]]></dc:creator>
		<pubDate>Thu, 30 Oct 2008 08:49:19 +0000</pubDate>
		<guid isPermaLink="false">http://ivanmiljenovic.wordpress.com/?p=15#comment-24</guid>
		<description><![CDATA[Well, my supervisor just told me today that he&#039;s not going to bother reading the Haskell section that thoroughly nor all the code snippets, which is kinda annoying especially after the effort I put in to simplify those snippets right back :s]]></description>
		<content:encoded><![CDATA[<p>Well, my supervisor just told me today that he&#8217;s not going to bother reading the Haskell section that thoroughly nor all the code snippets, which is kinda annoying especially after the effort I put in to simplify those snippets right back :s</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brad Clow</title>
		<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/#comment-23</link>
		<dc:creator><![CDATA[Brad Clow]]></dc:creator>
		<pubDate>Thu, 30 Oct 2008 05:55:44 +0000</pubDate>
		<guid isPermaLink="false">http://ivanmiljenovic.wordpress.com/?p=15#comment-23</guid>
		<description><![CDATA[If you wish to use map as an example in Section 3.2.1 you may want to note that in the type signature, [] represents a List. It also introduces type variables and that will probably be confusing for non-Haskell readers. 

I guess the challenge is how much you want to talk about Haskell vs the maths. :-)]]></description>
		<content:encoded><![CDATA[<p>If you wish to use map as an example in Section 3.2.1 you may want to note that in the type signature, [] represents a List. It also introduces type variables and that will probably be confusing for non-Haskell readers. </p>
<p>I guess the challenge is how much you want to talk about Haskell vs the maths. <img src='http://s0.wp.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ivanmiljenovic</title>
		<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/#comment-22</link>
		<dc:creator><![CDATA[ivanmiljenovic]]></dc:creator>
		<pubDate>Wed, 29 Oct 2008 23:21:18 +0000</pubDate>
		<guid isPermaLink="false">http://ivanmiljenovic.wordpress.com/?p=15#comment-22</guid>
		<description><![CDATA[Thanks for that, I&#039;ll re-do the lazy evaluation bit then (the main reason I brought it up was that the HOnours co-ordinator knows a bit about Haskell, but only enough to be surprised that I could get anything done with the laziness; also, I mention it again later on when I use Tying the Knot).

As for line numbers... that&#039;s a feature of the Listings environment, so I didn&#039;t number any of it myself ;-).]]></description>
		<content:encoded><![CDATA[<p>Thanks for that, I&#8217;ll re-do the lazy evaluation bit then (the main reason I brought it up was that the HOnours co-ordinator knows a bit about Haskell, but only enough to be surprised that I could get anything done with the laziness; also, I mention it again later on when I use Tying the Knot).</p>
<p>As for line numbers&#8230; that&#8217;s a feature of the Listings environment, so I didn&#8217;t number any of it myself <img src='http://s1.wp.com/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> .</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Imam Tashdid ul Alam</title>
		<link>http://ivanmiljenovic.wordpress.com/2008/10/29/honours-lxde/#comment-21</link>
		<dc:creator><![CDATA[Imam Tashdid ul Alam]]></dc:creator>
		<pubDate>Wed, 29 Oct 2008 14:28:05 +0000</pubDate>
		<guid isPermaLink="false">http://ivanmiljenovic.wordpress.com/?p=15#comment-21</guid>
		<description><![CDATA[another fellow aussie interested in Haskell, eh?
I just had a quick read (section 3) and I honestly don&#039;t think the lazy evaluation issue is clear AND that it needs this much attention here. since it&#039;s a maths thesis you would lose your reader right where you are talking about sum [1..]. just say that the language evaluates a value only when it is needed and remembers it as an unevaluated expression until then but purity makes it possible not to care about when it is evaluated.
by the way, by LaTeX is rusty. how do you do those nice line numbers? [your text should read &quot;line 8&quot; where you are saying &quot;line 9&quot; though]]]></description>
		<content:encoded><![CDATA[<p>another fellow aussie interested in Haskell, eh?<br />
I just had a quick read (section 3) and I honestly don&#8217;t think the lazy evaluation issue is clear AND that it needs this much attention here. since it&#8217;s a maths thesis you would lose your reader right where you are talking about sum [1..]. just say that the language evaluates a value only when it is needed and remembers it as an unevaluated expression until then but purity makes it possible not to care about when it is evaluated.<br />
by the way, by LaTeX is rusty. how do you do those nice line numbers? [your text should read "line 8" where you are saying "line 9" though]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
