Please use this identifier to cite or link to this item:
doi:10.22028/D291-41483 | Title: | Confluence without Termination via Parallel Critical Pairs |
| Author(s): | Gramlich, Bernhard |
| Language: | English |
| Year of Publication: | 1995 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting systems. The criterion is based on certain strong joinability properties of parallel critical pairs. We show how this criterion relates to other well-known results, consider some special cases and discuss some possible extensions. |
| Link to this record: | urn:nbn:de:bsz:291--ds-414836 hdl:20.500.11880/37784 http://dx.doi.org/10.22028/D291-41483 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 95,13 |
| Date of registration: | 4-Jun-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-95-13_Gramlich_Confluence-without-Termination-via-Parallel-Critical-Pairs .pdf | 2,22 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.