Abstract

The paper describes the Knuth/Bendix‐like completion subsystem of the PROSPECTRA programming environment. It consists of two independent completion procedures for conditional equations. The paper introduces some of the underlying theory and contains examples that illustrate the use of these procedures.