Advertisement

Appendix: Historical remarks on compiler construction

  • F. L. Bauer
Chapter 6.: Appendix
Part of the Lecture Notes in Computer Science book series (LNCS, volume 21)

Keywords

Syntactic Analysis Automatic Program Transition Table Pushdown Automaton Context Grammar 
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. [1]
    The A-2 Compiler System: Automatic Programming. Computers and Automation 4, 25–31 (Sept. 1955) and 4, 15–23 (Oct. 1955)Google Scholar
  2. [2]
    Adams, Ch. W., Laning, J. H. jr.: The MIT systems of automatic coding: Comprehensive, Summer Session, and Algebraic. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 30–33Google Scholar
  3. [3]
    Adams, E. S., Schlesinger, S. I.: Simple automatic coding systems. Comm. ACM 1:7, 5–9 (1958)Google Scholar
  4. [4]
    Angstl, H.: Seminar über Logistik. Prof. W. Britzelmayr, Universität München, 1950Google Scholar
  5. [5]
    Arden, B. W., Graham, R. M.: On GAT and the construction of translators. Comm. ACM 2:7, 24–26 (1959)Google Scholar
  6. [6]
    Arden, B. W., Galler, B. A., Graham, R. M.: The internal organization of the MAD translator. Comm. ACM 4, 28–31 (1961)Google Scholar
  7. [7]
    Automatic Programming: The IT translator. In: E. M. Grabbe et al. (eds.): Handbook of Automation, Computation, and Control 2, 2.200–2.228. New York: John Wiley and Sons 1959Google Scholar
  8. [8]
    Backus, J. W., Herrick, H.: IBM 701 speedcoding and other automatic programming systems. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 106–113Google Scholar
  9. [9]
    Backus, J. W.: Automatic Programming: Properties and performance of FORTRAN Systems I and II. Symposium Mechanisation of Thought Processes, National Physical Lab., Teddington, November 24–27, 1958, p. 231–255Google Scholar
  10. [10]
    Backus, J. W. et al.: The FORTRAN automatic coding system. Proc. AFIPS 1957 WJCC 11, p. 188–198Google Scholar
  11. [11]
    Barnett, M. P., Futrelle, R. P.: Syntactic analysis by digital computer. Comm. ACM 5, 515–526 (1962)Google Scholar
  12. [12]
    Barton, R. S.: Another (nameless) compiler for the Burroughs 220. Comm. ACM 4, A 11 (1961)Google Scholar
  13. [13]
    Bastian, A. L. jr.: A phrase-structure language translator. Air Force Cambridge Res. Labs., Hanscom Field (Mass.), Rep. No. AFCRL-69-549, August 1962Google Scholar
  14. [14]
    Bauer, F. L.: The formula-controlled logical computer "Stanislaus". Mathematics of Computation (MTAC) 14, 64–67 (1960)Google Scholar
  15. [15]
    Bauer, F. L., Bottenbruch, H., Rutishauser, H., Samelson, K.: Proposal for a universal language for the description of computing processes. Zürich, Mainz, München, Darmstadt (ZMMD-Projekt), April 1958Google Scholar
  16. [16]
    Bauer, F. L., Samelson, K.: Verfahren zur automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens. Deutsche Patentauslegeschrift 1094019. Anm.: 30. März 1957; Bek.: 1. Dez. 1960Google Scholar
  17. [17]
    Bauer, F. L., Samelson, K.: The cellar principle for formula translation. Proc. ICIP Paris 1959, p. 154Google Scholar
  18. [18]
    Bauer, F. L., Samelson, K.: Maschinelle Verarbeitung von Programmsprachen. In: Hoffmann, W. (Hrsg.): Digitale Informationswandler. Braunschweig: Vieweg 1962Google Scholar
  19. [19]
    Böhm, C.: Calculatrices digitales. Du déchiffrage de formules logico-mathématiques par la machine même dans la conception du programme (Dissertation, Zürich 1952). Annali Mathematica pura applicata, Ser. 4, 37, 5–47 (1954)Google Scholar
  20. [20]
    Bottenbruch, H.: Einige Überlegungen zur Übersetzung einer algorithmischen Sprache in Maschinenprogramme. Manuskript, Institut für Praktische Mathematik (IPM) der Techn. Hochschule Darmstadt, 1957Google Scholar
  21. [21]
    Brooker, R. A.: Some technical features of the Manchester Mercury Autocode Programme. Symposium Mechanisation of Thought Processes, National Physical Lab., Teddington, November 24–27, 1958, p. 201–229Google Scholar
  22. [22]
    Brooker, R. A., Morris, D.: An assembly program for a phrase structure language. Computer J. 3, 168–174 (1960)Google Scholar
  23. [23]
    Brooker, R. A., Morris, D.: Some proposals for the realization of a certain assembly program. Computer J. 3, 220–231 (1961)Google Scholar
  24. [24]
    Brooker, R. A., Morris, D.: A description of Mercury Autocode in terms of a phrase structure language. In: Goodman, R. (ed.): Second Annual Review of Automatic Programming. New York: Pergamon 1961Google Scholar
  25. [25]
    Brooker, R. A., Morris, D.: A general translation program for phrase-structure languages. J. ACM 9, 1–10 (1962)Google Scholar
  26. [26]
    Brooker, R. A. Morris, D.: A compiler for a self-defining phrase structure language. University of Manchester, England (undated)Google Scholar
  27. [27]
    Brown, J. H. Carr III, J. W.: Automatic programming and its development on the MIDAC. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 84–97Google Scholar
  28. [28]
    Burks, A. W., Warren, D. W., Wright, J. B.: An analysis of a logical machine using paranthesis-free notation. Math. Tables and Other Aids to Computation (MTAC) 8:46, 53–57 (1954)Google Scholar
  29. [29]
    Burroughs B5000. In: Data Processing Encyclopedia. Detroit 1961, p. 50–55Google Scholar
  30. [30]
    Cheatham, T. E.: The TGS-II translator-generator system. Proc. IFIP Congr. 65, New York. Washington (D.C.): Spartan 1965Google Scholar
  31. [31]
    Cheatham, T. E., Sattley, K.: Syntax-directed compiling. Proc. AFIPS 1964 SJCC 25. Washington (D.C.): Spartan 1964, p. 31–57Google Scholar
  32. [32]
    Chomsky, N.: Syntactic structures. Den Haag: Mouton 1957Google Scholar
  33. [33]
    Chomsky, N.: On certain formal properties of grammars. Information and Control 2, 137–167 (1959). Addendum: A note on phrase structure grammars. Information and Control 2, 393–395 (1959)Google Scholar
  34. [34]
    Chomsky, N.: Formal properties of grammars. In: Luce, R. D., Bush, R., Galanter, E. (eds.): Handbook of Mathematical Psychology, Vol. 2. New York: John Wiley and Sons 1963, p. 323–418Google Scholar
  35. [35]
    Chomsky, N., Schützenberger, M. P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.): Computer Programming and Formal Systems. Amsterdam: North-Holland 1963, p. 118–161Google Scholar
  36. [36]
    Church, A.: The calculi of lambda-conversion. In: Annals of Mathematics Studies No. 6. Princeton (N.J.): Princeton University Press 1941Google Scholar
  37. [37]
    Conway, M. E.: Design of a seperable transition-diagram compiler. Comm. ACM 6, 396–408 (1963)Google Scholar
  38. [38]
    Dijkstra, E. W.: Making a translator for ALGOL 60. Annual Review in Automatic Programming 3, 347–356 (1963)Google Scholar
  39. [39]
    Eickel, J.: Generation of parsing algorithms for Chomsky 2 — type languages. Mathematisches Institut der Technischen Universität München, Bericht Nr. 6401, 1964Google Scholar
  40. [40]
    Eickel, J., Paul, M., Bauer, F. L., Samelson, K.: A syntax-controlled generator of formal language processors. Comm. ACM 6, 451–455 (1963)Google Scholar
  41. [41]
    Ershov, A. P.: On programming of arithmetic operations (Russ.). Doklady AN SSSR 118:3, 427–430 (1958). (Engl. Transl. in: Comm. ACM 1:8, 3–6 (1958))Google Scholar
  42. [42]
    Ershov, A. P.: The work of the computing centre of the Academy of Sciences of the USSR in the field of automatic programming. Symposium Mechanisation of Thought Processes. National Physical Lab., Teddington, November 24–27, 1958, p. 257–278Google Scholar
  43. [43]
    Ershov, A. P.: Programming Programme for the BESM Computer (Russ.). Moskau: Verlag der Akademie der Wissenschaften der UdSSR 1958 und London: Pergamon Press 1960Google Scholar
  44. [44]
    Fischer, P. C.: A proposal for a term project for applied mathematics 205. Manuscript, 1959Google Scholar
  45. [45]
    Flow-Matic Programming System. Remington-Rand Univac Div. of Sperry Rand Corp. New York 1958Google Scholar
  46. [46]
    Floyd, R. W.: An algorithm defining ALGOL statement analysis with validity checking. Comm. ACM 3, 418–419 (1960)Google Scholar
  47. [47]
    Floyd, R. W.: An algorithm for coding efficient arithmetic operations. Comm. ACM 4, 42–51 (1961)Google Scholar
  48. [48]
    Floyd, R. W.: Syntactic analysis and operator precedence. J. ACM 10, 316–333 (1963)Google Scholar
  49. [49]
    Floyd, R. W.: Bounded context syntactic analysis. Comm. ACM 7, 62–67 (1964)Google Scholar
  50. [50]
    Floyd, R. W.: Syntactic analysis and operator precedence. In: Pollack, B.W. (ed.): Compiler Techniques. Princeton (N.J.): Auerbach Publishers 1972Google Scholar
  51. [51]
    Floyd, R. W.: The syntax of programming languages — a survey. In: Pollack, B. W. (ed.): Compiler Techniques. Princeton (N.J.): Auerbach Publishers 1972Google Scholar
  52. [52]
    Foster, J. M.: A syntax improving device. Computer J. 11, 31–34 (1968)Google Scholar
  53. [53]
    GAMM Fachausschuß Programmieren (Hrsg.): Vorschläge für eine algorithmische Schreibweise zur Formelübersetzung. Zürich, Mainz, München, Darmstadt, Oktober 1957Google Scholar
  54. [54]
    Glennie, A.: On the syntax machine and the construction of a universal compiler. Carnegie-Mellon University, Techn. Report No. 2 (AD-240512), July 1960Google Scholar
  55. [55]
    Goldfinger, R.: New York University Compiler System. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 30–33Google Scholar
  56. [56]
    Gorn, S.: Planning universal semi-automatic coding. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 74–83Google Scholar
  57. [57]
    Gorn, S.: On the logical design of formal mixed languages. Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, 1959Google Scholar
  58. [58]
    Graham, R. M.: Bounded context translation. Proc. AFIPS 1964 SJCC 25. Baltimore (Md.): Spartan 1964, p. 17–29Google Scholar
  59. [59]
    Grau, A. A.: Recursive processes and ALGOL translation. Comm. ACM 4, 10–15 (1961)Google Scholar
  60. [60]
    Grau, A. A.: The structure of an ALGOL translator. Oak Ridge Nat. Lab., Oak Ridge (Tenn.), Report No. ORNL-3054, February 9, 1961Google Scholar
  61. [61]
    Greibach, S. A.: Inverses of phrase structure generators. Harvard University, Cambridge (Mass.), Ph. D. dissertation, June 1963Google Scholar
  62. [62]
    Gries. D.: Compiler construction for digital computers. New York: John Wiley and Sons 1971Google Scholar
  63. [62a]
    Gries, D.: Use of transition matrices in compiling. Comm. ACM 11, 26–34 (1968)Google Scholar
  64. [63]
    Gries, D. et al.: Some techniques used in the ALCOR-Illinois 7090. Comm. ACM 8, 496–500 (1965)Google Scholar
  65. [64]
    Haley, A. C. D.: The KDF 9 computer system. Proc. AFIPS 1962 FJCC 22. Washington (D.C.): Spartan 1962, p. 108–120Google Scholar
  66. [65]
    Halstead, M. H.: Machine independent computer programming. Washington (D.C.): Spartan 1962, p. 37 ffGoogle Scholar
  67. [66]
    Hopper, G. M.: Automatic programming, definitions. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13–14, 1954, p. 1–5Google Scholar
  68. [67]
    Hopper, G. M.: First glossary of programming terminology. Report to the Association for Computing Machinery (ACM), June 1954Google Scholar
  69. [68]
    Huskey, H. D.: Compiling techniques for algebraic expressions. Computer J. 4, 10–19 (1961)Google Scholar
  70. [69]
    Huskey, H. D., Wattenburg, W. H.: A basic compiler for arithmetic expressions. Comm. ACM 4, 3–9 (1961)Google Scholar
  71. [70]
    Ingerman, P. Z.: A new algorithm for algebraic translation. Reprints of papers presented at the 14th National Meeting of the Association for Computing Machinery, 1959, p. 22.1–22.2Google Scholar
  72. [71]
    Ingerman, P. Z.: A syntax oriented compiler.... Moore School of Electr. Engineering. University of Pennsylvania, Philadelphia, April 1963Google Scholar
  73. [72]
    Irons, E. T.: A syntax directed compiler for ALGOL 60. Comm. ACM 4, 51–55 (1961)Google Scholar
  74. [73]
    Irons, E. T.: The structure and use of the syntax-directed compiler. In: Annual Review in Automatic Programming 3, 207–227 (1963)Google Scholar
  75. [74]
    Irons, E. T.: 'structural connections’ in formal languages. Comm. ACM 7, 67–72 (1964)Google Scholar
  76. [75]
    Janov, Y. J.: On the equivalence and transformation of program schemes (Russ.). Doklady AN SSSR 113:1, 39–42 (1957). Engl. transl. in: Comm. ACM 1:10, 8–12 (1958)Google Scholar
  77. [76]
    Janov, Y. J.: On matrix program schemes (Russ.). Doklady AN SSSR 113:2, 283–286 (1957). Engl. transl. in: Comm. ACM 1:12, 3–6 (1958)Google Scholar
  78. [77]
    Kanner, J.: An algebraic translator. Comm. ACM 2:10, 19–22 (1959)Google Scholar
  79. [78]
    Kantorovich, L. V.: On a mathematical symbolism convenient for performing machine calculations (Russ.). Doklady AN SSSR 113:4, 738–741 (1957)Google Scholar
  80. [79]
    Kleene, S. C.: Proof by cases in formal logic. Annals of Mathematics 35, 529–544 (1934)Google Scholar
  81. [80]
    Knuth, D. E.: Runcible: Algebraic translation on a limited computer. Comm. ACM 2, 18–21 (1959)Google Scholar
  82. [81]
    Knuth, D. E.: A history of writing compilers. Computers and Automation 11, 8–14 (1962)Google Scholar
  83. [82]
    Kolloquium über Sprachen und Algorithmen. Berlin, 8.–11. Juni 1960. Math. Logik 7, 299–308, 1961Google Scholar
  84. [83]
    Kuno, S., Oettinger, A. G.: Multiple-path syntactic analyzer. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1962, p. 306–312Google Scholar
  85. [84]
    Laning, J. H., Zierler, N.: A program for translation of mathematical equations for Whirlwind I. Massachusetts Institute of Technology, Cambridge (Mass.), Engineering Memorandum E-364, January 1954Google Scholar
  86. [85]
    Ledley, R. S., Wilson, J. B.: Autmatic-programming-language translation through syntactical analysis. Comm. ACM 5, 145–155 (1962)Google Scholar
  87. [86]
    Ljapunov, A. A.: On logical schemes of programming (Russ.) Problemi Kibernetiki 1, 46–74 (1958). Deutsche Übers. in: Ljapunov, A. A. (Hrsg.): Probleme der Kybernetik, Bd. 1. Berlin: Akademie Verlag 1962, p. 53–86Google Scholar
  88. [87]
    Lucas, P.: The structure of formula-translators. Mailüfterl, Vianna, Austria. ALGOL Bulletin Suppl. No. 16, September 1961 und Elektronische Rechenanlagen 3, 159–166 (1961)Google Scholar
  89. [88]
    Lukasiewicz, J.: O znaczeniu i potrzebach logiki matematycznej (on the importance and needs of mathematical logic). Nauka Polska 10, 604–620 (1929)Google Scholar
  90. [89]
    Lukasiewicz, J.: Elementy logiki matematycznej (Elements of mathematical logic). Lecture Notes, 2nd edition (1929) — Warszawa, 1958, PWN, p. 40Google Scholar
  91. [89a]
    Lukasiewicz, J.: Elements of mathematical logic. Oxford: Pergamon Press 1963Google Scholar
  92. [90]
    Lukasiewicz, J., Tarski, A.: Untersuchungen über den Aussagenkalkül. C.R.Soc. Sci. Lett. Varsovie, Ch. III, 23, 31 (1930)Google Scholar
  93. [91]
    Menger, K.: Eine elementare Bemerkung über die Struktur logischer Formeln. In: Menger, K. (Hrsg.): Ergebnisse eines mathematischen Kolloquiums 3, (1932). Leipzig und Wien: Deutige 1935, p. 22–23Google Scholar
  94. [92]
    Namur, P.: Entwurf eines Hochgeschwindigkeits-Rechenautomaten mit Leuchtpunktabtastung als Grundelement. Technische Hochschule Darmstadt, Dissertation, November 1964Google Scholar
  95. [93]
    Oettinger, A. G.: Automatic syntactic analysis and the push-down store. Proc. Symp. Appl. Math. 12, Providence (R.I.): Amer. Math. Soc. 1961, p. 104–129Google Scholar
  96. [94]
    Paul, M.: Zur Struktur formaler Sprachen. Universität Mainz, Dissertation D77, 1962Google Scholar
  97. [95]
    Paul, M.: A general processor for certain formal languages. Proc. Symp. Symbolic Languages in Data Processing, Rome, 1962. New York — London: Gordon and Breach 1962, p. 65–74Google Scholar
  98. [96]
    Paul, M.: ALGOL 60 processors and a processor generator. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1962, p. 493–497Google Scholar
  99. [97]
    Perlis, A. J. et al.: Internal translator (IT), a compiler for the 650. Carnegie Institute of Technology, Computation Center, Pittsburgh 1956. Reproduced by Lincoln Lab. Div. 6, Document 6D-327Google Scholar
  100. [98]
    van der Poel, W. L.: Dead programmes for a magnetic drum automatic computer. Applied Scientific Research (B) 3, 190–198 (1953)Google Scholar
  101. [99]
    Post, E. L.: Formal reduction of the general combinatorial decision problem. Amer. J. Math. 65, 197–215 (1943)Google Scholar
  102. [100]
    Reynolds, J. C.: A compiler and generalized translator. Applied Math. Div., Argonne Natl. Lab., Argonne, Ill., 1962Google Scholar
  103. [101]
    Rice, H. G.: The APS III compiler for the Datatron 204. Westinghouse Research Lab., Pittsburgh, Manuscript, 1957Google Scholar
  104. [102]
    Rich, B.: APT common computer language. Manuscript, Appl. Phys. Lab. Johns Hopkins University, Baltimore (Md.) 1957 and Annual Review in Automatic Programming 2, 141–159 (1961)Google Scholar
  105. [103]
    Rosenbloom, P. C.: The elements of mathematical logic. New York: Dover 1950Google Scholar
  106. [104]
    Rutishauser, H.: Über automatische Rechenplananfertigung bei programmgesteuerten Rechenmaschinen. Z. angew. Math. Mech. 31, 255 (1951)Google Scholar
  107. [105]
    Rutishauser, H.: Automatische Rechenplananfertigung bei programmgesteuerten Rechnemaschinen. Inst. f. Angew. Mathematik ETH Zürich, Mitteil. Nr. 3. Basel: Verlag Birkhäuser 1952Google Scholar
  108. [106]
    Rutishauser, H.: Automatische Rechenplananfertigung bei programmgesteuerten Rechenmaschinen. Z. angew. Math. Mech. 32, 312–313 (1952)Google Scholar
  109. [107]
    Samelson, K.: Probleme der Programmierungstechnik. Aktuelle Probleme der Rechentechnik. Ber. Internat. Mathematiker-Kolloquium, Dresden November 22–27, 1955. Berlin: VEB Deutscher Verlag der Wissenschaften 1957, p. 61–68Google Scholar
  110. [108]
    Samelson, K.: Programming languages and their processors. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1963, p. 487–492Google Scholar
  111. [109]
    Samelson, K., Bauer, F. L.: Sequentielle Formelübersetzung. Elektron. Rechenanlagen 1, 176–182 (1959)Google Scholar
  112. [110]
    Samelson, K., Bauer, F. L.: Sequential formula translation. Comm. ACM 3, 76–83 (1960)Google Scholar
  113. [111]
    Samelson, K., Bauer, F. L.: The ALCOR project. Proc. Symp. Symbolic Languages in Data Processing, Rome, 1962. New York — London: Gordon and Breach 1962, p. 207–217Google Scholar
  114. [112]
    Schorre, D. V.: A syntax oriented compiler writing language. Proc. 19th ACM Conf. 1964, Philadelphia, D1.3-1–D1.3-11Google Scholar
  115. [113]
    Schröter, K.: Axiomatisierung der Frege'schen Aussagenkalküle. Forschungen zur Logik und zur Gundlegung der exakten Wissenschaften. Neue Serie Bd. 8, Leipzig 1943Google Scholar
  116. [114]
    Schützenberger, M. P.: On context-free languages and pushdown automata. Information and Control 6, 246–264 (1963)Google Scholar
  117. [115]
    Share Assembly Program (SAP). In: Grappe, E. M. et al. (eds.): Handbook of Automation, Computation and Control Vol. 2. New York: John Wiley and Sons 1959, p. 2.165–2.167Google Scholar
  118. [116]
    Sheridan, P. B.: The arithmetic translator-compiler of the IBM FORTRAN automatic coding system. Comm. ACM 2:3, 9–21 (1959)Google Scholar
  119. [117]
    Slutz, R. J.: Engineering experience with the SEAC. Proc.AFIPS 1951 EJCC 1. New York: Amer. Inst. Electr. Engineers 1951, p. 90–93Google Scholar
  120. [118]
    UNIVAC Generalized Programming. Remington Rand Univac Div. of Sperry Rand Corp., New York 1957Google Scholar
  121. [119]
    UNIVAC Math-Matic Programming System. Remington Rand Univac Div. of Sperry Rand Corp., New York 1958Google Scholar
  122. [120]
    Waldburger, H.: Gebrauchsanweisung für die ERMETH. Institut für Angew. Math. an der ETH Zürich, 1958Google Scholar
  123. [121]
    Warshall, S.: A syntax-directed generator. Proc. AFIPS 1961 EJCC 20. Baltimore (Md.): Spartan 1961, p. 295–305Google Scholar
  124. [122]
    Warshall, S., Shapiro, R. M.: A general table-driven compiler. Proc. AFIPS 1964 SJCC 25. Washington (D.C.): Spartan 1964, p. 59–65Google Scholar
  125. [123]
    Watt, J. B., Wattenburg, W. H.: A NELIAC-generated 7090-1401 compiler. Comm. ACM 5, 101–102 (1962)Google Scholar
  126. [124]
    Wegstein, J. H.: From formulas to computer oriented language. Comm.ACM 2:3, 6–8 (1959)Google Scholar
  127. [125]
    Wells, R.: Immediate constituents. Language 23, 81–117 (1947)Google Scholar
  128. [126]
    Wilkes, M. V.: The use of a floating address system for orders in an automatic digital computer. Proc. Cambridge Philos. Soc. 49, 84–89 (1953)Google Scholar
  129. [127]
    Wilkes, M. V. et al.: The preparation of programs for an electronic digital computer. Cambridge (Mass.): Addison-Wesley 1951 (1957)Google Scholar
  130. [128]
    Wirth, N., Weber, H.: EULER: A generalization of ALGOL and its formal definition, Part I. Comm. ACM 9, 13–25 (1966)Google Scholar
  131. [129]
    Zuse, K.: Über den allgemeinen Plankalkül als Mittel zur Formalisierung schematisch-kombinatorischer Aufgaben. Archiv der Math. 1:6, 441–449 (1948/49)Google Scholar
  132. [130]
    Zuse, K.: Über den Plankalkül. Elektron. Rechenanlagen 1:2, 68–71 (1959)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • F. L. Bauer
    • 1
  1. 1.Technical University of MunichMunichGermany

Personalised recommendations