2026-07-21T23:59:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16282 2024-03-06T10:57:08Z ddc:004 open_access

Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk) Kop, Cynthia Termination Modularity Higher-order term rewriting Dependency Pairs Algebra Interpretations This paper discusses a number of methods to prove termination of higher-order term rewriting systems, with a particular focus on large systems. In first-order term rewriting, the dependency pair framework can be used to split up a large termination problem into multiple (much) smaller components that can be solved individually. This is important because a large problem may take exponentially longer to solve in one go than solving each of its components. Unfortunately, while there are higher-order versions of several of these methods, they often fail to simplify a problem enough. Here, we will explore some of these techniques and their limitations, and discuss what else can be done to incrementally build a termination proof for higher-order systems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Cynthia Kop 2022 Is Part Of LIPIcs, Volume 228, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2022.1 urn:nbn:de:0030-drops-162827 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.1 eng https://creativecommons.org/licenses/by/4.0/legalcode