scientific article; zbMATH DE number 3934390

MaRDI QIDQ3706484zbMATH OpenFDO

Authors H. Perdrix

Publication date 1984

zbMATH Keywords

Church-Rosser propertyconfluenceequational theoriesnon-resolution theorem provingterm rewriting systemsterminationunification

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Recommendations

• Completion of a Set of Rules Modulo a Set of Equations
• The Church-Rosser property for ground term-rewriting systems is decidable
• scientific article; zbMATH DE number 6109844
• scientific article; zbMATH DE number 3850463
• scientific article; zbMATH DE number 3949707

Cited in

(16)

• Parameter-preserving data type specifications
• The Church-Rosser property for ground term-rewriting systems is decidable
• History and basic features of the critical-pair/completion procedure
• A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
• Church-Rosser property for conditional rewriting systems with built-in predicates as premises
• On the Church-Rosser property and reducibility of natural derivations
• Complexity Versus the Church‐Rosser Property and Confluence
• Learning of Church-Rosser tree rewriting systems
• scientific article; zbMATH DE number 3896290 (Why is no real title available?)
• scientific article; zbMATH DE number 4047062 (Why is no real title available?)
• Completion of a Set of Rules Modulo a Set of Equations
• scientific article; zbMATH DE number 4106267 (Why is no real title available?)
• A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
• On the Church-Rosser property for the direct sum of term rewriting systems
• Proving weak properties of rewriting
• Abstract abstract reduction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706484)