Modularity of confluence: A simplified proof

Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel de Vrijer

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting is confluent.

Original languageEnglish
Pages (from-to)101-109
Number of pages9
JournalInformation Processing Letters
Volume49
Issue number2
DOIs
Publication statusPublished - 1994 Jan 28

Keywords

  • Confluence
  • Modularity
  • Term rewriting systems
  • Theory of computation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Modularity of confluence: A simplified proof'. Together they form a unique fingerprint.

  • Cite this

    Willem Klop, J., Middeldorp, A., Toyama, Y., & de Vrijer, R. (1994). Modularity of confluence: A simplified proof. Information Processing Letters, 49(2), 101-109. https://doi.org/10.1016/0020-0190(94)90034-5