[permalink] [id link]
Dijkstra was known to be a fan of ALGOL 60, and worked on the team that implemented the first compiler for that language.
from
Wikipedia
Some Related Sentences
Dijkstra and was
Born in Rotterdam, Dijkstra studied theoretical physics at Leiden University, but quickly realized he was more interested in computer science.
Dijkstra and Jaap Zonneveld, who collaborated on the compiler, agreed not to shave until the project was completed.
Dijkstra objected noting that the resulting proofs are long and cumbersome, and that the proof gives no insight on how the program was developed.
The following year, the ACM ( Association for Computing Machinery ) PODC Influential Paper Award in distributed computing was renamed the Dijkstra Prize in his honour.
The reverse Polish scheme was proposed in 1954 by Burks, Warren, and Wright and was independently reinvented by F. L. Bauer and E. W. Dijkstra in the early 1960s to reduce computer memory access and utilize the stack to evaluate expressions.
It emerged in the 1960s, particularly from work by Böhm and Jacopini, and a famous letter, Go To Statement Considered Harmful, from Edsger Dijkstra in 1968 — and was bolstered theoretically by the structured program theorem, and practically by the emergence of languages such as ALGOL with suitably rich control structures.
The project was a great engineering success, and managers at other companies cited it in support of adopting structured programming, although Dijkstra criticized the ways that Mills's interpretation differed from the published work.
The problem of mutual exclusion was first identified and solved by Edsger W. Dijkstra in his seminal 1965 paper titled: Solution of a problem in concurrent programming control.
The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959.
A prominent computing scientist, E. W. Dijkstra, wrote in a paper that the coining of the term software engineer was not useful since it was an inappropriate analogy, " The existence of the mere term has been the base of a number of extremely shallow — and false — analogies, which just confuse the issue ... Computers are such exceptional gadgets that there is good reason to assume that most analogies with other disciplines are too shallow to be of any positive value, are even so shallow that they are only confusing.
The semaphore concept was invented by Dutch computer scientist Edsger Dijkstra, and the concept has found widespread use in a variety of operating systems.
The term separation of concerns was probably coined by Edsger W. Dijkstra in his 1974 paper " On the role of scientific thought ".
It was first discovered in 1930 by Vojtěch Jarník and independently rediscovered again by Edsger Dijkstra in 1959.
It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, in terms of computers competing for access to tape drive peripherals.
The first count of Holland, Dirk I, was the son or foster-son of Gerolf, Count in Frisia ( Dijkstra suggests that Dirk may have been the son of a sister of Gerolf and that his own father died while he was still an infant ).
The Burroughs ALGOL compiler was very fast — this impressed the Dutch scientist Edsger Dijkstra when he submitted a program to be compiled at the B5000 Pasadena plant.
Dijkstra and be
Certainly major contributors to computer science such as Edsger Dijkstra and Donald Knuth, as well as the inventors of popular software such as Linus Torvalds ( Linux ), and Dennis Ritchie and Ken Thompson ( the C programming language ) are likely to be included in any such list ; see also List of programmers.
Edsger Dijkstra, in a famous 1968 letter published in the Communications of the ACM, argued that GOTO statements should be eliminated from all " higher level " programming languages.
“ On the Cruelty of Really Teaching Computing Science ” is a 1988 paper by E. W. Dijkstra which argues that computer programming should be understood as a branch of mathematics, and that the formal provability of a program is a major criterion for correctness.
The notion that cost of production of hardware should be a constraint in programming was foreign to Dijkstra.
Dijkstra and ALGOL
* Edsger W. Dijkstra and Jaap Zonneveld agreed to not shave until they completed the Electrologica ALGOL 60 compiler.
The X1 was the subject of Edsger Dijkstra's Ph. D. dissertation, and the target of the first complete working ALGOL 60 compiler, completed by Dijkstra and Jaap Zonneveld.
Dijkstra and 60
* E. W, Dijkstra, Algol 60 translation: an algol 60 translator for the x1 and making a translator for algol 60, report MR 35 / 61.
Dijkstra and on
Link State routing protocols build a topographical map of the entire network based on updates from neighbor routers, and then use the Dijkstra algorithm to compute the shortest path to each destination.
Another consequence of JSP's focus on data streams is that it creates program designs with a very different structure to the kind created by the stepwise refinement methods of Wirth and Dijkstra.
Despite the title, most of the article is on Dijkstra ’ s attempt to put computer science into a wider perspective within science, teaching being addressed as a corollary at the end.
Until the end of his life, Dijkstra maintained that the central challenges of computing hadn ’ t been met to his satisfaction, due to an insufficient emphasis on program correctness ( though not obviating other requirements, such as maintainability and efficiency ).
Dijkstra and team
The THE multiprogramming system was a computer operating system designed by a team led by Edsger W. Dijkstra, described in monographs in 1965-66 and published in 1968.
Dijkstra and implemented
Dijkstra and first
0.296 seconds.