Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited in

(only showing first 100 items - show all)

On equational theories, unification, and (un)decidability
Finite generation of ambiguity in context-free languages
Confluence of algebraic rewriting systems
A note on special thue systems with a single defining relation
Combinatorial \(N_\infty\) operads
Axiomatisation des tests
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
Explaining Gabriel-Zisman localization to the computer
Inferring a tree from walks
Conditional semi-Thue systems for presenting monoids
Partial completion of equational theories
On interreduction of semi-complete term rewriting systems
On the confluence of lambda-calculus with conditional rewriting
Some decision problems about controlled rewriting systems
Units of special Church-Rosser monoids
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
Determinism in parallel systems
Termination by completion
Automating inductionless induction using test sets
Algebraic semantics and complexity of term rewriting systems
The Church-Rosser property for ground term-rewriting systems is decidable
Reductions in tree replacement systems
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
A notation for lambda terms. A generalization of environments
n-level rewriting systems
An axiomatic approach to the Korenjak-Hopcroft algorithms
The translation power of top-down tree-to-graph transducers
An introduction to category-based equational logic
Remarks on an example of Jantzen
Symmetric bimonoidal intermuting categories and \(\omega\times\omega\) reduced bar constructions
Equality between functionals in the presence of coproducts
Unification in permutative equational theories is undecidable
Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
Modular tree transducers
Comparison of priority rules in pattern matching and term rewriting
Simple second-order languages for which unification is undecidable
Semantics and strong sequentiality of priority term rewriting systems
NTS grammars and Church-Rosser systems
On the duality of abduction and model generation in a framework for model generation with equality
On the Knuth-Bendix completion for concurrent processes
History and basic features of the critical-pair/completion procedure
Rewriting systems and word problems in a free partially commutative monoid
Anti-patterns for rule-based languages
Coherent confluence modulo relations and double groupoids
Analysis of Dehn's algorithm by critical pairs
Gröbner bases of associative algebras and the Hochschild cohomology
A \(\rho\)-calculus of explicit constraint application
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
Completion procedures as semidecision procedures
Infinite complete group presentations
Pebble games for studying storage sharing
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
On deciding confluence of finite string-rewriting systems modulo partial commutativity
Upper Bounds on Stream I/O Using Semantic Interpretations
On complexity bounds and confluence of parallel term rewriting
Proving confluence in the confluence framework with confident
Axioms for a theory of signature bases
Confluence of terminating membership conditional TRS
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
Local confluence of conditional and generalized term rewriting systems
Closure properties of knapsack semilinear groups
Design strategies for rewrite rules
Unification, weak unification, upper bound, lower bound, and generalization problems
Using groups for investigating rewrite systems
Syntactic properties of the refal language
Testing confluence of nonterminating rewriting systems
Termination and confluence in infinitary term rewriting
Abelian networks IV. Dynamics of nonhalting networks
A knowledge-based approach to program synthesis from examples
Normal higher-order termination
Combining matching algorithms: The regular case
From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
A local termination property for term rewriting systems
On how to move mountains ‘associatively and commutatively’
Layer systems for proving confluence
A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
A note on confluent Thue systems
A Characterization of NC k by First Order Functional Programs
Applying term rewriting methods to finite groups
Normal form in Hecke-Kiselman monoids associated with simple oriented graphs
Confluence Criteria for Logically Constrained Rewrite Systems
Left-Linear Completion with AC Axioms
Compositional confluence criteria
Braids via term rewriting
Reducing relative termination to dependency pair problems
Problems in rewriting applied to categorical concepts by the example of a computational comonad
Ranking trees generated by rotations
Confluence: the unifying, expressive power of locality
The ℛ-height of semigroups and their bi-ideals
Certifying confluence proofs via relative termination and rule labeling
On confluence versus strong confluence for one-rule trace-rewriting systems
Labelings for decreasing diagrams
A rewriting coherence theorem with applications in homotopy type theory
Semantics of concurrent revisions
Certification of classical confluence results for left-linear term rewrite systems
Shuffle polygraphic resolutions for operads
Confluence of orthogonal term rewriting systems in the prototype verification system
Normal forms for binary relations

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)