System presentation: An analyser of rewriting system complexity
Abstract
This paper briefly describes ICAR, a program which analyses the implicit complexity of first order functionnal programs. ICAR is based on two previous characterisation of ptime and pspace by mean of term rewriting termination orderings and polynomial