Mathematical Theory of Serial Computers

About 20 years ago (see e.g. [1]) the automation of programming started. Its aim was to facilitate the programming activity, and the direct reason was the “difficulty” of learning and using machine codes.

[1]  Alfred Tarski,et al.  Der Wahrheitsbegriff in den formalisierten Sprachen , 1935 .

[2]  Friedrich L. Bauer,et al.  Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.

[3]  Erwin Engeler Introduction to the theory of computation , 1973 .

[4]  Carl Hewitt,et al.  Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot , 1972 .

[5]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[6]  Friedrich L. Bauer,et al.  Revised report on the algorithm language ALGOL 60 , 1963, CACM.

[7]  Alfred V. Aho,et al.  Currents In The Theory Of Computing , 1973 .

[8]  Terry Winograd,et al.  Understanding natural language , 1974 .

[9]  H. Kadner F. L. Bauer/G. Goos, Informatik, eine einführende Übersicht, Tl. II, 208 S., Berlin‐Heidelberg‐New York 1974. Springer Verlag. DM 14,80 , 1976 .

[10]  Erwin Engeler,et al.  Structure and meaning of elementary programs , 1971, Symposium on Semantics of Algorithmic Languages.

[11]  Karel Culík,et al.  Extensions of rooted trees and their applications , 1977, Discret. Math..

[12]  Cliff B. Jones,et al.  The Syntax Machine , 1968 .

[13]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[14]  K. Gödel Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[15]  C. A. Petri Concepts of Net Theory , 1973, MFCS.

[16]  David C. Luckham,et al.  On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..

[17]  Robert W. Floyd,et al.  On the nonexistence of a phrase structure grammar for ALGOL 60 , 1962, CACM.

[18]  Robert M. Meade On memory system design , 1970, AFIPS '70 (Fall).

[19]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[20]  C. Petri Kommunikation mit Automaten , 1962 .

[21]  B. J. Mailloux,et al.  Report on the Algorithmic Language , 1971 .

[22]  Jeffrey D. Ullman,et al.  The Generation of Optimal Code for Arithmetic Expressions , 1970, JACM.

[23]  Karel Culík Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams , 1973, MFCS.

[24]  B. Dömölki On the Formal Definition of Assembly Languages , 1973, MFCS.

[25]  A. Church The calculi of lambda-conversion , 1941 .

[26]  Clay McFarland,et al.  A language-oriented computer design , 1970, AFIPS '70 (Fall).

[27]  Kurt Walk Modelling of storage properties of higher level languages , 1971, SIGP.

[28]  Karel Čulík Structural Similarity of Programs and Some Concepts of Algorithmic Method , 1972 .