Inheritance of rewrite rule structures applied to symbolic computation

Authors:
Jason F. Harris
Affiliations:
Department of Physics & Astronomy, University of Canterbury, Christchurch, New Zealand
Venue:
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1994

Citing 8
Cited 0

Algebraic Specifications in Software Engineering

Algebraic Specifications in Software Engineering
Programming in Mathematica

Programming in Mathematica
Algebraic specification

Handbook of theoretical computer science (vol. B)
Mathematica: a system for doing mathematics by computer (2nd ed.)

Mathematica: a system for doing mathematics by computer (2nd ed.)
Abstract specification of structures and methods in symbolic mathematical computation

Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Algebraic Specification Techniques in Object Oriented Programming Environments

Algebraic Specification Techniques in Object Oriented Programming Environments
Matching and Unification for the Object-Oriented Symbolic Computation System AlgBench

DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.