Termination proofs and complexity certification

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

Volumn 2215, Issue , 2001, Pages 183-200

  Leivant, Daniel ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE;

FUNCTIONAL PROGRAMS; KALMAR-ELEMENTARY FUNCTIONS; POSITIVE FORMULA; PROGRAM EXECUTION; RESOURCE BOUNDS; STRUCTURAL CONDITION; TERMINATION PROOF; VERIFICATION FRAMEWORK;

RECURSIVE FUNCTIONS;

EID: 84979032196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_9     Document Type: Conference Paper

References (25)

1. Arnold Beckmann and Andreas Weiermann. Characterizing the elementary recursive functions by a fragment of Gödel's system t. Archive of Math. Logic, 39: 475-491, 2000.
2. Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 1992.
3. Samuel Buss. Bounded Arithmetic. Bibliopolis, Naples, 1986.
4. Kurt Gödel. Über eine bisher noch nicht benutzte erweiterung des finiten standpunktes. Dialectica, 12: 280-287, 1958.
5. Petr Hájek and Pavel Pudlák. Metamathematics of First-Order Arithmetic. Springer, Berlin, 1993.
6. J. van Heijenoort. From Frege to Gödel, A Source Book in Mathematical Logic, 1879-1931. Harvard University Press, Cambridge, MA, 1967.
7. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, New York, 1980. Preliminary manuscript: 1969.
8. N. Jones. Computability and Complexity from a Programming Perspective. MIT Press, Cambridge, MA, 1997.
9. Daniel Leivant. Reasoning about functional programs and complexity classes associated with type disciplines. In Proceedings of the Twenty Fourth Annual Symposium on the Foundations of Computer Science, pages 460-469, Washington, 1983. IEEE Computer Society.
10. Daniel Leivant. Contracting proofs to programs. In P. Odifreddi, editor, Logic and Computer Science, pages 279-327. Academic Press, London, 1990.
11. Daniel Leivant. Subrecursion and lambda representation over free algebras. In Samuel Buss and Philip Scott, editors, Feasible Mathematics, Perspectives in Computer Science, pages 281-291. Birkhauser-Boston, New York, 1990.
12. Daniel Leivant. A foundational delineation of poly-time. Information and Computation, 110: 391-420, 1994. (Special issue of selected papers from LICS'91, edited by G. Kahn). Preminary report: A foundational delineation of computational feasibility, in Proceedings of the Sixth IEEE Conference on Logic in Computer Science, IEEE Computer Society Press, 1991.
13. Daniel Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Jeffrey Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science, pages 320-343. Birkhauser-Boston, New York, 1994. www. cs. indiana. edu/-leivant/papers.
14. Daniel Leivant. Intrinsic theories and computational complexity. In D. Leivant, editor, Logic and Computational Complexity, LNCS, pages 177-194, Berlin, 1995. Springer-Verlag.
15. Daniel Leivant. Applicative control and computational complexity. In J. Flum and M. Rodriguez-Artalejo, editors, Computer Science Logic Proceedings of the Thirteenth CSL Conference, pages 82-95, Berlin, 1999. Springer Verlag (LNCS 1683). www. cs. indiana. edu/-leivant/papers.
16. Daniel Leivant. Intrinsic reasoning about functional programs I: first order theories. Annals of Pure and Applied Logic, 2001. www. cs. indiana. edu/-leivant/papers.
17. Daniel Leivant. Substructural proofs and feasibility. www. cs. indiana. edu/-leivant/papers, 2001.
18. Charles Parsons. On a number-theoretic choice schema and its relation to induction. In A. Kino, J. Myhill, and R. Vesley, editors, Intuitionism and Proof Theory, pages 459-473. North-Holland, Amsterdam, 1970.
19. D. Prawitz. Natural Deduction. Almqvist and Wiksell, Uppsala, 1965.
20. H. E. Rose. Subrecursion. Clarendon Press (Oxford University Press), Oxford, 1984.
21. M. Schönfinkel. Über die Bausteine der mathematischen Logik. Mathematische Annalen, 92: 305-316, 1924. English translation: On the building blocks of mathematical logic, in [6], 355-366.
22. Harold Simmons. The realm of primitive recursion. Archive for Mathematical Logic, 27: 177-188, 1988.
23. S. Simpson. Subsystems of Second-Order Arithmetic. Springer-Verlag, Berlin, 1999.
24. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge, 1996, 2000.
25. Kai F. Wehmeier. Fragments of HA based on Σ1-induction. Archive for Mathematical Logic, 37: 37-49, 1997.