An Analyser of Rewriting Systems Complexity

Jean-Yves Moyen (1)

1 CALLIGRAMME - Linear logic, proof networks and categorial grammars

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 quasi-interpretations.

Mots clés: Quasi-interpretations

Domaines: Logique en informatique [cs.LO]; Complexité [cs.CC]

Jean-Yves Moyen. An Analyser of Rewriting Systems Complexity. Workshop on Implicit Computational Complexity, May 2001, Aarhus, Denmark. pp.93-99. ⟨hal-00153132⟩