Sound type-dependent syntactic language extension

Abstract

Syntactic language extensions can introduce new facilities into a programming language while requiring little implementation effort and modest changes to the compiler. It is typical to desugar language extensions in a distinguished compiler phase after parsing or type checking, not affecting any of the later compiler phases. If desugaring happens before type checking, the desugaring cannot depend on typing information and type errors are reported in terms of the generated code. If desugaring happens after type checking, the code generated by the desugaring is not type checked and may introduce vulnerabilities. Both options are undesirable. We propose a system for syntactic extensibility where desugaring happens after type checking and desugarings are guaranteed to only generate well-typed code. A major novelty of our work is that desugarings operate on typing derivations instead of plain syntax trees. This provides desugarings access to typing information and forms the basis for the soundness guarantee we provide, namely that a desugaring generates a valid typing derivation. We have implemented our system for syntactic extensibility in a languageindependent fashion and instantiated it for a substantial subset of Java, including generics and inheritance. We provide a sound Java extension for Scala-like for-comprehensions.

A vision of miking: interactive programmatic modeling, sound language composition, and self-learning compilation

“…Composability without static guarantees have been shown to work in practice at the syntactic level [44] and using complete language workbenches [16,22,61]. However, it is still an open problem to be able to guarantee sound composition of language fragments, although recent progress has been made within the area of attribute grammars [34] or based on type-dependent syntactic extensions [39]. For instance, a desirable property of statically typed languages is type soundness, where "well-typed programs cannot go wrong".…”

Type systems as macros

“…Many researchers have developed extensible type systems [2,4,11,28,30,36,37]. These frameworks typically augment a fixed host type system, which imposes some limitations on what kinds of extensions are allowed.…”

Romeo: A system for more flexible binding-safe programming

“…SoundX (Lorenzen & Erdweg, 2016) is a step toward a solution to this problem, demonstrating extensions to language syntax which are less powerful than macros, but whose expansions are guaranteed to be type-safe. We believe that the major remaining steps between SoundX and true typed macros are:…”