Hierarchical termination revisited.
type: Item
instance of: scholarly article
title: Hierarchical termination revisited.
zbMATH Open document ID: 1042.68602
DOI: 10.1016/S0020-0190(02)00272-7
author: Enno Ohlebusch
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1856477
zbMATH Keywords: Program correctness
zbMATH Keywords: Theory of computation
zbMATH Keywords: Term rewriting
zbMATH Keywords: Termination
zbMATH Keywords: Hierarchical programs
MaRDI profile type: Publication
cites work: Termination of term rewriting using dependency pairs
cites work: Modular termination proofs for rewriting using dependency pairs
cites work: Generalized sufficient conditions for modular termination of rewriting
cites work: Q4846997
cites work: Q4490728
cites work: Modular proofs for completeness of hierarchical term rewriting systems
cites work: Q4539643
cites work: Q4539636
full work available at URL: s0020-0190(02)00272-7
OpenAlex ID: W2040067413
description: scientific article; zbMATH DE number 1856477