CRSX - Combinatory Reduction Systems with Extensions

Author Kristoffer H. Rose

Thumbnail PDF


  • Filesize: 0.66 MB
  • 10 pages

Document Identifiers

Author Details

Kristoffer H. Rose

Cite AsGet BibTex

Kristoffer H. Rose. CRSX - Combinatory Reduction Systems with Extensions. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 81-90, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Combinatory Reduction Systems with Extensions (CRSX) is a system available from and characterized by the following properties: - Higher-order rewriting engine based on pure Combinatory Reduction Systems with full strong reduction (but no specified reduction strategy). - Rule and term syntax based on lambda-calculus and term rewriting conventions including Unicode support. - Strict checking and declaration requirements to avoid idiosyncratic errors in rewrite rules. - Interpreter is implemented in Java 5 and usable stand-alone as well as from an Eclipse plugin (under development). - Includes a custom parser generator (front-end to JavaCC parser generator) designed to ease parsing directly into higher-order abstract syntax (as well as permitting the use of custom syntax in rules files). - Experimental (and evolving) sort system to help rule management. - Compiler from (well-sorted deterministic subset of) CRSX to stand-alone C code.
  • Higher-Order Rewriting
  • Compilers


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads