Report on the algorithmic language ALGOL 68

DOI10.1007/BF02163002MaRDI QIDQ2538051zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(24)

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

Describes a project that uses

Uses Software

• ALGOL 68

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2538051)