On composable properties of term rewriting systems

Takahito Aoto, Yoshihito Toyama

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

7 Citations (Scopus)

Abstract

A property of term rewriting system (TRS, for short) is said to be composable if it is preserved under unions. We present composable properties of TRSs on the base of modularity results for direct sums of TRSs. We propose a decomposition by a naive sort attachment, and show that modular properties for direct sums of TRSs are τ-composable for a naive sort attachment τ. Here, a decomposition of a TRS R is a pair (R 1,R 2) of (not necessary disjoint) subsets of R such that R = R 1 U R 2; and for a naive sort attachment T a property ø of TRSs is said to be τ-composable if for any TRS R such that τ is consistent withR, ø(R1) Λ φ(R2) implies φ(R) where (R 1, R 2) is the decomposition of R by τ.

Original languageEnglish
Title of host publicationAlgebraic and Logic Programming - 6th International Joint Conference ALP 1997 ― HOA 1997, Proceedings
EditorsKarl Meinke, Michael Hanus, Jan Heering
PublisherSpringer-Verlag
Pages114-128
Number of pages15
ISBN (Print)3540634592, 9783540634591
DOIs
Publication statusPublished - 1997 Jan 1
Event6th International Conference on Algebraic and Logic Programming, ALP 1997 - Southampton, United Kingdom
Duration: 1997 Sep 31997 Sep 5

Publication series

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

Other

Other6th International Conference on Algebraic and Logic Programming, ALP 1997
CountryUnited Kingdom
CitySouthampton
Period97/9/397/9/5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On composable properties of term rewriting systems'. Together they form a unique fingerprint.

Cite this