Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On procedures as open subroutines. II

  • 18 Accesses

  • 16 Citations

Summary

In part I [11] of the paper elimination of global procedure parameters and modularity of programming languages have been investigated. The methods developed there are used in the present part II to prove that the so called macro program problem for ALGOL 60 and other ALGOL-like languages is algorithmically unsolvable (Theorem 4.3 and 4.4). Macro grammars theory is applied in order to determine sublanguages for which the macro program problem is solvable (Theorem 4.1, 5.2–5.5).

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

References

  1. 1.

    Aho, A. V.: Indexed grammars — an extension of the context free grammars. J. ACM 15, 647–671 (1968)

  2. 2.

    Büchi, J. R.: Regular canonical systems. Arch. Math. Logik Grundlagenforschung 6, 91–111 (1964)

  3. 3.

    Church, A.: The calculi of lambda-conversion. Annals of Mathematics Studies 6. Princeton (N. J.): Princeton University Press 1941

  4. 4.

    Fischer, M. J.: Grammars with macro-like productions. Harvard University, Cambridge (Mass.), Rep. No. NSF-22, Math. Ling. Autom. Transl., May 1968

  5. 5.

    Fischer, M. J.: Lambda calculus schemata. SIGPLAN Notices 7(1), 104–109 (1972)

  6. 6.

    Ginsburg, S., Greibach, S. A., Harrison, M. A.: Stack-automata and compiling. J. ACM 14, 172–201 (1967)

  7. 7.

    Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969

  8. 8.

    Kleene, S. C.: λ-definability and recursiveness. Duke Math. J. 2, 340–353 (1936)

  9. 9.

    Landin, P. J.: A correspondence between ALGOL 60 and Church's lambda notation. Comm. ACM 8, 89–101, 158–165 (1965)

  10. 10.

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

  11. 11.

    Langmaack, H.: On procedures as open subroutines I. Acta Informatica 2, 311–333 (1973)

  12. 12.

    Lippe, W.: Entscheidbarkeitsprobleme bei der Übersetzung von Programmen mit einparametrigen Prozeduren. In: Frielinghaus, W., Schlender, B. (Hrsg.): Gesellschaft für Informatik, 3. Fachtagung über Programmiersprachen, Kiel, 5.-7. März 1974, Lecture Notes in Computer Science 7. Berlin-Heidelberg-New York: Springer 1974, 11–24

  13. 13.

    McCarthy, J.:LISP 1.5 programmer's manual. Cambridge (Mass.): MIT Press 1969

  14. 14.

    Rounds, W. C.: Mappings and grammars on trees. Math. Systems Theory 4, 257–287 (1970)

  15. 15.

    Wijngaarden, A. van (ed.) et al.: Report on the algorithmic language ALGOL 68. Numerische Mathematik 14, 79–218 (1969)

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Langmaack, H. On procedures as open subroutines. II. Acta Informatica 3, 227–241 (1974). https://doi.org/10.1007/BF00288636

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory