Completeness of combinations of constructor systems

DOI10.1006/JSCO.1993.1024zbMath0778.68050OpenAlexW2072471462MaRDI QIDQ2368072

Aart Middeldorp, Yoshihito Toyama

Publication date: 22 August 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4f2a0907e74ba3987042634bd4dfa0661a1dc945

zbMATH Keywords

modularity of completeness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (16)

Generalized sufficient conditions for modular termination of rewriting ⋮ On proving termination by innermost termination ⋮ Modularity of termination in term graph rewriting ⋮ On the modularity of termination of term rewriting systems ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ Modular and incremental proofs of AC-termination ⋮ On modularity in term rewriting and narrowing ⋮ Interaction nets and term-rewriting systems ⋮ Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems ⋮ Simple termination of rewrite systems ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Modularity in noncopying term rewriting ⋮ Modular aspects of term graph rewriting ⋮ Some characteristics of strong innermost normalization ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs

This page was built for publication: Completeness of combinations of constructor systems