Demo Data from EDBT 2026 / reviewers in the wild / expert
Adriaan van Wijngaarden
dblp:30/2085
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1975
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › grammar formalisms
generative capacity |
0.0 | 1 | 1974 | The Generative Power of Two-Level Grammars · ICALP 1974 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | Revised Report on the Algorithmic Language ALGOL 68
Adriaan van Wijngaarden, Barry J. Mailloux, John E. L. Peck, Cornelis H. A. Koster, Michel Sintzoff, Charles H. Lindsey, Lambert G. L. T. Meertens, R. G. Fisker |
Acta Informatica | 1 |
| 1974 | The Generative Power of Two-Level Grammars
Adriaan van Wijngaarden |
ICALP | 1 |
| 1963 | Revised report on the algorithmic language ALGOL 60abstractThe report gives a complete defining description of the international algorithmic language ALGOL 60. This is a language suitable for expressing a large class of numerical processes in a form sufficiently concise for direct automatic translation into the language of programmed automatic computers. The introduction contains an account of the preparatory work leading up to the final conference, where the language was defined. In addition the notions reference language, publication language, and hardware representations are explained. In the first chapter a survey of the basic constituents and features of the language is given, and the formal notation, by which the syntactic structure is defined, is explained. The second chapter lists all the basic symbols, and the syntactic units know as identifiers, numbers, and strings are defined. Further, some important notions such as quantity and value are defined. The third chapter explains the rules for forming expressions, and the means of these expressions. Three different types of expressions exist: arithmetic, Boolean (logical), and designational. The fourth chapter describes the operational units of the language, known and statements. The basic statements are: assignment statements (evaluation of a formula), go to statements (explicit break of the sequence of execution of statements), dummy statements, and procedure statements (call for execution of a closed process, defined by a procedure declaration). The formation of more complex structures, having statement character, is explained. Thes include: conditional statements, for statements, compound statements, and blocks. In the fifth chapter the units known as declarations, serving for defining permanent properties of the units entering into a process described in the language, are defined. The report ends with two detailed examples of the use of the language, and an alphabetic index of definitions. John W. Backus, Friedrich L. Bauer, Julien Green, C. Katz, John McCarthy 0001, Peter Naur, Alan J. Perlis, Heinz Rutishauser, Klaus Samelson, Bernard Vauquois, Joseph Henry Wegstein, Adriaan van Wijngaarden, Michael Woodger |
Comput. J. | 12 |