Towards Modular Compilers for Effects

Day, Laurence E.; Hutton, Graham

doi:10.1007/978-3-642-32037-8_4

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This high level of modularity makes our automata-based recursion schemes especially valuable for constructing modular compilers as we have illustrated in our running example. However, we should point out that there are many more aspects to consider when constructing compilers in a modular fashion [4].…”

Section: Discussionmentioning

confidence: 99%

Modular Tree Automata

Bahr

2012

Lecture Notes in Computer Science

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

Section: Discussionmentioning

confidence: 99%

Modular Tree Automata

Bahr

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Having individual Haskell constructors for each funcon would have provided stronger correct-by-construction guarantees about the well-formedness of funcon terms. Several authors [33,34] have used this technique for the specific purpose of defining modular programming-language constructs in a Haskell setting.…”

Section: Funcon Modulesmentioning

confidence: 99%

Executable component-based semantics

Binsbergen

Mosses

Sculthorpe

2019

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

The potential benefits of formal semantics are well known. However, a substantial amount of work is required to produce a complete and accurate formal semantics for a major language; and when the language evolves, large-scale revision of the semantics may be needed to reflect the changes. The investment of effort needed to produce an initial definition, and subsequently to revise it, has discouraged language developers from using formal semantics. Consequently, many major programming languages (and most domain-specific languages) do not yet have formal semantic definitions. To improve the practicality of formal semantic definitions, the PLanCompS project has developed a component-based approach. In this approach, the semantics of a language is defined by translating its constructs (compositionally) to combinations of so-called fundamental constructs, or 'funcons'. Each funcon is defined using a modular variant of Structural Operational Semantics, and forms a language-independent component that can be reused in definitions of different languages. A substantial library of funcons has been developed and tested in several case studies. Crucially, the definition of each funcon is fixed, and does not need changing when new funcons are added to the library. For specifying component-based semantics, we have designed and implemented a metalanguage called CBS. It includes specification of abstract syntax, of its translation to funcons, and of the funcons themselves. Development of CBS specifications is supported by an integrated development environment. The accuracy of a language definition can be tested by executing the specified translation on programs written in the defined language, and then executing the resulting funcon terms using an interpreter generated from the CBS definitions of the funcons. This paper gives an introduction to CBS, illustrates its use, and presents the various tools involved in our implementation of CBS.

show abstract

Compilation à la Carte

Day

Hutton

2013

Proceedings of the 25th Symposium on Implementation and Application of Functional Languages

View full text Add to dashboard Cite

Towards Modular Compilers for Effects

Cited by 4 publications

References 14 publications

Modular Tree Automata

Modular Tree Automata

Executable component-based semantics

Compilation à la Carte

Contact Info

Product

Resources

About