Report on the algorithmic language ALGOL 68

DOI10.1007/BF02163002zbMath0191.46101OpenAlexW3022537579MaRDI QIDQ2538051

B. J. Mailloux, J. E. L. Peck, C. H. A. Koster, A. van Wijngaarden

Publication date: 1969

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131944

zbMATH Keywords

computer science and automata

Related Items (24)

A safe variant of the unsafe integer arithmetic of Java™ ⋮ Modularity and reusability in attribute grammars ⋮ A bi-unique transformation into integers of identifiers and other variable-length items ⋮ Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles ⋮ Generalized overlap resolvable grammars and their parsers ⋮ Programming language ALGOL 68 ⋮ Parallelism and synchronization in two-level metacontrolled substitution grammars ⋮ A note on the for statement ⋮ Implementing the ALGOL 68 heap ⋮ Control extension in a recursive language ⋮ Recursive data structures ⋮ Boolean-valued loops ⋮ On categorical graph grammars integrating structural transformations and operations on labels ⋮ An algorithm for determining defining relations of a subgroup ⋮ More comments on the programming language Pascal ⋮ On procedures as open subroutines. II ⋮ Critical comments on the programming language Pascal ⋮ A PROPOSED MULTI‐VALUED EXTENSION TO ALGOL 68 ⋮ Ambiguities and insecurities in pascal ⋮ Language design methods based on semantic principles ⋮ Time required for reference count management in retention block-structured languages. Part 1 ⋮ Time required for garbage collection in retention block-structured languages ⋮ A model for data structures and its applications. I ⋮ Representation and equality of modes

Uses Software

• ALGOL 68

This page was built for publication: Report on the algorithmic language ALGOL 68