Skip to main content
SpringerLink
Log in

The Small Grzegorczyk Classes and the Typed λ-Calculus

  • Conference paper
Book cover New Computational Paradigms (CiE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3526))

Included in the following conference series:

Abstract

The class \(\Delta^\mathbb{N}_{0}\) of rudimentary relations and the small relational Grzegorczyk classes \(\varepsilon^{0}_{*}, \varepsilon^{1}_{*}, \varepsilon^{2}_{*}\) attracted fairly much attention during the latter half of the previous century, e.g. Gandy [6], Paris-Wilkie [20], and numerous others.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beckmann, A., Weiermann, A.: Characterizing the elementary recursive functions by a fragment of Gödel’s T. Arch. Math. Logic 39(7), 475–491 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bellantoni, S.J., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity 2, 7–110 (1992)

    Article  MathSciNet  Google Scholar 

  3. Bel’tyukov, A.P.: A machine description and the hierarchy of initial Grzegorczyk classes. Zap. Naucn. Sem. Leninigrad. Otdel. May. Inst. Steklov. (LOMI) 88, 30–46 (1979); J. Soviet Math. 20 (1982)

    Google Scholar 

  4. Clote, P.: Computation Models and Function Algebra. In: Griffor, E. (ed.) Handbook of Computability Theory. Elsevier, Amsterdam (1996)

    Google Scholar 

  5. Esbelin, M.-A., More, M.: Rudimentary relations and primitive recursion: A toolbox. Theoretical Computer Science 193, 129–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gandy, R.: Some relations between classes of low computational complexity. Bulletin of London Mathematical Society, 127–134 (1984)

    Google Scholar 

  7. Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne, No. IV, Warszawa (1953)

    Google Scholar 

  8. Harrow, K.: Sub-elementary classes of functions and relations. Doctoral Dissertation, New York University, Department of Mathematics (1973)

    Google Scholar 

  9. Hindley, J.R., Seldin, J.P.: Introduction to Combinators and λ-caclulus. London Mathematical Society, Student Texts, vol. 1. Cambridge University Press, Cambridge (1984)

    Google Scholar 

  10. Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming 11, 55–94 (2001)

    Article  MATH  Google Scholar 

  11. Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science 228, 151–174 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity (accepted)

    Google Scholar 

  13. Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science 318, 139–161 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kristiansen, L., Voda, P.J.: The surprising power of restricted programs and Gödel’s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 345–358. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes (Submitted)

    Google Scholar 

  17. Kutylowski, M.: Small Grzegorczyk classes. J. London Math. Soc. 36(2), 193–210 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)

    Google Scholar 

  19. Odifreddi, P.: Classical Recursion Theory, vol. II. North-Holland, Amsterdam (1999)

    MATH  Google Scholar 

  20. Paris, J.B., Wilkie, A.: Counting problems in bounded arithmetic. In: Methods in mathematical logic. Proceedings, Caracas 1983. Lecture Notes in Mathematics, vol. 1130, pp. 317–340. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  21. Ritchie, R.W.: Classes of predictably computable functions. Trans. Am. Math. Soc. 106, 139–173 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rose, H.E.: Subrecursion. Functions and hierarchies. Clarendon Press, Oxford (1984)

    MATH  Google Scholar 

  23. Simmons, H.: The realm of primitive recursion. Arch. Math. Logic 27, 177–188 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  24. Simmons, H.: Derivation and computation. Taking the Curry-Howard correspondence seriously. Cambridge Tracts in Theoretical Computer Science, vol. 51. Cambridge University, Cambridge (2000)

    MATH  Google Scholar 

  25. Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003); Bezem, M., Klop, J.W., de Vrijer, R. (eds.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Oslo University College, Cort Adelers gate 30, N-0254, Oslo, Norway

    Lars Kristiansen

  2. Department of Mathematics, University of Oslo, Postboks 1053, Blindern, Oslo, N-0316, Norway

    Lars Kristiansen & Mathias Barra

Authors
  1. Lars Kristiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathias Barra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, LS2 9JT, Leeds, U.K.

    S. Barry Cooper

  2. Department Mathematik, Universität Hamburg, Bundesstrasse 55, 20146, Hamburg, Germany

    Benedikt Löwe

  3. Universiteit van Amsterdam,  

    Leen Torenvliet

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kristiansen, L., Barra, M. (2005). The Small Grzegorczyk Classes and the Typed λ-Calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_32

Download citation

  • DOI: https://doi.org/10.1007/11494645_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26179-7

  • Online ISBN: 978-3-540-32266-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation