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
On graph rewritings
Modularity of simple termination of term rewriting systems with shared constructors
Strict coherence of conditional rewriting modulo axioms
On weakly confluent monadic string-rewriting systems
Confluence by critical pair analysis revisited
A superposition oriented theorem prover
Some undecidability results for non-monadic Church-Rosser Thue systems
Some results on the confluence property of combined term rewriting systems
Thue systems as rewriting systems
Implementing first-order rewriting with constructor systems
Linear numeration systems, \(\theta\)-developments and finite automata
Causal automata
On restrictions of ordered paramodulation with simplification
Completion for rewriting modulo a congruence
Complete sets of transformations for general E-unification
Title not available (Why is that?)
Properties of grammatical codes of trees
A Transformational Approach to Prove Outermost Termination Automatically
Conditional linearization
Any ground associative-commutative theory has a finite canonical system
A confluent calculus for concurrent constraint programming
A refinement of strong sequentiality for term rewriting with constructors
Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
Graph grammars and operational semantics
Congruential complements of ground term rewrite systems
Testing for the ground (co-)reducibility property in term-rewriting systems
Bottom-up tree pushdown automata and rewrite systems
Title not available (Why is that?)
Context rewriting
An improved general path order
Building exact computation sequences
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Completeness of combinations of constructor systems
Decidable sentences of Church-Rosser congruences
De Bruijn's weak diamond property revisited
A note on a special one-rule semi-Thue system
Pushdown machines for the macro tree transducer
Unification in varieties of idempotent semigroups
Unification in combinations of collapse-free regular theories
On deciding the confluence of a finite string-rewriting system on a given congruence class
A Noetherian and confluent rewrite system for idempotent semigroups
Combining matching algorithms: The regular case
A formalization of the Knuth-Bendix(-Huet) critical pair theorem
Testing for the Church-Rosser property

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)