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
Shuffle polygraphic resolutions for operads
Theorem proving modulo associativity
Pregeometric spaces from Wolfram model rewriting systems as homotopy types
Normal higher-order termination
Normal form in Hecke-Kiselman monoids associated with simple oriented graphs
Title not available (Why is that?)
Title not available (Why is that?)
Axioms for a theory of signature bases
Local confluence of conditional and generalized term rewriting systems
Algebraic coherent confluence and higher globular Kleene algebras
Semantics of concurrent revisions
Towards automated deduction in cP systems
General idempotency languages over small alphabets
Closure properties of knapsack semilinear groups
Reducing relative termination to dependency pair problems
Design strategies for rewrite rules
Termination and confluence in infinitary term rewriting
A Characterization of NC k by First Order Functional Programs
On confluence versus strong confluence for one-rule trace-rewriting systems
Confluence of orthogonal term rewriting systems in the prototype verification system
Testing confluence of nonterminating rewriting systems
Confluence of terminating membership conditional TRS
Confluence: the unifying, expressive power of locality
The ℛ-height of semigroups and their bi-ideals
Upper Bounds on Stream I/O Using Semantic Interpretations
Certifying confluence proofs via relative termination and rule labeling
Certification of classical confluence results for left-linear term rewrite systems
On complexity bounds and confluence of parallel term rewriting
Proving confluence in the confluence framework with confident
Syntactic properties of the refal language
Combining matching algorithms: The regular case
Compositional confluence criteria
Title not available (Why is that?)
Sharing proofs with predicative theories through universe-polymorphic elaboration
Unification, weak unification, upper bound, lower bound, and generalization problems
Using groups for investigating rewrite systems
A knowledge-based approach to program synthesis from examples
From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
Normal forms for binary relations
Unification properties of commutative theories: a categorical treatment
Confluence Criteria for Logically Constrained Rewrite Systems
Left-Linear Completion with AC Axioms
String diagram rewrite theory. I: Rewriting with Frobenius structure
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
Transformation of shaped nested graphs and diagrams

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)