Strong sequentiality of left-linear overlapping term rewriting systems

Yoshihito Toyama

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

26 Citations (Scopus)

Abstract

G. Huet and J. J. Levy (INRIA Rep. 359, 1979) showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, index reduction strategy is normalizing. Their result is extended to overlapping term rewriting systems. It is shown that index reduction is normalizing for the class of strongly sequential left-linear term rewriting systems in which every critical pair can be joined with root balanced reductions. This class includes all weakly orthogonal left-normal systems, for which a leftmost-outermost reduction strategy is normalizing.

Original languageEnglish
Title of host publicationProceedings - Symposium on Logic in Computer Science
PublisherPubl by IEEE
Pages274-284
Number of pages11
ISBN (Print)0818627352
Publication statusPublished - 1992 Jun 1
EventProceedings of the 7th Annual IEEE Symposium on Logic in Computer Science - Santa Cruz, CA, USA
Duration: 1992 Jun 221992 Jun 25

Publication series

NameProceedings - Symposium on Logic in Computer Science

Other

OtherProceedings of the 7th Annual IEEE Symposium on Logic in Computer Science
CitySanta Cruz, CA, USA
Period92/6/2292/6/25

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Strong sequentiality of left-linear overlapping term rewriting systems'. Together they form a unique fingerprint.

  • Cite this

    Toyama, Y. (1992). Strong sequentiality of left-linear overlapping term rewriting systems. In Proceedings - Symposium on Logic in Computer Science (pp. 274-284). (Proceedings - Symposium on Logic in Computer Science). Publ by IEEE.