Parallel object-oriented term rewriting : the booleans

Abstract

As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism ASF. Correctness proofs for the implementations are sketched.