An Abstract Machine for Symbolic Computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Abstract Machine for Symbolic Computation

Full text

Pdf (2.54 MB)

Source

Journal of the ACM (JACM) archive
Volume 13 , Issue 3 (July 1966) table of contents

Pages: 444 - 468

Year of Publication: 1966

ISSN:0004-5411

Author

D. L. Overheu

Department of Defence, Australia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 19, Citation Count: 0

Additional Information:

abstract references index terms

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/321341.321354 What is a DOI?

ABSTRACT

The design of an abstract machine with a recursive function programming language which avoids the predicate type of conditional is described. It is shown that trough the adoption of list processing techniques it has been possible to construct a simple simulator for the machine in FORTRAN. A program for the machine which causes it to perform symbolic differentiation with some algebraic manipulation of the expressions concerned is given as an example of the type of computations which may be performed.

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	John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
	2	A. J. Perlis , Charles Thornton, Symbol manipulation by threaded lists, Communications of the ACM, v.3 n.4, p.195-204, April 1960 [doi>10.1145/367177.367202]
	3	NEWELI, A. Information Processing Language.V Manual. Prentice Hall, Englewood Cliffs, N.J., 1961.
	4	BARNETT, M.P. A formal language for the description of string relationships. Tecta. Not: No. 16, Co-operative Computing Lab., M.I.T., Cambridge, Mass.
	5	GILMORE, P.C. An Abstract Computer with a LISP-Like Language Without a Label Operatol- Computer Programming and Formal Systems. North Holland Publishing Co., Amsterdam 1963, p. 72.
	6	BOCHENSKI, J .M . A Precis of Mathematical Logic. D. Reidel Publishing Co., Holland 1959.
	7	Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985
	8	DAvis, M. Computability and Unsolvability. McGraw-Hill, New York, 1958.
	9	McCAaTHY, J. A Basis }or a Mathematical Theory of Computing Compue" Progamming and Formal Systems. North Holland Publishing Co., Amsterdam, p. 33.
	10	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]
	11	TARSKI, A. Logic, Semantics, and Meta-mathematics. Oxford U. Press, Oxford, England, 1956.