@MISC{MSAFREE4.MIZ,
  AUTHOR = {Bancerek, Grzegorz},
  TITLE = {Free Term Algebras},
  SECTION1 = {Preliminaries},
  SECTION2 = {Trivial Algebras},
  SECTION3 = {Image},
  SECTION4 = {Term Algebras},
  SECTION5 = {Satisfiability},
  SECTION6 = {Term Correspondence},
  SECTION7 = {Free Algebras},
  SECTION8 = {Algebras of Normal Forms},
  DAY = {15},
  MONTH = {May},
  YEAR = {2012},
  ADDRESS1 = {Faculty of Computer Science\\Bia{\l}ystok Technical University\\Wiejska 45A, 15-351 Bia{\l}ystok\\Poland},
  SUMMARY = {We introduce a new characterization of algebras of normal forms
of term rewriting systems \cite{KlopTRS} as
algebras of term free in itself (any function from the set of free generators into
the algebra generates endomorphism of the algebra).
Introduced algebras are free in classes
of algebras satisfying some sets of equalities. The universes of them 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.
}}


@InBook{KlopTRS,
  editor = 	 {S. Abramsky, D.M. Gabbay and T.S.E. Maibaum},
  title = 	 {Handbook of Logic in Computer Science},
  chapter = 	 {Term Rewriting Systems},
  publisher = 	 {Oxford University Press},
  year = 	 {1992},
  address = 	 {New York},
  pages = 	 {1--116},
  note = 	 {http://www.informatik.uni-bremen.de/agbkb/lehre/rbs/texte/Klop-TR.pdf}
}

