Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

From the Stack Principle to ALGOL

  • Chapter
  • First Online:
Software Pioneers

Abstract

Certainly one of the most characteristic principles to organize computations with the help of appropriate data structures is the so-called stack principle. It is used not only when expressions with parentheses are to be evaluated, but even more importantly it is also the essential principle of organizing the data inside the memory when calling nested procedures. The stack principle also works for locally declared data within scopes and is therefore the most prominent implementation idea when dealing with high-level languages, scopes and block structures such as the languages of the ALGOL family. The paper describes the early ideas on using stacks starting from evaluating expressions and the development processes that have led to the ALGOL language family.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Lukasiewicz, A. Tarski: Untersuchungen über den Aussagenkalkül. C. R. Séances Soc. Sei. Lett. Varsovie, CI. III,23 (1930) 31–32

    MATH  Google Scholar 

  2. K. Menger: Eine elementare Bemerkung über die Struktur logischer Formeln. In: K. Menger: Ergebnisse eines mathematischen Kolloquiums3, Deuticke, Leipzig (1935)

    Google Scholar 

  3. K. Schröter: Axiomatisierung der Frege’schen Aussagekalküle. In: Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften, N. F. 8; J. Symb. Logic9 (1943) 69

    Google Scholar 

  4. K. Zuse: Über den Allgemeinen Plankalkül als Mittel zur Formulierung schematisch-kombinativer Aufgaben. Arch. Math. 1 (1948/49) 441–449.

    Article  Google Scholar 

  5. D. C. Gerneth: Generalization of Menger’s result on the structure of logical formulas. Bulletin of the American Mathematical Society54 (1948) 803–804; J. Symb. Logic13 (1948) 224

    Article  MathSciNet  Google Scholar 

  6. C. E. Shannon: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28 (1949) 59–88

    Article  MathSciNet  Google Scholar 

  7. P. C. Rosenbloom: The Elements of Mathematical Logic. Dover, New York (1950)

    MATH  Google Scholar 

  8. F. L. Bauer: The Formula-Controlled Logical Computer “Stanislaus”. Math. Tabl. Aids Comp. 14 (1960) 64–67

    MathSciNet  MATH  Google Scholar 

  9. H. Rutishauser: Über automatische Rechenplanfertigung bei programmgesteuerten Rechenanlagen. Z. Angew. Math. Mech. 31 (1951) 255

    Article  Google Scholar 

  10. H. Rutishauser: Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen. Z. Angew. Math. Mech. 32 (1952) 312–313; Mitt. Inst. f. Angew. Math, der ETH Zürich, Nr. 3, 1952

    MathSciNet  MATH  Google Scholar 

  11. C. Boehm: Calculatrices digitales. Du déchiffrage de formules logico-mathématiques par la machine même dans la conception du programme. Dissertation Zürich (1952); Ann. Matematica Pura Appl. Ser. 4,37 (1954) 5–47

    Google Scholar 

  12. A. J. Perlis, J. W. Smith, H. R. van Zooren: Internal Translator (IT), a Compiler for the 650. Lincoln Lab. Div. 6, Document 6D-327 (1956)

    Google Scholar 

  13. K. Samelson: Probleme der Programmierungstechnik. Internationales Kolloquium über Probleme der Rechentechnik Dresden 1955. Berlin (1957) 61–68

    Google Scholar 

  14. Deutsches Patentamt, Auslegeschrift 1 094 019, B44122IX/42m. Verfahren zur automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens. Anmeldetag: 30. März 1957. Bekanntmachung der Anmeldung und Ausgabe der Auslegeschrift: 1. Dezember 1960.

    Google Scholar 

  15. Dr. Friedrich Ludwig Bauer und Dr. Klaus Samelson, München, sind als Erfinder genannt worden. Erteilt 12.8.1971, DE-PS 1 094 019

    Google Scholar 

  16. United States Patent Office. Patent No. 3,047,228, Patented July 31, 1962. Friedrich Ludwig Bauer and Klaus Samelson: Automatic Computing Machines and Method of Operation. Filed March 28, 1958, Ser. No. 724,770

    Google Scholar 

  17. H. Bottenbruch: Übersetzung von algorithmischen Formelsprachen in die Programmiersprachen von Rechenmaschinen. Z. Math. Logik Gründl. Math. 4 (1958) 180–221

    Article  MathSciNet  Google Scholar 

  18. F. L. Bauer, H. Bottenbruch, H. Rutishauser, K. Samelson: Proposal for a universal language for the description of computing processes. In: Carr, J. W. (ed.), Summer School 1958. University of Michigan (1958) 355–373

    Google Scholar 

  19. P. B. Sheridan: The arithmetic translator-compiler of the IBM Fortran automatic coding system. Commun. ACM2,2 (1959) 9–21

    Article  Google Scholar 

  20. A. J. Perlis, K. Samelson (eds.): Report on the algorithmic language ALGOL by the ACM committee on programming languages and the GAMM committee on programming. Num. Math. 1 (1959)41–60

    Google Scholar 

  21. A. J. Perlis, K. Samelson (eds.): Preliminary report—international algebraic language. Commun. ACM1 (1959) 8–22

    Google Scholar 

  22. K. Samelson, F. L. Bauer: Sequentielle Formelübersetzung. Elektron. Rechenanlagen1 (1959) 176–182

    MATH  Google Scholar 

  23. K. Samelson, F. L. Bauer: Sequential formula translation. Commun. ACM3 (1960) 76–83

    Article  MathSciNet  Google Scholar 

  24. F. L. Bauer, K. Samelson: The cellar principle for formula translation. In: Proceedings International Conference on Information Processing, UNESCO Paris 1959. Oldenburg, München (1960) 154–155

    Google Scholar 

  25. F. L. Bauer, K. Samelson: The problem of a common language. In: Proceedings International Conference on Information Processing, UNESCO Paris 1959. Oldenburg, München (1960) 120–125

    Google Scholar 

  26. J. W. Backus: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference. In: Proceedings International Conference on Information Processing, UNESCO Paris 1959. Oldenburg, München (1960) 125–132

    Google Scholar 

  27. J.W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur (ed.), A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauquois, J. H. Wegstein, A. van Wijngaarden, M. Woodger: Report on the algorithmic language ALGOL 60. Num. Math. 2 (1960) 106–136

    Google Scholar 

  28. J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur (ed.), A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauqois, J. H. Wegstein, A. van Wijngaarden, M. Woodger: Report on the algorithmic language ALGOL 60. Commun. ACM3 (1960) 299–314

    Article  Google Scholar 

  29. F. L. Bauer, K. Samelson: Maschinelle Verarbeitung von Programmiersprachen. In: W. Hoffmann (ed.), Digitale Informationswandler. Probleme der Informationsverarbeitung in ausgewählten Beiträgen. Vieweg, Braunschweig (1962) 227–268

    Google Scholar 

  30. R. Baumann, M. Paul: Praktische Erfahrungen im ALCOL-Betrieb. Elektron. Datenverarbeitung, Beiheft 2 (1961) 51–56

    MATH  Google Scholar 

  31. K. Samelson, F. L. Bauer: The ALCOR project. In: Symbolic Languages in Data Processing, Proceedings of the Symposium, organized and edited by the International Computation Centre Rome, March 26–31, 1962. Gordon and Breach, New York (1962) 207–217

    Google Scholar 

  32. J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur, A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauqois, J. H. Wegstein, A. van Wijngaarden, M. Woodger: Revised report on the algorithmic language ALGOL 60. Num. Math. 4 (1963) 420–453

    Article  MathSciNet  Google Scholar 

  33. J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, P. Naur, A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauqois, J. H. Wegstein, A. van Wijngaarden, M. Woodger: Revised report on the algorithmic language ALGOL 60. Commun. ACM6 (1963) 1–17

    Article  Google Scholar 

  34. P. J. Landin: A formal description of ALGOL 60. In: T. B. Steel, Jr. (ed.), Formal language description languages for computer programming, Proceedings of the IFlP Working Conference on Formal Language Description Languages, Vienna September 15–18, 1964. Amsterdam (1966) 266–294

    Google Scholar 

  35. F. L. Bauer: The cellar principle of state transition and storage allocation. Ann. Hist. Comput. 12 (1990) 41–49

    Article  Google Scholar 

  36. A. A. Grau: Recursive processes and ALGOL translation. Commun. ACM4 (1961) 10–15

    Article  Google Scholar 

  37. P. Lucas: Die Strukturanalyse von Formelübersetzern. Interner Bericht Mailüfterl Wien (1961)

    Google Scholar 

  38. M. Paul: Zur Struktur formaler Sprachen. Dissertation Mainz (1962)

    Google Scholar 

  39. M. Paul: A general processor for certain formal languages. In: Symbolic Languages in Data Processing, Proceedings of the Symposium, organized and edited by the International Computation Centre Rome, March 26–31, 1962. Gordon and Breach, New York (1962) 65–74

    Google Scholar 

  40. P. Deussen: Bericht über ein Programm zur Übersetzung Boolescher Ausdrücke in disjunktive Normalform. Colloquium über Schaltkreis- und Schaltwerk-Theorie. Birkhäuser, Basel (1961)

    Google Scholar 

  41. W. Petry: Übersetzung formaler Sprachen in topologische Strukturen. Dissertation Mainz (1962)

    Google Scholar 

  42. Charles L. Hamblin: Computer languages. Austral. J. Sci. 20 (1957) 135

    MathSciNet  Google Scholar 

  43. F. G. Duncan: Stack machine development: Australia, Great Britain, and Europe. Computer 10 (1977) 50–52

    Article  Google Scholar 

  44. J. Eickel, M. Paul: The parsing and ambiguity problem for Chomsky languages. In: T. B. Steel, Jr. (ed.), Formal Language Description Languages for Computer Programming, Proceedings of the IFlP Working Conference on Formal Language Description Languages, Vienna, September 15–18, 1964. Amsterdam (1966) 52–75

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Techniche Universität München, Germany

    Friedrich L. Bauer (Professor of Mathematics and Informatics (Emeritus)

Authors
  1. Friedrich L. Bauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Manfred Broy (Professor of Informatics) (Professor of Informatics)

  2. sd&m AG software design & management, Postfach 83 08 51, 81708, München, Germany

    Ernst Denert (Chairman of the Supervisory Board) (Chairman of the Supervisory Board)

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bauer, F.L. (2002). From the Stack Principle to ALGOL. In: Broy, M., Denert, E. (eds) Software Pioneers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59412-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59412-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63970-8

  • Online ISBN: 978-3-642-59412-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation