Philip Zucker • 1/14/2026

Contextual Union Finds

The article discusses the need for rewriting under assumptions in egraph systems, such as in conditional branches or inductive proofs. It introduces contextual union finds as a simpler case to understand hierarchical union finds, where child contexts inherit but don't mutate parent equalities. It compares dense (vector-based) and sparse (hashmap-based) union find implementations and references related research on persistent data structures.

0 comments

#Union Find #Egraph #Rewriting