A Formalism for Program Translation

Authors:
J. Slansky;M. Finkelstein
Affiliations:
University of California, Irvine, California;University of California, Irvine, California
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 3
Cited 4

A alternate form of the “UNCOL diagram”

Communications of the ACM
The problem of programming communication with changing machines: a proposed solution

Communications of the ACM
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Translation Networks and Function Composition

Journal of the ACM (JACM)
A formalism for translator interactions

Communications of the ACM
Letters to the editor: number of possible strategies when writing compilers

Communications of the ACM
Conversion of programs between computers: Interpreters, simulators and compilers

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.04

Visualization

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.