Counterexamples to termination for the direct sum of term rewriting systems
From MaRDI portal
Publication:1107975
DOI10.1016/0020-0190(87)90122-0zbMATH Open0653.68010DBLPjournals/ipl/Toyama87OpenAlexW2080725351WikidataQ56019617 ScholiaQ56019617MaRDI QIDQ1107975FDOQ1107975
Authors: Yoshihito Toyama 
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/99946
Recommendations
- On termination of the direct sum of term-rewriting systems
- scientific article; zbMATH DE number 4180808
- Termination for the direct sum of left-linear term rewriting systems
- Generalized sufficient conditions for modular termination of rewriting
- On the Church-Rosser property for the direct sum of term rewriting systems
Cites Work
Cited In (68)
- Completeness of combinations of conditional constructor systems
- Root-Labeling
- Modular Termination of Basic Narrowing
- From innermost to full almost-sure termination of probabilistic term rewriting
- Finding small counterexamples for abstract rewriting properties
- Type removal in term rewriting
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- A domain model characterising strong normalisation
- On termination of the direct sum of term-rewriting systems
- Modularity in term rewriting revisited
- Modularity of simple termination of term rewriting systems with shared constructors
- Simple termination of rewrite systems
- Generalized sufficient conditions for modular termination of rewriting
- On the modularity of termination of term rewriting systems
- Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
- Modular proofs for completeness of hierarchical term rewriting systems
- Automating the dependency pair method
- Transforming termination by self-labelling
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Automatic synthesis of logical models for order-sorted first-order theories
- Termination of narrowing revisited
- An improved general path order
- Modular aspects of term graph rewriting
- Proving termination by dependency pairs and inductive theorem proving
- Bubbles in modularity
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Completeness of combinations of constructor systems
- Decidability of reachability for disjoint union of term rewriting systems
- Modular termination of prefix-constrained term rewrite systems
- Essentials of term graph rewriting
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Deciding the word problem in the union of equational theories.
- Intersection type assignment systems with higher-order algebraic rewriting
- Jumping and escaping: modular termination and the abstract path ordering
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Title not available (Why is that?)
- Termination for the direct sum of left-linear term rewriting systems
- Combinations of simplifying conditional term rewriting systems
- Termination of term rewriting by interpretation
- Modular and incremental automated termination proofs
- On modularity in infinitary term rewriting
- A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Extension orderings
- Overlap closures do not suffice for termination of general term rewriting systems
- Some classes of term rewriting systems inferable from positive data
- Maximal Termination
- Interaction nets and term-rewriting systems
- Title not available (Why is that?)
- Mechanizing and improving dependency pairs
- Tyrolean termination tool: techniques and features
- Modular term rewriting systems and the termination
- The size-change principle and dependency pairs for termination of term rewriting
- Modular and incremental proofs of AC-termination
- Variant-Based Satisfiability in Initial Algebras
- Modular aspects of properties of term rewriting systems related to normal forms
- Proof certificates for equality reasoning
- Confluence of the disjoint union of conditional term rewriting systems
- Loop detection in term rewriting using the eliminating unfoldings
- Some characteristics of strong innermost normalization
- A uniform framework for term and graph rewriting applied to combined systems
- Modular termination of \(r\)-consistent and left-linear term rewriting systems
- Modularity in noncopying term rewriting
- Termination is not modular for confluent variable-preserving term rewriting systems
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Implementing term rewriting by graph reduction: Termination of combined systems
- Modularity of termination in term graph rewriting
This page was built for publication: Counterexamples to termination for the direct sum of term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107975)
