<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>River Dillon</title><link>https://k-monk.org/blog</link><description>Various musings of River Dillon</description><item><title>Some Applications of Union Find</title><link>https://k-monk.org/blog/union-find</link><guid isPermaLink="true">https://k-monk.org/blog/union-find</guid><pubDate>Sun, 28 Jun 2026 00:00:00 GMT</pubDate><description>These are some notes I prepared for the Antithesis research reading group. They are very rough, and will likely remain that way. Union find is one of those things that keeps coming up, and every time I have to remind myself how it works. My aim today is just to introduce you to the idea, if you haven't seen it before, and maybe give you a sense of some cases in which you might use it.</description></item><item><title>Generating the P3 Tiling</title><link>https://k-monk.org/blog/generating-the-p3-tiling</link><guid isPermaLink="true">https://k-monk.org/blog/generating-the-p3-tiling</guid><pubDate>Sun, 28 Jun 2026 00:00:00 GMT</pubDate><description>Have you heard of Penrose tilings? Today, I want to describe one algorithm you can use to generate them. My hope is that this article will serve as necessary background material for some future subjects I have in mind, the details of which I'll leave in suspense for now.</description></item><item><title>Banh Mi On Me</title><link>https://k-monk.org/blog/banh-mi</link><guid isPermaLink="true">https://k-monk.org/blog/banh-mi</guid><pubDate>Sun, 02 Nov 2025 00:00:00 GMT</pubDate><description>If you are a PhD student in or visiting London or NYC, I'll buy you lunch if we can talk about your work and your interests.</description></item><item><title>Expression Parsing Made Simple</title><link>https://k-monk.org/blog/expression-parsing-made-simple</link><guid isPermaLink="true">https://k-monk.org/blog/expression-parsing-made-simple</guid><pubDate>Fri, 28 Mar 2025 00:00:00 GMT</pubDate><description>I present an algorithm I like for expression parsing.</description></item><item><title>Minimal Parenthesization of Lambda Terms</title><link>https://k-monk.org/blog/minimal-parenthesization-of-lambda-terms</link><guid isPermaLink="true">https://k-monk.org/blog/minimal-parenthesization-of-lambda-terms</guid><pubDate>Sun, 15 Sep 2024 00:00:00 GMT</pubDate><description>When writing a compiler, it's useful to be able to visualize the syntax tree as it gets processed. Often you end up with lots of unneeded parentheses. This post shows one way of avoiding that.</description></item><item><title>Introduction to the OCaml Module System</title><link>https://k-monk.org/blog/introduction-to-the-ocaml-module-system</link><guid isPermaLink="true">https://k-monk.org/blog/introduction-to-the-ocaml-module-system</guid><pubDate>Tue, 10 Sep 2024 00:00:00 GMT</pubDate><description>I got a request from the OCaml group at the Recurse Center to go over modules and functors this week. Here are the notes I prepared.</description></item></channel></rss>