Solution to the problem of Zantema on a persistent property of term rewriting systems

Takahito Aoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.

Original languageEnglish
Title of host publicationPrinciples of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings
EditorsCatuscia Palamidessi, Hugh Glaser, Karl Meinke
PublisherSpringer Verlag
Pages250-265
Number of pages16
ISBN (Print)3540650121, 9783540650126
DOIs
Publication statusPublished - 1998 Jan 1
Event10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998 - Pisa, Italy
Duration: 1998 Sep 161998 Sep 18

Publication series

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

Other

Other10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998
CountryItaly
CityPisa
Period98/9/1698/9/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Solution to the problem of Zantema on a persistent property of term rewriting systems'. Together they form a unique fingerprint.

  • Cite this

    Aoto, T. (1998). Solution to the problem of Zantema on a persistent property of term rewriting systems. In C. Palamidessi, H. Glaser, & K. Meinke (Eds.), Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings (pp. 250-265). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1490). Springer Verlag. https://doi.org/10.1007/bfb0056618