<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: tnlogy</title><link>https://news.ycombinator.com/user?id=tnlogy</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 12 Jul 2026 05:04:40 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tnlogy" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by tnlogy in "Oban, the job processing framework from Elixir, has come to Python"]]></title><description><![CDATA[
<p>Looks like a nice API. We have used the similar pattern for years, but with sqlalchemy and the same kind of sql statement for getting the next available job. Think it’s easier to handle worker queues just with postgresql rather than some other queue system to keep supported and updated for security fixes etc.</p>
]]></description><pubDate>Wed, 28 Jan 2026 21:20:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=46801689</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=46801689</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46801689</guid></item><item><title><![CDATA[New comment by tnlogy in "Show HN: I built an interactive HN Simulator"]]></title><description><![CDATA[
<p>I would like the ”prompt” feature here as well, so I would know the reason for writing this comment!</p>
]]></description><pubDate>Tue, 25 Nov 2025 12:05:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=46045040</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=46045040</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46045040</guid></item><item><title><![CDATA[New comment by tnlogy in "µcad: New open source programming language that can generate 2D sketches and 3D"]]></title><description><![CDATA[
<p>Nice with another alternative. I have been using shapescript, which I think is easier than openscad, and available on ios. <a href="https://shapescript.info/" rel="nofollow">https://shapescript.info/</a></p>
]]></description><pubDate>Mon, 24 Nov 2025 08:59:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=46031835</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=46031835</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46031835</guid></item><item><title><![CDATA[New comment by tnlogy in "The Programming Languages Zoo"]]></title><description><![CDATA[
<p>Made me think about this book <a href="https://webperso.info.ucl.ac.be/~pvr/book.html" rel="nofollow">https://webperso.info.ucl.ac.be/~pvr/book.html</a> where the author creates a mini language and extends it in many different paradigms.</p>
]]></description><pubDate>Tue, 28 Oct 2025 17:04:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=45735564</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=45735564</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45735564</guid></item><item><title><![CDATA[New comment by tnlogy in "Build Your Own Lisp"]]></title><description><![CDATA[
<p>Someone seems to have saved my old self-compiling scheme-to-c compiler in about 1k lines of scheme code. <a href="https://github.com/veqqq/llvm_scheme/blob/main/compile.ccode.ss" rel="nofollow">https://github.com/veqqq/llvm_scheme/blob/main/compile.ccode...</a> (also an llvm version)<p>Maybe I should read and compare it. Mine was a really slow Poc to inspired by SICP, is that book still used in courses somewhere?</p>
]]></description><pubDate>Tue, 05 Aug 2025 15:08:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=44798985</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=44798985</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44798985</guid></item><item><title><![CDATA[New comment by tnlogy in "Minimal auto-differentiation engine in Rust"]]></title><description><![CDATA[
<p>My idea was to make a Vec of nodes with pointers to indexes in the vec, so it would be easier to send this array into the gpu. I wanted to make a minimal version example of making a micrograd network run on the gpu, with wgpu or macroquad, but I didn’t complete it, so would be nice if someone else did it. :)</p>
]]></description><pubDate>Fri, 20 Jun 2025 20:07:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=44331560</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=44331560</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44331560</guid></item><item><title><![CDATA[New comment by tnlogy in "Minimal auto-differentiation engine in Rust (for educational purposes)"]]></title><description><![CDATA[
<p>Nice! I made a small toy version myself to learn Rust and freshen up on ML. <a href="https://github.com/tnlogy/telegrad">https://github.com/tnlogy/telegrad</a><p>I wanted to store the graph in a heap to be able to send it to the gpu later on, but then I got lazy and abandoned it. But you always learn something. :)</p>
]]></description><pubDate>Fri, 20 Jun 2025 18:30:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=44330543</link><dc:creator>tnlogy</dc:creator><comments>https://news.ycombinator.com/item?id=44330543</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44330543</guid></item></channel></rss>