<?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"
	>
<channel>
	<title>Comments on: A new species</title>
	<atom:link href="http://existentialtype.net/2008/04/30/a-new-species/feed/" rel="self" type="application/rss+xml" />
	<link>http://existentialtype.net/2008/04/30/a-new-species/</link>
	<description>For People Who Like Type and Types</description>
	<pubDate>Wed, 20 Aug 2008 09:50:30 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: washburn</title>
		<link>http://existentialtype.net/2008/04/30/a-new-species/#comment-22651</link>
		<dc:creator>washburn</dc:creator>
		<pubDate>Tue, 13 May 2008 10:22:39 +0000</pubDate>
		<guid isPermaLink="false">http://existentialtype.net/?p=239#comment-22651</guid>
		<description>@Jacques:  Thanks for the additional details, I look forward to seeing what you come up with in your future research.  If nothing, else I really like the idea of having differentiation or pointing available as first class type operators.  

Girard's writing on Ludics are indeed quite impenetrable.  I've managed to understand some of the pieces.  Part of Ludics is based upon the ideas surrounding focusing, that the folks at CMU are now explaining in a much more approachable fashion.  Another part seems to be based upon location, which is why fairly early on in &lt;i&gt;Locus Solum&lt;/i&gt; he starts describing derivations entirely in terms of indices.  Somewhere along the lines he starts defining "locative" variants of the usual logical operators, and there is some comments about how locative and delocalized products related to standard Cartesian products and intersection types, but it is all very difficult to follow.  I guess what is particularly interesting is there also seems to be a "delocation" connective/modality to convert from intermediate between the locative to delocalized forms.</description>
		<content:encoded><![CDATA[<p>@Jacques:  Thanks for the additional details, I look forward to seeing what you come up with in your future research.  If nothing, else I really like the idea of having differentiation or pointing available as first class type operators.  </p>
<p>Girard&#8217;s writing on Ludics are indeed quite impenetrable.  I&#8217;ve managed to understand some of the pieces.  Part of Ludics is based upon the ideas surrounding focusing, that the folks at CMU are now explaining in a much more approachable fashion.  Another part seems to be based upon location, which is why fairly early on in <i>Locus Solum</i> he starts describing derivations entirely in terms of indices.  Somewhere along the lines he starts defining &#8220;locative&#8221; variants of the usual logical operators, and there is some comments about how locative and delocalized products related to standard Cartesian products and intersection types, but it is all very difficult to follow.  I guess what is particularly interesting is there also seems to be a &#8220;delocation&#8221; connective/modality to convert from intermediate between the locative to delocalized forms.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jacques Carette</title>
		<link>http://existentialtype.net/2008/04/30/a-new-species/#comment-22544</link>
		<dc:creator>Jacques Carette</dc:creator>
		<pubDate>Fri, 02 May 2008 15:16:36 +0000</pubDate>
		<guid isPermaLink="false">http://existentialtype.net/?p=239#comment-22544</guid>
		<description>We wanted to get to that punchline, but couldn't quite yet.  We know that the underlying tools are there in the semantics (folds, etc).  But an actual implementation is altogether different.

In Haskell, there is foldl, foldl1, foldr and foldr1, right?  There are ``only'' 4 because there is an obvious interpretation of regular functors as L-species that give you 2 canonical choices of ordering (but 2 more choices from laziness).  The problem with other structures is that you don't have such canonical choices, so you get a whole tree of potential folds.  Of course if what you are using in your fold is a commutative-associative binary function, then the whole tree collapses as all choices are isomorphic [but not identical].  There just was not time for us to explain this properly in this paper.

Another obvious route to take is to look at build-fold fusion rules.  If we stay 'categorical', then the fold is ok (as just a map from one F-algebra to another).  But we have yet to get a good picture of the underlying 'build' for species.  And we are pretty sure that some of neatest computations will come from just that.  Well, that and from fusing away Virtual Species, although that's another thread altogether.

You are quite right that our notation for products comes from previous work on species, and that work itself is greatly influenced by analysis.  In other words, the notation for the species operations is a lift of the notation for the corresponding operation on generating functions!  

As to the link with Ludics, I don't know.  I have tried to read Girard's Ludics paper, but gave up.  I will file that idea away for further study though.</description>
		<content:encoded><![CDATA[<p>We wanted to get to that punchline, but couldn&#8217;t quite yet.  We know that the underlying tools are there in the semantics (folds, etc).  But an actual implementation is altogether different.</p>
<p>In Haskell, there is foldl, foldl1, foldr and foldr1, right?  There are &#8220;only&#8221; 4 because there is an obvious interpretation of regular functors as L-species that give you 2 canonical choices of ordering (but 2 more choices from laziness).  The problem with other structures is that you don&#8217;t have such canonical choices, so you get a whole tree of potential folds.  Of course if what you are using in your fold is a commutative-associative binary function, then the whole tree collapses as all choices are isomorphic [but not identical].  There just was not time for us to explain this properly in this paper.</p>
<p>Another obvious route to take is to look at build-fold fusion rules.  If we stay &#8216;categorical&#8217;, then the fold is ok (as just a map from one F-algebra to another).  But we have yet to get a good picture of the underlying &#8216;build&#8217; for species.  And we are pretty sure that some of neatest computations will come from just that.  Well, that and from fusing away Virtual Species, although that&#8217;s another thread altogether.</p>
<p>You are quite right that our notation for products comes from previous work on species, and that work itself is greatly influenced by analysis.  In other words, the notation for the species operations is a lift of the notation for the corresponding operation on generating functions!  </p>
<p>As to the link with Ludics, I don&#8217;t know.  I have tried to read Girard&#8217;s Ludics paper, but gave up.  I will file that idea away for further study though.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
