On Confluence of Parallel-Innermost Term Rewriting
Résumé
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures. We propose a simple sufficient criterion for confluence of parallelinnermost rewriting based on non-overlappingness. Our experiments on a large benchmark set indicate the practical usefulness of our criterion. We close with a challenge to the community to develop more powerful dedicated techniques for this problem.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|