Inheritance of rewrite rule structures applied to symbolic computation
Jason F. Harris · 1994
This paper defines and presents a method of inheritance for structures that are defined by rewrite rules. This method is natural in the sense that it can be easily and cleanly implemented in rewrite rules themselves. This framework of inheritance is not that of classical Object-Oriented Programming. It is shown that this inheritance has particular application to structures implemented in rewrite rules and, more generally, to symbolic computation. The treatment is practical, and examples are presented in Mathematica for concreteness.