Skip to Main content Skip to Navigation
Conference papers

System presentation: An analyser of rewriting system complexity

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 : 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
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:46:28 PM
Last modification on : Friday, February 4, 2022 - 3:31:04 AM


  • HAL Id : inria-00100525, version 1



Jean-Yves Moyen. System presentation: An analyser of rewriting system complexity. Second International Workshop on Rule-Based Programming - RULE'01, Université de Florence, 2001, Firenze, Italy, 7 p. ⟨inria-00100525⟩



Record views