Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited in

(only showing first 100 items - show all)

Fundamental properties of infinite trees
Some undecidability results for non-monadic Church-Rosser Thue systems
A superposition oriented theorem prover
Axiomatisation des tests
A note on a special one-rule semi-Thue system
Termination orderings for associative-commutative rewriting systems
A finite Thue system with decidable word problem and without equivalent finite canonical system
Properties of substitutions and unifications
On sufficient-completeness and related properties of term rewriting systems
On recursive path ordering
Reductions in tree replacement systems
n-level rewriting systems
The problems of cyclic equality and conjugacy for finite complete rewriting systems
Pushdown machines for the macro tree transducer
Unification in varieties of idempotent semigroups
A refinement of strong sequentiality for term rewriting with constructors
Proof by consistency
A catalogue of complete group presentations
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Termination of rewriting
Thue systems as rewriting systems
Unification in combinations of collapse-free regular theories
Analysis of Dehn's algorithm by critical pairs
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
The Church-Rosser property for ground term-rewriting systems is decidable
Rewriting systems and word problems in a free partially commutative monoid
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
On deciding the confluence of a finite string-rewriting system on a given congruence class
History and basic features of the critical-pair/completion procedure
Word problems and a homological finiteness condition for monoids
Linear numeration systems of order two
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Critical pair criteria for completion
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
On lexicographic semi-commutations
Implementing first-order rewriting with constructor systems
Finite generation of ambiguity in context-free languages
Deterministic tree pushdown automata and monadic tree rewriting systems
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
Full abstraction and limiting completeness in equational languages
Using unavoidable set of trees to generalize Kruskal's theorem
Higher-order rewrite systems and their confluence
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Compositions with superlinear deterministic top-down tree transformations
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
A notation for lambda terms. A generalization of environments
A complete proof of correctness of the Knuth-Bendix completion algorithm
NTS grammars and Church-Rosser systems
Testing for the Church-Rosser property
Pebble games for studying storage sharing
Attribute grammars and recursive program schemes. I. II
Graph grammars and operational semantics
Monadic Thue systems
When is a monoid a group? The Church-Rosser case is tractable
A Noetherian and confluent rewrite system for idempotent semigroups
The geometry of tensor calculus. I
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Trace monoids with some invertible generators: Two decision problems
A criterion for proving noetherianity of a relation
Combining matching algorithms: The regular case
Sequentiality in orthogonal term rewriting systems
Reduction rules for resolution-based systems
Conditional rewriting logic as a unified model of concurrency
An implementation of syntax directed functional programming on nested- stack machines
Causal automata
A new invariant of plane bipartite cubic graphs
Modularity of simple termination of term rewriting systems with shared constructors
Confluent linear numeration systems
Adding algebraic rewriting to the untyped lambda calculus
Tree transducers with external functions
Completion for rewriting modulo a congruence
On the Knuth-Bendix completion for concurrent processes
Complete sets of transformations for general E-unification
On deciding confluence of finite string-rewriting systems modulo partial commutativity
Diagram techniques for confluence
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
Semantics and strong sequentiality of priority term rewriting systems
The first-order theory of linear one-step rewriting is undecidable
On the equivalence problem for letter-to-letter top-down tree transducers
Homotopy reduction systems for monoid presentations
A categorical critical-pair completion algorithm
An abstract machine for concurrent modular systems: CHARM
On the duality of abduction and model generation in a framework for model generation with equality
Efficient solution of the word problem in slim varieties
Properties of grammatical codes of trees
Rewriting systems of Coxeter groups
Confluence by decreasing diagrams
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Eta-conversion for the languages of explicit substitutions
The translation power of top-down tree-to-graph transducers
Some results on the confluence property of combined term rewriting systems
Synthesized and inherited functions. A new computational model for syntax-directed semantics
Undecidable properties of deterministic top-down tree transducers
Higher categories, strings, cubes and simplex equations
Label-selective -calculus syntax and confluence
Buchberger's algorithm: The term rewriter's point of view
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
A calculational approach to mathematical induction
A confluent calculus for concurrent constraint programming
Developing developments

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)