Pages that link to "Item:Q3908463"
From MaRDI portal
The following pages link to Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems (Q3908463):
Displaying 50 items.
- Series parallel digraphs with loops (Q372966) (← links)
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent (Q407556) (← links)
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs (Q418014) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
- Approximate XML structure validation based on document-grammar tree similarity (Q527155) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Building exact computation sequences (Q579925) (← links)
- Unification in commutative theories (Q582071) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- Orderings for term-rewriting systems (Q593789) (← links)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem (Q616850) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Confluence for graph transformations (Q672753) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Importing logics (Q694499) (← links)
- Conditional linearization (Q698633) (← links)
- De Bruijn's weak diamond property revisited (Q740482) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Non-commutative Gröbner bases in algebras of solvable type (Q752147) (← links)
- Termination by completion (Q757069) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- On word problems in Horn theories (Q757095) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- Determinism in parallel systems (Q786533) (← links)
- Proofs by induction in equational theories with constructors (Q789177) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Remarks on an example of Jantzen (Q793015) (← links)
- On graph rewritings (Q800736) (← links)
- Modular tree transducers (Q807012) (← links)
- Simple second-order languages for which unification is undecidable (Q807609) (← links)
- Comparison of priority rules in pattern matching and term rewriting (Q808264) (← links)
- Explaining Gabriel-Zisman localization to the computer (Q861700) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
