Alpha Equivalent Hash Consing with Thinnings
Explores alpha-equivalent hash consing using thinnings (bitvectors) for efficient term sharing in lambda calculus and compiler analysis.
Explores alpha-equivalent hash consing using thinnings (bitvectors) for efficient term sharing in lambda calculus and compiler analysis.
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.