P. Naur. Revised Report on the Algorithmic Language ALGOL 60. Communications of the ACM, 3(5):299314, May 1960.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... we didn t already know This talk describes some work which attempts to provide a usable reasoning technique for the games model of Ghica [1] Semantics of Imperative Languages using Regular Expressions Algol (IA) is Reynolds s theoretical distillation of Algol 60 [9, 3]. IA can be seen as: basic functional language extended with state . 3 . alternatively, a basic imperative language extended . block structure (new) higher order procedures (# calculus) Either way, it is very expressive, elegant and ....

Peter Naur, J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, A. J. Perlis, H. Rutishauer, K. Samelson, B. Vauquois, J. H. Wegstein, A. van Wijngaarden, and M. Woodger. Revised report on the algorithmic language ALGOL 60. Communications of the ACM, 6(1):1--17, January 1963.

....: 153 Bibliography 154 1 Chapter 1 Introduction This work uses denotational models to study and enhance programming language constructs that manipulate non local context information. Non local control operators occur in such diverse languages as Algol [12], Lisp [34, 49] C [30] C [53] Scheme [5, 54] ML [23, 37] EuLisp [38] and Dylan [11] they enable the programmer to identify and restore enclosing or arbitrary control contexts in the program execution path. We show here that widely differing denotational models for any kind of control ....

P. Naur (ed.). Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1--17, 1963.

....P, is the enabling predicate. The enabling predicate determines when the transition will occur. This predicate is required for code generation and if left blank it will default to false (0) The syntax for the enabling predicate is defined by the following grammar using BNF (Backus Naur form [Nau65]) notation: 4.2. USING THE EDITOR 66 pred : pred ) j pred ( pred ) j pred ( pred ) j pred relation j pred relation j relation relation : relation ) j expr = expr j expr expr j expr expr j expr = expr j expr = expr j expr = expr j expr j expr j RE var j FE var j ....

P. Naur et al., Revised Report on the Algorithmic Language Algol 60, in Computer Journal, 5, 1965, pages 349-367.

....in the SyntaxMacro as a mixfix operation symbol, i.e. an operation symbol distributed on the operands taken by the operation it denotes. The rationale for this notation seems to be the flavor of a natural language provided to the Algollike programming languages originally specified by such rules [Nau63] and its potential to disambiguate word expressions thus specified. SemanticsMacro used so far as semantics specification rules are denotations [Mos90] used in the study of semantics of programming languages, attributes [DJL88] used in compiler construction, semantics feature representations ....

P. Naur. Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1--17, 1963.

....permission to use text from the Scheme 311 version 4 reference manual. We thank Texas Instruments, Inc. for permission to use text from the TI Scheme Language Reference Manual[30] We gladly acknowledge the influence of manuals for MIT Scheme[17] T[22] Scheme 84[11] Common Lisp[27] and Algol 60[18]. We also thank Betty Dexter for the extreme effort she put into setting this report in T E X, and Donald Knuth for designing the program that caused her troubles. The Artificial Intelligence Laboratory of the Massachusetts Institute of Technology, the Computer Science Department of Indiana ....

Peter Naur et al. Revised report on the algorithmic language Algol 60. Communications of the ACM 6(1):1--17, January 1963.

....see an early struggle with this challenge in the research on the specification of Algol 60. The original 1960 specification [10] of the language is one of the most influential software specifications ever written. Predictably, it was found to have difficulties which led to a revised specification [33] in 1963. In 1967 Donald Knuth wrote a survey [22] of the difficulties in these specifications; his comments cover some of the persistent problems arising in specifying complex software systems: When Algol 60 was first published in 1960, many new features were introduced into programming ....

P. Naur and M. Woodger. Revised report on the algorithmic language algol 60. Communications of the ACM, 6:1--20, 1963.

....before being substituted into the procedure body. Call by lazy evaluation is also known as normal order evaluation, because of the order (outermost to innermost, left to right) of evaluation of an expression. Call by name is a particular implementation of call by lazy, used in Algol 60 [18]. The designers of Algol 60 intended that call by name parameters be physically substituted into the procedure body, enclosed by parentheses and with suitable name changes to avoid conflicts, before the body was evaluated. 2.3. CALL BY LAZY VS. CALL BY NEED Call by need is an extension of call ....

Peter Naur (ed.), J. W. Backus, F. L. Bauer, J. Green, C. Katz, J. McCarthy, A. J. Perlis, H. Rutishauser, K. Samelson, B. Vauquois, J. H. Wegstein, A. van Wijngaarden, and M. Woodger, 1963. Revised report on the algorithmic language Algol-60. In Communications of the ACM, January 1963.

....all. The effect of call by value is obtained by forcing an actual parameter upon entry in a procedure, and packaging the resulting value into a thunk that is bound to an occurrence of the formal parameter in a new inner block. This corresponds to the definition of call by value in the Algol report [18]. Let us express this strategy for a language n v with both call by name functions ( x : e) and callby value functions ( v x : e) This language with mixed parameter passing can be simulated simply by extending T with the following clause. T h[ v x : e]i = t : let v = force t in ( x : T h[e]i) ....

Peter Naur (editor). Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1--17, 1962.

....issues. Nonetheless, the academic discipline of programming language design has proven valuable, because many of its insights and techniques move into the mainstream over a period of decades. In particular, the first wave of language design innovations, that of syntax definition [36], parsing theory [23] and simple data typing [19] developed in the 1960 s and 1970 s, are firmly implanted within the mainstream today. One no longer needs to justify why a language s syntax is based on an LALR(k) grammar and why its data type checking relies on a propositional logic of types. ....

P. Naur. Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1--17, 1963.

....i.e. unchanged. 1.2 Languages In the literature on computing science, xed point equations are most often called recursive equations because the unknown x recurs on the right side of the equation. Recursion was rst used extensively in computing science in the now classic Algol 60 report [Nau63] which de ned the programming language Algol 60. The Algol 60 report introduced so called Backus Naur Form to de ne the syntax of the language. Here is a small, simpli ed extract from the language de nition. hExpressioni : hExpressioni hExpressioni j ( hExpressioni ) j hVariablei This de ....

P. (Ed.) Naur. Revised report on the algorithmic language ALGOL 60. Comm. ACM, 6:1-20, Also in The Computer Journal, 5: 349-67 (1963); Numerische Mathematik, 4: 420-52 (1963) 1963.

No context found.

P. Naur. Revised Report on the Algorithmic Language ALGOL 60. Communications of the ACM, 3(5):299314, May 1960.

No context found.

P. Naur. Revised report on the algorithmic language ALGOL60. Commun. ACM, 3(5):299--314, May 1960.

No context found.

Peter NAUR. Revised report on the algorithmic language algol 60. Communications of the ACM, 3(5):299--314, May 1960.

No context found.

Naur, P.: Revised report on the algorithmic language algol 60. Communications of the ACM 3 (1960) 299-- 314

No context found.

Peter Naur et al. Revised report on the algorithmic language Algol 60, Communications of the ACM 6(1): 1-17, January 1963.

No context found.

P. Naur. Revised report on the algorithmic language Algol 60. The Computer Journal, 5:349--367, 1963.

No context found.

Peter NAUR. Revised report on the algorithmic language algol 60. Communications of the ACM, 3(5):299--314, May 1960.

No context found.

P. Naur. Revised Report on the Algorithmic Language ALGOL 60. Communications of the ACM, 3(5):299314, May 1960.

No context found.

P. Naur et al. Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1--17, January 1963. (p. 4)

No context found.

Naur, P.: Revised report on the algorithmic language Algol 60. The Computer Journal 5 (1963) 349--367

No context found.

Naur, P. (Ed.). Revised report on the algorithmic language ALGOL 60. Comm. of ACM (6) (January 1963) 1--17.

No context found.

Peter Naur. Revised report on the algorithmic language ALGOL 60. Numerische Mathematik, 4:420--453, 1963. Also published in the Communications of the ACM 6(1):1--17 (1963) and Computer Journal 5:349--.

No context found.

Naur, P. (ed.) Revised report on the algorithmic language Algol 60. In Communication of the ACM, volume 1, pages 1-17. The ACM Press, 1963.

No context found.

Peter Naur et al. Revised report on the algorithmic language Algol 60. Communications of the ACM 6(1):1--17, January 1963.

No context found.

P. Naur, J. W. Backus, et al. Revised report on the algorithmic language Algol 60. Comm. ACM, 6(1):1--17, 1963. Also The Computer Journal 5:349--67, and Numerische Mathematik 4:420--53.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC