\begin{thebibliography}{99}

\bibitem{Dunne-CATS} Steve Dunne,
Abstract Commands: A Uniform Notation for Specifications and Implementations,
In Computing: The Australasian Theory Symposium (2001),
Electronic Notes in Theoretical Computer Science 42,
% \verb|http://www.elsevier.nl/|
% \verb|gej-ng/31/29/23/68/22/show/Products/notes/index.htt#008|
\url{http://www.elsevier.nl/gej-ng/31/29/23/68/22/show/Products/notes/index.htt#008}

\bibitem{Dunne-case} Steve Dunne,
A Case for General Correctness, submitted.

\bibitem{Gordon} Michael J. C. Gordon.
Mechanizing Programming Logics in Higher Order Logic.
In G. Birtwistle and P. A. Subrahmanyam (editors),
Current Trends in Hardware Verification and Automated Theorem Proving,
Springer-Verlag, 1989.

\bibitem{Harrison} John Harrison: Formalizing Dijkstra. 
In Jim Grundy, Malcolm C. Newey (Eds.): Theorem Proving in Higher Order Logics,
(TPHOLS'98), Lecture Notes in Computer Science, Vol. 1479, Springer, 1998,
171-188.

\bibitem{JG} Dean Jacobs and David Gries.
General Correctness: A Unification of Partial and Total Correctness.
Acta Informatica 22 (1985), 67-83.

\bibitem{lhj} Sheng Liang, Paul Hudak, and Mark P Jones.
Monad Transformers and Modular Interpreters.
In Symposium on Principles of Programming Languages (POPL'95), 1995, 333--343.

\bibitem{Nelson} Greg Nelson. A generalization of Dijkstra's calculus.
ACM Transactions on Programming Languages and Systems, 11 (1989), 517-61.
Or see DEC (now Compaq) SRC Research Report 16,
\url{http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-016.html}

\bibitem{Plotkin} Gordon D. Plotkin.  
A Power-domain construction.  SIAM J. Comput. 5 (1976), 452--487. 

\bibitem{Wadler-essence} Philip Wadler. The Essence of Functional Programming.
In Symposium on Principles of Programming Languages (POPL'92), 1992, 1--14.

\end{thebibliography}

