License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2023.9
URN: urn:nbn:de:0030-drops-179936
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17993/
Ivanov, Ievgen
Generalized Newman’s Lemma for Discrete and Continuous Systems
Abstract
We propose a generalization of Newman’s lemma which gives a criterion of confluence for a wide class of not-necessarily-terminating abstract rewriting systems. We show that ordinary Newman’s lemma for terminating systems can be considered as a corollary of this criterion. We describe a formalization of the proposed generalized Newman’s lemma in Isabelle proof assistant using HOL logic.
BibTeX - Entry
@InProceedings{ivanov:LIPIcs.FSCD.2023.9,
author = {Ivanov, Ievgen},
title = {{Generalized Newman’s Lemma for Discrete and Continuous Systems}},
booktitle = {8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-277-8},
ISSN = {1868-8969},
year = {2023},
volume = {260},
editor = {Gaboardi, Marco and van Raamsdonk, Femke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17993},
URN = {urn:nbn:de:0030-drops-179936},
doi = {10.4230/LIPIcs.FSCD.2023.9},
annote = {Keywords: abstract rewriting system, confluence, discrete-continuous systems, proof assistant, formal proof}
}
Keywords: |
|
abstract rewriting system, confluence, discrete-continuous systems, proof assistant, formal proof |
Collection: |
|
8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
28.06.2023 |
Supplementary Material: |
|
Text: https://doi.org/10.5281/zenodo.7855691 |