Publisher Summary Equations and formulas occur frequently in mathematics, logic, and
computer science. This chapter reviews the main results concerning equations and the …

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Page 1 Confluent Reductions: Abstract Properties and Applications to Term Rewriting …

Publisher Summary This chapter focuses on rewrite systems, which are directed equations
used to compute by repeatedly replacing sub-terms of a given formula with equal terms until …

A history of Haskell Page 1 A History of Haskell: Being Lazy With Class Paul Hudak Yale
University paul.hudak@yale.edu John Hughes Chalmers University rjmh@cs.chalmers.se …

This survey describes methods for proving that systems of rewrite rules are terminating
programs. We illustrate the use in termination proofs of various kinds of orderings on terms …

ABSTgACT. Tree pattern matching is an interesting special problem which occurs as a
crucial step ma number of programmmg tasks, for instance, design of interpreters for …

Compiler-component generators, such as lexical analyzer generators and parser
generators, have long been used to facilitate the construction of compilers. A tree …

Abstract Fay has described in [2, 3] a complete T-unification for equational theories T which
possess a complete set of reductions as defined by Knuth & Bendix [12]. This algorithm …

Graph rewriting (also called reduction) as defined in Wadsworth [1971] was introduced in
order to be able to give a more efficient implementation of functional programming …

In a declarative programming language a computation is expressed in a static fashion, as a
list of declarations. A program in such a language is regarded as a specification that …