2000 character limit reached
Higher-order dependency pairs (1804.08855v1)
Published 24 Apr 2018 in cs.LO
Abstract: 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.