On the Confluence of Linear Shallow Term Rewrite Systems
Lists
Only you see this
Abstract
We show that the confluence of shallow linear term rewrite systems is decidable. The decision procedure is a nontrivial generalization of the polynomial time algorithms for deciding confluence of ground and restricted non-ground term rewrite systems presented in [13]
BibTeX
@inproceedings{godoy2003confluence,
author = {Guillem Godoy and Ashish Tiwari and Rakesh M. Verma},
title = {{On the Confluence of Linear Shallow Term Rewrite Systems}},
booktitle = {STACS},
year = {2003},
url = {https://openreview.net/forum?id=14ZISSFlagF},
}Loading related content...