<?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 on: Reimagining matrices</title>
	<atom:link href="http://conal.net/blog/posts/reimagining-matrices/feed" rel="self" type="application/rss+xml" />
	<link>http://conal.net/blog/posts/reimagining-matrices</link>
	<description>Inspirations &#38; experiments, mainly about denotative/functional programming in Haskell</description>
	<lastBuildDate>Sat, 26 Sep 2020 21:06:12 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=4.1.17</generator>
	<item>
		<title>By: Jason Turner</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-856</link>
		<dc:creator><![CDATA[Jason Turner]]></dc:creator>
		<pubDate>Thu, 15 Jan 2015 21:13:29 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-856</guid>
		<description><![CDATA[&lt;p&gt;I am a mathematical physicist, lately working in software engineering - and somewhat new to the practice of functional programming; I came across your publications by way of listening to your HaskellCast re FRP and denotational design and find it very very interesting.&lt;/p&gt;

&lt;p&gt;I think that you may find some interesting reading on a similar vein and with some curious twists in the book &quot;Probability Theory, The Logic of Science&quot; by E T Jaynes, specifically chapter 2. This derives the quantitative rules of probability theory from the &#039;basic desiderata&#039; of &#039;plausible reasoning&#039;. What I find interesting is firstly another fine example of the approach you have applied here and from what I surmise quite widely elsewhere; the approach is the same and the particular steps are also similar although as the problem is more general the equations involved are more general functional equations, one being &#039;The Associativity Equation&#039;. But it is also interesting that the author took this approach, with some inspiration from G Polya, around 65 years ago and while active in applying computation to probability and statistics was certainly not of a theoretical computer science orientation.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>I am a mathematical physicist, lately working in software engineering &#8211; and somewhat new to the practice of functional programming; I came across your publications by way of listening to your HaskellCast re FRP and denotational design and find it very very interesting.</p>

<p>I think that you may find some interesting reading on a similar vein and with some curious twists in the book &#8220;Probability Theory, The Logic of Science&#8221; by E T Jaynes, specifically chapter 2. This derives the quantitative rules of probability theory from the &#8216;basic desiderata&#8217; of &#8216;plausible reasoning&#8217;. What I find interesting is firstly another fine example of the approach you have applied here and from what I surmise quite widely elsewhere; the approach is the same and the particular steps are also similar although as the problem is more general the equations involved are more general functional equations, one being &#8216;The Associativity Equation&#8217;. But it is also interesting that the author took this approach, with some inspiration from G Polya, around 65 years ago and while active in applying computation to probability and statistics was certainly not of a theoretical computer science orientation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peteris Erins</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-855</link>
		<dc:creator><![CDATA[Peteris Erins]]></dc:creator>
		<pubDate>Tue, 25 Dec 2012 10:14:44 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-855</guid>
		<description><![CDATA[&lt;p&gt;Hi Conal, great post, inspired me to &quot;reimagine&quot; tensors: http://peteriserins.tumblr.com/post/38783455201/typed-type-tensors-in-scala.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>Hi Conal, great post, inspired me to &#8220;reimagine&#8221; tensors: <a href="http://peteriserins.tumblr.com/post/38783455201/typed-type-tensors-in-scala" rel="nofollow">http://peteriserins.tumblr.com/post/38783455201/typed-type-tensors-in-scala</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dave Abrahams</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-854</link>
		<dc:creator><![CDATA[Dave Abrahams]]></dc:creator>
		<pubDate>Thu, 20 Dec 2012 19:51:53 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-854</guid>
		<description><![CDATA[&lt;p&gt;I&#039;m probably revealing a weakness in my jargon knowledge, but what do you mean when you use the word &quot;preserves,&quot; here?  You&#039;ve used that one word to describe multiple things that look like mathematical laws (e.g. distributivity) each of which has its own name.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>I&#8217;m probably revealing a weakness in my jargon knowledge, but what do you mean when you use the word &#8220;preserves,&#8221; here?  You&#8217;ve used that one word to describe multiple things that look like mathematical laws (e.g. distributivity) each of which has its own name.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jonathan Fischoff</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-853</link>
		<dc:creator><![CDATA[Jonathan Fischoff]]></dc:creator>
		<pubDate>Thu, 20 Dec 2012 03:37:52 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-853</guid>
		<description><![CDATA[&lt;p&gt;I can&#039;t shake this feeling that Arrow erupted from the bowels of Base and tried to take possession of Vect.&lt;/p&gt;

&lt;p&gt;It seems more natural to express Vect as a symmetric bimonoidal category (http://ncatlab.org/nlab/show/bimonoidal+category) using the tensor product and direct sum. (***) is basically the tensor product, but I think the direct sum of transformations would be more like (+++).&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>I can&#8217;t shake this feeling that Arrow erupted from the bowels of Base and tried to take possession of Vect.</p>

<p>It seems more natural to express Vect as a symmetric bimonoidal category (<a href="http://ncatlab.org/nlab/show/bimonoidal+category" rel="nofollow">http://ncatlab.org/nlab/show/bimonoidal+category</a>) using the tensor product and direct sum. (***) is basically the tensor product, but I think the direct sum of transformations would be more like (+++).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rebcabin</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-852</link>
		<dc:creator><![CDATA[rebcabin]]></dc:creator>
		<pubDate>Tue, 18 Dec 2012 06:32:05 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-852</guid>
		<description><![CDATA[&lt;p&gt;There is a lovely demonstration somewhere vaguely remembered in one of my favorite books http://matrixeditions.com/UnifiedApproach4th.html that Determinant is the UNIQUE multilinear, antisymmetric function of matrices.  In other words, it ought to be derivable from those properties, just in the way you derived mat mul from linearity and composition.  dreaming&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>There is a lovely demonstration somewhere vaguely remembered in one of my favorite books <a href="http://matrixeditions.com/UnifiedApproach4th.html" rel="nofollow">http://matrixeditions.com/UnifiedApproach4th.html</a> that Determinant is the UNIQUE multilinear, antisymmetric function of matrices.  In other words, it ought to be derivable from those properties, just in the way you derived mat mul from linearity and composition.  dreaming</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Franklin Chen</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-851</link>
		<dc:creator><![CDATA[Franklin Chen]]></dc:creator>
		<pubDate>Tue, 18 Dec 2012 06:26:38 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-851</guid>
		<description><![CDATA[&lt;p&gt;Before I got to the comment section, I had almost exactly the same thought as @DrMathochist in my head, so I was glad I kept that on hold and continued on, and your response clarified what exactly you meant by &quot;reimagining&quot;. (In college, for my first introduction to linear algebra, we went quite far without ever seeing or using a matrix, finally getting there, and deriving the matrix operations, only when it became necessary as a concrete representation of a linear transformation.) I suspect that people seeing only the title and first paragraphs of this post might be confused, however.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>Before I got to the comment section, I had almost exactly the same thought as @DrMathochist in my head, so I was glad I kept that on hold and continued on, and your response clarified what exactly you meant by &#8220;reimagining&#8221;. (In college, for my first introduction to linear algebra, we went quite far without ever seeing or using a matrix, finally getting there, and deriving the matrix operations, only when it became necessary as a concrete representation of a linear transformation.) I suspect that people seeing only the title and first paragraphs of this post might be confused, however.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rebcabin</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-850</link>
		<dc:creator><![CDATA[rebcabin]]></dc:creator>
		<pubDate>Tue, 18 Dec 2012 06:05:49 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-850</guid>
		<description><![CDATA[&lt;p&gt;my big big big question is : can we do arbitrary computation using just matrix addition and multiplication (and maybe transpose)... i.e., can we capture the lambda calculus or the universal turing machine in a little bit of linear algebra?  I have managed to find McCarthy COND using only primitive matrix ops.  Is this enough, or do I need NAND?&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>my big big big question is : can we do arbitrary computation using just matrix addition and multiplication (and maybe transpose)&#8230; i.e., can we capture the lambda calculus or the universal turing machine in a little bit of linear algebra?  I have managed to find McCarthy COND using only primitive matrix ops.  Is this enough, or do I need NAND?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matthew Brunelle</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-849</link>
		<dc:creator><![CDATA[Matthew Brunelle]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 19:31:53 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-849</guid>
		<description><![CDATA[&lt;p&gt;I just finished up linear algebra class so this article was a very stimulating way to apply that information.  Thanks for the post!&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>I just finished up linear algebra class so this article was a very stimulating way to apply that information.  Thanks for the post!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: conal</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-848</link>
		<dc:creator><![CDATA[conal]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 17:57:58 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-848</guid>
		<description><![CDATA[&lt;p&gt;@DrMathochist asked on Twitter:&lt;/p&gt;

&lt;blockquote&gt;

in what way is this a &quot;reimagining&quot;? That matrices represent linear transformations is absolutely fundamental.

 &lt;/blockquote&gt;

&lt;p&gt;Thanks for asking.
What I mean by &quot;reimagining&quot; is (a) packaging of linear maps via the &lt;code&gt;Category&lt;/code&gt; &amp; &lt;code&gt;Arrow&lt;/code&gt; vocabulary (more explicit in &lt;a href=&quot;https://github.com/conal/linear-map-gadt&quot; rel=&quot;nofollow&quot;&gt;the library&lt;/a&gt;), (b) structuring the representation and semantics to match the algebraic structure of &lt;code&gt;dot&lt;/code&gt; and &lt;code&gt;(&amp;&amp;&amp;)&lt;/code&gt;, and (c) derivation of operations from semantics.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>@DrMathochist asked on Twitter:</p>

<blockquote>

in what way is this a &#8220;reimagining&#8221;? That matrices represent linear transformations is absolutely fundamental.

 </blockquote>

<p>Thanks for asking.
What I mean by &#8220;reimagining&#8221; is (a) packaging of linear maps via the <code>Category</code> &amp; <code>Arrow</code> vocabulary (more explicit in <a href="https://github.com/conal/linear-map-gadt" rel="nofollow">the library</a>), (b) structuring the representation and semantics to match the algebraic structure of <code>dot</code> and <code>(&amp;&amp;&amp;)</code>, and (c) derivation of operations from semantics.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rdm</title>
		<link>http://conal.net/blog/posts/reimagining-matrices#comment-847</link>
		<dc:creator><![CDATA[rdm]]></dc:creator>
		<pubDate>Mon, 17 Dec 2012 17:00:33 +0000</pubDate>
		<guid isPermaLink="false">http://conal.net/blog/?p=503#comment-847</guid>
		<description><![CDATA[&lt;p&gt;Note that the derivation is a lot simpler if you start with a form of multiplication which follows the same structural rules as addition and build from that an &quot;inner product&quot; operation which does the multiply-and-sum thing.&lt;/p&gt;
]]></description>
		<content:encoded><![CDATA[<p>Note that the derivation is a lot simpler if you start with a form of multiplication which follows the same structural rules as addition and build from that an &#8220;inner product&#8221; operation which does the multiply-and-sum thing.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
