Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited in

(only showing first 100 items - show all)

Proving Confluence of Term Rewriting Systems Automatically
Conditional rewriting logic: Deduction, models and concurrency
On graph rewritings
Real or natural number interpretation and their effect on complexity
Unique normal forms for nonlinear term rewriting systems: Root overlaps
About the rewriting systems produced by the Knuth-Bendix completion algorithm
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
A rewriting coherence theorem with applications in homotopy type theory
Problems in rewriting III
The first-order theory of one-step rewriting is undecidable
Automatic acquisition of search control knowledge from multiple proof attempts.
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Collapsed tree rewriting: Completeness, confluence, and modularity
Symmetric bimonoidal intermuting categories and \(\omega\times\omega\) reduced bar constructions
Critical pairs in term graph rewriting
Twenty years of rewriting logic
Modularity of simple termination of term rewriting systems with shared constructors
On inductive inference of cyclic structures
Bisimilarity in term graph rewriting.
Strict coherence of conditional rewriting modulo axioms
On weakly confluent monadic string-rewriting systems
Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
Term rewriting induction
Confluence by critical pair analysis revisited
A superposition oriented theorem prover
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Some undecidability results for non-monadic Church-Rosser Thue systems
On deciding confluence of finite string-rewriting systems modulo partial commutativity
Some results on the confluence property of combined term rewriting systems
A new invariant of plane bipartite cubic graphs
On equational theories, unification, and (un)decidability
Thue systems as rewriting systems
Implementing first-order rewriting with constructor systems
scientific article; zbMATH DE number 3684923 (Why is no real title available?)
Shuffle polygraphic resolutions for operads
Analysis of Dehn's algorithm by critical pairs
Causal automata
Theorem proving modulo associativity
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Linear numeration systems, \(\theta\)-developments and finite automata
Completion for rewriting modulo a congruence
Complete sets of transformations for general E-unification
A semantic approach to order-sorted rewriting
Anti-patterns for rule-based languages
Conditional linearization
Computing with relational machines
Properties of grammatical codes of trees
Pregeometric spaces from Wolfram model rewriting systems as homotopy types
Infinite complete group presentations
On restrictions of ordered paramodulation with simplification
Open problems in rewriting
The conservation theorem for differential nets
scientific article; zbMATH DE number 3772918 (Why is no real title available?)
Explaining Gabriel-Zisman localization to the computer
A confluent calculus for concurrent constraint programming
A refinement of strong sequentiality for term rewriting with constructors
Adding algebraic rewriting to the untyped lambda calculus
A Transformational Approach to Prove Outermost Termination Automatically
Normal higher-order termination
scientific article; zbMATH DE number 40567 (Why is no real title available?)
Linear numeration systems of order two
Graph grammars and operational semantics
Unification theory
Any ground associative-commutative theory has a finite canonical system
Continuous monoids and yields of infinite trees
Calcul de longueurs de chaînes de réécriture dans le monoïde libre
Confluence modulo equivalence in Constraint Handling Rules
Diagrammatic confluence for constraint handling rules
Word problems and a homological finiteness condition for monoids
Normal form in Hecke-Kiselman monoids associated with simple oriented graphs
Some undecidable termination problems for semi-Thue systems
An introduction to category-based equational logic
Undecidable properties of deterministic top-down tree transducers
Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
Combinatorial \(N_\infty\) operads
Confluence and commutation for nominal rewriting systems with atom-variables
Ordered rewriting and confluence
scientific article; zbMATH DE number 7650583 (Why is no real title available?)
Coherent confluence modulo relations and double groupoids
Axioms for a theory of signature bases
Local confluence of conditional and generalized term rewriting systems
Quasi-interpretations. A way to control resources
A catalogue of complete group presentations
Orderings for term-rewriting systems
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
Confluence without termination via parallel critical pairs
Algebraic coherent confluence and higher globular Kleene algebras
Synthesized and inherited functions. A new computational model for syntax-directed semantics
CSI -- a confluence tool
Testing for the ground (co-)reducibility property in term-rewriting systems
Semantics of concurrent revisions
Congruential complements of ground term rewrite systems
On the confluence of lambda-calculus with conditional rewriting
Rewriting modulo isotopies in pivotal linear (2,2)-categories
Closure properties of knapsack semilinear groups
Units of special Church-Rosser monoids
Equality between functionals in the presence of coproducts
A \(\rho\)-calculus of explicit constraint application
Rewriting systems of Coxeter groups
An improved general path order

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)