A simple technique for automatic recompilation in modular programming languages

Ronald A. Olsson; Gregory R. Whitehead

doi:10.1002/spe.4380190805

A simple technique for automatic recompilation in modular programming languages

Software Practice and Experience ◽

10.1002/spe.4380190805 ◽

1989 ◽

Vol 19 (8) ◽

pp. 757-773 ◽

Cited By ~ 1

Author(s):

Ronald A. Olsson ◽

Gregory R. Whitehead

Keyword(s):

Programming Languages ◽

Simple Technique ◽

Modular Programming

Download Full-text

Modular Programming Languages

10.1007/10722581 ◽

2000 ◽

Keyword(s):

Programming Languages ◽

Modular Programming

Download Full-text

Compositional Programming

ACM Transactions on Programming Languages and Systems ◽

10.1145/3460228 ◽

2021 ◽

Vol 43 (3) ◽

pp. 1-61

Author(s):

Weixin Zhang ◽

Yaozhu Sun ◽

Bruno C. D. S. Oliveira

Keyword(s):

Programming Languages ◽

Functional Programming ◽

Language Design ◽

Model Data ◽

Problem Model ◽

Significant Challenge ◽

Modular Programming ◽

Multiple Dimensions ◽

Key Concepts ◽

Class Hierarchies

Modularity is a key concern in programming. However, programming languages remain limited in terms of modularity and extensibility. Small canonical problems, such as the Expression Problem (EP), illustrate some of the basic issues: the dilemma between choosing one kind of extensibility over another one in most programming languages. Other problems, such as how to express dependencies in a modular way, add up to the basic issues and remain a significant challenge. This article presents a new statically typed modular programming style called Compositional Programming . In Compositional Programming, there is no EP: It is easy to get extensibility in multiple dimensions (i.e., it is easy to add new variants as well as new operations). Compositional Programming offers an alternative way to model data structures that differs from both algebraic datatypes in functional programming and conventional OOP class hierarchies. We introduce four key concepts for Compositional Programming: compositional interfaces , compositional traits , method patterns , and nested trait composition . Altogether, these concepts allow us to naturally solve challenges such as the Expression Problem, model attribute-grammar-like programs, and generally deal with modular programs with complex dependencies . We present a language design, called CP , which is proved to be type-safe, together with several examples and three case studies.

Download Full-text