miniblog.

One interesting consequence of the rise of LLMs: there's more demand for tools that handle untrusted input. Arbitrary HTML+JS can be safely run in a browser. Lean can check an arbitrary proof. These work really well with an LLM that can be wrong, but sometimes gives exactly what you want. Are there other tools in this family?

Today I learnt that A* doesn't work for an arbitrary non-planar graph, you need additional structure: https://stackoverflow.com/q/26568552/509706 This matches my experience with difftastic so far. The graph is non-planar and my best heuristic only matches Dijkstra perf in typical cases.

Rich Hickey compares REPL design with RPC style nREPL: https://groups.google.com/g/clojure-dev/c/Dl3Stw5iRVA/m/IHoVWiJz5UIJ Rich considers the nesting ability to be important. If the user is interacting with stdout/stdin, they can enter arbitrary other text UIs.