A Formalism for Program Translation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Formalism for Program Translation

Full text

Pdf (715 KB)

Source

Journal of the ACM (JACM) archive
Volume 15 , Issue 2 (April 1968) table of contents

Pages: 165 - 175

Year of Publication: 1968

ISSN:0004-5411

Authors

J. Slansky	University of California, Irvine, California
M. Finkelstein	University of California, Irvine, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 14, Citation Count: 3

Additional Information:

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

ABSTRACT

A formalism for representing sequences or networks of program translations and compiler translations is described. The formalism is shown to be capable of (a) concisely and clearly representing the overall tasks of assemblers and preprocessors, (b) checking for similarities or equivalences among translation networks, and (c) reducing translation networks to smaller entities.

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	LEDLEY, R.S. Programming and Utilizing Digital Computers. McGraw-Hill, New York, 1962.
	2	J. Strong , J. Wegstein , A. Tritter , J. Olsztyn , O. Mock , T. Steel, The problem of programming communication with changing machines: a proposed solution, Communications of the ACM, v.1 n.8, p.12-18, Aug. 1958 [doi>10.1145/368892.368915]
	3	BURKHARDT W. H. Universal programming laaguages ad processors: A brief survey and new concepts. Proc. AFPS 1965 Fall Joiat Comput. Conf., Vol. 27, Pt. I, pp. 1-21.
	4	Comm. ACM 9, 2 (Feb. 1966), cover ad p. I25.
	5	KLEENE, S. Introduction to Metamathematics. Van Nostrand, Prilceton, N. J., 1952, p. 24.
	6	BACKUS, J.W. The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM ConfereIce. Proc. internatioaal Conference on Information Processing, UNESCO, Paris, June 1959, pp. 125--132.
	7	McCARCHY, J. Towards a mathematical science of computation. Dep. Computer Science Rep., Stanford U., Stanford, C:d., 1964.
	8	Harvey Bratman, A alternate form of the “UNCOL diagram”, Communications of the ACM, v.4 n.3, p.142, March 1961 [doi>10.1145/366199.366249]
	9	McCARTHY, Z. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, North..Holland, Amsterdam, 1963.
	10	John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962

CITED BY 3

	Jay Earley , Howard Sturgis, A formalism for translator interactions, Communications of the ACM, v.13 n.10, p.607-617, Oct. 1970
	I. J. Good, Letters to the editor: number of possible strategies when writing compilers, Communications of the ACM, v.11 n.7, p.474, July 1968
	Peter Wegner, Translation Networks and Function Composition, Journal of the ACM (JACM), v.16 n.2, p.261-263, April 1969