Skip to main content
SpringerLink
Log in

Characterization of acceptable by algol-like programming languages

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

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

Included in the following conference series:

  • 123 Accesses

Abstract

It is proved that the procedure concept of ALGOL60-like programming languages with the standard call-by-name static scope semantics without arithmetic and without array allows any effective computation over arbitrary signatures.

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. Bauer, F., Wössner, H.: Algorithmische Sprache und Programmentwicklung. Springer-Verlag 1981

    Google Scholar 

  2. Brainerd, W.S., Landweber, L.H.: Theory of computation. John Wiley, New York 1974

    Google Scholar 

  3. Clarke, E.M., Jr.: Programming language constructs for which it is impossible to obtain good Hoare axiom systems. J. ACM 26, 1, 129–147 (1979)

    Google Scholar 

  4. Crasemann, Ch.: On the power of higher functionalities and function declaration nestings in ALGOL-like programming languages. Bericht des Inst.f.Inform. u. Prakt.Math., Christian-Albrechts-Universität Kiel, Juni 1983

    Google Scholar 

  5. Critcher, A.: On the ability of structures to store and access information. In: Proceedings of the 9th annual ACM symposium on principles of programming languages, pp. 366–378 (1982)

    Google Scholar 

  6. Constable, R.L., Gries, D.: On classes of program schemata. SIAM J. Comp. 1, pp. 66–118 (1972)

    Google Scholar 

  7. Clarke, E.M., German, S.M., Halpern, J.Y.: On effective axiomatizations of Hoare logics. In: Proceedings of the 9th annual ACM symposium on principles of programming languages, pp. 309–321 (1982)

    Google Scholar 

  8. Damm, W., Josko, B.: A sound and relatively* complete Hoare logic for a language with higher type procedures. Schriften Informatik Angew. Math. 77 (1982)

    Google Scholar 

  9. Friedman, H.: Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In: R.O. Gandy, C.M.E. Yates (eds.): Logic colloquium '69. North Holland Publishing Company, studies in logic and the foundations of mathematics, vol. 61, pp. 361–389 (1971)

    Google Scholar 

  10. Greibach, S.A.: Theory of program structures: schemes, semantics, verification. LNCS 36, Springer-Verlag 1975

    Google Scholar 

  11. Jensen, K., Wirth, N.: PASCAL user manual and report. Springer, Berlin, Heidelberg, New York 1975

    Google Scholar 

  12. Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informatica 2, 110–142 (1973)

    Google Scholar 

  13. Langmaack, H.: On procedures as open subroutines I, II. Acta Informatica 2, pp. 311–333 (1973) and Acta Informatica 3, pp. 227–241 (1974)

    Google Scholar 

  14. Langmaack, H.: On termination problems for finitely interpreted ALGOL-like programs. Acta Informatica 18, 79–108 (1982)

    Google Scholar 

  15. Lipton, R.J.: A necessary and sufficient condition for the existence of Hoare logics. In: 18th IEEE symposium on foundations of computer science, Providence, Rhode Island, pp. 1–6, New York, IEEE 1977

    Google Scholar 

  16. Langmaack, H., Olderog, E.R.: Present-day Hoare-like systems for programming languages with procedures: power, limits, and most likely extensions. In: J.W. de Bakker, J. van Leeuwen: Proceed. Autom. Lang. Progr., 7th Coll., Noordwijkerhout, July 1980. LNCS 85, pp. 363–373 (1980)

    Google Scholar 

  17. Lippe, W.M., Simon, F.: Untersuchungen zur Beziehung zwischen ALGOL60 und ALGOL60-P-G. Bericht des Inst.f.Inform.u.Prakt.Math., Christian-Albtechts-Universität Kiel, Dez. 1977.

    Google Scholar 

  18. Nivat, M.: On the interpretation of recursive polyadic program schemes. Symposia Mathematica, Vol 15, 1975

    Google Scholar 

  19. Olderog, E.R.: Sound and complete Hoare-like calculi based on copy rules. Acta Informatica 16, 161–197 (1981)

    Google Scholar 

  20. Olderog, E.R.: Charakterisierung Hoarescher Systeme für ALGOL-ähnliche Programmierspreachen. Dissertation Kiel 1981

    Google Scholar 

  21. Olderog, E.R.: Correctness of PASCAL-like programs without global variables. Bericht des Inst.f.Inform. u. Prakt.Math., Christian-Albrechts-Universität Kiel, Nov. 1981, will appear in TCS

    Google Scholar 

  22. Tiuryn, J.: Logic of effective definitions. Bericht Nr. 55 der RWTH Aachen, Juli 1979

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40, D-2300, Kiel

    Ch. Crasemann & H. Langmaack

Authors
  1. Ch. Crasemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Langmaack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Clarke Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crasemann, C., Langmaack, H. (1984). Characterization of acceptable by algol-like programming languages. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_360

Download citation

  • DOI: https://doi.org/10.1007/3-540-12896-4_360

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38775-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation