Skip to main content

Some connections between iterative programs, recursive programs, and first-order logic

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1981)

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

Included in the following conference series:

  • 142 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brown, Gries, and Szymanski, "Program schemes with pushdown stores", SIAM J. Comput. 1, 1972.

    Google Scholar 

  2. Constable and Gries, "On classes of program schemata," SIAM J. Computing,1, 1972.

    Google Scholar 

  3. Garland and Luckham, "Program schemes, recursion schemes, and formal languages", JCSS, 7, 1973.

    Google Scholar 

  4. Kfoury, "Loop elimination and loop reduction", Proceedings of 21st Symposium on FOCS, 1980.

    Google Scholar 

  5. Luckham, Park, and Paterson, "On formalized computer programs", JCSS, 4, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kfoury, A.J. (1982). Some connections between iterative programs, recursive programs, and first-order logic. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025781

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics