Shallow EDSLs and Object-Oriented Programming: Beyond Simple Compositionality

Zhang, Weixin; Oliveira, Bruno C. d. S.

doi:10.22152/programming-journal.org/2019/3/10

Cited by 3 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the functional decomposition version, these extensions have to be added by defining new case classes of Operator and modifying existing consumers on Operator scattered around the file. In contrast, it can be simplified by switching to object-oriented style and adding the extensions modularly as classes with C : The transformed object-oriented code looks very much like the core part of Zhang and Oliveira [2019]'s hand-written implementation. Similarly, when the need of new operations such as compiling SQL queries to C backend arises, we can transform the implementation back to functional style to facilitate operation extensions.…”

Section: Sql Processormentioning

confidence: 99%

Decomposition Without Regret

Zhang¹,

David²,

Wang³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Programming languages are embracing both functional and object-oriented paradigms. A key difference between the two paradigms is the way of achieving data abstraction. That is, how to organize data with associated operations. There are important tradeoffs between functional and object-oriented decomposition in terms of extensibility and expressiveness. Unfortunately, programmers are usually forced to select a particular decomposition style in the early stage of programming. Once the wrong design decision has been made, the price for switching to the other decomposition style could be rather high since pervasive manual refactoring is often needed. To address this issue, this paper presents a bidirectional transformation system between functional and object-oriented decomposition. We formalize the core of the system in the FOOD calculus, which captures the essence of functional and object-oriented decomposition. We prove that the transformation preserves the type and semantics of the original program. We further implement FOOD in Scala as a translation tool called C and conduct several case studies to demonstrate the applicability and effectiveness of C .

show abstract

Section: Sql Processormentioning

confidence: 99%

Decomposition Without Regret

Zhang¹,

David²,

Wang³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Nevertheless, that approach still requires a lot of boilerplate that needs to be repeated for each DSL, as well as explicit projections that need to be written in each interpretation. Another alternative Haskell encoding that also enables multiple dependent interpretations is proposed by Zhang and Oliveira [55], but it does not eliminate the explicit delegation and still requires substantial amounts of boilerplate. A final remark is that adding new primitives (e.g., a "right stretch" rstretch combinator [25]) can also be easily achieved [46].…”

Section: Composition Of Embeddingsmentioning

confidence: 99%

“…While using advanced meta-programming techniques enables automating the merge combinator to a large extent in existing programming languages [37,42], those techniques have several problems: error messages can be problematic, type-unsafe reflection is needed in some approaches [37] and advanced type-level features are required in others [42]. An alternative to the merge combinator that supports modular multiple interpretations and works in OO languages with support for some form of multiple inheritance and covariant type-refinement of fields has also been recently proposed [55]. While this approach is relatively simple, it still requires a lot of manual boilerplate code for composition of interpretations.…”

Section: Introductionmentioning

confidence: 99%

Distributive Disjoint Polymorphism for Compositional Programming

Xie

Oliveira

et al. 2019

Programming Languages and Systems

View full text Add to dashboard Cite

Popular programming techniques such as shallow embeddings of Domain Specific Languages (DSLs), finally tagless or object algebras are built on the principle of compositionality. However, existing programming languages only support simple compositional designs well, and have limited support for more sophisticated ones.This paper presents the F + i calculus, which supports highly modular and compositional designs that improve on existing techniques. These improvements are due to the combination of three features: disjoint intersection types with a merge operator ; parametric (disjoint) polymorphism; and BCD-style distributive subtyping. The main technical challenge is F + i 's proof of coherence. A naive adaptation of ideas used in System F's parametricity to canonicity (the logical relation used by F + i to prove coherence) results in an ill-founded logical relation. To solve the problem our canonicity relation employs a different technique based on immediate substitutions and a restriction to predicative instantiations. Besides coherence, we show several other important meta-theoretical results, such as type-safety, sound and complete algorithmic subtyping, and decidability of the type system. Remarkably, unlike F<:'s bounded polymorphism, disjoint polymorphism in F + i supports decidable type-checking.

show abstract

Compositional embeddings of domain-specific languages

Sun

Dhandhania

Oliveira

2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

A common approach to defining domain-specific languages (DSLs) is via a direct embedding into a host language. There are several well-known techniques to do such embeddings, including shallow and deep embeddings. However, such embeddings come with various trade-offs in existing programming languages. Owing to such trade-offs, many embedded DSLs end up using a mix of approaches in practice, requiring a substantial amount of code, as well as some advanced coding techniques. In this paper, we show that the recently proposed Compositional Programming paradigm and the CP language provide improved support for embedded DSLs. In CP we obtain a new form of embedding, which we call a compositional embedding, that has most of the advantages of both shallow and deep embeddings. On the one hand, compositional embeddings enable various forms of linguistic reuse that are characteristic of shallow embeddings, including the ability to reuse host-language optimizations in the DSL and add new DSL constructs easily. On the other hand, similarly to deep embeddings, compositional embeddings support definitions by pattern matching or dynamic dispatching (including dependent interpretations, transformations, and optimizations) over the abstract syntax of the DSL and have the ability to add new interpretations. We illustrate an instance of compositional embeddings with a DSL for document authoring called ExT. The DSL is highly flexible and extensible, allowing users to create various non-trivial extensions easily. For instance, ExT supports various extensions that enable the production of wiki-like documents, LaTeX documents, vector graphics or charts. The viability of compositional embeddings for ExT is evaluated with three applications.

show abstract

Shallow EDSLs and Object-Oriented Programming: Beyond Simple Compositionality

Cited by 3 publications

References 24 publications

Decomposition Without Regret

Decomposition Without Regret

Distributive Disjoint Polymorphism for Compositional Programming

Compositional embeddings of domain-specific languages

Contact Info

Product

Resources

About