Pages that link to "Item:Q1107975"
From MaRDI portal
The following pages link to Counterexamples to termination for the direct sum of term rewriting systems (Q1107975):
Displaying 50 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Some classes of term rewriting systems inferable from positive data (Q924174) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
- Bubbles in modularity (Q1127335) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Decidability of reachability for disjoint union of term rewriting systems (Q1325846) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- A uniform framework for term and graph rewriting applied to combined systems (Q1583048) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Proof certificates for equality reasoning (Q1744408) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- An improved general path order (Q1925013) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Modular termination of prefix-constrained term rewrite systems (Q2059889) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Maximal Termination (Q3522012) (← links)
- Root-Labeling (Q3522028) (← links)
- Modularity of termination and confluence in combinations of rewrite systems with λω (Q4630300) (← links)
- Extension orderings (Q4645205) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Essentials of Term Graph Rewriting (Q4923548) (← links)
