• search hit 2 of 3
Back to Result List

Confluence without Termination via Parallel Critical Pairs

  • We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting systems. The criterion is based on certain strong joinabil-ity properties of parallel critical pairs . We show how this criterion relates toother well-known results, consider some special cases and discuss some possibleextensions.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Bernhard Gramlich
URN (permanent link):urn:nbn:de:hbz:386-kluedo-3549
Serie (Series number):SEKI Report (95,13)
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of Publication:1999
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/04/03
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011