EWD number 
Size (KB) 
Title 

800 
71 
A bagatelle for the left hand 

801 
101 
Distances from the root in skew trees (with C.S.Scholten) 

802 
270 
Trip report E.W.Dijkstra, Scotland, Newcastle 31 Aug.–15 Sep. 1981 

803 
980 
Lecture notes on the structure of programs and proofs 

804 
32 
On equality of propositions 

805 
86 
Trip report E.W.Dijkstra, Amsterdam, 26–29 Oct. 1981 

806 
245 
Trip report E.W.Dijkstra, USA, 1–27 Nov. 1981 

807 
141 
The Fast Fourier Transform and the Perfect Shuffle 

808 
233 
Canonical string reduction 

809 
261 
An introductory essay on three algorithms for sorting in situ (with A.J.M. van Gasteren) 

810 
139 
Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 

810a 
112 
Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 

811 
135 
An alternative ending for AvG16/ EWD809 

812 
141 
A personal summary of Jonkers’s program transformation 

813 
234 
About predicate transformers in general (with C.S.Scholten) 

814 
113 
A review of a book on PEARL 

815 
78 
Remarks on notation (with A.J.M. van Gasteren) 

816 
247 
Weakest preconditions, liberal and not (with C.S.Scholten) 

817 
373 
An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 

817a 
272 
An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 

818 
45 
A nice theorem on monotonic predicate sequences 

819 
195 
Mathematical induction and computing science 

820 
102 
On iteration and recursion 

821 
40 
From predicate transformers to predicates (Dedicated by the Tuesday Afternoon Club to C.A.R. Hoare at the occasion of his being elected Fellow of the Royal Society.) 

822 
213 
A summary of formulae (and of some theory) 

823 
142 
A sequel to EWD822 (with C.S.Scholten) 

824 
28 
Linearization of a twodimensional search 

825 
240 
About the correctness of a few SASL programs 

826 
318 
Trip report E.W.Dijkstra, USA, 20 May 1982 – 14 June 1982 

827 
27 
A very simple exercise in SASL 

828 
62 
Distributed termination detection revisited 

829 
241 
De software crisis, ontstaan en hardnekkigheid 

830 
302 
On different notions of termination (with C.S.Scholten) 

831 
93 
Why numbering should start at zero 

832 
27 
A theorem about infinite sequences of numbers 

833 
134 
An InDepth Seminar on Proven Tools & Techniques of Structured Methodology for Effective Software Configuration Management 

834 
71 
Elementary predicates and elimination (with A.J.M. van Gasteren) 

835 
1226 
Lecture notes “Predicate transformers” (Draft) 

836 
57 
A note on substitution and renaming 

837 
180 
Trip report E.W.Dijkstra, Newcastleupon Tyne, 6–10 Sep. 1982 

838 
101 
Trip report E.W.Dijkstra, Copenhagen, 10–16 Sep. 1982 

839 
74 
Trip report E.W.Dijkstra, Utrecht 30 Sep.–1 Oct. 1982 

840 
148 
Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and A.J.M. van Gasteren) 

841 
170 
“There is no ‘royal road’ to geometry” 

841a 
44 
[Reflections on “A note on two problems in connexion with graphs” 

842 
112 
Two cheers for equivalence 

843 
70 
A short sequel to EWD842 

844 
173 
A universal quantification revisited (with C.S.Scholten) 

845 
64 
McCarthy’s 91–function: an unfortunate paradigm 

846 
105 
The maximum length of a segment satisfying a monotonic predicate (with A.J.M. van Gasteren) 

847 
221 
Trip report E.W.Dijkstra, Australia, 19 Jan.1983 – 12 Feb.1983 

849 
476 
Junctivity of extreme solutions (with C.S.Scholten) 

849a 
381 
Junctivity of extreme solutions (with C.S.Scholten) 

850 
85 
Trip report E.W.Dijkstra, Helsinki, 1–4 March 1983 

851 
125 
Reducing control traffic in a distributed implementation of mutual exclusion 

851a 
251 
Reducing control traffic in a distributed implementation of mutual exclusion 

851b 
300 
Reducing control traffic in a distributed implementation of mutual exclusion 

852 
298 
Judging “HOS” from a distance 

852a 
154 
Judging “HOS” from a distance 

853 
109 
A correction of EWD851b 

853a 
50 
Ingenieur Ebergen, Weledelgetrenge Heer 

854 
386 
The fruits of misunderstanding 

855 
154 
Trip report E.W.Dijkstra, Barcelona 5–7 June 1983 

856 
41 
On maximizing a product 

857 
43 
Generalizing an old formula 

858 
247 
Trip report E.W.Dijkstra, USA, 10 June–3 July 1983 

859 
387 
Semantics of recursive procedures (with C.S.Scholten) 

860 
364 
A sequel to EWD859 (with C.S.Scholten) 

861 
288 
Research proposal: Our plans for the years to come (with A.J.M. van Gasteren) 

861 
288 
x[n] = x[n–1] + x[n+1] has period 9 

862 
29 
A sequence with x[n] = x[n–1] + x[n+1] has period 9 

863 
595 
Predicate calculus revisited 

864 
383 
The distributed snapshot of Chandy/Lamport/Misra 

864a 
135 
The Distributed Snapshot of K.M.Chandy and L. Lamport 

865 
261 
Trip report E.W.Dijkstra, Brasil & USA, 17 Oct.– 6 Nov. 1983 

866 
70 
An analytical proof of the Butterfly Theorem 

867 
176 
On IPW’s 

868 
225 
Computers and General Education: a position paper 

869 
146 
Ter afsluiting van de “Inleiding tot de Kunst van het Programmeren” 

870 
43 
My mother’s proof of the Butterfly Theorem (see EWD866) 

871m 
541 
Invariance and nondeterminacy 

871t 
357 
Invariance and nondeterminacy 

872 
52 
The little essay I could not write 

873 
192 
Trip report E.W.Dijkstra, London and Colchester, 16–20 Jan. 1984 

874 
158 
A miscellany of results (with C.S.Scholten) 

875 
114 
Monotonicity and quantification 

876 
75 
De microprocessor als lollie 

877 
24 
Some useful formulae (with A.J.M. van Gasteren) 

878 
61 
A monotonicity argument (with A.J.M. van Gasteren) 

879 
271 
Trip report E.W.Dijkstra, London, 14–17 February 1984 

880 
73 
Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 

880a 
94 
Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 

880b 
78 
The termination theorem for unconstrained nondeterminacy (with A.J.M. van Gasteren) 

881 
115 
A review of “The Evolution of Programs” 

882 
552 
The regularity calculus: a first trial (AvG36) 

883 
265 
The operational interpretation of extreme solutions (with C.S. Scholten) 

884 
64 
A sequel to EWD874 (with C.S. Scholten) 

885 
93 
Trip report E.W.Dijkstra, Muenchen, 12–14 April 1984 

886 
315 
A simple fixpoint argument without the restriction to continuity (with A.J.M. van Gasteren) 

886a 
290 
A simple fixpoint argument without the restriction to continuity (with A.J.M. van Gasteren) 

887 
271 
Trip report E.W.Dijkstra, USA, 23 April –10 May 1984 

888 
163 
Trip report E.W.Dijkstra, Zürich, 22–24 May 1984 

889 
86 
Userfriendly Mathematics 

891 
62 
Wellfounded sets revisited 

892 
85 
Trip report E.W.Dijkstra, London, 12–14 June 1984 

893 
124 
Trip report E.W.Dijkstra, USA, 17–26 June 1984 

894 
49 
On partitioning predicates 

895 
253 
Trip report E.W.Dijkstra, Marktoberdorf, 30 July – 12 Aug. 1984 

896 
176 
On the nature of computing science 

897 
110 
A formal program derivation for the record 

898 
551 
The threats to computing science 

899 
138 
A review of a paper in AI 
