Skip to Main content Skip to Navigation
Conference papers

On complexity analysis by quasi-interpretation

Guillaume Bonfante 1 Jean-Yves Marion 1 Jean-Yves Moyen 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a survey on a method to analyse the program time and space complexity, based on termination orderings and quasi-interpretation. This method can be implemented to certify the runtime (or space) of programs. We demonstrate that the class of functions computed by first order functional programs over free algebras which terminate by permutation Path Ordering (resp. Lexicographic Path Ordering) and admit a quasi-interpretation bounded by a polynomial, is exactly the class of functions computable in polynomial time (resp. space).
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:14:08 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00100099, version 1



Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On complexity analysis by quasi-interpretation. 2nd Appsem II workshop - APPSEM'04, 2004, Tallinn, Estonia, pp.85-95. ⟨inria-00100099⟩



Record views