Modular proofs for completeness of hierarchical term rewriting systems
type: Item
instance of: scholarly article
title: Modular proofs for completeness of hierarchical term rewriting systems
zbMATH Open document ID: 0871.68109
DOI: 10.1016/0304-3975(95)00075-8
author: M. R. K. Krishna Rao
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 983987
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00075-8
OpenAlex ID: W2077956228
cites work: Q3783521
cites work: Q4385532
cites work: Q4692463
cites work: Q4255514
cites work: Q4246729
cites work: Q3805891
cites work: Algorithmic Learning Theory
cites work: Q4268467
cites work: Q4490728
cites work: Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
cites work: Q4202945
cites work: Modular term rewriting systems and the termination
cites work: Modularity of simple termination of term rewriting systems with shared constructors
cites work: Modularity of completeness revisited
cites work: Q3204048
cites work: Modular properties of conditional term rewriting systems
cites work: Completeness of combinations of constructor systems
cites work: Q4431370
cites work: Q4954455
cites work: Modular properties of composable term rewriting systems
cites work: On termination of the direct sum of term-rewriting systems
cites work: On the Church-Rosser property for the direct sum of term rewriting systems
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: Termination for direct sums of left-linear complete term rewriting systems
Recommended article: Modular properties of composable term rewriting systems
Recommended article: Modularity in term rewriting revisited
Recommended article: Q4364594
Recommended article: Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
Recommended article: On the modularity of termination of term rewriting systems
Recommended article: Modular termination proofs for rewriting using dependency pairs
Recommended article: Q4539636
Recommended article: On the completeness of modular proof systems
Recommended article: Modular term rewriting systems and the termination
Recommended article: On modularity in infinitary term rewriting
description: scientific article; zbMATH DE number 983987