Completeness of combinations of constructor systems

DOI10.1007/3-540-53904-2_96zbMath1503.68138OpenAlexW2166898558MaRDI QIDQ5055759

Aart Middeldorp, Yoshihito Toyama

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_96

zbMATH Keywords

normal formcritical pairreduction sequencemodular propertyfunction symbol

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Decidability of reachability for disjoint union of term rewriting systems ⋮ More problems in rewriting ⋮ Modular termination of \(r\)-consistent and left-linear term rewriting systems ⋮ Completeness of combinations of conditional constructor systems ⋮ Modularity of simple termination of term rewriting systems with shared constructors ⋮ Interaction nets and term rewriting systems (extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular term rewriting systems and the termination
• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• Modularity of simple termination of term rewriting systems with shared constructors
• On theories with a combinatorial definition of 'equivalence'
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Modular aspects of properties of term rewriting systems related to normal forms
• Termination for the direct sum of left-linear term rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems

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