A bonus from van Wijngaarden's device

Authors:
James H. Morris, Jr.
Affiliations:
Univ. of California, Berkeley, Berkeley
Venue:
Communications of the ACM
Year:
1972

Citing 3
Cited 4

GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Communications of the ACM
The next 700 programming languages

Communications of the ACM
PAL—a language designed for teaching programming linguistics

ACM '68 Proceedings of the 1968 23rd ACM national conference

Abstracting control

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Definitional Interpreters for Higher-Order Programming Languages

Higher-Order and Symbolic Computation
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Peter J. Landin (1930---2009)

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	48.22

Visualization

Abstract

In [1] van Wijngaarden presented a rather remarkable technique for rewriting ALGOL 60 programs to eliminate all labels. The purpose of this note is to point out that the rewriting would also eliminate the use of array returning (procedure returning, label returning, etc.) procedures had they been legal constructs of ALGOL 60. Hence, the many languages which allow such things to be returned as procedure values are not such large extensions of ALGOL 60 as one might think [2, 3, 4, 5].