Skip to main content
SpringerLink
Log in
Book cover

Mathematical Studies of Information Processing pp 538–558Cite as

On a theory of decision problems in programming languages

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Aho, A.V.: Nested stack automata. J. ACM 16, 383–406 (1969)

    Google Scholar 

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

    Google Scholar 

  4. Damm, W.: Prozedurschemasprachen und ihr emptiness-Problem. Vortrag Univ. Kiel (1978)

    Google Scholar 

  5. Damm,W.,Fehr,E.: On the power of self-application and higher type recursion. Bericht, RWTH Aachen, 22 pp. (1978)

    Google Scholar 

  6. Engelfriet,J.: Simple program schemes and formal languages. Lecture Notes in Computer Science 20, Berlin-Heidelberg-New York (1974)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  9. Grau,A.A.,Hill,U.,Langmaack,H.: Translation of ALGOL 60. Handbook for Automatic Computation, Ib, Berlin-Heidelberg-New York (1967)

    Google Scholar 

  10. Kandzia,P.: On the "most recent" property of ALGOL-like programs. In: Lecture Notes in Computer Science 14, Ed. J.Loeckx, 97–111, Berlin-Heidelberg-New York (1974)

    Google Scholar 

  11. Kandzia,P.,Langmaack,H.: On a theorem of McGowan concerning the "most recent" property of programs. Bericht, Angew. Math. Informatik A 74/07, Univ.Saarbrücken (1974)

    Google Scholar 

  12. Kaufholz,G.,Lippe,W.: A note on a paper of H.Langmaack about procedure parameter transmission. Bericht, Angew.Math.Informatik A 74/06, Univ.Saarbrücken (1974)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  15. Langmaack, H.: On procedures as open subroutines II. Acta Informatica 3, 227–241 (1974)

    Google Scholar 

  16. Langmaack,H.: Zum Begriff der Modularität von Programmiersprachen. In: Lecture Notes in Computer Science 7, Eds. B.Schlender, W.Frielinghaus, 1–12, Berlin-Heidelberg-New York (1974)

    Google Scholar 

  17. Lippe,W.M.: Über die Entscheidbarkeit der formalen Erreichbarkeit von Prozeduren bei monadischen Programmen. Diss., Univ. Saarbrücken (1975)

    Google Scholar 

  18. Lippe,W.M.,Simon,F.: A formal notion for equivalence of ALGOL-like programs. In: Proceedings of the 3rd International Symposium on Programming in Paris (1978)

    Google Scholar 

  19. McGowan, C.L.,: The "most recent" error: its causes and correction. SIGPLAN Notices 7, 1, 191–202 (1972)

    Google Scholar 

  20. Paterson, M.S.: Decision problems in computational models. SIGPLAN Notices 7, 1, 74–82 (1972)

    Google Scholar 

  21. Samelson, K., Bauer, F.L.: Sequentielle Formelübersetzung. Elektron. Rechenanl. 1, 176–182 (1959)

    Google Scholar 

  22. Winklmann, K.A.: A theoretical study of some aspects of parameter passing in ALGOL 60 and in similar programming languages. Doct.Thesis, Purdue Univ., Lafayette, Ind. (August 1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität Kiel, D - 2300, Kiel, Fed.Rep.Germany

    Hans Langmaack

Authors
  1. Hans Langmaack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langmaack, H. (1979). On a theory of decision problems in programming languages. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09541-5

  • Online ISBN: 978-3-540-35010-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation