Sciweavers

3 search results - page 1 / 1
» Introduction to Rewriting
Sort
View
RTA
2007
Springer
14 years 1 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
LFCS
1997
Springer
13 years 11 months ago
Type Introduction for Equational Rewriting
Hitoshi Ohsaki, Aart Middeldorp
AC
1993
Springer
13 years 11 months ago
Introduction to Rewriting
Jean-Pierre Jouannaud