<abstract xmlns="http://www.w3.org/1999/xhtml"><p>We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras requiring some equalities of terms, e.g., associativity of addition.</p></abstract>

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras requiring some equalities of terms, e.g., associativity of addition.

Free Term Algebras

Faculty of Computer Science, Białystok Technical University, Wiejska 45A, 15-351 Białystok, Poland

Formalized Mathematics

{"article-title":"Free Term Algebras"}

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free...

Free Term Algebras

Published Online: Feb 02, 2013

Page range: 239 - 256

DOI: https://doi.org/10.2478/v10037-012-0029-6

This content is open access.