Efficient first order functional program interpreter with time bound certifications

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

Volumn 1955, Issue , 2000, Pages 25-42

  Marion, Jean Yves ^a   Moyen, J Y ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; FUNCTIONS; POLYNOMIAL APPROXIMATION; PROGRAM DIAGNOSTICS; RECONFIGURABLE HARDWARE;

FIRST-ORDER FUNCTIONAL PROGRAMS; MULTISET PATH ORDERING; OPTIMISATIONS; POLYNOMIAL-TIME; QUASI-INTERPRETATION; TIME BOUND;

PROGRAM INTERPRETERS;

EID: 84956853109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (34)

1. Aehlig, K., and Schwichtenberg, H. A syntactical analysis of non-sizeincreasing polynomial time computation. In Proceedings of the Fifteenth IEEE Symposium on Logic in Computer Science (LICS’00) (2000), pp. 84–91.
2. Basin, D., and Ganzinger, H. Automated complexity analysis based on ordered resolution. Journal of the ACM (2000). To appear.
3. Bellantoni, S., and Cook, S. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2 (1992), 97–110.
4. Bellantoni, S., Niggl, K.-H., and Schwichtenberg, H. Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic 104, 1-3 (2000), 17–30.
5. Benzinger, R. Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University, 1999.
6. Bonfante, G., Cichon, A., Marion, J.-Y., and Touzet, H. Complexity classes and rewrite systems with polynomial interpretation. In Computer Science Logic, 12th International Workshop, CSL’98 (1999), vol. 1584 of Lecture Notes in Computer Science, pp. 372–384. Full version will appear in Journal of Functional Programming.
7. Caseiro, V.-H. An equational characterization of the poly-time functions on any constructor data strucure. Tech. Rep. 226, University of Oslo, Dept. of informatics, December 1996. http://www.ifi.uio.no/∼ftp/publications.
8. Cichon, A., and Weiermann, A. Term rewriting therory for the primitive recursive functions. Annals of pure and applied logic 83 (1997), 199–223.
9. Clote, P. Computational models and function algebras. In LCC’94 (1995), D. Leivant, Ed., vol. 960 of Lecture Notes in Computer Science, pp. 98–130.
10. Cobham, A. The intrinsic computational difficulty of functions. In Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, Y. Bar-Hillel, Ed. North-Holland, Amsterdam, 1962, pp. 24–30.
11. Colson, L. Functions versus algorithms. Bulletin of EATCS 65 (1998). The logic in computer science column.
12. Cook, S. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM 18(1) (January 1971), 4–18.
13. Crary, K., and Weirich, S. Ressource bound certification. In ACM SIGPLANSIGACT symposium on Principles of programming languages, POPL (2000), pp. 184–198.
14. Dershowitz, N. Orderings for term-rewriting systems. Theoretical Computer Science 17, 3 (1982), 279–301.
15. Dershowitz, N., and Jouannaud, J.-P. Handbook of Theoretical Computer Science vol.B. Elsevier Science Publishers B. V. (NorthHolland), 1990, ch. Rewrite systems, pp. 243–320.
16. Hofbauer, D. Termination proofs with multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science 105, 1 (1992), 129–140.
17. Hofmann, M. Linear types and non-size-increasing polynomial time computation. In Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science (LICS’99) (1999), pp. 464–473.
18. Hofmann, M. Programming languages capturing complexity classes. SIGACT News Logic Column 9 (2000).
19. Hofmann, M. A type system for bounded space and functional in-place update. In European Symposium on Programming, ESOP’00 (2000), vol. 1782 of Lecture Notes in Computer Science, pp. 165–179.
20. Huet, G. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM 27, 4 (1980), 797–821.
21. Jones, N. Computability and complexity, from a programming perspective. MIT press, 1997.
22. Jones, N. Logspace and ptime characterized by programming languages. Theoretical Computer Science 228 (1999), 151–174.
23. Jones, N. The expressive power of higher order types or, life without cons. To appear, 2000.
24. Kamin, S., and Lévy, J.-J. Attempts for generalising the recursive path orderings. Tech. rep., Univerity of Illinois, Urbana, 1980. Unpublished note.
25. Lankford, D. On proving term rewriting systems are noetherien. Tech. Rep. MTP-3, Louisiana Technical University, 1979.
26. Leivant, D. A foundational delineation of computational feasiblity. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS’91) (1991).
27. Leivant, D. Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Feasible Mathematics II, P. Clote and J. Remmel, Eds. Birkhäuser, 1994, pp. 320–343.
28. Leivant, D. Applicative control and computational complexity. In Computer Science Logic, 13th International Workshop, CSL’99 (1999), vol. 1683 of Lecture Notes in Computer Science, pp. 82–95.
29. Liu, Y. A., and Stoller, S. D. Dynamic programming via static incrementalization. In Proceedings of the 8th European Symposium on Programming (Amsterdam, The Netherlands, March 1999), Springer-Verlag, pp. 288–305.
30. Marion, J.-Y. Analysing the implicit complexity of programs. Tech. rep., Loria, 2000. Presented at the workshop Implicit Computational Complexity (ICC’99), FLOC, Trento, Italy. The paper is submitted and accessible from http://www.loria.fr/∼marionjy.
31. Péter, R. Rekursive Funktionen. Akadémiai Kiadó, Budapest, 1966. English translation: Recursive Functions, Academic Press, New York, 1967.
32. Plaisted, D. A recursively defined ordering for proving termination of term rewriting systems. Tech. Rep. R-78-943, Department of Computer Science, University of Illinois, 1978.
33. Ritchie, R. Classes of predictably computable functions. Transaction of the American Mathematical Society 106 (1963), 139–173.
34. Simmons, H. The realm of primitive recursion. Archive for Mathematical Logic 27 (1988), 177–188.