Proving innermost normalisation automatically

DOI10.1007/3-540-62950-5_68zbMath1379.68191OpenAlexW1480168175MaRDI QIDQ4594225

Jürgen Giesl, Thomas Arts

Publication date: 17 November 2017

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/18360

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (12)

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Certifying a Termination Criterion Based on Graphs, without Graphs ⋮ Termination of term rewriting using dependency pairs ⋮ Unnamed Item ⋮ Proving weak properties of rewriting ⋮ Context-sensitive dependency pairs ⋮ Termination of Priority Rewriting ⋮ Using well-founded relations for proving operational termination ⋮ Induction for termination with local strategies ⋮ Some characteristics of strong innermost normalization ⋮ ELAN from a rewriting logic point of view

This page was built for publication: Proving innermost normalisation automatically