klibertp

7 ms·

1.
by klibertp 5d ago
Interestingly, an almost identical proverb exists in Polish ("him" is replaced with "swine" canonically, but it's often replaced by a person's name). It's used to suggest that someone is either too dumb or
2.
by klibertp 6d ago
What's funny is that with Sol, I added an instruction to AGENTS.md in one project to prefer sed/python ("deterministic tools" in general) for moving code instead of deleting it and rewriting it elsewhere from memory, bec
3.
by klibertp 27d ago
Yes, large. I haven't used Zig much myself, but from a few experiments I ran, Zig handles dead code elimination exceptionally well. It compiled a full Win32 GUI calc app that used Capy (a full, cross-platform GUI framework) into a 133k
4.
by klibertp 1mo ago
Yeah, that's why the second prompt starts with "You misunderstood" and a correction. This is a long conversation, with multiple experiments performed and a lot of inspection of all the intermediate results on my end between p
5.
by klibertp 1mo ago
I'm saying you don't need to publish on Steam to make your app run on Steam. You really don't. A user can add any executable to the Steam Library via the "Add a Game -> Add Non-Steam Game" button in the bottom-le
6.
by klibertp 1mo ago
Steam provides a stable Linux runtime, but it's not containerized or isolated Docker/Flatpak-style. It's closer to a chrooted env with some specific distro, but without chroot and the need to maintain said distro. They want t
7.
by klibertp 1mo ago
It doesn't have to cost money. You can write a normal Windows app and run it under Proton. For end users, provided that they have Steam installed (it's free), they can just add "Non-Steam game" to the library - it's
8.
by klibertp 1mo ago
Interesting to see Factor and J so far to the bottom and right in the zstd test, but much closer to the rest in the Pandoc test (with Asm taking their place). This suggests that both the task and language (not just the language) influence t
9.
by klibertp 1mo ago
But it eliminates JS, in this case including graphs. I prefer Ctrl+Shift+M (responsive mode) and resizing the viewport with the mouse.
10.
by klibertp 1mo ago
> I think in order to appreciate DbC [...] one needs to have some idea of "Program Correctness" concepts in the lineage of Floyd/Hoare/Dijkstra and Meyer. Agreed. To me, full-program (or system) formal verification is
11.
by klibertp 1mo ago
> AI is great at producing the code It's not. The latest-and-greatest models on $200/mo subscriptions routinely produce bloated code full of boilerplate. They are incapable of producing elegant, concise, readable, correct-by-de
12.
by klibertp 1mo ago
It's not that bad... But it is bad. It looks cool, and I managed to read the first few paragraphs. But when the code scrolled into view, it stopped looking cool and became an eye-destroying disaster. YMMV, but OP, if you read this, pl
13.
by klibertp 1mo ago
The ones I most likely had in mind (recovered with help from ChatGPT due to my memory being fuzzy - but most links it produced were in my bookmarks): - Matthias Felleisen, Sam Tobin-Hochstadt, “Interlanguage Migration: From Scripts to Progr
14.
by klibertp 1mo ago
> Side note: I expected to see mention of design by contract and function preconditions/invariants/postconditions. For some reason, DbC seems to be virtually unknown to most programmers. It's incredibly strange: I was sur
15.
by klibertp 1mo ago
Asserts are a goto of ensuring correctness. Versatile, powerful, and incredibly easy to misuse. Whatever correctness goal you're trying to achieve, there are safer, more ergonomic, and stronger alternatives you can reach for: type syst
16.
by klibertp 1mo ago
I think of the Turing test as one of the starting lines, along with image recognition ("a summer break project for a group of grad students" resisted being solved for decades). It is a huge leap. Now we can start talking about &
17.
by klibertp 1mo ago
> doesn’t seem like there is much benefit at that point That depends on the problem you're trying to solve. I found it to be of great benefit when trying to overcome "writer block". Mediocre prose - but at least some pro
18.
by klibertp 1mo ago
Emacs/Elisp has the rx library: https://www.gnu.org/software/emacs/manual/html_node/elisp/Rx... You get s-exp-based regex syntax (example for C-style block comments; there are shorter aliases t
19.
by klibertp 1mo ago
I would recommend trying something like PyParsing[1] instead. Libraries like this allow you to compose the parser from language-level entities (object and functions, on top of regex and string literals). This means you can attach comments t
20.
by klibertp 1mo ago
While true in principle, writing grammars in regexes is problematic in practice: the syntax for the more advanced features (named submatches, lookahead, backreferences, etc.) is pretty complex, and refactoring the expression means you'
21.
by klibertp 2mo ago
> But they generate objectively bad text. By default, yes. That's exactly the same for code: by default, even with planning and patient nudging towards best practices, you get passable code at best. Not elegant, not performant, and
22.
by klibertp 2mo ago
10x or 60x of very little is still not much. "Working programmers" unable to write FizzBuzz exist. 10x or 60x of a negative value is a 10-60x bigger problem than that initial negative value. We all regularly commit things that are
23.
by klibertp 2mo ago
> Some times the true nature of the problem is revealed while implementing it and by deferring everything to an LLM you spend days throwing tokens at the wrong thing. If you look at the code the LLM spat out (and you really, really shoul
24.
by klibertp 2mo ago
GToolkit[1] - a Smalltalk environment that's based on Pharo but replaces the UI framework and some other parts of the stack. It uses Rust through FFI to interface with and bundle native dependencies. I don't remember the exact num
25.
by klibertp 2mo ago
The only language with Fexprs that I used was Io. In Io, unevaluated code is represented as a tree of Message nodes, and for each call, an activation record is instantiated and provided to the called method body. That reified Call object le
26.
by klibertp 2mo ago
Good point. I was thinking about meta-interpreters (and it's still possible I misunderstood or misremembered how they work!), but you're right; I should have at least been more precise.
27.
by klibertp 2mo ago
I don't think that moving the evaluation to compile time is something you can just ignore when discussing macros. It's an important differentiator between macros and Fexprs[1]. IME, the primary use case for macros in Lisps is lang
28.
by klibertp 2mo ago
If your language has macros, you don't need to wait for it to gain async/await (and it was quite a wait even in Python and JS, while Java got its virtual threads very recently); you can just[1] implement a CPS transform as a macro
29.
by klibertp 2mo ago
IIRC, the criticism is of syntax-rules and syntax-case kind of macros in Scheme; I don't recall (happy to be proved wrong) LoL directly mentioning syntax-parse that's specific to Racket. syntax-parse is no less powerful than defma
30.
by klibertp 2mo ago
On the contrary, CLI, TUI, and desktop GUI apps are basically the only kinds of apps that benefit from CL and can live with its shortcomings. The startup time of a tool written in CL is short: you just need to load the image into RAM, run s

More ›