Currently I have the priviledge to be working on the Lean theorem prover , as a Principle Research Software Engineer with the Lean FRO. Before that I did a lot of things with Haskell and Isabelle, as a PhD student in Karlsruhe and as a post-doc at UPenn.
Visit joachim-breitner.de → On Hacker News Dec 2017 – Dec 2020
Last week, I wrote a small nifty tool called bisect-binary , which semi-automates answering the question “To what extent can I fill this file up with zeroes and still have it working”. I wrote it it in Haskell, and part of the Haskell code, in the Intervals.hs module, is a data structure for “subsets of a file”…
TL;DR: CPS-conversion and defunctionalization can help you to come up with a constant-stack algorithm.