System presentation: An analyser of rewriting systems complexity

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 4, 2001, Pages 412-424

  Moyen, J Y ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS; SET THEORY;

CONSTRUCTORS; FUNCTION SYMBOLS; LEXICOGRAPHIC PATH ORDERING; MULTISET PATH ORDERING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19144371680     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00300-7     Document Type: Conference Paper

References (7)

1. Bonfante G., Cichon A., Marion J.-Y., Touzet H. Algorithms with polynomial interpretation termination proof. Journal of Functional Programming. 11:2000
2. Bonfante G., Marion J.-Y., and Moyen J.-Y. On lexicographic termination ordering with space bound certifications. In PSI (Jul 2001), Lecture Notes in Computer Science, Springer.
3. Dershowitz N., Jouannaud J.-P. Handbook of Theoretical Computer Science. vol. B:1990;243-320 Elsevier Science Publishers B. V. (NorthHolland). ch. Rewrite systems
4. Jones N. The expressive power of higher order types or, life without cons. Journal of Functional Programming 11. 1:2000;55-94
5. Marion J.-Y. Analysing the implicit complexity of programs. Information and Computation. 2000;. to appear.
6. Marion J.-Y. Complexité implicite des calculs, de la thorie la pratique, 2000. Habilitation.
7. Marion J.-Y., and Moyen J.-Y. Efficient first order functional program interpreter with time bound certifications. In LPAR (Nov 2000), vol. 1955 of Lecture Notes in Computer Science, Springer, pp. 25-42.