\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR }
% \MRhref is called by the amsart/book/proc definition of \MR.
\providecommand{\MRhref}[2]{%
  \href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2}
}
\providecommand{\href}[2]{#2}
\begin{thebibliography}{10}

\bibitem{bentley:pearls}
Jon Bentley, \emph{Programming pearls}, second ed., Addison-Wesley, 2000.

\bibitem{curry:foundations}
Haskell~B. Curry, \emph{Foundations of mathematical logic}, Dover Publications,
  Inc., 1977.

\bibitem{dijkstra:fillers}
Edsger~W. Dijkstra, \emph{Fillers at the {Y}o{P} intitute}, in \emph{Formal
  Development of Programs and Proofs} \cite{dijkstra:fdpp}.

\bibitem{dijkstra:fdpp}
Edsger~W. Dijkstra (ed.), \emph{Formal development of programs and proofs},
  Addison-Wesley, 1990.

\bibitem{dijkstra:discipline}
E.W. Dijkstra, \emph{A discipline of programming}, Prentice Hall, Englewood
  Cliffs, 1976.

\bibitem{gries:science-prog}
David Gries, \emph{The science of programming}, Springer-Verlag, New York,
  1981.

\bibitem{gries:sp}
\bysame, \emph{The science of programming}, Springer-Verlag, 1985.

\bibitem{gs:discretemaths}
David Gries and Fred B.Schneider, \emph{A logical approach to discrete
  mathematics}, Springer-Verlag, 1993.

\bibitem{dek:taocp:iii}
Donald~E. Knuth, \emph{The art of computer programmimg, volume 3: Sorting and
  searching}, Addison-Wesley, 1998.

\bibitem{morris:data-refinment}
Joseph~M. Morris, \emph{Piecewise data refinment}, in Dijkstra
  \cite{dijkstra:fdpp}.

\end{thebibliography}
