<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: ThyerMJ26</title><link>https://news.ycombinator.com/user?id=ThyerMJ26</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 03 Jul 2026 09:13:27 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ThyerMJ26" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ThyerMJ26 in "Computer History Museum Launches Digital Portal to Its Collection"]]></title><description><![CDATA[
<p>I'm hoping they digitize some of the older archives they have in storage.<p>For example, they apparently have 23 U-Matic tapes of the HOPL (History of Programming Languages) conference in 1978 [1].<p>The proceedings [2] describe one of the tapes that don't make it into the transcribed proceedings:<p>> The after-dinner speeches at the conference banquet were devoted to humorous reminiscences and anecdotes about the languages and events during their development. The banquet anecdotes are not included in this volume because, although they are humorous to hear, the voice inflections make a big difference, and they are not necessarily amusing to read.<p>[1] <a href="https://www.computerhistory.org/collections/catalog/102695128/" rel="nofollow">https://www.computerhistory.org/collections/catalog/10269512...</a>
[2] <a href="https://dl.acm.org/doi/book/10.1145/800025" rel="nofollow">https://dl.acm.org/doi/book/10.1145/800025</a></p>
]]></description><pubDate>Sat, 31 Jan 2026 13:12:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=46836382</link><dc:creator>ThyerMJ26</dc:creator><comments>https://news.ycombinator.com/item?id=46836382</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46836382</guid></item><item><title><![CDATA[New comment by ThyerMJ26 in "The Unix Executable as a Smalltalk Method [pdf]"]]></title><description><![CDATA[
<p>Joel Jakubovic's talk is here: <a href="https://youtu.be/gD7ajjCHYbU?t=20378" rel="nofollow">https://youtu.be/gD7ajjCHYbU?t=20378</a>
It includes Q+As from a number of people, including Stephen Kell.</p>
]]></description><pubDate>Mon, 20 Oct 2025 17:16:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=45646452</link><dc:creator>ThyerMJ26</dc:creator><comments>https://news.ycombinator.com/item?id=45646452</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45646452</guid></item><item><title><![CDATA[New comment by ThyerMJ26 in "Ask HN: What are you working on? (July 2025)"]]></title><description><![CDATA[
<p>I've been working on a functional language and a specializing translator (a specialator) based on graph-reduction beneath lambdas.<p>The intention is to specialize away interpretive and meta-programming-like overhead,
  and then translate the result into usable source code in whichever language is desired.
If the code, after specialization, has a suitable form, then you should get conventional imperative code out.
If there are still functional-idioms present that haven't been specialized away, the generated code will have a more functional-style.
The specialator currently targets JS and C.<p>The language has an expressive type-system based on self-dependent sub-typing.
The type-system is too expressive for everyday use, it is intended to be used with a decidability checker.<p>This is an experimental work-in-progress.</p>
]]></description><pubDate>Mon, 28 Jul 2025 16:35:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=44712498</link><dc:creator>ThyerMJ26</dc:creator><comments>https://news.ycombinator.com/item?id=44712498</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44712498</guid></item><item><title><![CDATA[New comment by ThyerMJ26 in "Implementing a functional language with graph reduction (2021)"]]></title><description><![CDATA[
<p>The author's previous post goes into details of a categorial connection:<p><pre><code>  λ-Calculus, Combinatory Logic and Cartesian Closed Categories
  https://thma.github.io/posts/2021-04-04-Lambda-Calculus-Combinatory-Logic-and-Cartesian-Closed-Categories.html
</code></pre>
Also, more in-depth:<p><pre><code>  Categorical combinators, P.-L. Curien
  https://www.sciencedirect.com/science/article/pii/S001999588680047X
</code></pre>
(or maybe you're looking for something beyond that)</p>
]]></description><pubDate>Sat, 26 Jul 2025 17:13:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=44695555</link><dc:creator>ThyerMJ26</dc:creator><comments>https://news.ycombinator.com/item?id=44695555</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44695555</guid></item></channel></rss>