Modular termination proofs for rewriting using dependency pairs
type: Item
instance of: scholarly article
title: Modular termination proofs for rewriting using dependency pairs
zbMATH Open document ID: 1010.68073
author: Jürgen Gieslthomas Artsenno Ohlebusch
published in: Journal of Symbolic Computation
publication date: 2003-03-23T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1886741
zbMATH Keywords: modularity
zbMATH Keywords: dependency pairs
MaRDI profile type: Publication
full work available at URL: jsco.2002.0541
OpenAlex ID: W2030433877
cites work: Rewriting techniques and applications. 11th international conference, RTA 2000, Norwich, GB, July 10--12, 2000. Proceedings
cites work: Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
cites work: Termination of term rewriting using dependency pairs
cites work: A note on simplification orderings
cites work: Termination of rewriting
cites work: Natural termination
cites work: Q3999156
cites work: Automating the Knuth Bendix ordering
cites work: Q4537515
cites work: Generating polynomial orderings for termination proofs
cites work: Verification of Erlang processes by dependency pairs
cites work: Q2723429
cites work: Frontiers of combining systems 2. Selected papers from the 2nd international workshop (FroCoS'98), Amsterdam, Netherlands, October 2--4, 1998
cites work: Generalized sufficient conditions for modular termination of rewriting
cites work: Q4846997
cites work: On proving termination by innermost termination
cites work: Q4023900
cites work: Q5581665
cites work: Q2778876
cites work: Modular proofs for completeness of hierarchical term rewriting systems
cites work: Modularity of simple termination of term rewriting systems with shared constructors
cites work: Principles and practice of declarative programming. International conference PPDP '99. Paris, France, September 29--October 1, 1999. Proceedings
cites work: Q3197780
cites work: Q4539643
cites work: Type introduction for equational rewriting
cites work: Completeness of combinations of constructor systems
cites work: Simple termination of rewrite systems
cites work: On the modularity of termination of term rewriting systems
cites work: Modular properties of composable term rewriting systems
cites work: Termination of logic programs: Transformational methods revisited
cites work: On termination of the direct sum of term-rewriting systems
cites work: Generating polynomial orderings
cites work: Q4846999
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: Termination for direct sums of left-linear complete term rewriting systems
cites work: Q4539636
cites work: Termination of term rewriting: Interpretation and type elimination
DOI: 10.1006/JSCO.2002.0541
description: scientific article; zbMATH DE number 1886741