Reproduce “Bidirectional Type Slicing” 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
Max Carroll, Anil Madhavapeddy, Cyrus Omar
A formal theory for bidirectional type slicing is presented, enabling development tools to explain why an expression possesses a specific static type or why a type error arises. This framework generates well-formed, minimal program fragments as explanations, applicable to both correctly typed and ill-typed code.
Key insights
- The 'downwards static graduality' property allows program parts to be replaced with less precise versions (holes) while preserving type-checkability of the fragment.
- Type slices, as well-formed partial programs containing holes, can retain the syntactic and type-checkable structure of the original code, allowing for further analysis.
- The problem of finding absolute minimum-size slices is proven to be NP-hard, suggesting the necessity of efficient approximation algorithms for practical implementations.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.