diaries

Dijkstra and Van Wijngaarden

Here's a comment from another reviewer for my paper on `Dijkstra's Rallying Cry...':

ALGOL 60 Programming School

Dated: 
5 and 6 April, 1961
ALGOL 60 Programming School at Brighton Technical College, April 1961

The Dijkstra family collected many things, including an advertisement in NATURE on 4 February 1961, which mentioned the ALGOL 60 Programming School to be held at Brighton Technical College on 5 and 6 April 1961.

Tags: 

University of Kent

Dated: 
23 April 1981

At the Computing Laboratory of the University of Kent, Dijkstra lectured on semantics preserving program transformations (cf. EWD776).

Tags: 

The peer group

Dated: 
15 March 1981

Though Dijkstra's own research publications were cited a lot, he himself did not want to judge the quality of one's work in terms of number of citations, nor in terms of number of papers.

Tags: 

Trip to Warwick, IFIP WG 2.3

Dated: 
16 March - 15 April, 1971

Dijkstra wrote a report in Dutch about his trip to Warwick (England), which took place right before Easter, 1971. The purpose of his trip was to attend an IFIP Working Group 2.3 meeting at Warwick University. Some points in Dijkstra's trip report are of general interest:

Tags: 

Letter from Wirth to Dijkstra

Dated: 
19 March 1971

Wirth and Dijkstra were close colleagues, thoroughly studying each other's writings in 1971. But how close, exactly, were they? How did Wirth's views differ from those of Dijkstra? In my first attempt to address these matters, I shall discuss a letter Wirth sent to Dijkstra in March 1971.

Tags: 

Dijkstra the Linguist?

Is it correct to say that Dijkstra reasoned linguistically during the late 1950s and early 1960s? A reviewer of the research paper `Dijkstra's Rallying Cry ...' expressed his reservations about this matter.

In the reviewer's own words:

Automatic theorem proving

Dated: 
28 February 1981

In a letter to Nils J. Nilsson, Dijkstra expressed his misgivings about research in artificial intelligence (AI). Only automatic theorem proving deserved his appraisal. (EWD778)

Tags: 

From Black Box to Grey Box?

In the previous post, "The reliability problem in a nutshell", the pessimistic assumption was made that each program component could interact with any other component. This resulted in the exponential factor pN, with N equal to the number of components and p equal to the probability that a component is bug free.

Tags: 

Massaging the program

Dated: 
8 February 1981

Given a specific function, called lambo, how do you prove that it is equal to its own inverse? Dijkstra's answer: by massaging a program that computes lambo. That is, by gradually transforming an original program that computes lambo into a symmetric program that is rather useless to the programmer but useful to the mathematician!

Tags: 

Pages

 
© 2011–today by the respective authors. All rights reserved.