|
104
|
1 |
\begin{thebibliography}{1}
|
|
|
2 |
|
|
|
3 |
\bibitem{charniak80}
|
|
|
4 |
E.~Charniak, C.~K. Riesbeck, and D.~V. McDermott.
|
|
|
5 |
\newblock {\em Artificial Intelligence Programming}.
|
|
|
6 |
\newblock Lawrence Erlbaum Associates, 1980.
|
|
|
7 |
|
|
|
8 |
\bibitem{debruijn72}
|
|
|
9 |
N.~G. de~Bruijn.
|
|
|
10 |
\newblock Lambda calculus notation with nameless dummies, a tool for automatic
|
|
|
11 |
formula manipulation, with application to the {Church-Rosser Theorem}.
|
|
|
12 |
\newblock {\em Indagationes Mathematicae}, 34:381--392, 1972.
|
|
|
13 |
|
|
178
|
14 |
\bibitem{nipkow-prehofer}
|
|
|
15 |
Tobias Nipkow and Christian Prehofer.
|
|
|
16 |
\newblock Type checking type classes.
|
|
|
17 |
\newblock In {\em 20th ACM Symp.\ Principles of Programming Languages}, 1993.
|
|
|
18 |
\newblock To appear.
|
|
|
19 |
|
|
104
|
20 |
\bibitem{paulson91}
|
|
|
21 |
Lawrence~C. Paulson.
|
|
|
22 |
\newblock {\em {ML} for the Working Programmer}.
|
|
|
23 |
\newblock Cambridge University Press, 1991.
|
|
|
24 |
|
|
|
25 |
\bibitem{pelletier86}
|
|
|
26 |
F.~J. Pelletier.
|
|
|
27 |
\newblock Seventy-five problems for testing automatic theorem provers.
|
|
|
28 |
\newblock {\em Journal of Automated Reasoning}, 2:191--216, 1986.
|
|
|
29 |
\newblock Errata, JAR 4 (1988), 235--236.
|
|
|
30 |
|
|
|
31 |
\end{thebibliography}
|