Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle - Correct System Design: Recent Insights and Advances - page 26

Research Limited for supporting my visit to Cambridge, and to researchers at
Microsoft who have devoted their time to my further education, including Luca
Cardelli, Andy Gordon, Cedric Fournet, Nick Benton and Simon Peyton Jones.
The organisers of POPL 1999 in San Antonio invited me to present my thoughts
there, and the participants gave useful encouragement and feedback. Krzysztof
Apt and John Reynolds have suggested many improvements that have been
made since an earlier draft of the paper, and more that could have been.
References
S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF .To
appear in Information and Computation.
Baeten and Weijland. Process Algebra . CUP 1990, ISBN 0521 400430.
E.W. Dijkstra. A Discipline of Programming . Prentice Hall 1976, ISBN 013
215871X.
C.A.R. Hoare and He Jifeng. Unifying Theories of Programming . Prentice Hall
International 1998, ISBN 0-13-458761-8, available from amazon.co.uk.
J.M.E. Hyland and C.H.L. Ong. On Full Abstraction for PCF: I, II and III .To
appear in Informatics and Computation.
A.W. Roscoe. Theory and Practice of Concurrency . Prentice Hall 1998, ISBN
013 674409 5.