Section: Software

Cat

Participant : Yves Guiraud [ correspondant ] .

Cat is an automatic termination prover for first-order functional programs. It translates such a rewriting system into a 3-polygraph and tries to find a derivation proving its termination, using the results of [6] [51] . If possible, it seeks a derivation that proves that the program is polynomial [3] . For the moment, Cat is a prototype giving results on simple examples. One goal is to specialize it to prove termination of Tom strategies, translated as first-order functional programs.