Signature Extensions Preserve Termination

DOI10.1007/978-3-642-15205-4_39zbMath1287.03032OpenAlexW96821497MaRDI QIDQ3586062

Christian Sternagel, René Thiemann

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_39

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items

Generalized and Formalized Uncurrying ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Uncurrying for termination and complexity ⋮ Size-based termination of higher-order rewriting ⋮ Modularity in term rewriting revisited ⋮ Certified equational reasoning via ordered completion ⋮ Derivational complexity and context-sensitive Rewriting

This page was built for publication: Signature Extensions Preserve Termination