Random-Access Stored-Program Machines, an Approach to Programming Languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Random-Access Stored-Program Machines, an Approach to Programming Languages

Full text

Pdf (2.53 MB)

Source

Journal of the ACM (JACM) archive
Volume 11 , Issue 4 (October 1964) table of contents

Pages: 365 - 399

Year of Publication: 1964

ISSN:0004-5411

Authors

Calvin C. Elgot	IBM Watson Research Center, Yorktown Heights, New York
Abraham Robinson	IBM Watson Research Center, Yorktown Heights, New York and University of California, Los Angeles, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 55, Citation Count: 17

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321239.321240 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Peter Naur , J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger, Report on the algorithmic language ALGOL 60, Communications of the ACM, v.3 n.5, p.299-314, May 1960 [doi>10.1145/367236.367262]
	2	DAvis, M. Computability and Unsolvability. McGraw Hill, New York, 1958.
	3	HERMES, H. Aufzdhlbarkeit, Entseheidbarkeit, Berechenbarkeit, Einftihrung in die Theorie der Recursiven Funktionen. Berlin, Springer, 1961.
	4	GOLDSTINE, H, H., AND vONNEUMANN, J. Planning and coding of problems for an electronic computing instrument. Rep. 1947, Inst. Adv. Study, Princeton.
	5	ASSER, G. Turing-Msschinen und Markowsche Algorithmen. Z. Math. Log. Grundlag. Math. 5 (1959), 346-365.
	6	KAPHENGST, H. Eine abstrakte programmgesteuerte Rechenmaschine. Z. Math. Log. Grundlag. Math. 5 (1959), 366-379.
	7	Hao Wang, A Variant to Turing's Theory of Computing Machines, Journal of the ACM (JACM), v.4 n.1, p.63-92, Jan. 1957 [doi>10.1145/320856.320867]
	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.
	9	J. C. Shepherdson , H. E. Sturgis, Computability of Recursive Functions, Journal of the ACM (JACM), v.10 n.2, p.217-255, April 1963 [doi>10.1145/321160.321170]

CITED BY 18

	G. E. Blelloch, Scans as Primitive Parallel Operations, IEEE Transactions on Computers, v.38 n.11, p.1526-1538, November 1989
	R. J. Nelson, Invited papers—1: basic concepts of automata theory, Proceedings of the 1965 20th national conference, p.138-161, August 24-26, 1965, Cleveland, Ohio, United States
	Robert L. Constable, On the size of programs in subrecursive formalisms, Proceedings of the second annual ACM symposium on Theory of computing, p.1-9, May 04-06, 1970, Northampton, Massachusetts, United States
	Michael Marcotty , Henry Ledgard , Gregor V. Bochmann, A Sampler of Formal Definitions, ACM Computing Surveys (CSUR), v.8 n.2, p.191-276, June 1976
	Michael S. Paterson, Decision problems in computational models, ACM SIGACT News
	John C. Warkentin , Patrick C. Fischer, Predecessor machines and regressing functions, Proceedings of the fourth annual ACM symposium on Theory of computing, p.81-87, May 01-03, 1972, Denver, Colorado, United States
	Jerome Feldman , David Gries, Translator writing systems, Communications of the ACM, v.11 n.2, p.77-113, Feb. 1968
	Patrick C. Fischer, Multi-tape and infinite-state automata—a survey, Communications of the ACM, v.8 n.12, p.799-805, Dec. 1965
	Robert L. Constable , Allan B. Borodin, Subrecursive Programming Languages, Part I: efficiency and program structure, Journal of the ACM (JACM), v.19 n.3, p.526-568, July 1972
	E. K. Blum, Towards a theory of semantics and compilers for programming languages, Proceedings of the first annual ACM symposium on Theory of computing, p.217-227, May 05-07, 1969, Marina del Rey, California, United States
	David Beech, A Structural View of PL/I, ACM Computing Surveys (CSUR), v.2 n.1, p.33-64, March 1970
	Carl H. Smith , J. van Leeuwen, Microprogrammed random access stored program machines, ACM SIGACT News, v.6 n.3, p.23-32, July 1974
	Marian Boykan Pour-El, Computer Science And Recursion Theory, Proceedings of the 1978 annual conference, p.15-20, December 04-06, 1978, Washington, D.C., United States
	Kurt Walk, Modelling of storage properties of higher level languages, ACM SIGPLAN Notices, v.6 n.2, February 1971
	Yuxin Deng , Rob van Glabbeek , Matthew Hennessy , Carroll Morgan , Chenyi Zhang, Remarks on Testing Probabilistic Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 172, p.359-397, April, 2007
	Walter H. Burkhardt, Universal programming languages and processors: a brief survey and new concepts, Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I, November 30-December 01, 1965, Las Vegas, Nevada
	K. Bandat, On the formal definition of PL/I, Proceedings of the April 30--May 2, 1968, spring joint computer conference, April 30-May 02, 1968, Atlantic City, New Jersey
	E. J. Neuhold, The formal description of programming languages, IBM Systems Journal, v.10 n.2, p.86-112, June 1971