Termination modulo equations by abstract commutation with an application to iteration

Wan Fokkink; Hans Zantema

doi:10.1016/S0304-3975(96)00254-X

Termination modulo equations by abstract commutation with an application to iteration

Wan Fokkink^*, Hans Zantema

^*Corresponding author for this work

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

We generalize a termination theorem in term rewriting, based on an abstract commutation technique, to rewriting modulo equations. This result is applied in the setting of process algebra with iteration.

Original language	English
Pages (from-to)	407-423
Number of pages	17
Journal	Theoretical Computer Science
Volume	177
Issue number	2
DOIs	https://doi.org/10.1016/S0304-3975(96)00254-X
Publication status	Published - 15 May 1997

Access to Document

10.1016/S0304-3975(96)00254-X

Persistent URL (handle)

Persistent link

Cite this

@article{05048669fd5140d69f0add75f1987251,

title = "Termination modulo equations by abstract commutation with an application to iteration",

abstract = "We generalize a termination theorem in term rewriting, based on an abstract commutation technique, to rewriting modulo equations. This result is applied in the setting of process algebra with iteration.",

author = "Wan Fokkink and Hans Zantema",

year = "1997",

month = may,

day = "15",

doi = "10.1016/S0304-3975(96)00254-X",

language = "English",

volume = "177",

pages = "407--423",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Termination modulo equations by abstract commutation with an application to iteration

AU - Fokkink, Wan

AU - Zantema, Hans

PY - 1997/5/15

Y1 - 1997/5/15

N2 - We generalize a termination theorem in term rewriting, based on an abstract commutation technique, to rewriting modulo equations. This result is applied in the setting of process algebra with iteration.

AB - We generalize a termination theorem in term rewriting, based on an abstract commutation technique, to rewriting modulo equations. This result is applied in the setting of process algebra with iteration.

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

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

U2 - 10.1016/S0304-3975(96)00254-X

DO - 10.1016/S0304-3975(96)00254-X

M3 - Article

AN - SCOPUS:0031144119

SN - 0304-3975

VL - 177

SP - 407

EP - 423

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

Termination modulo equations by abstract commutation with an application to iteration

Abstract

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this