<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: z5h</title><link>https://news.ycombinator.com/user?id=z5h</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 23 Aug 2026 20:28:00 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=z5h" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by z5h in "Movwin: My (Unpublished) TUI Framework"]]></title><description><![CDATA[
<p>I’ve actually implemented a TUI in Prolog (because there wasn’t anything in the space and I wanted to make sure it respected the relational/logical nature of Prolog).
I’m happy with performance and developer ergonomics. But before I publish it, I want to firm up some opinions on how TUIs should behave for end users.
Do you have any suggestions other than “use Vim/Emacs and think about it”?</p>
]]></description><pubDate>Mon, 01 Jun 2026 20:03:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=48361870</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=48361870</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48361870</guid></item><item><title><![CDATA[New comment by z5h in "Zed 1.0"]]></title><description><![CDATA[
<p>So, the S and P in LSP stands for Server and Protocol. The Protocol is to exchange JSON-RPC messages with a server. So to add a new language to Zed, we should just be able to direct Zed to the server to talk to right? No. You have to write an extension in Rust. <a href="https://zed.dev/docs/extensions/languages#language-servers" rel="nofollow">https://zed.dev/docs/extensions/languages#language-servers</a>.<p>Or am I missing something?</p>
]]></description><pubDate>Wed, 29 Apr 2026 18:16:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=47952225</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=47952225</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47952225</guid></item><item><title><![CDATA[New comment by z5h in "Show HN: Cellarium: A Playground for Cellular Automata"]]></title><description><![CDATA[
<p>Thank you!  
I've recently become a bit obsessed with the work of Blaise Agüera y Arcas and  his BFF experiments (self-replicating (Brainfuck) programs emerging spontaneously from random noise). This got me thinking about running a similar experiment with Cellular Automata (efficiently on GPUs). So I'll definitely be playing with this.</p>
]]></description><pubDate>Tue, 24 Feb 2026 15:45:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=47138584</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=47138584</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47138584</guid></item><item><title><![CDATA[New comment by z5h in "Show HN: I Made the Hardest Focus App"]]></title><description><![CDATA[
<p>Intense. I thought “lose it all” meant wiping your phone.</p>
]]></description><pubDate>Sat, 23 Aug 2025 15:42:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=44996761</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44996761</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44996761</guid></item><item><title><![CDATA[New comment by z5h in "Show HN: OverType – A Markdown WYSIWYG editor that's just a textarea"]]></title><description><![CDATA[
<p>I tried exactly this idea a few years ago (inspired by how Bear app did Markdown at the time). But I never solved all the issues to get it working 100%.Eventually I just gave up and moved on.
So bravo and thank you for making it work!!</p>
]]></description><pubDate>Mon, 18 Aug 2025 18:06:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=44943543</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44943543</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44943543</guid></item><item><title><![CDATA[New comment by z5h in "US AI Action Plan"]]></title><description><![CDATA[
<p>When is a good time (in the timeline of mankind) to stop being adversarial with AI?</p>
]]></description><pubDate>Wed, 23 Jul 2025 23:04:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=44664966</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44664966</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44664966</guid></item><item><title><![CDATA[New comment by z5h in "Perfume reviews"]]></title><description><![CDATA[
<p>Apparently I'm a super smeller (always the first to detect gas leaks, food that's off, know the brand of shampoo a person uses if I'm 200ft down wind, know if you use scented dish soap to clean the bowl you used to make cookies in when I eat the cookie). And I just think the idea that adding smells to the world is absolutely insane. Can I beam my favourite colours directly into your eyes with a laser from across the room? What if I know you like that colour too?</p>
]]></description><pubDate>Fri, 18 Jul 2025 17:58:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=44607862</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44607862</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44607862</guid></item><item><title><![CDATA[New comment by z5h in "I do not remember my life and it's fine"]]></title><description><![CDATA[
<p>I’m realized years ago I have full blown aphantasia. But I don’t suffer from autobiographical memory deficiencies. For me it’s akin to what happens when you close your eyes for a moment then open them again. I’m not shocked by everything in the room “appearing” suddenly. I knew it was all there, but not because I visualized it while my eyes were closed. So when I remember past events, it’s with that same sensation of being there but just having closed my eyes to it. I do dream with full imagery.</p>
]]></description><pubDate>Fri, 06 Jun 2025 02:35:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=44197354</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44197354</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44197354</guid></item><item><title><![CDATA[New comment by z5h in "Why Algebraic Effects?"]]></title><description><![CDATA[
<p>After spending a lot if time in Prolog, I want a nice way to implement and compose nondeterministic functions and also have a compile time type check. I’m eyeing all of these languages as a result. I’ll watch Ante as well. (Don’t forget developer tools like an LSP, tree-sitter or other editor plugins).</p>
]]></description><pubDate>Sat, 24 May 2025 17:01:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=44082311</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=44082311</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44082311</guid></item><item><title><![CDATA[New comment by z5h in "Ask HN: What are you working on? (April 2025)"]]></title><description><![CDATA[
<p>A Prolog TUI library that sticks to relational/logical programming, is conceptually simple, complete, and performant. 
Only requires some core ansi features that exist or are easily implemented in most Prologs.
Currently have stuff like nested scrollable areas, toggles, frames, buttons, layouts working.<p>Also, a visual programming language implemented as a PICO-8 script, where the "programming" is done fully in the sprite editor.</p>
]]></description><pubDate>Mon, 28 Apr 2025 17:03:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=43823603</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=43823603</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43823603</guid></item><item><title><![CDATA[New comment by z5h in "Why Fennel?"]]></title><description><![CDATA[
<p>Ok I’m genuinely convinced I’d be happier using Fennel than using Lua in instances where I need to use Lua. I’m not currently using Lua for anything. Maybe if I write a Pico-8 app…</p>
]]></description><pubDate>Mon, 14 Apr 2025 01:38:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=43677312</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=43677312</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43677312</guid></item><item><title><![CDATA[New comment by z5h in "Why F#?"]]></title><description><![CDATA[
<p>As a proficient Elm developer with industry experience, I’m wondering what are the biggest challenges in hiring devs? Is it the paradigm, learning the ecosystem, lack of interest? 
Are you currently hiring?</p>
]]></description><pubDate>Tue, 01 Apr 2025 13:49:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=43546760</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=43546760</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43546760</guid></item><item><title><![CDATA[New comment by z5h in "What about K?"]]></title><description><![CDATA[
<p>> Readability is a property of the reader, not the language.<p>Similarly, the inability of a person to write machine code directly is a property of the person, not the hardware. Yet some of these people admit their limitations and use K.</p>
]]></description><pubDate>Mon, 10 Feb 2025 14:30:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=43000693</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=43000693</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43000693</guid></item><item><title><![CDATA[New comment by z5h in "What Is miniKanren?"]]></title><description><![CDATA[
<p>> if they haven't surpassed SWI in some performance metrics yet I'd be surprised<p>I was/am also anticipating performance gains from Scryer. Which is why I made a point to request up to date Scryer benchmarks in the SWI forums. Still, for free/open Prolog, SWI-Prolog is hard to beat: <a href="https://swi-prolog.discourse.group/t/porting-the-swi-prolog-benchmark-suite-comparing-8-prolog-systems/6997/31?u=z5h" rel="nofollow">https://swi-prolog.discourse.group/t/porting-the-swi-prolog-...</a></p>
]]></description><pubDate>Mon, 06 Jan 2025 17:24:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=42612657</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=42612657</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42612657</guid></item><item><title><![CDATA[New comment by z5h in "What Is miniKanren?"]]></title><description><![CDATA[
<p>Implementing and using a miniKanren was fun and enlightening. And it helped me appreciate how incredibly optimized and fast SWI-Prolog is for relational/logical programming. If someone knows of a miniKanren/language combination that outperforms SWI-Prolog and has good developer ergonomics for relational/logical programming, I’d love to hear about it.</p>
]]></description><pubDate>Thu, 02 Jan 2025 14:43:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=42574819</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=42574819</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42574819</guid></item><item><title><![CDATA[New comment by z5h in "GenChess"]]></title><description><![CDATA[
<p>Not at all creative or interesting. Literal and uninspired.</p>
]]></description><pubDate>Tue, 26 Nov 2024 21:07:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=42250081</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=42250081</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42250081</guid></item><item><title><![CDATA[New comment by z5h in "34x34x34 Rubik's Cube"]]></title><description><![CDATA[
<p>I’ll add my vote for Roux in terms of pure fun. And there is more freedom to play between fastest solves and fewer moves with more planning.</p>
]]></description><pubDate>Fri, 01 Nov 2024 13:03:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=42016551</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=42016551</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42016551</guid></item><item><title><![CDATA[New comment by z5h in "Use Prolog to improve LLM's reasoning"]]></title><description><![CDATA[
<p>For example: the logical core of Prolog along with it's resolution model (for the logical part) are non deterministic (something can have none, one, many solutions) but only one solution is explored at a time. So it's a "meta logical" thing to express something like "the set of solutions for ...". Given that the core of Prolog is Turing complete, you can still get Prolog to compute anything, you might just not have a nice way of declaring it in pure Prolog.<p>Prolog has an interesting history of people discovering ways to express things that are simple, powerful and elegant. And yet despite the simplicity, these ways of expressing things were not immediately evident. DCGs are a prime example.</p>
]]></description><pubDate>Mon, 21 Oct 2024 17:38:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=41906405</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=41906405</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41906405</guid></item><item><title><![CDATA[New comment by z5h in "Use Prolog to improve LLM's reasoning"]]></title><description><![CDATA[
<p>> Hah! Hello fellow PCEmacs >> vim user :D<p>That made my day! Hello!</p>
]]></description><pubDate>Fri, 18 Oct 2024 13:48:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=41879451</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=41879451</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41879451</guid></item><item><title><![CDATA[New comment by z5h in "Use Prolog to improve LLM's reasoning"]]></title><description><![CDATA[
<p>> How do you debug DCGs? I get "false." instead of "syntax error at line 23", which is unacceptable for bigger inputs.<p>I also sympathize. "false" as the default failure mode is a challenge with Prolog. Most Prologs I've used have good debugging/stepping features (see spy and trace predicates), logical debugging of pure monotonic Prolog can often help (explained by Markus Triska), you can easily write (use existing) meta predicates that assert a called predicate must not fail otherwise throw an exception. For example: here the ./ is supposed to look like a checkmark. So `./ true.` is true. `./ false` throws an exception.<p><pre><code>  :- op(920, fy, './').
  :- meta_predicate './'(0).
  './'(X) :- call(X) *-> true ; prolog_debug:assertion_failed(fail, X).</code></pre></p>
]]></description><pubDate>Fri, 18 Oct 2024 13:40:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=41879378</link><dc:creator>z5h</dc:creator><comments>https://news.ycombinator.com/item?id=41879378</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41879378</guid></item></channel></rss>