Parameter-preserving data type specifications

摘要

Term rewriting methods are used for solving the persistency problem of parametrized data type specifications. Such a specification is called persistent if the parameter part of its algebraic symantics agrees with the semantics of the parameter specification. Since persistency mostly cannot be guaranteed for the whole equational variety of the parameter specification, the persistency criteria developed here mainly concern classes of parameter algebras with “built-in” logic.