Principled syntactic code completion using placeholders
No abstract available.
Related papers
- Syntactic Completions with Material Obligations OOPSLA 2025
- A complete, co-inductive syntactic theory of sequential control and state POPL 2007
- The Billion-Dollar Fix - Safe Modular Circular Initialisation with Placeholders and Placeholder Types ECOOP 2013
- Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with Incomplete Code Fragments PLDI 2024
- Transparent proxies for java futures OOPSLA 2004
- Resolvable ambiguity: principled resolution of syntactically ambiguous programs CC 2021
- Enabling static analysis for partial java programs OOPSLA 2008
- Syntactic control of interference for separation logic POPL 2012