About these proceedings
This volume contains the papers preesented at the Third
International Workshop on Conditional Term Rewriting
Systems, held in Pont- -Mousson, France, July 8-10, 1992.
Topics covered include conditional rewriting and its
applications to programming languages, specification
languages, automated deduction, constrained rewriting, typed
rewriting, higher-order rewriting, and graph rewriting.
The volume contains 40 papers, including four invited talks:
Algebraic semantics of rewriting terms and types, by K.
Meinke; Generic induction proofs, by P. Padawitz;
Conditional term rewriting and first-order theorem proving,
by D. Plaisted; and Decidability of finiteness properties
(abstract), by L. Pacholski.
The first CTRS workshop was held at the University of Paris
in 1987 and the second at Concordia University, Montreal, in
1990. Their proceddings are published as Lecture Notes in
Computer Science Volumes 308 and 516 respectively.
Automat automated deduction programming programming language proving semantics theorem proving