On lexicographic termination ordering with space bound certifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2244 LNCS, Issue , 2001, Pages 482-493

  Bonfante, Guillaume ^a   Marion, Jean Yves ^a   Moyen, Jean Yves ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FUNCTIONS;

FIRST-ORDER FUNCTIONAL PROGRAMS; FREE ALGEBRA; LEXICOGRAPHIC PATH ORDERING; POLYNOMIAL SPACE; QUASI-INTERPRETATION; SPACE BOUNDS; SPACE COMPLEXITY;

FUNCTIONS; INFORMATION SCIENCE;

EID: 84891457627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45575-2_46     Document Type: Conference Paper

References (23)

1. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
2. R. Benzinger. Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University, 1999.
3. thInternational Workshop, CSL'98, volume 1584 of Lecture Notes in Computer Science, pages 372-384, 1999.
4. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114-133, 1981.
5. A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24-30. North-Holland, Amsterdam, 1962.
6. R. Constable and al. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, 1986. http://www.cs.cornell.edu/Info/Projects/NuPrl/ nuprl.html.
7. K. Crary and S. Weirich. Ressource bound certification. In ACM SIGPLANSIGACT symposium on Principles of programming languages, POPL, pages 184 - 198, 2000.
8. N. Dershowitz and J-P Jouannaud. Handbook of Theoretical Computer Science vol.B, chapter Rewrite systems, pages 243-320. Elsevier Science Publishers B. V. (North-Holland), 1990.
9. A. Goerdt. Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science, 100(1):45-66, 1992.
10. D. Hofbauer. Termination proofs with multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science, 105(1):129-140, 1992.
11. M. Hofmann. Linear types and non-size-increasing polynomial time computation. In Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science (LICS'99), pages 464-473, 1999.
12. M. Hofmann. A type system for bounded space and functional in-place update. In European Symposium on Programming, ESOP'00, volume 1782 of Lecture Notes in Computer Science, pages 165-179, 2000.
13. N. Immerman. Descriptive Complexity. Springer, 1999.
14. N. Jones. The Expressive Power of Higher order Types or, Life without CONS. to appear, 2000.
15. S. Kamin and J-J Lévy. Attempts for generalising the recursive path orderings. Technical report, Univerity of Illinois, Urbana, 1980. Unpublished note.
16. M. S. Krishnamoorthy and P. Narendran. On recursive path ordering. Theoretical Computer Science, 40(2-3):323-328, October 1985.
17. D.S. Lankford. On proving term rewriting systems are noetherien. Technical Report MTP-3, Louisiana Technical University, 1979.
18. D. Leivant. Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, pages 320-343. Birkḧauser, 1994.
19. thWorkshop, CSL '94, volume 933 of Lecture Notes in Computer Science, pages 486-500, Kazimierz, Poland, 1995. Springer.
20. J-Y Marion. Complexité implicite des calculs, de la théorie ̀a la pratique, 2000. Habilitation.
21. J-Y Marion and J-Y Moyen. Efficient first order functional program interpreter with time bound certifications. In LPAR, volume 1955 of Lecture Notes in Computer Science, pages 25-42. Springer, Nov 2000.
22. D.B. Thompson. Subrecursiveness : machine independent notions of computability in restricted time and storage. Math. System Theory, 6:3-15, 1972.
23. A. Weiermann. Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science, 139:335-362, 1995.