Journal article
From Rogue to MicroRogue
Electronic notes in theoretical computer science, Vol.117, pp.69-87
01/20/2005
DOI: 10.1016/j.entcs.2004.06.028
Abstract
The Rewriting Calculus has been proposed as a foundational system combining the central ideas of λ-calculus and term rewriting. The rewriting is explicit, in the sense that rules must be applied explicitly to terms to transform them. This paper begins with an imperative version of the Rewriting Calculus called Rogue. It then shows how Rogue can itself be conveniently implemented by an even more foundational system called MicroRogue. MicroRogue rewrites terms using a global set of first-order rules. Rules can be enabled, disabled, and dynamically added in scopes, which can be pushed and popped. MicroRogue also provides mechanisms for specifying evaluation order. Using these primitives, a Rogue interpreter can be implemented in less than 40 lines of MicroRogue code.
Details
- Title: Subtitle
- From Rogue to MicroRogue
- Creators
- Aaron Stump - Washington University in St. LouisRyan Besand - Washington University in St. LouisJames C Brodman - Washington University in St. LouisJonathan Hseu - Washington University in St. LouisBill Kinnersley - Washington University in St. Louis
- Resource Type
- Journal article
- Publication Details
- Electronic notes in theoretical computer science, Vol.117, pp.69-87
- DOI
- 10.1016/j.entcs.2004.06.028
- ISSN
- 1571-0661
- eISSN
- 1571-0661
- Publisher
- Elsevier B.V
- Language
- English
- Date published
- 01/20/2005
- Academic Unit
- Computer Science
- Record Identifier
- 9984259463102771
Metrics
8 Record Views