论文信息 - System Presentation: An Analyser of Rewriting Systems Complexity

System Presentation: An Analyser of Rewriting Systems Complexity

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

Jean-Yves Moyen

[1] Jean-Yves Marion,et al. Efficient First Order Functional Program Interpreter with Time Bound Certifications , 2000, LPAR.

[2] Jan van Leeuwen,et al. Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[3] Guillaume Bonfante,et al. Algorithms with polynomial interpretation termination proof , 2001, Journal of Functional Programming.

[4] Neil D. Jones. The expressive power of higher-order types or, life without CONS , 2001, J. Funct. Program..

[5] Guillaume Bonfante,et al. On Lexicographic Termination Ordering with Space Bound Certifications , 2001, Ershov Memorial Conference.