Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited In (only showing first 100 items - show all)

Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
Symmetric bimonoidal intermuting categories and \(\omega\times\omega\) reduced bar constructions
On deciding confluence of finite string-rewriting systems modulo partial commutativity
On equational theories, unification, and (un)decidability
Analysis of Dehn's algorithm by critical pairs
Anti-patterns for rule-based languages
Infinite complete group presentations
Explaining Gabriel-Zisman localization to the computer
An introduction to category-based equational logic
Combinatorial \(N_\infty\) operads
Coherent confluence modulo relations and double groupoids
On the confluence of lambda-calculus with conditional rewriting
Units of special Church-Rosser monoids
Equality between functionals in the presence of coproducts
A \(\rho\)-calculus of explicit constraint application
A notation for lambda terms. A generalization of environments
On the duality of abduction and model generation in a framework for model generation with equality
An axiomatic approach to the Korenjak-Hopcroft algorithms
Semantics and strong sequentiality of priority term rewriting systems
Termination by completion
Automating inductionless induction using test sets
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
Gröbner bases of associative algebras and the Hochschild cohomology
A note on special thue systems with a single defining relation
Remarks on an example of Jantzen
Unification in permutative equational theories is undecidable
Confluence of algebraic rewriting systems
The translation power of top-down tree-to-graph transducers
Some decision problems about controlled rewriting systems
Algebraic semantics and complexity of term rewriting systems
Equational completion in order-sorted algebras
A characterisation of deterministic context-free languages by means of right-congruences
An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
Reductions in tree replacement systems
Pebble games for studying storage sharing
n-level rewriting systems
History and basic features of the critical-pair/completion procedure
Rewriting systems and word problems in a free partially commutative monoid
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
Determinism in parallel systems
On the Knuth-Bendix completion for concurrent processes
The Church-Rosser property for ground term-rewriting systems is decidable
Conditional semi-Thue systems for presenting monoids
Completion procedures as semidecision procedures
Axiomatisation des tests
On interreduction of semi-complete term rewriting systems
Inferring a tree from walks
Partial completion of equational theories
Modular tree transducers
Comparison of priority rules in pattern matching and term rewriting
Simple second-order languages for which unification is undecidable
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
Finite generation of ambiguity in context-free languages
NTS grammars and Church-Rosser systems
About the rewriting systems produced by the Knuth-Bendix completion algorithm
Term rewriting induction
Twenty years of rewriting logic
A new invariant of plane bipartite cubic graphs
The conservation theorem for differential nets
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Unification theory
Diagrammatic confluence for constraint handling rules
Adding algebraic rewriting to the untyped lambda calculus
Ordered rewriting and confluence
Confluence modulo equivalence in Constraint Handling Rules
Word problems and a homological finiteness condition for monoids
Some undecidable termination problems for semi-Thue systems
Undecidable properties of deterministic top-down tree transducers
Confluence without termination via parallel critical pairs
CSI -- a confluence tool
A catalogue of complete group presentations
Quasi-interpretations. A way to control resources
Orderings for term-rewriting systems
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
Rewriting systems of Coxeter groups
The undecidability of the D_A-unification problem
Proofs by induction in equational theories with constructors
On recursive path ordering
The geometry of tensor calculus. I
Higher-order rewrite systems and their confluence
Decidable approximations of term rewriting systems
Higher categories, strings, cubes and simplex equations
Decreasing diagrams and relative termination
Decreasing diagrams and relative termination
A calculational approach to mathematical induction
On sufficient-completeness and related properties of term rewriting systems
Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Deterministic tree pushdown automata and monadic tree rewriting systems
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Unification in commutative theories
Towards a foundation of completion procedures as semidecision procedures
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
On word problems in Horn theories
Unification in a combination of arbitrary disjoint equational theories
A complete proof of correctness of the Knuth-Bendix completion algorithm
Decidability of elementary theories of certain finitely defined algebras
Confluence of one-rule Thue systems
Fundamental properties of infinite trees

This page was built for publication: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

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