equal
deleted
inserted
replaced
137 \newblock {\em Theoretical Computer Science}, 87:209--220, 1991. |
137 \newblock {\em Theoretical Computer Science}, 87:209--220, 1991. |
138 |
138 |
139 \bibitem{nazareth-nipkow} |
139 \bibitem{nazareth-nipkow} |
140 Dieter Nazareth and Tobias Nipkow. |
140 Dieter Nazareth and Tobias Nipkow. |
141 \newblock Formal verification of algorithm {W}: The monomorphic case. |
141 \newblock Formal verification of algorithm {W}: The monomorphic case. |
142 \newblock In J.~von Wright, J.~Grundy, and J.~Harrison, editors, {\em Theorem |
142 \newblock In von Wright et~al. \cite{tphols96}, pages 331--345. |
143 Proving in Higher Order Logics: {TPHOLs} '96}, LNCS 1125, pages 331--345, |
|
144 1996. |
|
145 |
143 |
146 \bibitem{Nipkow-CR} |
144 \bibitem{Nipkow-CR} |
147 Tobias Nipkow. |
145 Tobias Nipkow. |
148 \newblock More {Church-Rosser} proofs (in {Isabelle/HOL}). |
146 \newblock More {Church-Rosser} proofs (in {Isabelle/HOL}). |
149 \newblock In Michael McRobbie and John~K. Slaney, editors, {\em Automated |
147 \newblock In Michael McRobbie and John~K. Slaney, editors, {\em Automated |
212 \newblock {\em Journal of Logic and Computation}, 7(2):175--204, March 1997. |
210 \newblock {\em Journal of Logic and Computation}, 7(2):175--204, March 1997. |
213 |
211 |
214 \bibitem{paulson-security} |
212 \bibitem{paulson-security} |
215 Lawrence~C. Paulson. |
213 Lawrence~C. Paulson. |
216 \newblock Proving properties of security protocols by induction. |
214 \newblock Proving properties of security protocols by induction. |
217 \newblock In {\em 10th Computer Security Foundations Workshop}. IEEE Computer |
215 \newblock In {\em 10th Computer Security Foundations Workshop}, pages 70--83. |
218 Society Press, 1997. |
216 IEEE Computer Society Press, 1997. |
219 \newblock In press. |
|
220 |
217 |
221 \bibitem{paulson-COLOG} |
218 \bibitem{paulson-COLOG} |
222 Lawrence~C. Paulson. |
219 Lawrence~C. Paulson. |
223 \newblock A formulation of the simple theory of types (for {Isabelle}). |
220 \newblock A formulation of the simple theory of types (for {Isabelle}). |
224 \newblock In P.~Martin-L\"of and G.~Mints, editors, {\em COLOG-88: |
221 \newblock In P.~Martin-L\"of and G.~Mints, editors, {\em COLOG-88: |
246 \bibitem{quaife92} |
243 \bibitem{quaife92} |
247 Art Quaife. |
244 Art Quaife. |
248 \newblock Automated deduction in {von Neumann-Bernays-G\"{o}del} set theory. |
245 \newblock Automated deduction in {von Neumann-Bernays-G\"{o}del} set theory. |
249 \newblock {\em Journal of Automated Reasoning}, 8(1):91--147, 1992. |
246 \newblock {\em Journal of Automated Reasoning}, 8(1):91--147, 1992. |
250 |
247 |
|
248 \bibitem{slind-tfl} |
|
249 Konrad Slind. |
|
250 \newblock Function definition in higher-order logic. |
|
251 \newblock In von Wright et~al. \cite{tphols96}. |
|
252 |
251 \bibitem{suppes72} |
253 \bibitem{suppes72} |
252 Patrick Suppes. |
254 Patrick Suppes. |
253 \newblock {\em Axiomatic Set Theory}. |
255 \newblock {\em Axiomatic Set Theory}. |
254 \newblock Dover, 1972. |
256 \newblock Dover, 1972. |
255 |
257 |
260 |
262 |
261 \bibitem{thompson91} |
263 \bibitem{thompson91} |
262 Simon Thompson. |
264 Simon Thompson. |
263 \newblock {\em Type Theory and Functional Programming}. |
265 \newblock {\em Type Theory and Functional Programming}. |
264 \newblock Addison-Wesley, 1991. |
266 \newblock Addison-Wesley, 1991. |
|
267 |
|
268 \bibitem{tphols96} |
|
269 J.~von Wright, J.~Grundy, and J.~Harrison, editors. |
|
270 \newblock {\em Theorem Proving in Higher Order Logics: {TPHOLs} '96}, LNCS |
|
271 1125, 1996. |
265 |
272 |
266 \bibitem{principia} |
273 \bibitem{principia} |
267 A.~N. Whitehead and B.~Russell. |
274 A.~N. Whitehead and B.~Russell. |
268 \newblock {\em Principia Mathematica}. |
275 \newblock {\em Principia Mathematica}. |
269 \newblock Cambridge University Press, 1962. |
276 \newblock Cambridge University Press, 1962. |