# Sequential formula translation

@article{Samelson1960SequentialFT, title={Sequential formula translation}, author={Klaus Samelson and Friedrich L. Bauer}, journal={Commun. ACM}, year={1960}, volume={3}, pages={76-83} }

The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state-symbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes…

## Tables from this paper

## 22 Citations

Stack automata and compiling

- Computer ScienceJACM
- 1967

A mathematical model is presented which embodies salient features of many modern compiling techniques, including deterministic linear bounded automaton and nondeterministic stack automaton, and particular instances of this more general device are noted.

Program control via transition matrices—a novel application of micro-programming

- Computer ScienceSIGMINI '76
- 1976

A micro-coded implementation of a particularly rich concept—the transition matrix (TM) is described, which permits TM-oriented decision-making techniques to be utilized in virtually any task that can be described by means of a transition matrix.

Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information

- Computer ScienceActa Informatica
- 2006

A pure stack implementation that avoids a heap even for lazy arguments is developed by restriction to first-order functions over basic types by adding appropriate strictness information to recursive function definitions.

Programming Language Concepts

- Computer ScienceUndergraduate Topics in Computer Science
- 2012

Programming Language Concepts uses a functional programming language (F#) as the metalanguage in which to present all concepts and examples, and thus has an operational flavour, enabling practical…

AUTOMATIC PROCESSING OF NATURAL AND FORMAL LANGUAGES

- Computer Science
- 2011

The growth, within the theory of automata, of descriptions of machines in which a basically finite state control element is supplemented by an actually or potentially infinite storage device, usually an abstraction of the notion of n tapes capable of growing beyond any bound and subject to a variety of restrictions on reading or writing ability and on direction of motion.

From mathematical logic to programming-language semantics: a discussion with Tony Hoare

- Computer ScienceJ. Log. Comput.
- 2015

The discussion’s transcript is compared to previously published interviews with Hoare rather technical in that many questions are directly related to mathematical logic and computability theory in particular.

Translator writing systems

- Computer Science, LinguisticsCACM
- 1968

A critical review of recent efforts to automate the writing of translators of programming languages is presented and various approaches to automating the postsyntactic aspects of translator writing are discussed.

An undergraduate compiler laboratory

- Computer ScienceSIGCSE '79
- 1979

The goals of the course are to introduce students to the fundamental concepts of the design and translation of higher level languages, and to provide an introductory exposure to the related literature.

Some proposals for improving the efficiency of ALGOL 60

- Computer ScienceCACM
- 1961

A number of defects in AL(~OL which it appears to us must be eliminated before the language can achieve full success as a means of programmin~ computers for serious work are drawn up.

Application of pushdown-store machines

- EducationAFIPS '63 (Fall)
- 1963

This paper presents a meta-modelling architecture suitable for the effective processing of languages by computers, and some examples show how this architecture can be modified for mobile devices.

## References

SHOWING 1-10 OF 13 REFERENCES

The formula-controlled logical computer “Stanislaus”

- Mathematics
- 1960

The evaluation of a formula of propositional calculus is considerably simplified if this formula is written in the parenthesis-free notation of the Warsaw School, [1]. The Warsaw notation may be…

A Description of a Cooperative Venture in the Production of an Automatic Coding System

- Computer ScienceJACM
- 1956

The purpose of this paper is to point out that PACT is the product of a different sort of co-operative undertaking, to let the machine do a larger share of the work of preparing a problem for machine computation.

ACM Committee on Programming Languages and GAMM Committee on Programming, Eeport on the Algorithmic J,anguage ALC}OL Nmn. Math

- ACM Committee on Programming Languages and GAMM Committee on Programming, Eeport on the Algorithmic J,anguage ALC}OL Nmn. Math
- 1959

Die algorithmiHche Ji ' ormelHpraehe ALGOL

- Nmn . Math .
- 1959

Probleme der Progranm1ierungsteehnik. Intern. Kolloquium iiber Probleme der Hechenteehnik

- Probleme der Progranm1ierungsteehnik. Intern. Kolloquium iiber Probleme der Hechenteehnik
- 1955

The use of a ‘floating address’ system for orders in an automatic digital computer

- Computer Science
- 1953

Automatische H.echenplanfertigung bei programmgesteuerten Uechenmaschinen

- Mitt. Inst. f. Angew. Math. der ETII Zurich, Nr
- 1952

Planning and coding for an electronic computing instrument. Institute for Advanced Study

- N .. J
- 1947

Die algorithmiHche Ji'ormelHpraehe ALGOL. Eleklronische Rechwnanlagen 1 (1\1.50), 72-79 and HO-U,:i

- Die algorithmiHche Ji'ormelHpraehe ALGOL. Eleklronische Rechwnanlagen 1 (1\1.50), 72-79 and HO-U,:i