Higher-order dependency pairs

04/24/2018
by   Frédéric Blanqui, et al.
0

Arts and Giesl proved that the termination of a first-order rewrite system can be reduced to the study of its "dependency pairs". We extend these results to rewrite systems on simply typed lambda-terms by using Tait's computability technique.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2019

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting

Dependency pairs are a key concept at the core of modern automated termi...
research
12/10/2021

Formalizing Higher-Order Termination in Coq

We describe a formalization of higher-order rewriting theory and formall...
research
05/19/2023

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

Dependency pairs are one of the most powerful techniques to analyze term...
research
04/06/2009

Dependency Pairs and Polynomial Path Orders

We show how polynomial path orders can be employed efficiently in conjun...
research
05/23/2018

The unified higher-order dependency pair framework

In recent years, two higher-order extensions of the powerful dependency ...
research
04/03/2009

The Derivational Complexity Induced by the Dependency Pair Method

We study the derivational complexity induced by the dependency pair meth...
research
02/23/2021

Higher order phase averaging for highly oscillatory systems

We introduce a higher order phase averaging method for nonlinear oscilla...

Please sign up or login with your details

Forgot password? Click here to reset