Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1994: Computer Science Logic pp 324–338Cite as

Subrecursion as a basis for a feasible programming language

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

Abstract

We are motivated by finding a good basis for the semantics of programming languages and investigate small classes in subrecursive hierarchies of functions. We do this with the help of a pairing function because in this way we can explore the amazing coding powers of S-expressions of LISP within the domain of natural numbers. We introduce three Grzegorczyk-like hierarchies based on pairing and characterize them both in terms of Grzegorczyk hierarchy and computational complexity.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Borovansky, P. J. Voda. Types as Values Polymorphism. In proceedings of SOF-SEM conference 1993.

    Google Scholar 

  2. A. Cobham. The intrinsic computational difficulty of functions. In Proc. Int. Conf. Logic, Meth. Phil.(ed Y. Bar Hillel), 24–30, North Holland, Amsterdam, 1965.

    Google Scholar 

  3. M. Davis. Computability and Unsolvability, McGraw Hill, New York. 1958.

    Google Scholar 

  4. R. L. Graham, D. F. Knuth, O. Patashnik. Concrete mathematics. Addison-Wesley 1989.

    Google Scholar 

  5. A. Grzegorczyk. Some classes of recursive functions. Rozprawy Mate. No. IV, Warsaw 1953.

    Google Scholar 

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

    Google Scholar 

  7. H.E. Rose. Subrecursion, Functions and Hierarchies. Clarendon Press, Oxford 1984

    Google Scholar 

  8. L. Stockmeyer, The Polynomial-Time Hierachy, Theor. Comp. Sci. 3, 1–22, 1977.

    Article  Google Scholar 

  9. P.J. Voda. Types of Trilogy, Proceedings of the Fifth International Conference on Logic Programming, MIT Press, Cambridge MA, 1988.

    Google Scholar 

  10. K. Wagner, G. Wechsung. Computational Complexity, VEB Berlin 1986.

    Google Scholar 

  11. C. Wrathall, Rudimentary Predicates and Relative Computation, SIAM Journ. Comput., 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Comenius University Bratislava, Mlynská dolina, 842 15, Bratislava, Slovakia

    Paul J. Voda

Authors
  1. Paul J. Voda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voda, P.J. (1995). Subrecursion as a basis for a feasible programming language. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022266

Download citation

  • DOI: https://doi.org/10.1007/BFb0022266

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation