Skip to main content
SpringerLink
Log in

Recursive program schemes and computable functionals

  • Invited Lecturers
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra, A.K., Z.Manna, Program schemes with equality, Stanford Artifitial Intelligence Project Memo AIM-158, Stanford, 1971.

    Google Scholar 

  2. Constable, R.L., D. Gries, On classes of program schemes, Conf. Record, 12 Symposium on switching and automata theory, 1971.

    Google Scholar 

  3. Ershov, Yu. L., Computable functionals of finite types, Algebra and Logic, 11, no.4 (1972), pp.367–437.

    Google Scholar 

  4. Paterson,M.S., C.E.Hewitt, Comparative schematology, Conf. Record of Project MAC, Conference on Concurrent Systems and Parallel Computation, ACM, no.9, 1970.

    Google Scholar 

  5. Sazonov, V.Yu., On expressibility and computability of objects in Scott's LCF. In Proceedings of the Third All-Union Conference on Mathematical Logic, pp.191–194, Novosibirsk, 1974 (in Russian).

    Google Scholar 

  6. Sazonov,V.Yu., Sequentiallity and parallely computable functionals (extended abstract), in Proceedings of the Symposium on — Calculus and Computer Science Theory, Roma, 1975, Lecture Notes in Computer Science, 37, pp.312–318.

    Google Scholar 

  7. Sazonov, V.Yu., Degrees of parallelism in computations, in these Proceedings.

    Google Scholar 

  8. Scott, D., A type-theoretical alternative to ISWIM, CUCH,OWHY, Oxford University, 1969.

    Google Scholar 

  9. Strong, H.R., High level languages of maximum power, Conf. Record 12 Symposium on switching and automata theory, 1971.

    Google Scholar 

  10. Trakhtenbrot, B.A., On universal class of program schemes, Lecture Notes in Computer Science, 5, 1973.

    Google Scholar 

  11. Trakhtenbrot,M.B., On representation of sequential and parallel functions, in Proceedings of 4th Symposium on Mathematical Fundations of Computer Science, Lecture Notes in Computer Science, no.32, pp.411–417, 1975.

    Google Scholar 

  12. Trakhtenbrot,M.B., On interpreted functions in program schemes, in System and Theoretical Programming, Novosibirsk, 1973.

    Google Scholar 

  13. Vuillemin,J., Proof technique for recursive programs, Ph.D.Thesis, Computer Science Dept. Stanford University, Stanford, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch of the USSR Academy of Sciences, 630090, Novosibirsk

    B. A. Trakhtenbrot

Authors
  1. B. A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trakhtenbrot, B.A. (1976). Recursive program schemes and computable functionals. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_168

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_168

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation