2026-08-17T09:52:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3130 2024-03-06T10:33:50Z ddc:004 open_access

CRSX - Combinatory Reduction Systems with Extensions Rose, Kristoffer H. Higher-Order Rewriting Compilers 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kristoffer H. Rose 2011 Is Part Of LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2011.81 urn:nbn:de:0030-drops-31301 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.81 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode