Automated Implicit Computational Complexity Analysis (System Description)

Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully automatic and commandline based) system that implements the majority of these techniques and present experimental ndings to simplify comparisons.

• Type: Conference
• Year: 2008
• Where: CADE
• Authors: Martin Avanzini, Georg Moser, Andreas Schnabl
• Keywords: CADE 2008, Fully Automatic, Logical Reasoning, Term Rewriting Techniques, Time Computable Functions