Computing in Systems Described by Equations

I: Introduction.- II: Syntax, semantics and proof theory for equational logic.- III: Subtree replacement systems.- IV: The confluence property and the Church-Rosser property.- V: Termination.- VI: Costs of reduction sequences.- VII: Schematic definitions of SRSs.- VIII: Recursively defined functions.- IX: Applications of SRS theory to LISP and lucid.- X: Another approach to confluence, termination, optimality.