|To load:||(require (planet samsergey/rewrite:1:0))|
|Old style:||(require (planet "main.rkt" ("samsergey" "rewrite.plt" 1 0)))|
|Min Racket version:||5.0|
Implementation of rewriting systems for Racket.
|Downloads this week:||0|
[no interface available]
|Packages in other repositories|
These packages are not available in the 3xx repository, but they are available for other versions of Racket.
|PLaneT version||External version||Source||DLs||Docs||Req. PLT||Date added|
|To load: (require (planet "main.rkt" ("samsergey" "rewrite.plt" 1 (= 0))))|
|Available in repositories: 4.x|
|The package provides tools for programming via term rewriting technique. Provided forms could be considered as a syntactic sugar for Racket's match form, however they offer different semantics. The package introduces repetitive rewriting in order to obtain the normal form of given expression, ability to transform any subpart in nested list structure and definition of formal functions which abstract general algebraic types.Contains numerous examples.|