|
| |
| | Peter Naur - Wikipedia, the free encyclopedia |
 | | From 1969 to 1998 Peter was a professor of computer science at Copenhagen University. | | | Peter Naur (born October 25, 1928) is a Danish pioneer in computer science and Turing award winner. | | | In his book Computing: A Human Activity (1992), which is a collection of his contributions to computer science, he rejects the formalist school of programming that view programming as a branch of mathematics. |
|
http://en.wikipedia.org/wiki/Peter_Naur
(346 words)
|
|
| |
| | DIKU: Peter Naur: The first professor at DIKU |
| | Naur heavily criticized the behaviorist view of human beings as complex computers, and he criticized the concept of artificial intelligence in the sense of computers that could reason in a manner that was comparable to that of human beings. | | | Naur found that "computer science" was an unsatisfactory term. | | | Peter Naur has spent most of his career in computer science, and he has made major contributions to the field, as we know it today. |
|
http://www.diku.dk/reklamer/mennesker_og_resultater/peter_naur.html
(792 words)
|
|
| |
| | Memo to Self: April 2005 |
| | Naur thought that the really important thing to realize was that successful programmers had to establish a Theory about a problem before they could develop a Theory about the solution to it that would lead to, at the end of the process, a program text. | | | Peter Naur was one half of the duo behind the Backus-Naur Form (BNF) grammar used to define programming languages. | | | Naur's Theory Building View of software development, and XP's Metaphor, are two very interesting, and very useful, ways of thinking about software development. |
|
http://ose.typepad.com/neils_blog/2005/04
(3075 words)
|
|
| |
| | The Copenhagen model |
| | Naur consulted the Danish computer industry and put considerable effort into designing every aspect of a computer science course [1, 2]. | | | Naur also discusses the organisation of project work, what ``reports'' typically should look like, and problems of evaluation, including the possibility of automatic grading of programs and students' mutual evaluation. | | | Almost all of Naur's ideas have been implemented at DIKU. |
|
http://www.cs.mu.oz.au/~eas/files/supplementary-docs/node4.html
(647 words)
|
|
| |
| | DBLP: Peter Naur |
| | Peter Naur: Remarks on and certification of algorithm 50: inverse of a finite segment of the Hilbert matrix. | | | Peter Naur: Correction to earlier remarks on algorithm 42 invert, alg. | | | Mondrup, Peter Naur: A storage allocation scheme for ALGOL 60. |
|
http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/n/Naur:Peter.html
(297 words)
|
|
| |
| | Visible Storage |
| | Peter Naur, a Danish computer scientist, and John Backus, the creator of FORTRAN, developed a meta-language they called BNF (Backus-Naur Form) for defining the grammar of ALGOL - 60. | | | This elegant recursive notation remains a standard tool for computer scientists. |
|
http://www.computerhistory.org/VirtualVisibleStorage/artifact_main.php?tax_id=02.05.03
(77 words)
|
|
| |
| | Crystal Clear Main Page |
| | Peter Naur, widely known as one of the authors of the programming language syntax notation "Backus-Naur Form" (BNF), wrote "Programming as Theory Building" in 1985. | | | Peter Naur's "Programming as Theory Building" neatly describes the mental activity of creating software and explains the "metaphor building" activity in Extreme Programming (XP). | | | He admonishes people to avoid getting infatuated with tools and schools, to use different tools and strokes for different moments, and to just "cut off the opponent's arm." His admonitions apply directly to software development—if you realize that the opponent is the problem, and not your office mate. |
|
http://alistair.cockburn.us/crystal/books/asd/extracts/asdapp2/asdapp2naurehnmusashi.htm
(14493 words)
|
|
| |
| | Notations for context-free grammars: BNF, Syntax Diagrams, EBNF |
| | History: the very first version was created by John Backus, and shortly after improved by Peter Naur, and it was this improved version that was publicly used for the first time, to define Algol 60. | | | [Naur P (ed.), 1963, Revised report on the algorithmic language Algol 60, Comm. | | | UP to more information about computer languages, parsing, grammars, and compilers |
|
http://www.cs.man.ac.uk/~pjj/bnf/bnf.html
(1329 words)
|
|
| |
| | NATO Software Engineering Conference 1968 |
| | This was based on a logical structuring of the topics covered, rather than closely patterned on the actual way in which the conference's various parallel and plenary sessions had happened to be timetabled. | | | The idea for the first NATO Software Engineering Conference, and in particular that of adopting the then practically unknown term "software engineering" as its (deliberately provocative) title, I believe came originally from Professor Fritz Bauer. | | | The reviewing and sorting of the passages from written contributions and the discussions was done by Larry Flanigan, Bernard Galler, David Gries, Ian Hugo, Peter Naur, Brian Randell and Gerd Sapper. |
|
http://homepages.cs.ncl.ac.uk/brian.randell/NATO/NATOReports
(3150 words)
|
|
| |
| | BNF - Backus-Naur Form |
| | BNF was created by John Backus and Peter Naur to define the Algol 60 programming language. | | | Compilers translate computer languages from symbols like words and math operators into machine language. | | | According to Headington and Riley (1994), BNF provides a class of language definitions called "generators" - in other words, using BNF, you can generate all possible syntactically valid strings of a language. |
|
http://www.sbuniv.edu/~tdeclue/cis1154/Examples/BNF.html
(736 words)
|
|
| |
| | Panini-Backus |
| | The formal structure of computer programming languages was introduced in the 1958-60 period by eminent scientists John Backus (1958), and Peter Naur (1963). | | | Here we examine one specific feature of his structure that has been used also in the representation of high-level languages. | | | They headed UNESCO conferences on International algorithmic language ALGOL 60, a language "suitable for expressing a large class of numerical processes in a form sufficiently concise for direct automatic translation into the language of programmable automatic computers." |
|
http://www.infinityfoundation.com/mandala/t_es/t_es_rao-t_syntax.htm
(1003 words)
|
|
| |
| | History of Parsing Methods |
| | John Backus, the principle designer of FORTRAN, and Peter Naur, a journalist for a computer magazine, both attend a conference on Algol in 1960 in Paris, France, I believe. | | | Together they worked on refining a notation for describing the grammars of languages. | | | An example of a BNF grammar that describes the rules for the +, -, *, and / operators might look something like: |
|
http://www.andrews.edu/~bidwell/536/history.html
(799 words)
|
|
| |
| | Fawcette.com - Understand Extended BNF |
| | The Naur in BNF is for Peter Naur, who made the notation popular after he used it to define the ALGOL 60 language. | | | One source says that BNF was developed by John Backus, father of functional programming and creator of FORTRAN, the world's first high-level computer programming language. | | | Naur then decided that there must be a uniform set of symbols that could be used to define the grammar of a language, and drew up on his own notation—BNF—for ALGOL 60. |
|
http://www.fawcette.com/javapro/2002_10/online/ebnf_bkurniawan_10_22_02
(479 words)
|
|
| |
| | About BNF notation |
| | John Backus and Peter Naur introduced for the first time a formal notation to describe the syntax of a given language (This was for the description of the ALGOL 60 programming language, see [Naur 60]). | | | NAUR, Peter (ed.), "Revised Report on the Algorithmic Language ALGOL 60.", Communications of the ACM, Vol. | | | He made a few modificiations that are almost universally used and drew up on his own the BNF for ALGOL 60 at the meeting where it was designed. |
|
http://cui.unige.ch/db-research/Enseignement/analyseinfo/AboutBNF.html
(647 words)
|
|
| |
| | peter jax - ResearchIndex document query |
| | TCP Vegas: Emulation and Experiment Jong Suk Ahn, Peter B. Danzig, Zhen Liu, and Limin Yan Computer | | | Peter Wisnovsky has worked in the database industry for | | | Boulder, CO 80309-0430 baveja@cs.colorado.edu Peter Dayan Brain and Cognitive Sciences E25-210, MIT |
|
http://citeseer.ist.psu.edu/cis?q=Peter+Jax
(474 words)
|
|
| |
| | ULAB machine names |
| | A year later Peter Naur improved upon the original language syntax, giving us Backus-Naur form (BNF), the description of syntax for most programming languages. | | | In 1959, John Backus invented FORTRAN, the first high-level computer programming language. | | | An English mathematician who first conceived the automatic digital computer, which he called the 'Analytical Engine'. |
|
http://cs.calvin.edu/ulab/names.html
(1498 words)
|
|
| |
| | Comp.compilers: Report on 1993 Perlis Symposium at Yale |
| | Naur disputed this view: he holds that the task of the programmer | | | The first goal, Naur argued, was never reached because it was based on an | | | The first speaker, Peter Naur, discussed the programming language |
|
http://compilers.iecc.com/comparch/article/93-05-105
(4119 words)
|
|
| |
| | Peter Naur: An Anatomy of human mental life |
| | – – Naur, P. 1993b: Review 9308-0558 of M. Wagman: Cognitive science and concepts of mind: toward a general theory of human and artifical intelligence, Computing Reviews 34, 8, p. | | | – – Naur, P. 1989a: Review 8903-0192 of Y. Shoham: Reasoning about change–time and causation from the standpoint of artificial intelligence, Computing Reviews 30, 1, p. | | | – – Naur, P. 1988b: Programming Languages are not Languages, in (Naur, 1992), pp. |
|
http://www.naur.com/Nauranat-ref.html
(2676 words)
|
|
| |
| | BNF and EBNF: What are they and how do they work? |
| | Backus-Naur notation (more commonly known as BNF or Backus-Naur Form) is a formal mathematical way to describe a language, which was developed by John Backus (and possibly Peter Naur as well) to describe the syntax of the Algol 60 programming language. | | | The article gets more and more detailed as you read on, so if you don't want to dig really deep into this, just stop reading when the questions you are interested in have been answered and things start getting boring. | | | (Legend has it that it was primarily developed by John Backus (based on earlier work by the mathemathician Emil Post), but adopted and slightly improved by Peter Naur for Algol 60, which made it well-known. |
|
http://cgi.ethz.ch/~jayetp/download/bnf.html
(3086 words)
|
|
| |
| | Charles Babbage Institute: RESEARCH PROGRAM> Current research |
| | By late summer of that year, an experimental ALGOL translator for the popular IBM 709/7090 computer had been described, and five other translators in process for other machines. | | | Indeed, many computer languages in use today may be described as ALGOL-like. | | | That meeting resulted in formal reporting on the International Algebraic Language (IAL) now referred to colloquially as “ALGOL 58.” |
|
http://special.lib.umn.edu/cbi/shp/entries/algol60.html
(1022 words)
|
|
| |
| | Peter Naur |
| | ‘… when I then encountered the scientist Peter Naur’s recent book Antifilosofisk Leksikon, which reveals the whole complex of philosophical problems as a bunch of delusions and occupational projects for incarnate creatures of habit, my self-esteem rose as sharply as the effective income of the middle class during the same period.’ |
|
http://www.naur.com/Antiphil.html
(386 words)
|
|
| |
| | CS 345 Lecture Notes Online |
| | Report on the Algorithmic Language Algol 60, by Peter Naur (learn more about Algol) | | | The Next 700 Programming Languages, by Peter Landin (defined ISWIM as the first pure functional programming language) | | | Recursive Functions of Symbolic Expressions and Their Computation by Machine, by John McCarthy (the original LISP paper) |
|
http://www.cs.utexas.edu/users/lavender/courses/cs345/lectures
(370 words)
|
|
| |
| | Peter Naur |
| | From the age of 12 I got deeply interested in astronomy and soon began to be active in computations of the orbits of comets and minor planets. | | | My later interests have been mainly in the area of programming methodology. | | | Peter Naur: Born in Frederiksberg near Copenhagen, 1928. |
|
http://tennessee.cc.vt.edu/~hopl/NaurBio.html
(395 words)
|
|
| |
| | Comp.compilers: Backus Normal Form vs. Backus Naur Form (long) |
| | The book "History of Programming Languages", edited by Richard L. Wexelblat, contains papers and transcripts of talks given by Alan J. Perlis and Peter Naur about the development of ALGOL {58-60} language. | | | "It is amusing to see how Peter Naur looks at the use of | | | [This is denied by Peter Z. Ingerman.] I don't |
|
http://compilers.iecc.com/comparch/article/93-07-017
(602 words)
|
|
| |
| | Clear Text |
| | Naur is the 'N' in BNF, our most common way to specify syntax of programming languages. | | | Few people already received the Turing award as recognition to programming languages - Wirth (Pascal), Dahl and Nygaard (OOP and Simula), Iverson (APL), Backus (Fortran and BNF). | | | ACM statement about this year (Peter Naur) is short and laconic: |
|
http://www.gutterman.net
(524 words)
|
|
| |
| | [No title] |
| | In 1960 Backus published a formal grammar for ALGOL using a notation that has come to be known as Backus-Naur Form or BNF. | | | BNF has been used to describe many programming languages since. | | | Peter Naur came up with the same thing independently. |
|
http://csis.pace.edu/~wolf/documents/BNF.DOC
(1431 words)
|
|
| |
| | Backus-Naur form - Free Encyclopedia |
| | It was originally named after John Backus and later (at the suggestion of Donald Knuth) also after Peter Naur, two pioneers in computer science, namely in the art of compiler design, as part of creating the rules for Algol 60. | | | A BNF specification is a set of derivation rules, written as |
|
http://www.wacklepedia.com/b/ba/backus_naur_form.html
(382 words)
|
|
| |
| | [No title] |
| | Yet this is the key thing." -- K. Kolence (in [Naur and Randell, 1969]) "A comparison with our hardware colleagues is relevant." -- Peter Naur (in [Naur and Randell, 1969]) "Reusable code is taken seriously in Japan and should be here too. | | | SOFTWARE REUSABILITY "Software components (routines), to be widely acceptable to different machines and users, should be available in families arranged according to precision, robustness, generality and time-space performance. | | | P. Naur and B. Randell, Editors, Software Engineering: Report on a Conference Sponsored by the NATO Science Committee, Garmisch, Germany, October 7-11, 1968. |
|
http://www.toa.com/pub/ooda_article.txt
(2468 words)
|
|
| |
| | ALGOL 60 Refereces |
| | Naur (ed.), Revised Report on the Algorithmic Language ALGOL 60, CACM, Vol. | | | Revised Report on the Algorithmic Language ALGOL 60 (pub. | | | ACM Committee meeting (Dec. '59 / Washington): discussion of ACM-comments and selection of representatives to attend the January 1960 international conference; |
|
http://www.masswerk.at/algol60
(553 words)
|
|
| |
| | Diary for brother |
| | And for those non-danish speaking members of the Advogato community: Datalogi is the term Peter Naur inventet for somthing best descibed as Computer Science and Information Systems. | | | Peter Naur was one of the Lead Developers on the Algol Reports. | | | But I wouldn't certify him as Master for that reason. |
|
http://www.advogato.org/person/brother/diary.html?start=3
(608 words)
|
|
| |
| | Syntactic Specification - Backus Naur Form |
| | There was a discussion on the proper title for this methodology of specification at the 1978 History of Programming Languages Conference, it originally having been given the title Backus Normal Form, after John Backus the developer of FORTRAN and then the developer of this system for the language ALGOL. | | | The first major use of the specification language was by Peter Naur, the secretary of the ALGOL committee and the author of the first ALGOL Report. | | | Naur slightly extended the notation and thereafter it got the name Backus-Naur Form. |
|
http://courses.cs.vt.edu/~cs1104/summ01/BNF/BNF.samples.html
(262 words)
|
|
| |
| | [No title] |
| | [3] P. Naur (Editor), Revised Report on the Algorithmic Language ALGOL 60, Regnecentralen, Copenhagen, 1962, and elsewhere. | | | In [6] and [8], the descriptional technique of [3] was used, whereas [9] featured a new technique for language design and definition. | | | Versions were used during courses on the language held at various centres, and the experience gained in explaining the language to skilled audiences and the reactions of the students influenced the succeeding versions. |
|
http://members.dokom.net/w.kloke/RR/rrAck.html
(729 words)
|
|
| |
| | COMP0168: Programming Languages IV |
| | The Jargon File (recently moved) - includes entries on most languages from a hacker's (as in coder, not cracker) point of view. | | | historical documents, including the original FORTAN manual by John Backus in 1956, the original Peter Naur edition of the Algol 60 report, documents defining Simula 67, Algol 68, Pascal and others. |
|
http://www.cs.bath.ac.uk/~jap/CM20168/links.html
(126 words)
|
|
| |
| | UB CSE305 Notes 3 |
| | Issue: How to describe a piece of source code, or other computer command or piece of language in general? | | | Developed by Backus as part of ALGOL 58 development, and modified by Naur as part of ALGOL 60 development. | | | Named for John Backus and Peter Naur, though sometimes referred to as "Backus Normal Form". |
|
http://www.cs.buffalo.edu/~shapiro/Courses/CSE305/2005/notes3.html
(902 words)
|
|
| |
| | Making it stick.: In Need of a Theory? |
| | The notion of establishing a "metaphor" in Extreme Programming is similar to programming as "building a theory" as proposed by Peter Naur. | | | Reading how "Microsoft officials have characterized SharePoint as 'the killer app for XML'", I am looking for a theory to emerge in the way that perhaps continuations are beginning to form a theory around web server programs and s-expressions form a theory around manipulating XML. | | | Making it stick.: In Need of a Theory? |
|
http://patricklogan.blogspot.com/2005/02/in-need-of-theory.html
(387 words)
|
|
| |
| | EBNF - Extended Backus Naur Form |
| | The original format was adapted from the area of linguistics during the formulation of the programming language Algol 60 in 1958. | | | To honour the leading figure in this effort, Peter Naur, the revised notation was renamed from Backus Normal form to Backus Naur Form. | | | How do we write our definitions of C and C++ elements |
|
http://www.cee.hw.ac.uk/~rjp/Coursewww/Cwww/EBNF.html
(832 words)
|
|
| |
| | Charles Babbage Institute: Software History Bibliography, N-S |
| | Patton, Peter C. “Computer Science Education in Europe.” Datamation 11 (October 1965): 77-80. | | | Redwood, Peter H.S. “APL for Business Applications.” Datamation 18 (May 1972): 82-4. | | | Salus, Peter H. A Quarter Century of Unix. |
|
http://special.lib.umn.edu/cbi/shp/shpns.html
(5625 words)
|
|
| |
| | Revised Report on the Algorithmic Language Algol 60 |
| | The report gives a complete defining description of the international algorithmic language Algol 60. | | | A ``hardware group'' was formed for working cooperatively right down to the level of the paper tape code. | | | This conference also led to the publication by Regnecentralen, Copenhagen, of an `Algol Bulletin', edited by Peter Naur, which served as a forum for further discussion. |
|
http://burks.brighton.ac.uk/burks/language/other/a60rr/report.htm
(9144 words)
|
|
| |
| | This is not an article |
| | Parberry, Ian (1990): A Guide for New Referees in Theoretical Computer Science. | | | I have found a couple of papers on the topic as well: a relatively short one by Naur (1992); one containing detailed examples of how to present results by Gopen and Swan (1990); Snyder's (1991) is directed at potential submitters to OOPSLA; Pugh (1991) and Wegman (1986) focus on how to write extended abstracts. | | | BBS (1982): Open Peer Commentary: Commentary on Peters and Ceci (1982): Journal review process. |
|
http://www.csrc.lse.ac.uk/staff/sorensen/downloads/not/notart.html
(7356 words)
|
|
| |
| | DIKU - Psychology Central |
| | DIKU was created in 1970, as an offshot of the Institute for Mathematical Sciences. | | | The first professor at DIKU was Peter Naur. | | | DIKU is currently located at Universitetsparken 1 in Copenhagen, but there are plans to move the institute to Ørestaden. |
|
http://psychcentral.com/psypsych/DIKU
(220 words)
|
|
| |
| | Entry Naur:1968:FGA from bit.bib |
| | Naur, Peter, 3(2)124, 3(3)145, 3(3)204, 4(2)115, 4(2)120, 4(3)177, 4(3)204-2, 5(3)151, 6(4)310, 7(2)123, 9(1)91, 9(3)250, 12(3)347, 20(4)414, 22(4)437, 26(2)175, 34(1)148 |
|
http://www.math.utah.edu:8080/ftp/pub/tex/bib/idx/bit/8/1/36-42.html
(37 words)
|
|
| |
| | Bison 1.875 |
| | Formal method of specifying context-free grammars originally proposed by John Backus, and slightly improved by Peter Naur in his 1960-01-02 committee document contributing to what became the Algol 60 report. | | | Grammars specified as rules that can be applied regardless of context. | | | You can help support this site by visiting the advertisers that sponsor it! |
|
http://www.delorie.com/gnu/docs/bison/bison_107.html
(760 words)
|
|
| |
| | Peter Makholm's homepage |
| | So it will probally will never be written. | | | Thanks to Peter Naur we have the danish term |
|
http://peter.makholm.net/english
(345 words)
|
|
| |
| | Index file section N for cacm1960 |
| | Naur, P., see Jensen, J. Naur, Peter, 3(5)299--314, 6(1)1--17, 6(3)77--79, 7(3)144--145, 7(3)148--148, 7(5)296--296--2, 8(11)671--676, 9(3)176--179, 9(7)485--485--1 | | | Naur, P., 3(5)318--318, 3(5)318--318--1, 4(10)441--445, 6(1)38--38--1, 6(1)38--39, 6(1)39--39, 6(1)39--39--1, 6(1)39--39--2, 6(1)39--40, 6(1)40--40, 6(8)445--445--1, 6(8)446--446--1, 6(8)447--448 |
|
http://www.math.utah.edu:8080/ftp/pub/tex/bib/idx/cacm1960/n.html
(369 words)
|
|
|
