×

Towards a theory of semantics and compilers for programming languages. (English) Zbl 0174.28903


PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Kleene, S. C., (Introduction to Metamathematics (1952), Van Nostrand: Van Nostrand Princeton, New Hersey) · Zbl 0047.00703
[2] Kleene, S. C., Herbrand-Godel-style recursive functionals of finite types, (Recursive Function Theory. Recursive Function Theory, Proc. of Symposia in Pure Mathematics, vol. V (1962), AMS) · Zbl 0171.26903
[3] Davis, M., (Computability and Unsolvability (1958), McGraw-Hill Book Co.: McGraw-Hill Book Co. New York) · Zbl 0080.00902
[4] Wang, H., A variant to Turing’s theory of computing machines, J. ACM, 63-92 (1957)
[5] Shephardson, J. C.; Sturgis, H. E., Computability of recursive functions, J. ACM., 10, 217-255 (1963) · Zbl 0118.25401
[6] Curtis, M. W., A Turing machine simulator, J. ACM., 12, 1-14 (1965) · Zbl 0158.16301
[7] Rogers, H., (Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill Book Co.: McGraw-Hill Book Co. New York) · Zbl 0183.01401
[8] Knuth, D., (The Art of Computer Programming (1968), Addison-Wesley: Addison-Wesley Reeding, Massachusetts) · Zbl 0191.17903
[9] Wegner, D., Programming languages, information structures and machine organization (1968)
[10] Elgot, C. C.; Robinson, A., Random-access stored-program machines, and approach to programming languages, J. ACM., 11, 365-399 (1964) · Zbl 0192.07302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.