<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Matrix Code · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1109.5416/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1109.5416/feed.xml" rel="self" type="application/rss+xml" /><item><title>Matrix Code — mentioned by 082349872349872</title><link>https://news.ycombinator.com/item?id=32617344</link><guid isPermaLink="false">urn:hackerpapers:mention:1109.5416:32617344</guid><pubDate>Sat, 27 Aug 2022 09:39:16 GMT</pubDate><description>&lt;p&gt;&amp;gt; there may really be a finite set of [control structures] Kleene Algebras (which compose via sequencing, choice, and repetition) map so well to sequential programming that I currently believe, yeah, we have them[0]: - cf &amp;#x27;;&amp;#x27;, case, and while - Hoare triples map nicely into a Kleene Algebra. I suspect the rise of structured programming tanked adoption of formal methods, because informal methods sufficed, where they may not have had we continued with spaghetti coding. - matrices/graphs of Kleene Algebras also form a Kleene Algebra, so the state machine[2] a &amp;quot;structured program&amp;quot; compiles down…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1109.5416/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
