Rewrite: The Term Rewriting Tools

Sergey B. Samoilenko

 (require "main.rkt")
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.

    1 Motivation

      1.1 Short examples

    2 Replacement Forms

      2.1 Singlefold Rewriting

      2.2 Repetitive Rewriting

    3 Formal Functions

      3.1 Motivation

      3.2 Declaring Formal Functions

    4 Utilities