Hylic: A composable recursion system for Rust (separating tree, fold, and execution) I’ve been working on a Rust library, and published yesterday, that decomposes general recursion, into three independent parts: * **Tree/Graph** structure (*Nodes* and their child nodes; DAG only) * **Fold** logic (three closures: *initialize* intermediate result (heap), *accumulate* child results onto heap + a *finalize* step into the result type) * **Execution** strategy (Executor) Project location: * Docs: [https://hylic-recursion.github.io/hylic-docs/intro.html](https://hylic-recursion.github.io/hylic-docs/intro.html) * Github: [https://github.com/hylic-recursion/hylic](https://github.com/hylic-recursion/hylic) The idea is that instead of writing recursive functions directly, you define: 1. how your structure expands (`Treeish `, morally `N -> &[N]`) 2. how results are combined (`Fold ` -- init+accumulate+finalize) 3.…