Compositional Programming

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

doi:10.1145/3460228

Cited by 13 publications

(10 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We prove the typesoundness and determinism of F + i using a direct TDOS. These proofs validate the proofs of correctness previously presented for CP by Zhang et al [46]. Technical innovations.…”

Section: Cbn F +supporting

confidence: 85%

“…To demonstrate the capabilities of Compositional Programming, we show how to solve a variant of the Expression Problem [42] in the CP language. Our solution is adapted from the original one by Zhang et al [46]. In this variant, in addition to the usual challenge of extensibility in multiple directions, we also consider the problem of context evolution [25,37], so the interpreter may require different contextual information for different features of the interpreter.…”

Section: Compositional Programming By Examplementioning

confidence: 99%

“…Sorts will be instantiated with concrete representations later. Internally, sorts are handled differently from normal type parameters [46]. In accordance with the compositional interface, we can then define how to evaluate the expression language.…”

Section: Compositional Programming By Examplementioning

confidence: 99%

“…Compositional Programming [46] is a recently proposed modular programming paradigm. It offers a natural solution to the Expression Problem [42] and novel approaches to modular pattern matching and dependency injection.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Direct Foundations for Compositional Programming

Fan¹,

Huang²,

Han³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

The recently proposed CP language adopts Compositional Programming: a new modular programming style that solves challenging problems such as the Expression Problem. CP is implemented on top of a polymorphic core language with disjoint intersection types called F + i . The semantics of F + i employs an elaboration to a target language and relies on a sophisticated proof technique to prove the coherence of the elaboration. Unfortunately, the proof technique is technically challenging and hard to scale to many common features, including recursion or impredicative polymorphism. Thus, the original formulation of F + i does not support the two later features, which creates a gap between theory and practice, since CP fundamentally relies on them.This paper presents a new formulation of F + i based on a type-directed operational semantics (TDOS). The TDOS approach was recently proposed to model the semantics of languages with disjoint intersection types (but without polymorphism). Our work shows that the TDOS approach can be extended to languages with disjoint polymorphism and model the full F + i calculus. Unlike the elaboration semantics, which gives the semantics to F + i indirectly via a target language, the TDOS approach gives a semantics to F + i directly. With a TDOS, there is no need for a coherence proof. Instead, we can simply prove that the semantics is deterministic. The proof of determinism only uses simple reasoning techniques, such as straightforward induction, and is able to handle problematic features such as recursion and impredicative polymorphism. This removes the gap between theory and practice and validates the original proofs of correctness for CP. We formalized the TDOS variant of the F + i calculus and all its proofs in the Coq proof assistant.

show abstract

Section: Cbn F +supporting

confidence: 85%

Section: Compositional Programming By Examplementioning

confidence: 99%

Section: Compositional Programming By Examplementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Direct Foundations for Compositional Programming

Fan¹,

Huang²,

Han³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Wadler [1998] popularized the problem by coining the term "Expression Problem" and describing the requirements that a proper solution should meet. Thereafter, many solutions to the Expression Problem have been proposed [Carette et al 2009;Hofer et al 2008;Oliveira and Cook 2012;Swierstra 2008;Wang and Oliveira 2016;Odersky 2001, 2005;Zhang et al 2021], to list a few. However, solutions to the Expression Problem typically introduce extra complexity, parameterization, and indirections that may cause performance penalty or require boilerplate code Oliveira 2020, 2017].…”

Section: Related Workmentioning

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