Calvin C. Elgot
- 1 NAUR, P. (ED.) Report on the algorithmic language ALGOL 60. Comm. ACM 3, 5 (May 1960), 299-314; and Numer. Math. 2, (1960), 106-136. Google Scholar
- 2 DAvis, M. Computability and Unsolvability. McGraw Hill, New York, 1958.Google Scholar
- 3 HERMES, H. Aufzdhlbarkeit, Entseheidbarkeit, Berechenbarkeit, Einftihrung in die Theorie der Recursiven Funktionen. Berlin, Springer, 1961.Google Scholar
- 4 GOLDSTINE, H, H., AND vONNEUMANN, J. Planning and coding of problems for an electronic computing instrument. Rep. 1947, Inst. Adv. Study, Princeton.Google Scholar
- 5 ASSER, G. Turing-Msschinen und Markowsche Algorithmen. Z. Math. Log. Grundlag. Math. 5 (1959), 346-365.Google Scholar
- 6 KAPHENGST, H. Eine abstrakte programmgesteuerte Rechenmaschine. Z. Math. Log. Grundlag. Math. 5 (1959), 366-379.Google Scholar
- 7 WANG, H. A variant to Turing's theory of computing machines. J. ACM 4, 1 (Jan. 1957), 63-92. Google Scholar
- 8 GILMORE, P. An abstract computer with a LISP-like machine language without a label operator. In Computer Programming and Formal Systems, P. Braffort (Ed.), North Holland, 1963.Google Scholar
- 9 SHEPHERDSON, J. C. AND STURGIS, H. E. Computability of recursive functions. J. ACM 10, 2 (April 1963), 217-255. Google Scholar
Index Terms
- Random-Access Stored-Program Machines, an Approach to Programming Languages
Recommendations
General-purpose multiparadigm programming languages: an enabling technology for constructing complex systems
ICECCS '95: Proceedings of the 1st International Conference on Engineering of Complex Computer SystemsMultiparadigm programming languages have been envisioned as a vehicle for constructing large and complex heterogeneous systems, such as a stock market exchange or a telecommunications network. General-purpose multiparadigm languages, as opposed to ...
Comments