Compositional Confluence Criteria
We show how confluence criteria based on decreasing diagrams are generalized to ones composable with other criteria. For demonstration of the method, the confluence criteria of orthogonality, rule labeling, and critical pair systems for term rewriting are recast into composable forms. We also show h...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2024-01-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/11045/pdf |
| Summary: | We show how confluence criteria based on decreasing diagrams are generalized
to ones composable with other criteria. For demonstration of the method, the
confluence criteria of orthogonality, rule labeling, and critical pair systems
for term rewriting are recast into composable forms. We also show how such a
criterion can be used for a reduction method that removes rewrite rules
unnecessary for confluence analysis. In addition to them, we prove that
Toyama's parallel closedness result based on parallel critical pairs subsumes
his almost parallel closedness theorem. |
|---|---|
| ISSN: | 1860-5974 |