Sequential formula translation
@article{Samelson1960SequentialFT,
title={Sequential formula translation},
author={K. Samelson and F. 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… Expand
Tables and Topics from this paper
23 Citations
Program control via transition matrices—a novel application of micro-programming
- SIGMINI '76
- 1976
- 3
- Highly Influenced
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
- Mathematics, Computer Science
- Acta Informatica
- 2006
- 55
- PDF
From mathematical logic to programming-language semantics: a discussion with Tony Hoare
- Computer Science
- J. Log. Comput.
- 2015
- 2