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
Sequentiality in orthogonal term rewriting systems
Deterministic tree pushdown automata and monadic tree rewriting systems
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
A combinatory account of internal structure
Embedding and Confluence of Graph Transformations with Negative Application Conditions
CSI -- a confluence tool
How to prove decidability of equational theories with second-order computation analyser SOL
Decision problems for semi-Thue systems with a few rules
A new invariant of plane bipartite cubic graphs
The attributed pi-calculus with priorities
The geometry of tensor calculus. I
Word problems and a homological finiteness condition for monoids
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
A finite Thue system with decidable word problem and without equivalent finite canonical system
Tree transducers with external functions
A confluent relational calculus for higher-order programming with constraints
Conditional rewriting logic as a unified model of concurrency
A catalogue of complete group presentations
Confluence by decreasing diagrams
Higher categories, strings, cubes and simplex equations
Some undecidable termination problems for semi-Thue systems
The conservation theorem for differential nets
Decreasing diagrams and relative termination
Quasi-interpretations. A way to control resources
A complete proof of correctness of the Knuth-Bendix completion algorithm
Undecidable properties of deterministic top-down tree transducers
Shallow confluence of conditional term rewriting systems
Non-commutative Gröbner bases in algebras of solvable type
Unification in commutative theories
Termination orderings for associative-commutative rewriting systems
Church-Rosser systems with respect to formal languages
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
About the rewriting systems produced by the Knuth-Bendix completion algorithm
Decreasing diagrams and relative termination
Attribute grammars and recursive program schemes. I. II
Term rewriting: Some experimental results
Higher-order rewrite systems and their confluence
Proving Confluence of Term Rewriting Systems Automatically
Diagrammatic confluence for constraint handling rules
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
CoLL: a confluence tool for left-linear term rewrite systems
Adding algebraic rewriting to the untyped lambda calculus
Tableaux and hypersequents for justification logics
Orderings for term-rewriting systems
Ordered rewriting and confluence

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)