article

Free access

A Formalism for Program Translation

Authors:

J. Slansky,

M. FinkelsteinAuthors Info & Claims

Journal of the ACM (JACM), Volume 15, Issue 2

Pages 165 - 175

https://doi.org/10.1145/321450.321451

Published: 01 April 1968 Publication History

PDF eReader

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

[1]

LEDLEY, R.S. Programming and Utilizing Digital Computers. McGraw-Hill, New York, 1962.

Google Scholar

[2]

STRONG, J. S., Er aL. The problem of programming communication with changing machines; a proposed solution. Comm. ACM I, 8 (Aug. 1958), 12--18; and t, 9 (Sept. 1959), 9-15.

Crossref

Google Scholar

[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.

Google Scholar

[4]

Comm. ACM 9, 2 (Feb. 1966), cover ad p. I25.

Google Scholar

[5]

KLEENE, S. Introduction to Metamathematics. Van Nostrand, Prilceton, N. J., 1952, p. 24.

Google Scholar

[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.

Google Scholar

[7]

McCARCHY, J. Towards a mathematical science of computation. Dep. Computer Science Rep., Stanford U., Stanford, C:d., 1964.

Google Scholar

[8]

BRATMHN, H. An Mternate form of the "UNCOL diagram." Comm. ACM 4, 3 (March 1961), 142.

Crossref

Google Scholar

[9]

McCARTHY, Z. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, North.Holland, Amsterdam, 1963.

Google Scholar

[10]

LISP 1.5 Programmer's Manual. M.I.T. Computation Center, Cambridge, Mass, 1962.

Crossref

Google Scholar

Cited By

View all

Lecarme OPellissier MThomas M(2006)Computer‐aided production of language implementation systems: A review and classificationSoftware: Practice and Experience10.1002/spe.438012090212:9(785-824)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120902
Griswold R(2006)A tool to aid in the installation of complex software systemsSoftware: Practice and Experience10.1002/spe.438012030712:3(251-267)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120307
Rosin R(2006)A graphical notation for describing system implementationSoftware: Practice and Experience10.1002/spe.43800702147:2(239-250)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380070214
Show More Cited By

Index Terms

A Formalism for Program Translation
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Translator writing systems and compiler generators
    2. General programming languages
      1. Language types

Recommendations

Bean soup translation: flexible, linguistically-motivated syntax for machine translation
Dependency treelet translation: the convergence of statistical and example-based machine-translation?

We describe a novel approach to MT that combines the strengths of the two leading corpus-based approaches: Phrasal SMT and EBMT. We use a syntactically informed decoder and reordering model based on the source dependency tree, in combination with ...
TAGs as a grammatical formalism for generation
ACL '85: Proceedings of the 23rd annual meeting on Association for Computational Linguistics

Tree Adjoining Grammars, or "TAG's", (Joshi, Levy & Takahashi 1975; Joshi 1983; Kroch & Joshi 1985) were developed as an alternative to the standard syntactic formalisms that are used in theoretical analyses of language. They are attractive because they ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 15, Issue 2

April 1968

175 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321450

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1968

Published in JACM Volume 15, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
424
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lecarme OPellissier MThomas M(2006)Computer‐aided production of language implementation systems: A review and classificationSoftware: Practice and Experience10.1002/spe.438012090212:9(785-824)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120902
Griswold R(2006)A tool to aid in the installation of complex software systemsSoftware: Practice and Experience10.1002/spe.438012030712:3(251-267)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380120307
Rosin R(2006)A graphical notation for describing system implementationSoftware: Practice and Experience10.1002/spe.43800702147:2(239-250)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380070214
Tëmov V(2005)Metaalgorithmic system of general application (MASON)Methods of Algorithmic Language Implementation10.1007/3-540-08065-1_11(188-208)Online publication date: 23-May-2005
https://doi.org/10.1007/3-540-08065-1_11
Eichenauer B(2005)Ein portabler Übersetzer für einen Subset der Prozessprogrammiersprache PEARLGFK-GI-GMR Fachtagung Prozessrechner 197410.1007/3-540-06786-8_295(576-585)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-06786-8_295
Nudds D(1973)Conversion of programs between computersJournal of Computer and System Sciences10.1016/S0022-0000(73)80037-67:6(597-614)Online publication date: 1-Dec-1973
https://dl.acm.org/doi/10.1016/S0022-0000%2873%2980037-6
Earley JSturgis H(1970)A formalism for translator interactionsCommunications of the ACM10.1145/355598.36274013:10(607-617)Online publication date: 1-Oct-1970
https://dl.acm.org/doi/10.1145/355598.362740
Wegner P(1969)Translation Networks and Function CompositionJournal of the ACM10.1145/321510.32151816:2(261-263)Online publication date: 1-Apr-1969
https://dl.acm.org/doi/10.1145/321510.321518
Good I(1968)Letters to the editorCommunications of the ACM10.1145/363397.36339911:7(474)Online publication date: 1-Jul-1968
https://dl.acm.org/doi/10.1145/363397.363399

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Bean soup translation: flexible, linguistically-motivated syntax for machine translation

Dependency treelet translation: the convergence of statistical and example-based machine-translation?

TAGs as a grammatical formalism for generation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations