Language-parametric static semantic code completion
summary
Implements a language‑parametric code completion that is sound and complete by construction: it reinterprets Statix static semantics and SDF3 syntax to expand predicates, injections and scope queries, running each candidate through the Statix solver to reject invalid fills. Prototype lives in Spoofax, works on Tiger (and any language with a Statix spec, including Java), uses structural placeholders for editing, and skips ranking and full expansion for performance tradeoffs.
AI-written summary · about
chapters (5)
- 0:00Start
- 0:15Problem
- 6:01Statix
- 9:23Implementation
- 15:05Language-Parametric Static Semantic Code Completion
related talks
28mOn the Soundness of Auto-Completion Services for Dynamically Typed Languages
15mLanguage-Parametric Reference Synthesis
20mAn Approach to Generate Text-Based IDEs for Syntax Correction based on Syntax Specification
38mType System Foundations for Super-Charged Semantic Code Search
26mDesign a new language in JS: from zero to autocomplete
27mParsing, Compiling, and Static Metaprogramming
17mSyntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with(…)
57mVariant analysis