Advertisement

Logic of Programs 1983: Logics of Programs pp 129-146 | Cite as

Characterization of acceptable by algol-like programming languages

  • Ch. Crasemann
  • H. Langmaack
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)

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.

Keywords

Normal Form Programming Language Function Call Recursive Function High Functional 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BaW81]
    Bauer, F., Wössner, H.: Algorithmische Sprache und Programmentwicklung. Springer-Verlag 1981Google Scholar
  2. [BrLa74]
    Brainerd, W.S., Landweber, L.H.: Theory of computation. John Wiley, New York 1974Google Scholar
  3. [C177/79]
    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. [Cr83]
    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 1983Google Scholar
  5. [Cri82]
    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. [CG72]
    Constable, R.L., Gries, D.: On classes of program schemata. SIAM J. Comp. 1, pp. 66–118 (1972)Google Scholar
  7. [CGH81/82]
    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. [DJ82]
    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. [Fr69]
    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. [Gr75]
    Greibach, S.A.: Theory of program structures: schemes, semantics, verification. LNCS 36, Springer-Verlag 1975Google Scholar
  11. [JW75]
    Jensen, K., Wirth, N.: PASCAL user manual and report. Springer, Berlin, Heidelberg, New York 1975Google Scholar
  12. [La73]
    Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informatica 2, 110–142 (1973)Google Scholar
  13. [La74]
    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. [La79/82]
    Langmaack, H.: On termination problems for finitely interpreted ALGOL-like programs. Acta Informatica 18, 79–108 (1982)Google Scholar
  15. [Li77]
    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 1977Google Scholar
  16. [LO80]
    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. [LS77]
    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. [Ni75]
    Nivat, M.: On the interpretation of recursive polyadic program schemes. Symposia Mathematica, Vol 15, 1975Google Scholar
  19. [Ol1 81]
    Olderog, E.R.: Sound and complete Hoare-like calculi based on copy rules. Acta Informatica 16, 161–197 (1981)Google Scholar
  20. [Ol2 81]
    Olderog, E.R.: Charakterisierung Hoarescher Systeme für ALGOL-ähnliche Programmierspreachen. Dissertation Kiel 1981Google Scholar
  21. [Ol3 81]
    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 TCSGoogle Scholar
  22. [Ti79]
    Tiuryn, J.: Logic of effective definitions. Bericht Nr. 55 der RWTH Aachen, Juli 1979Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ch. Crasemann
    • 1
  • H. Langmaack
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel

Personalised recommendations