Reproduce “Typed Flexible-Arity Slotted E-Graphs: A Soundness Construction and an Alloy Case Study” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Guanxuan Wu, Allison Sullivan

The paper specifies a certificate-based extension of slotted e-graphs with typed interfaces and flexible-arity ports for sequence, bag, and set structure. Typed invocation maps support sharing under variable renaming, while separate certificates justify sibling quotients, flattening, and symmetries. In a frozen Java pipeline, 4,088 of 19,212 labeled-correct pairs matched at zero distance, versus none of 42,386 labeled-incorrect pairs; this is not a semantic-soundness proof of the implementation.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.