From Rogue to MicroRogue

Authors:
Aaron Stump;Ryan Besand;James C. Brodman;Jonathan Hseu;Bill Kinnersley
Affiliations:
Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri, USA11Web: http://cl.cse.wustl.edu/;Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri, USA11Web: http://cl.cse.wustl.edu/;Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri, USA11Web: http://cl.cse.wustl.edu/;Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri, USA11Web: http://cl.cse.wustl.edu/;Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri, USA11Web: http://cl.cse.wustl.edu/
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
Term rewriting and all that

Term rewriting and all that
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Handbook of automated reasoning

Handbook of automated reasoning
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A Trustworthy Proof Checker

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Rewriting Calculus has been proposed as a foundational system combining the central ideas of @l-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.