David Anekstein's blog

In my post Generic Recursion Applied to Algebraic Graphs1 we explored how we can leverage recursion schemes to perform basic operations on a graph data structure.

Years ago in New York City’s Bryant park I came across a pop up store that sold puzzles, one of which was this wooden cube.

Lately I’ve been thinking about time series analysis to aid in Reflect’s insights features.

Recently I’ve been working in static analysis land and as a part of that have been familiarizing myself with data flow analysis.

It would be such a shame if I couldn’t combine Rust, recursion schemes, and graphs into one blog post (with the added bonus of leaving out C++).

I was recently looking into implementing some speculative execution functionality using std::async; based on some seed data, the goal was to asynchronously run a compute-intensive calculation where the result may or may not be needed at a later time.

You can find the source code for this post here.

This post assumes a basic understanding of genetic algorithms and the terminology associated with them, as well as a cursory understanding of recursion schemes; resources for both may be found scattered within the post.