Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
 

Summary: Harnessing First Order Termination Provers
Using Higher Order Dependency Pairs
Carsten Fuhs1
and Cynthia Kop2
1
RWTH Aachen University, LuFG Informatik 2, 52056 Aachen, Germany
fuhs@informatik.rwth-aachen.de
2
Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
kop@few.vu.nl
Abstract. Many functional programs and higher order term rewrite
systems contain, besides higher order rules, also a significant first order
part. We discuss how an automatic termination prover can split a rewrite
system into a first order and a higher order part. The results are appli-
cable to all common styles of higher order rewriting with simple types,
although some dependency pair approach is needed to use them.
Key words: higher order rewriting, termination, dependency pairs,
modularity
1 Introduction
Termination of term rewrite systems has been an area of active research for

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences