[permalink] [id link]
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.
from
Wikipedia
Some Related Sentences
Edsger and Dijkstra
Edsger Wybe Dijkstra (; May 11, 1930 – August 6, 2002 ) was a Dutch computer scientist.
ast: Edsger Dijkstra
bs: Edsger Dijkstra
ca: Edsger Dijkstra
cs: Edsger Dijkstra
da: Edsger Dijkstra
de: Edsger Wybe Dijkstra
et: Edsger Wybe Dijkstra
es: Edsger Dijkstra
eo: Edsger Dijkstra
eu: Edsger Dijkstra
fr: Edsger Dijkstra
ga: Edsger Dijkstra
gl: Edsger Dijkstra
hr: Edsger Dijkstra
id: Edsger Dijkstra
it: Edsger Dijkstra
la: Edsger Dijkstra
lb: Edsger W. Dijkstra
hu: Edsger Wybe Dijkstra
nl: Edsger Dijkstra
no: Edsger Dijkstra
pl: Edsger Dijkstra
pt: Edsger Dijkstra
ro: Edsger Dijkstra
Edsger and famous
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.
* Dutch national flag problem, a famous computer science related programming problem proposed by Edsger Dijkstra
* Edsger W. Dijkstra's famous letter inveighing against the use of GOTO.
Edsger Dijkstra's famous letter, " Go To Statement Considered Harmful ," followed in 1968.
Edsger and 1968
Software architecture as a concept has its origins in the research of Edsger Dijkstra in 1968 and David Parnas in the early 1970s.
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.
Edsger and letter
It was popularized by Edsger Dijkstra's letter Go To Statement Considered Harmful,
It was elaborated upon in a Datamation article by R. Lawrence Clark in 1973, written in response to Edsger Dijkstra's letter Go To Statement Considered Harmful.
Edsger and published
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree.
Edsger and ACM
An early use of the term is in Edsger Dijkstra's 1972 ACM Turing Award Lecture:
Edsger 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.
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.
Edsger and programming
Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming.
Edsger W. Dijkstra took the position that the use of a formal language is essential to prevent the introduction of meaningless constructs, and dismissed natural language programming as " foolish ".
When introducing the hardware description language KARL in the mid ' 1970s, Reiner Hartenstein coined the term " structured VLSI design " ( originally as " structured LSI design "), echoing Edsger Dijkstra's structured programming approach by procedure nesting to avoid chaotic spaghetti-structured programs.
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.
* Edsger W. Dijkstra, developed the framework for structured programming.
The book pays explicit homage, in title and tone, to The Elements of Style, by Strunk & White and is considered a practical template promoting Edsger Dijkstra's structured programming discussions.
* Edsger Dijkstra or his manuscripts on computer programming.
* Structured programming in circa 1967 with Edsger W. Dijkstra.
0.197 seconds.