System Presentation
Jean-Yves Moyen · Electronic Notes in Theoretical Computer Science · 2001
This paper describes ICAR, a program which analyses the implicit complexity of first order functionnal programs. ICAR is based on two previous characterizations of Ptime and Pspace by mean of term rewriting termination orderings and quasi-interpretations polynomially bounded.