Pbrisbin.com

This post is a literate Haskell file. To follow along, cut and paste the entire text of this post into a file called StarSemiring.lhs and load it up in GHCi. I would like to introduce you to a very general algorithm that I like to call the Gauss-Jordan...

Select, few Recently, there's been a lot of interest in DSLs to address the so-called N+1 selects problem, which describes the very common situation where you Do one database query to get a list of things, say user IDs; for each, call some sort of...

(This article was originally published at Darren Wilkinson's research blog, and syndicated at StatsBlogs.) Introduction In the previous post I gave a quick introduction to some important concepts in functional programming, such as HOFs, closures, currying...

Just about three years ago, I created the “automatic rule-based time tracker” (arbtt), a tool that quietly runs in the background, records your current windows and their titles, and allows you to later process this data using, well, rules. By now, I...

This post describes how graph and automata theory can help compile a regular expression like “ab(cd|e)*fg” into the following asymptotically (linear-time) and practically (around 8 cycles/character on my E5-4617) efficient machine code. The...