Skip to main content
SpringerLink
Log in
Book cover

International Conference on Typed Lambda Calculi and Applications

TLCA 2001: Typed Lambda Calculi and Applications pp 2–3Cite as

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

  • Conference paper
  • First Online:

  • 471 Accesses

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  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. Stephen Bellantoni and Stephen Cook. New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  3. Samuel R. Buss. Bounded Arithmetic. Bibliopolis, 1986.

    Google Scholar 

  4. S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic, 63:103–200, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  5. J.-Y. Girard. Light Linear Logic. Information and Computation, 143, 1998.

    Google Scholar 

  6. J.-Y. Girard, A. Scedrov, and P. Scott. Bounded linear logic. Theoretical Computer Science, 97(1):1–66, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  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. Martin Hofmann. Programming languages capturing complexity classes. SIGACT News Logic Column, 9, 2000. 12 pp.

    Google Scholar 

  9. Martin Hofmann. Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic, 104:113–166, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  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. D. Leivant and J.-Y. Marion. Predicative Functional Recurrence and Poly-Space. In Springer LNCS 1214: Proc. CAAP, 1997.

    Google Scholar 

  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. 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. D. Leivant and J.-Y. Marion. Predicative Functional Recurrence and Poly-Space. In Springer LNCS 1214: Proc. CAAP, 1997.

    Google Scholar 

  15. Daniel Leivant. Stratified Functional Programs and Computational Complexity. In Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for the Foundations of Computer Science Division of Informatics, University of Edinburgh, Germany

    Martin Hofmann

Authors
  1. Martin Hofmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, USA

    Samson Abramsky

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hofmann, M. (2001). From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45413-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41960-0

  • Online ISBN: 978-3-540-45413-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation