Explores alpha-equivalent hash consing using thinnings (bitvectors) for efficient term sharing in lambda calculus and compiler analysis.
Explores advanced union-find data structures with annotations like offsets and thinnings for e-graphs and de Bruijn index manipulation.
Explores contextual union finds for rewriting under assumptions in egraph systems, comparing dense and sparse implementations.
Explores asymmetric completion, a union-find algorithm variant for inequality reasoning, with Python implementation insights.
A developer explains implementing a percolation system visualization in JavaScript, covering the Union-Find algorithm and project challenges.
