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.

....laborious task to convert an existing proof into a format which can be checked by a machine. In the system that we propose, the author is assisted in the process of converting an existing proof into the PVS language and having it checked by PVS. 1 Introduction The now classic ALGOL 60 report [5] recognized three different levels of language: a reference language, a publication language and several hardware representations, whereby the publication language was intended to admit variations on the reference language and was to be used for stating and communicating processes. The importance ....

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

....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 e#ort 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.

....of these settings, by representing the meaning of the rest of the program as a function or procedure, continuations provide an elegant description of a variety of language constructs, including call by value and goto statements. 1. The Background In the early 1960 s, the appearance of Algol 60 [32, 33] inspired a ferment of research on the implementation and formal definition of programming languages. Several aspects of this research were critical precursors of the discovery of continuations. The ability in Algol 60 to jump out of blocks, or even procedure bodies, forced implementors to ....

Naur, Peter et al. Revised report on the algorithmic language ALGOL

.... 2 http: www.cis.upenn.edu switchware This is a preliminary version being submitted to HOOTS99 Kakkar and Hicks and Moore and Gunter Specifying a programming language carefully is a traditional challenge dating back at least to the specification of Algol 60 [4,17], possibly one of the first programming languages to be specified precisely by something different from an implementation. Many of the problems that arose with that specification [12] are still issues now, but there are also some new challenges brought on by the changing role of modern programming ....

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

....E : Syn Sem and L ffi E = 1 Sem . Observation: L tells that any semantic element has at least one syntactic representation and E tells that any syntax element has as unique semantic value. We use equations of the form r : A 0 = t 0 A 1 t 1 A 2 t 2 : A n t n , called BNF notation [Nau63], as specification rules for language algebras similarity class, where A i , 0 i n, are parameters called nonterminals and t i , 0 i n, are fixed strings. For a given specification rule r : A 0 = t 0 A 1 t 1 A 2 t 2 : A n t n , A 0 is the left hand side of the rule and is denoted by lhs(r) ....

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

....assignment constructs into referentially transparent functional programming languages. This combination of paradigms, however, may also be approached from the imperative programming point of view, and indeed it has been, dating from the days of the great progenitor, Algol 60 [Naur et al. 1960; Naur et al. 1963] It is a peculiarity of Algol 60, little imitated in its successors, that its default parameter passing mechanism is call by name: procedure invocation is defined by the copy rule stating that the procedure invocation has exactly the same meaning as the defining text of the procedure, but with ....

Peter Naur, 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. Revised report on the algorithmic language ALGOL 60. Communications of the ACM, 6(1):1--17, 1963.

....rule is shown in figure 2.4. raise Parse error Figure 2.4: Error handling 2.1.2 OCAMLYACC Yacc is an abbreviation for Yet another compiler compiler. Yacc is a program that generates a parser for a list of rules in BNF like format. BNF is an abbreviation for Backus Naur Form [4], which is a method of representing grammars. This list of rules is a simplified version of BNF. The parsing technique OCAMLYACC uses is called LALR(1) LALR is an abbreviation for LookAhead Left Recursive. The (1) denotes that the lookahead is limited to a single token. Input to a parser is a ....

....and the others. The token generated for the assignment operator = is ASSIGNS and this token has no value. ASSIGNS = ASSIGNMENTOPERATOR(lexeme lexbuf) Figure 2.25: Lex specification of some of the assignment operators 2.2. 2 The syntactic grammar The syntactic grammar [5, 4, 6 10, 14, 15] defines a set of production rules, that describes how sequences of tokens specified in subsection 2.2.1 can form a syntactically correct JAVA program 1 . Only a part of this grammar will be discussed here. Start symbol Each grammar has its start (or goal) symbol. According to [5] the ....

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

....are two already defined conctypes. The enclosing of the elements in brackets makes it an embedded language and it is possible to use reserved words of the programming language in the elements. It is easy to define and use a conctype. The notation is very close to the well known BNF notation [Bac60, Nau63, Knu64]. Thus, for most programmers it would not be any problem to understand and use the notation. A conctype definition is not much bigger than the definition of the corresponding ordinary datatype. Thus, better syntax of the elements can easily be obtained. The extra work involved is nothing compared ....

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

....used to automatically generate language processing tools. 1.1 Language specification rule A language specification rule describes formally elements of Syn(L) Sem(L) and the relationship between them. We use equations of the form r : A 0 = t 0 A 1 t 1 A 2 t 2 : An t n called BNF notation [Nau63] as specification rules, where A i , 0 i n, are parameters called nonterminals and t i , 0 i n, are fixed strings. Appropriate interpretations of the BNF notation provide the mechanisms that allow one to construct Syn(L) and Sem(L) as algebras of the same similarity class and of L and E , ....

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

....be used to automatically generate language processing tools. 1.1 Language specification rule A language specification rule describes formally elements of Syn(L) Sem(L) and the relationship between them. We use equations of the form r : A 0 = t 0 A 1 t 1 A 2 t 2 : A n t n called BNF notation [16] as specification rules, where A i , 0 i n, are parameters called nonterminals and t i , 0 i n, are fixed strings. Appropriate interpretations of the BNF notation provide the mechanisms that allows one to construct Syn(L) and Sem(L) as algebras of the same similarity class and of L and E , ....

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

....Ritchie [KR78] which was sufficiently open to interpretation that a variety of differing translator implementations had come into common use. With experience, language design became more rigorous, and languages were specified before they were implemented. In later languages, such as Algol 60 [Nau63] and Ada [DoD83] a specification of the grammar for the languages existed before the language was implemented. The grammar in the language specification, rather than an early implementation of a compiler, defined the syntax of the language. To concisely DRAFT: Do Not Distribute 10:45 8 September ....

....of a compiler, defined the syntax of the language. To concisely DRAFT: Do Not Distribute 10:45 8 September 1994 frontend.tex 10 and unambiguously indicate the syntax of computer languages, specialized grammar notations were developed. Backus Naur Form (BNF) which was used in the Algol 60 [Nau63] language description, is an example of a grammar specification language. However, given a grammar, it is not sufficient to merely construct a program that can determine if the input conformed to the grammar, i.e. to construct a recognizer. There must be some means to effect a translation of the ....

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

....memory management discipline, which helps the user manage memory, in return for imposing restrictions on how memory may be used. Indeed, memory management considerations have often played a central role in the design of programming languages. One famous example is the programming language Algol 60 [10], which introduced what we will call the pure stack discipline. In the pure stack discipline the runtime stack can hold all values produced by the computation, including temporary variables, non local variables, return addresses, and even certain variable sized arrays. The term pure refers to ....

P. Naur. Revised report on the algorithmic language Algol 60. Comm. ACM, 1:1--17, 1963.

....1 Introduction Large software systems consist of many components (resources) that interact in intricate ways. Being able to control these interactions is critical for both the initial development and longterm maintenance of a software system. Early programming languages, such as ALGOL 60 [12], recognized the importance of limiting the interactions of fine grained resources such as variables, constants, and types by encapsulating them into block structures and using scoping rules to dictate how these resources were able to interact. As software systems grew in size, block structures ....

....hierarchy. To a large extent, these scoping concepts have evolved from concepts found in programming languages that support modules and classes. Our presentation of scoping rules gives an evolutionary perspective. In Section 2, we begin by describing block structure scoping using ALGOL 60 [12] as an example. In Section 3, we describe module scoping using Modula 3 [1] as an example. These two kinds of scoping pre date subsystem scoping, which is described in Section 4. We describe subsystem scoping using the Software Landscape [13] architectural notation as an example. 2 Block Structure ....

[Article contains additional citation context not shown here]

Naur, P. Revised Report of the Algorithmic Language Algol 60. Communications of the ACM 6, 1 (1963), 1--17.

....[17, 18] evaluated immediately after the function is applied, and the resulting values are wrapped up again as thunks. Thus, ER captures the computational properties of call by value, but in a different style than Ev . This corresponds to the definition of call by value in the Algol 60 report [30]. Turning to the CPS transformation, Rv def = C 0 ffi ER Griffin, for example [15, Footnote 3] pointed out that the typing of the function space in Rv matches the one of Pn i.e. Rvh 1 2 i = Rvh[ 1 ]i Rv h[ 2 ]i This typing coincidence already holds here, before introducing ....

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

....memory cells. The reason for this is that the number of cells which the program wishes to allocate and use at some point during the computation often is much larger than the number of cells which have to exist at any one point of the computation. The stack discipline which originated with Algol 60[15] is a particularly elegant discipline for dynamic memory management. Restricted versions of the original stack discipline are used in many languages in current use, e.g. C and Pascal. In the stack discipline, every point of memory allocation is matched by a point of de allocation, and these ....

Peter Naur (ed.). Revised report on the algorithmic language Algol 60. Comm. ACM, 1:1--17, 1963.

....the former sequences the execution of two terms, the latter compares the result of its Thetarst sub expression to [0 and branches to the second if the answer is armative and to the third term otherwise. The informal semantics of the procedural language is easily explained via Algol s copy rule [13]. A procedure replaces its parameters by its arguments (after renaming internal bound variables, which we implicitly assume according to Convention 1) A recursive de Thetanition is unrolled as far as necessary. The sub language of IA does not provide a looping construct but again, this omission ....

Peter Naur, ed. Revised report on the algorithmic language Algol 60. Communications of the ACM, 6(1):1#17, 1963. See Chapter 1.

....to write local recursive procedure definitions. Common Lisp [17] provides the labels special form for this purpose. Scheme [13] provides the similar letrec special form, as well as internal definitions, a syntactic alternative more akin to the internal procedure declarations of Algol 60 [6]. Recursive procedures are described, and sometimes implemented, particularly for top level procedures, in terms of assignment. For example, the first expression in Fig. 1 can be considered shorthand for the second. Lisp compilers typically treat letrec (or labels) as a primitive special form in ....

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

....were designed to overcome some of these short comings by providing a greater variety of data types. For example, Pascal[wir73] provides a programmer with typed structures that can be used to model a wide range of complex data structures. Other examples of such programming languages include Algol 60[nau63], Algol 68[van69] BCPL[ric80] and C[ker78] Although these languages can provide sophisticated type systems to control the use of data, they are still prone to spurious errors resulting from uninitialised data, indexing errors and so on. Following the generation of programming languages that ....

Naur P. et al. Revised report on the algorithmic language Algol 60. Comm. ACM vol. 6, no. 1, 1963, pp1-17.

.... Preliminary Design of the Programming Language Forsythe [1] c fl1996 John C. Reynolds Research suuported by National Science Foundation Grant CCR 9409997. Keywords: Forsythe, Algol like languages, Algol 60, intersection types 1. Introduction In retrospect, it is clear that Algol 60 [2, 3] was an heroic and surprisingly successful attempt to design a programming language from first principles. Its creation gave a formidable impetus to the development and use of theory in language design and implementation, which has borne rich fruit in the intervening thirty six years. Most of this ....

.... while increasing the variable i: letinline sum:intvar int commj i : e : begin s : 0 ; i : a Gamma 1; while i b do (i : i 1 ; s : s e) end in sum i i X(i) Theta Y (i) j This way of using call by name, known as Jensen s device , was illustrated in the original Algol 60 Report [2, 3] by the exemplary procedure Innerproduct. Finally, we give two higher order procedures akin to the for command: letinline for : int int (int comm) comm j l : u: b: newintvar (l Gamma 1) k : newintvar u u: while k u do (k : k 1 ; b k) fordown : int int (int comm) commj ....

Naur, P. et al. Revised Report on the Algorithmic Language ALGOL 60. Communications of the ACM, vol. 6 (1963), pp. 1--17.

....as an infinite capacity to create new objects as is the case with the applicative languages. With any rough classification, some languages cut across the rules. How well a language fits the rules determines how much of an algol it is. Languages that could be considered as algols are Algol 60 [6], Algol W [7] Algol R [9, 38] and perhaps Pascal [10] Algol 68 [11] and PL 1 [12] Where have they gone wrong Have they Many criticisms of these languages have appeared, particularly for the more popular ones such as Pascal, Algol 68 and PL 1. They take the form of criticising particular ....

Naur P., et al Revised report on the algorithmic language Algol 60

....programming language users as syntax rules for the development of three kind of language constructs called type definitions, object declarations, and state transformations. The experience of programming language development has standardized these rules as Backus Naur Formulas, called BNF notations [Nau63], which are equations of the form LHS 0 = t 0 LHS 1 t 1 : t n Gamma1 LHS n t n where the left hand sides, LHS i , 0 i n, are variables called nonterminals and the right hand sides, RHS, t 0 LHS 1 t 1 : t n Gamma1 LHS n t n , are composed by the concatenation of fixed strings (including ....

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

....: 50 7 Conclusion and future work 50 A The Definition of Consistent 55 B Proof of Lemma 4.2 56 C Proof of Lemma 4.3 59 D Proof of Lemma 4.5 59 E Proof of Lemma 4. 4 1 Introduction The stack allocation scheme for block structured languages[10,9] often gives economical use of memory resources. Part of the reason for this is that the stack discipline is eager to reuse dead memory locations (i.e. locations, whose contents is of no consequence to the rest of the computation) Every point of allocation is matched by a point of deallocation ....

Peter Naur (ed.). Revised report on the algorithmic language Algol 60. Comm. ACM, 1:1--17, 1963.

....the former sequences the execution of two terms, the latter compares the result of its first sub expression to p0q and branches to the second if the answer is affirmative and to the third term otherwise. The informal semantics of the procedural language is easily explained via Algol s copy rule [14]. A procedure replaces its parameters by its arguments (after renaming internal bound variables, which we implicitly assume according to Convention 1) A recursive definition is unrolled as far as necessary. The sub language of IA does not provide a looping construct but again, this omission only ....

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

....a discussion of many topics of lambda lifting and lambda dropping as symmetric transformations but with a focus on lambda dropping. Chapter 7 outlines the main application of lambda dropping: partial evaluation. 1. 2 Block Structure The origins of block structure can be traced back to ALGOL 60 [5, 36], known as The Father of Modern Programming Languages. This was the first language with a syntax formally defined in BNF. It spirited many features found in most modern programming languages, such as structured control statements, first class procedures (akin to those of Pascal) and a powerful ....

P. Naur. Revised report on the algorithmic language ALGOL 60. In Comm. ACM, 6, pages 1--17, 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.

No context found.

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

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