Innocuous constructor-sharing combinations

Nachum Dershowitz

doi:10.1007/3-540-62950-5_71

Innocuous constructor-sharing combinations

Nachum Dershowitz^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings
Editors	Hubert Comon
Publisher	Springer Verlag
Pages	202-216
Number of pages	15
ISBN (Print)	3540629505, 9783540629504
DOIs	https://doi.org/10.1007/3-540-62950-5_71
State	Published - 1997
Externally published	Yes
Event	8th International Conference on Rewriting Techniques and Applications, RTA 1997 - Sitges, Spain Duration: 2 Jun 1997 → 5 Jun 1997

Publication series

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

Conference

Conference	8th International Conference on Rewriting Techniques and Applications, RTA 1997
Country/Territory	Spain
City	Sitges
Period	2/06/97 → 5/06/97

Access to Document

10.1007/3-540-62950-5_71

Cite this

Dershowitz, N. (1997). Innocuous constructor-sharing combinations. In H. Comon (Ed.), Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings (pp. 202-216). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1232). Springer Verlag. https://doi.org/10.1007/3-540-62950-5_71

@inproceedings{747b216318344950b20d08d4aa139130,

title = "Innocuous constructor-sharing combinations",

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.",

author = "Nachum Dershowitz",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; null ; Conference date: 02-06-1997 Through 05-06-1997",

year = "1997",

doi = "10.1007/3-540-62950-5_71",

language = "אנגלית",

isbn = "3540629505",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "202--216",

editor = "Hubert Comon",

booktitle = "Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings",

}

Dershowitz, N 1997, Innocuous constructor-sharing combinations. in H Comon (ed.), Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1232, Springer Verlag, pp. 202-216, 8th International Conference on Rewriting Techniques and Applications, RTA 1997, Sitges, Spain, 2/06/97. https://doi.org/10.1007/3-540-62950-5_71

Innocuous constructor-sharing combinations. / Dershowitz, Nachum.

Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings. ed. / Hubert Comon. Springer Verlag, 1997. p. 202-216 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1232).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Innocuous constructor-sharing combinations

AU - Dershowitz, Nachum

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947748038&partnerID=8YFLogxK

U2 - 10.1007/3-540-62950-5_71

DO - 10.1007/3-540-62950-5_71

M3 - פרסום בספר כנס

AN - SCOPUS:84947748038

SN - 3540629505

SN - 9783540629504

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 202

EP - 216

BT - Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings

A2 - Comon, Hubert

PB - Springer Verlag

Y2 - 2 June 1997 through 5 June 1997

ER -

Dershowitz N. Innocuous constructor-sharing combinations. In Comon H, editor, Rewriting Techniques and Applications - 8th International Conference, RTA 1997, Proceedings. Springer Verlag. 1997. p. 202-216. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-62950-5_71

Innocuous constructor-sharing combinations

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this