Writing Composable Software with InterpreterLib

Snyder, Mark; Frisby, Nicolas; Kimmell, Garrin; Alexander, Perry

doi:10.1007/978-3-642-02655-3_12

Cited by 1 publication

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, code that does not go through the Game toolchain still has to track roots itself. Second, the evaluator is treated as a single entity, with little support for modularization, especially compared to modular interpreters using monad transformers [11,17]. However, we believe both of these concerns to be…”

Section: Discussion All Three Instantiationsmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Customized Interpreters from Reusable Evaluators Using Game

Timbermont

Roover

D'Hondt

2012

Software Composition

View full text Add to dashboard Cite

Abstract. Separation of concerns is difficult to achieve in the implementation of a programming language interpreter. We argue that evaluator concerns (i.e., those implementing the operational semantics of the language) are, in particular, difficult to separate from the runtime concerns (e.g., memory and stack management) that support them. This precludes the former from being reused and limits variability in the latter. In this paper, we present the Game environment for composing customized interpreters from a reusable evaluator and different variants of its supporting runtime. To this end, Game offers a language for specifying the evaluator according to the generic programming methodology. Through a transformation into defunctionalized monadic style, the Game toolchain generates a generic abstract machine in which the sequencing of low-level interpretational steps is parameterized. Given a suitable instantiation of these parameters for a particular runtime, the toolchain is able to inject the runtime into the generic abstract machine such that a complete interpreter is generated. To validate our approach, we port the prototypical Scheme evaluator to Game and compose the resulting generic abstract machine with several runtimes that vary in their automatic memory management as well as their stack discipline.

show abstract

Section: Discussion All Three Instantiationsmentioning

confidence: 99%

“…In the context of modularity in interpreters, monads and monad transformers proved to be a very useful abstraction technique [11,17]. The notion of defunctionalized monadic style incorporates the abstraction power of monadic style.…”

Section: Related Workmentioning

confidence: 99%