Analysing the implicit complexity of programs

Information and Computation

Volumn 183, Issue 1, 2003, Pages 2-18

  Marion, J Y ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING;

LIGHT MULTISET PATH ORDERING (LMPO);

COMPUTER PROGRAM LISTINGS;

EID: 0038147487     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00011-7     Document Type: Review

References (18)

1. N. Andersen, N.D. Jones, Generalizing Cook's transformation to imperative stack programs, in: J. Karhumäki, Ḣ. Maurer, G. Rozenberg (Eds.), Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science, vol. 812, Springer-Verlag, Berlin/New York, 1994, pp. 1-18.
2. S. Bellantoni, S. Cook, A new recursion-theoretic characterization of the poly-time functions, Comput. Complexity 2 (1992) 97-110.
3. R. Benzinger, Automated Complexity Analysis of NUPRL Extracts, Ph.D. thesis, Cornell University, 1999.
4. V.-H. Caseiro, An Equational Characterization of the Poly-Time Functions on Any Constructor Data Strucure," Technical Report 226, University of Oslo, Department of Informatics, 1996, available at http://www.ifi.uio.no/̃ftp/publications.
5. L. Colson, Functions versus algorithms, Bull. EATCS 65, the logic in computer science column, 1998.
6. S. Cook, Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach. 18 (1) (1971) 4-18.
7. N. Dershowitz, Orderings for term-rewriting systems, Theoret. Comput. Sci. 17 (3) (1982) 279-301.
8. N. Dershowitz, Termination of rewriting, J. Symbolic Comput. (1987) 69-115.
9. N. Dershowitz, J.P. Jouannaud, Rewrite systems, in: Handbook of Theoretical Computer Science, vol. B, Elsevier Science, North-Holland, Amsterdam, 1990, pp. 243-320.
10. D. Hofbauer, Termination proofs with multiset path orderings imply primitive recursive derivation lengths, Theoret. Comput. Sci. 105 (1) (1992) 129-140.
11. M. Hofmann, Linear types and non-size-increasing polynomial time computation, in: 14th IEEE Symposium on Logic in Computer Science, 1999, pp. 464-473.
12. N. Jones, Computability and Complexity, from a Programming Perspective, MIT Press, Cambridge, MA, 1997.
13. S. Kamin, J.J. Lévy. Attempts for Generalising the Recursive Path Orderings, Technical report. University of Illinois, Urbana, Unpublished note, 1980.
14. J.B. Kruskal, Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc. 95 (1960) 210-225.
15. D. Leivant, Predicative recurrence and computational complexity I: Wont recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematrics II, Birkhäuser, Basel, 1994, pp. 320-343.
16. J.-Y. Marion, J.-Y. Moyen, Efficient first order functional program interpreter with time bound certifications, in: LPAR, Lecture Notes in Artificial Intelligence, vol. 1955, Springer-Verlag, New York, 2000, pp. 25-42.
17. D. Plaisted, A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems, Technical Report R-78-943, Department of Computer Science, University of Illinois, 1978.
18. H. Simmons, The realm of primitive recursion, Arch. Math. Logic 27 (1988) 177-188.