Advertisement

From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour

  • Martin Hofmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

Abstract

Bounded arithmetic [3] is a subsystem of Peano arithmetic defining exactly the polynomial time functions. As Gödel’s system T corresponds to Peano arithmetic Cook and Urquhart’s system PVω [4] corresponds to bounded arithmetic. It is a type system with the property that all definable functions are polynomial time computable.

References

  1. 1.
    S. Bellantoni, K.-H. Niggl, and H. Schwichtenberg. Ramification, Modality, and Linearity in Higher Type Recursion. Annals of Pure and Applied Logic, 2000. to appear.Google Scholar
  2. 2.
    Stephen Bellantoni and Stephen Cook. New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Samuel R. Buss. Bounded Arithmetic. Bibliopolis, 1986.Google Scholar
  4. 4.
    S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic, 63:103–200, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    J.-Y. Girard. Light Linear Logic. Information and Computation, 143, 1998.Google Scholar
  6. 6.
    J.-Y. Girard, A. Scedrov, and P. Scott. Bounded linear logic. Theoretical Computer Science, 97(1):1–66, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Martin Hofmann. Linear types and non size-increasing polynomial time computation. To appear in Theoretical Computer Science. See http://www.dcs.ed.ac.uk/home/papers/icc.ps.gz for a draft. An extended abstract has appeared under the same title in Proc. Symp. Logic in Comp. Sci. (LICS) 1999, Trento, 2000.
  8. 8.
    Martin Hofmann. Programming languages capturing complexity classes. SIGACT News Logic Column, 9, 2000. 12 pp.Google Scholar
  9. 9.
    Martin Hofmann. Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic, 104:113–166, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Martin Hofmann. A type system for bounded space and functional in-place up-date. Nordic Journal of Computing, 2001. To appear, see http://www.dcs.ed.ac.uk/home/mxh/papers/nordic.ps.gz for a draft. An extended abstract has appeared in Programming Languages and Systems, G. Smolka, ed., Springer LNCS, 2000.Google Scholar
  11. 11.
    D. Leivant and J.-Y. Marion. Predicative Functional Recurrence and Poly-Space. In Springer LNCS 1214: Proc. CAAP, 1997.Google Scholar
  12. 12.
    Daniel Leivant. Stratified Functional Programs and Computational Complexity. In Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993. Pure and Applied Logic, 104:113–166, 2000.Google Scholar
  13. 10.
    Martin Hofmann. A type system for bounded space and functional in-place up-date. Nordic Journal of Computing, 2001. To appear, see http://www.dcs.ed.ac.uk/home/mxh/papers/nordic.ps.gz for a draft. An extended abstract has appeared in Programming Languages and Systems, G. Smolka, ed., Springer LNCS, 2000.Google Scholar
  14. 11.
    D. Leivant and J.-Y. Marion. Predicative Functional Recurrence and Poly-Space. In Springer LNCS 1214: Proc. CAAP, 1997.Google Scholar
  15. 12.
    Daniel Leivant. Stratified Functional Programs and Computational Complexity. In Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Martin Hofmann
    • 1
  1. 1.Laboratory for the Foundations of Computer Science Division of InformaticsUniversity of EdinburghGermany

Personalised recommendations