Innocuous constructor-sharing combinations

Nachum Dershowitz*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate conditions under which confluence and/or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is left-linear and convergent.

Original languageEnglish
Title of host publicationRewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings
EditorsHubert Comon
PublisherSpringer Verlag
Pages202-216
Number of pages15
ISBN (Print)3540629505, 9783540629504
DOIs
StatePublished - 1997
Externally publishedYes
Event8th International Conference on Rewriting Techniques and Applications, RTA 1997 - Sitges, Spain
Duration: 2 Jun 19975 Jun 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1232
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Rewriting Techniques and Applications, RTA 1997
Country/TerritorySpain
CitySitges
Period2/06/975/06/97

Fingerprint

Dive into the research topics of 'Innocuous constructor-sharing combinations'. Together they form a unique fingerprint.

Cite this