<?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/"
		>
<channel>
	<title>Comments for Andrew Birkett's blog</title>
	<atom:link href="http://www.nobugs.org/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.nobugs.org/blog</link>
	<description>Thoughts of a software engineer</description>
	<lastBuildDate>Fri, 12 Mar 2010 14:56:25 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Model Checking by Árni Hermann</title>
		<link>http://www.nobugs.org/blog/archives/2010/03/11/model-checking/comment-page-1/#comment-61699</link>
		<dc:creator>Árni Hermann</dc:creator>
		<pubDate>Fri, 12 Mar 2010 14:56:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.nobugs.org/blog/?p=361#comment-61699</guid>
		<description>Great! I absolutely recommend it. Although I find there are much nicer modeling languages than SMV, e.g. SPIN, CCS or Rebeca (actor based modeling language).</description>
		<content:encoded><![CDATA[<p>Great! I absolutely recommend it. Although I find there are much nicer modeling languages than SMV, e.g. SPIN, CCS or Rebeca (actor based modeling language).</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why do they call it: Referentially transparent by Greg McIntyre</title>
		<link>http://www.nobugs.org/blog/archives/2008/11/12/why-do-they-call-it-referentially-transparent/comment-page-1/#comment-61672</link>
		<dc:creator>Greg McIntyre</dc:creator>
		<pubDate>Thu, 11 Mar 2010 13:19:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.nobugs.org/blog/?p=175#comment-61672</guid>
		<description>Hurray for this blog entry. *like button*</description>
		<content:encoded><![CDATA[<p>Hurray for this blog entry. *like button*</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Why do they call it: Referentially transparent by ajs</title>
		<link>http://www.nobugs.org/blog/archives/2008/11/12/why-do-they-call-it-referentially-transparent/comment-page-1/#comment-61661</link>
		<dc:creator>ajs</dc:creator>
		<pubDate>Thu, 11 Mar 2010 02:14:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.nobugs.org/blog/?p=175#comment-61661</guid>
		<description>Well, Quine was talking about natural language and its relation to philosophy, but he also wrote about logic and philosophy.  In particular, your &quot;contexts&quot; are functions, in the mathematical sense.  (Note that if &quot;x is blah&quot; and &quot;y is blah&quot; is the same sentence, then x is y, as a string of symbols.)  Equivalently, they&#039;re formulae/proofs, in a logic of some kind.  You sort of skimmed over that part, but acknowledged it -- the semantics of interpretation (the part where you check if the sentence you constructed from a context and value &quot;is true&quot;) remain the same under substitution of equivalents.  That&#039;s it.  This is the connection.

Functional programming languages have a different model of interpretation, but it&#039;s not so different from a proof language.  The biggest difference is the mechanism used to quantify over objects by property.  Strongly typed functional languages use primarily use types to categorize objects.  Logic languages sort objects by the predicates they satisfy.  And these approaches are pretty obviously equivalent.  A type represents a set of objects that satisfy some predicates/proofs/functions.  It is the extension of a predicate.

Heck, both of these approaches are equivalent to constructive set theory, under the same form of trivial transformation.</description>
		<content:encoded><![CDATA[<p>Well, Quine was talking about natural language and its relation to philosophy, but he also wrote about logic and philosophy.  In particular, your &#8220;contexts&#8221; are functions, in the mathematical sense.  (Note that if &#8220;x is blah&#8221; and &#8220;y is blah&#8221; is the same sentence, then x is y, as a string of symbols.)  Equivalently, they&#8217;re formulae/proofs, in a logic of some kind.  You sort of skimmed over that part, but acknowledged it &#8212; the semantics of interpretation (the part where you check if the sentence you constructed from a context and value &#8220;is true&#8221;) remain the same under substitution of equivalents.  That&#8217;s it.  This is the connection.</p>
<p>Functional programming languages have a different model of interpretation, but it&#8217;s not so different from a proof language.  The biggest difference is the mechanism used to quantify over objects by property.  Strongly typed functional languages use primarily use types to categorize objects.  Logic languages sort objects by the predicates they satisfy.  And these approaches are pretty obviously equivalent.  A type represents a set of objects that satisfy some predicates/proofs/functions.  It is the extension of a predicate.</p>
<p>Heck, both of these approaches are equivalent to constructive set theory, under the same form of trivial transformation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Coders at Work by Anthony Bailey</title>
		<link>http://www.nobugs.org/blog/archives/2009/10/28/coders-at-work/comment-page-1/#comment-60296</link>
		<dc:creator>Anthony Bailey</dc:creator>
		<pubDate>Sun, 10 Jan 2010 12:43:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.nobugs.org/blog/?p=316#comment-60296</guid>
		<description>Mostly asking this here rather than later at work because I will probably forget otherwise...

Given your interest in language, have you read the similarly interview-based &quot;Masterminds of Programming&quot; (http://amzn.com/0596515170)?

I was going to buy &quot;Coders&quot;, but got distracted by the existence of &quot;Masterminds&quot;, then wondered about buying that and trading lends with you.</description>
		<content:encoded><![CDATA[<p>Mostly asking this here rather than later at work because I will probably forget otherwise&#8230;</p>
<p>Given your interest in language, have you read the similarly interview-based &#8220;Masterminds of Programming&#8221; (<a href="http://amzn.com/0596515170)?" rel="nofollow">http://amzn.com/0596515170)?</a></p>
<p>I was going to buy &#8220;Coders&#8221;, but got distracted by the existence of &#8220;Masterminds&#8221;, then wondered about buying that and trading lends with you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Technical debt (or, mortgages in Haskell) by Simon</title>
		<link>http://www.nobugs.org/blog/archives/2009/11/17/technical-debt-or-mortgages-in-haskell/comment-page-1/#comment-59591</link>
		<dc:creator>Simon</dc:creator>
		<pubDate>Mon, 07 Dec 2009 23:54:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.nobugs.org/blog/?p=326#comment-59591</guid>
		<description>Very interesting, thanks! Will have to see if there are synergies with hledger.</description>
		<content:encoded><![CDATA[<p>Very interesting, thanks! Will have to see if there are synergies with hledger.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
