Compositional data types

Bahr, Patrick; Hvitved, Tom

doi:10.1145/2036918.2036930

Cited by 36 publications

(46 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The latter is represented as a compositional data type [2]. to sort-preserving rewrites that can be applied to terms of any sort, and also enables many generic-programming techniques.…”

Section: Generating the Modularized Representationmentioning

confidence: 99%

“…to sort-preserving rewrites that can be applied to terms of any sort, and also enables many generic-programming techniques. See Bahr and Hvitved [2] for a more thorough discussion of this representation.…”

Section: Generating the Modularized Representationmentioning

confidence: 99%

“…Our work is most directly based on the data types à la carte approach to modular syntax [35], and its extensions in Bahr's work on compositional datatypes [2]. The extension of data types à la carte to multi-sorted terms was introduced in Yakushev et al [41].…”

Section: Chapter 6 Related Workmentioning

confidence: 99%

“…In this direction, researchers in the past few decades have made great progress, developing techniques for dealing with different languages modularly, including work on modular semantics [9,28], modular interpreters [25], and modular syntax [2,42]. Using any of these techniques requires defining an entire language in a specialized manner, differently from existing tools.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Incremental parametric syntax for multi-language transformation

Koppel

Solar-Lezama

2017

Proceedings Companion of the 2017 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: So

View full text Add to dashboard Cite

We present a new system for building source-to-source transformations that can run on multiple programming languages, based on a new way of representing programs called incremental parametric syntax. We construct incremental parametric syntaxes for C, Java, JavaScript, Lua, and Python, and demonstrate two multi-language program transformations that can run on all of them. Our evaluation shows that (1) once a transformation is written, relatively little work is required to configure it for a new language (2) transformations built this way output readable code which preserve the structure of the original, according to participants in our human study, and (3) despite dealing with many languages, our transformations can still handle language corner-cases, and pass 90% of compiler test suites.Incremental parametric syntax is based on the datatypes à la carte approach for constructing modular syntax, but extends it with the notion of a sort injection, which allows intermixing language-specific and generic components in a type-safe and modular fashion. Instead of translating each language to a common representation, this allows having a family of representations, each specific to a language, but sharing common components. Our system can construct an incremental parametric syntax semi-automatically from a third-party library for that language, with the user only writing code for the portions they wish to translate into generic components. The resulting incremental parametric syntax is isomorphic to the original representation, allowing transformations to be fully information-preserving. The user can begin by only translating a small fragment of a language into generic components, enough to support a few transformations, and incrementally add more. Our experience shows that constructing an incremental parametric syntax for a new language is easy, typically taking less than a day of work, and that multi-language transformations built against incremental parametric syntaxes can be configured for a large number of languages, with only a small amount of work per language.

show abstract

“…The latter is represented as a compositional data type [2]. to sort-preserving rewrites that can be applied to terms of any sort, and also enables many generic-programming techniques.…”

Section: Generating the Modularized Representationmentioning

confidence: 99%

Section: Generating the Modularized Representationmentioning

confidence: 99%

Section: Chapter 6 Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Incremental parametric syntax for multi-language transformation

Koppel

Solar-Lezama

2017

Proceedings Companion of the 2017 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: So

View full text Add to dashboard Cite

show abstract

“…To simplify matters, Bahr and Hvitved [1] focused on tree transducers with a singleton state space, also known as tree homomorphisms [3]:…”

Section: Tree Homomorphismsmentioning

confidence: 99%

Modular Tree Automata

Bahr

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.

show abstract