Higher-order dependency pairs

04/24/2018

∙

by   Frédéric Blanqui, et al.

∙

0

∙

share

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.