Within a module, predicates can be defined by clauses local to that module and by imports from an - number of other modules. Finally, an extension to facilitate Simula-style classes is provided. A program for symbolic regular algebra S. C. Hirst, Basser Department of Computer Science, University of Sydney, NSW, 2006. The paper presents a user overview, design philosophy and some applications of a program for performing symbolic computation in the domain of regular algebra. Our expression space extends the usual regular expressions to arbitrary systems of equations with special emphasis given to the transformations of simplification, differentiation and the construction of finite state machines.
Simplification is described using the concept of a 'weakened' canonical form.
The account of differentiation which is an extension to the work of Brzozowski, finds an economical way of differentiating arbitrary equation systems.