Abstract
Combinatory Reduction Systems with Extensions (CRSX) is a system
available from http://crsx.sourceforge.net 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.
BibTeX - Entry
@InProceedings{rose:LIPIcs:2011:3130,
author = {Kristoffer H. Rose},
title = {{CRSX - Combinatory Reduction Systems with Extensions}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {81--90},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9 },
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Manfred Schmidt-Schau{\ss}},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3130},
URN = {urn:nbn:de:0030-drops-31301},
doi = {10.4230/LIPIcs.RTA.2011.81},
annote = {Keywords: Higher-Order Rewriting, Compilers}
}
|
Keywords: |
|
Higher-Order Rewriting, Compilers |
|
Collection: |
|
22nd International Conference on Rewriting Techniques and Applications (RTA'11) |
|
Issue Date: |
|
2011 |
|
Date of publication: |
|
26.04.2011 |
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)