Syntax and semantics of universal programming languages

References

• Blum , M. 1967 . A machine-independent theory of the complexity of recursive functions . J. Assoc. Comput. Mach. , 14 : 322 – 336 .
   Google Scholar
• Blum , M. 1967 . On the size of machines . Information and Control , 11 : 257 – 265 .
   Google Scholar
• Davis , M. 1958 . Computability and Unsolvability , New York : McGraw-Hill .
   Google Scholar
• Davis , M. 1973 . Hilbert's tenth problem is unsolvable . Amer. Math. Monthly , 80 : 233 – 269 .
   Web of Science ®Google Scholar
• Dijkstra , E. W. 1968 . Goto statement considered harmful . Comm. Assoc. Comput. Mach. , 11 : 147 – 148 .
   Web of Science ®Google Scholar
• Floyd , R. W. 1962 . On the nonexistence of a phrase structure grammar for ALGOL 60 . Comm. Assoc. Comput. Mach. , 5 : 483 – 484 .
   Google Scholar
• Friedberg , R. M. 1958 . Three theorems on recursive enumeration. I. Decomposition. II. Maximal set III. Enumeration without duplication . J. Symbolic Logic , 23 : 309 – 316 .
   Google Scholar
• Hamlet , R. G. 1972 . “ Partial recursive computation ” . Seattle : University of Washington Comput. Sci. Group . Technical report 72-07-01
   Google Scholar
• Hamlet , R. G. . A patent problem for abstract programming languages . machine-independent computations . pp. 193 – 197 . Proceeding of the Fourth Annual ACM Symposium on Theory of Computing .
   Google Scholar
• Hamlet , R. G. 1974 . Introduction to Computation Theory , New York : Intext Educational Publishers .
   Google Scholar
• Hamlet , R. G. 1974 . “ Friedberg programming languages ” . College Park : University of Maryland Computer Science . Technical Report TR-74-337
   Google Scholar
• Hartmanis , J. 1974 . Computational complexity of formal translations . Math. Sys. Theory , 8 : 156 – 166 .
   Google Scholar
• Kleene , S. C. 1952 . Introduction to Metamathematics , Princeton : D. Van Nostrand .
   Google Scholar
• Naur , P. , ed. 1963 . “ Revised report on the algorithmic language ALGOL 60 ” . In Comm. Assoc. Comput. Mach. Vol. 6 , 1 – 17 .
   Google Scholar
• Rogers , H. Jr. 1958 . Gödel numberings of partial recursive functions . J. Symbolic Logic , 23 : 331 – 41 .
   Google Scholar
• Rogers , H. Jr. 1967 . Theory of Recursive Functions and Effective Computability , New York : McGraw-Hill .
   Google Scholar
• Turing , A. M. . On computable numbers, with an application to the entseheidungsproblem . Proceedings of the London Math. Soc. Ser. 2 . Vol. 42 , pp. 230 – 278 .
   Google Scholar
• Wulf W. A. Shaw M. Global variable considered harmful SIGPLAN Notices Feb 1973 8 28 34
   Google Scholar
• Young , P. R. 1971 . A note on ‘axioms’ for computational complexity and computation of finite functions . Information & Control , 19 Feb : 377 – 386 .
   Google Scholar
• Basili , V. R. and Turner , A. J. 1975 . A transportable extendable compiler . Software-Practice and Experiences , 5 July : 269 – 278 .
   Google Scholar
• Knuth , D. E. 1974 . Structured programming with go to statements . Comp. Surveys , 6 July : 261 – 302 .
   Google Scholar
• Wulf , W. A. 1971 . BLISS: a language for system programming . Comm. Assoc. Comput. Mach. , 14 Dec : 780 – 790 .
   Google Scholar
• van Wijngaarden , A. 1976 . Revised report on the algorithm language ALGOL68 , Berlin : Springer-Verlag .
   Google Scholar
• Baker , B. S. 1977 . An algorithm for structuring flowgraphs . J. Assoc. Comput. Mach. , 24 Dec : 98 – 120 .
   Google Scholar