About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
RTA 2011
Conference paper
CRSX-Combinatory Reduction Systems with Extensions
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 λ-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. © Kristoffer H. Rose.