Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specifications

Rouvoet, Arjen; Antwerpen, Hendrik van; Poulsen, Casper Bach; Krebbers, Robbert; Visser, Eelco

doi:10.1145/3428248

Cited by 9 publications

(13 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Discussing this argument is out of scope for this paper. For a full treatment, we refer to Van Antwerpen et al [27] and Rouvoet et al [18].…”

Section: The Resolution Algorithmmentioning

confidence: 99%

“…Variables can be used in resolution expressions (𝐸). There are four possible expressions: resolve resolves the There is the traditional variant of Statix (𝐶) [18,27], that has a generic query constraint, which can be resolved using the resolution algorithm introduced in the previous section. In this paper, we define 𝐶 * , which is a variation of 𝐶 with the generic query removed and a compiled query added.…”

Section: Syntaxmentioning

confidence: 99%

“…𝜖 represents the empty store, Σ; (𝑥, 𝐴) denotes adding a mapping 𝑥 ↦ → 𝐴 to Σ, and Σ(•) : X ⇀ A retrieves the value (an environment) of a variable. Following Rouvoet et al [18], we define the operational semantics of Statix in a small-step style: a solver state that consists of a scope graph and a set of unsolved constraints (𝐶 * ) steps to a new state. Because we added a new construct to the language, we define the Op-Query-SM rule to evaluate it.…”

Section: Semanticsmentioning

confidence: 99%

“…However, implementing a type checker takes significant time and effort. In particular, implementing name binding correctly is challenging, as it requires careful staging of program traversals [18]. Therefore, type checker frameworks that abstract over name resolution scheduling, such as Pacak et al [15] (based on Datalog), Wyk et al [31], Hedin and Magnusson [5] (using attribute grammars), and Van Antwerpen et al [27] (using constraint programming and scope graphs) have been developed.…”

Section: Introductionmentioning

confidence: 99%

“…References can be resolved using a versatile graph query mechanism. Scope graphs are embedded in the Statix DSL for type system specification [18,27]. This DSL allows high-level specification of type systems using declarative inference rules.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Specializing Scope Graph Resolution Queries: Extended Edition

Zwaan¹

2022

Preprint

View full text Add to dashboard Cite

To warrant programmer productivity, type checker results should be correct and available quickly. Correctness can be provided when a type checker implementation corresponds to a declarative type system specification. Statix is a type system specification language which achieves this by automatically deriving type checker implementations from declarative typing rules. A key feature of Statix is that it uses scope graphs for declarative specification of name resolution. However, compared to hand-written type checkers, type checkers derived from Statix specifications have suboptimal run time performance.In this paper, we identify and resolve a performance bottleneck in the Statix solver, namely part of the name resolution algorithm, using partial evaluation. To this end, we introduce a tailored procedural intermediate query resolution language, and provide a specializer that translates declarative queries to this language.Evaluating this specializer by comparing type checking run time performance on three benchmarks (Apache Commons CSV, IO, and Lang3), shows that our specializer improves query resolution time up to 7.7x, which reduces the total type checking run time by 38 -48%.

show abstract

“…Discussing this argument is out of scope for this paper. For a full treatment, we refer to Van Antwerpen et al [27] and Rouvoet et al [18].…”

Section: The Resolution Algorithmmentioning

confidence: 99%

Section: Syntaxmentioning

confidence: 99%

Section: Semanticsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Specializing Scope Graph Resolution Queries: Extended Edition

Zwaan¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

OIL: an industrial case study in language engineering with Spoofax

Bunte,

Denkers,

van Gool

et al. 2024

Softw Syst Model

Self Cite

View full text Add to dashboard Cite

Domain-specific languages (DSLs) promise to improve the software engineering process, e.g., by reducing software development and maintenance effort and by improving communication, and are therefore seeing increased use in industry. To support the creation and deployment of DSLs, language workbenches have been developed. However, little is published about the actual added value of a language workbench in an industrial setting, compared to not using a language workbench. In this paper, we evaluate the productivity of using the Spoofax language workbench by comparing two implementations of an industrial DSL, one in Spoofax and one in Python, that already existed before the evaluation. The subject is the Open Interaction Language (OIL): a complex DSL for implementing control software with requirements imposed by its industrial context at Canon Production Printing. Our findings indicate that it is more productive to implement OIL using Spoofax compared to using Python, especially if editor services are desired. Although Spoofax was sufficient to implement OIL, we find that Spoofax should especially improve on practical aspects to increase its adoptability in industry.

show abstract

Language-parametric static semantic code completion

Pelsmaeker

Antwerpen

Poulsen

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Code completion is an editor service in IDEs that proposes code fragments for the user to insert at the caret position in their code. Code completion should be sound and complete. It should be sound, such that it only proposes fragments that do not violate the syntactic and static semantic rules of the language. It should be complete, such that it proposes all valid fragments so that code completion can be used to construct all programs. To realize soundness and completeness, code completion should be informed by the language definition. In practice, the implementation of code completion is an additional effort in the implementation of a language. In this paper, we develop a framework for language-parametric semantic code completion for statically typed programming languages based on their specification of syntax and static semantics, realizing the implementation of a code completion editor service with minimal additional effort. The framework builds on the SDF3 syntax definition formalism and the Statix static semantics specification language. The algorithm reinterprets the static semantics definition to find sound expansions of predicates and solutions to name resolution queries in scope graphs. This allows a search strategy to explore the solution space and synthesize completion proposals. The implementation of the strategy language and code completion algorithm extend the implementation of the Statix solver, and can be used for any language defined in Statix. We demonstrate soundness and completeness of the completion proposal synthesis, and evaluate its performance.

show abstract

Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specifications

Cited by 9 publications

References 30 publications

Specializing Scope Graph Resolution Queries: Extended Edition

Specializing Scope Graph Resolution Queries: Extended Edition

OIL: an industrial case study in language engineering with Spoofax

Language-parametric static semantic code completion

Contact Info

Product

Resources

About