104
|
1 |
\begin{thebibliography}{10}
|
|
2 |
|
598
|
3 |
\bibitem{abrial93}
|
|
4 |
J.~R. Abrial and G.~Laffitte.
|
|
5 |
\newblock Towards the mechanization of the proofs of some classical theorems of
|
|
6 |
set theory.
|
|
7 |
\newblock preprint, February 1993.
|
|
8 |
|
104
|
9 |
\bibitem{andrews86}
|
|
10 |
Peter~B. Andrews.
|
|
11 |
\newblock {\em An Introduction to Mathematical Logic and Type Theory: To Truth
|
|
12 |
Through Proof}.
|
|
13 |
\newblock Academic Press, 1986.
|
|
14 |
|
114
|
15 |
\bibitem{basin91}
|
|
16 |
David Basin and Matt Kaufmann.
|
|
17 |
\newblock The {Boyer-Moore} prover and {Nuprl}: An experimental comparison.
|
|
18 |
\newblock In {G\'erard} Huet and Gordon Plotkin, editors, {\em Logical
|
598
|
19 |
Frameworks}, pages 89--119. Cambridge University Press, 1991.
|
114
|
20 |
|
104
|
21 |
\bibitem{boyer86}
|
|
22 |
Robert Boyer, Ewing Lusk, William McCune, Ross Overbeek, Mark Stickel, and
|
|
23 |
Lawrence Wos.
|
|
24 |
\newblock Set theory in first-order logic: Clauses for {G\"odel's} axioms.
|
598
|
25 |
\newblock {\em Journal of Automated Reasoning}, 2(3):287--327, 1986.
|
114
|
26 |
|
|
27 |
\bibitem{camilleri92}
|
|
28 |
J.~Camilleri and T.~F. Melham.
|
|
29 |
\newblock Reasoning with inductively defined relations in the {HOL} theorem
|
|
30 |
prover.
|
598
|
31 |
\newblock Technical Report 265, Computer Laboratory, University of Cambridge,
|
|
32 |
August 1992.
|
104
|
33 |
|
|
34 |
\bibitem{church40}
|
|
35 |
Alonzo Church.
|
|
36 |
\newblock A formulation of the simple theory of types.
|
598
|
37 |
\newblock {\em Journal of Symbolic Logic}, 5:56--68, 1940.
|
359
|
38 |
|
|
39 |
\bibitem{coen92}
|
|
40 |
Martin~D. Coen.
|
|
41 |
\newblock {\em Interactive Program Derivation}.
|
|
42 |
\newblock PhD thesis, University of Cambridge, 1992.
|
|
43 |
\newblock Computer Laboratory Technical Report 272.
|
|
44 |
|
|
45 |
\bibitem{constable86}
|
630
|
46 |
R.~L. Constable et~al.
|
359
|
47 |
\newblock {\em Implementing Mathematics with the Nuprl Proof Development
|
|
48 |
System}.
|
598
|
49 |
\newblock Prentice-Hall, 1986.
|
359
|
50 |
|
|
51 |
\bibitem{davey&priestley}
|
|
52 |
B.~A. Davey and H.~A. Priestley.
|
|
53 |
\newblock {\em Introduction to Lattices and Order}.
|
598
|
54 |
\newblock Cambridge University Press, 1990.
|
359
|
55 |
|
|
56 |
\bibitem{devlin79}
|
|
57 |
Keith~J. Devlin.
|
|
58 |
\newblock {\em Fundamentals of Contemporary Set Theory}.
|
|
59 |
\newblock Springer, 1979.
|
104
|
60 |
|
|
61 |
\bibitem{dummett}
|
|
62 |
Michael Dummett.
|
|
63 |
\newblock {\em Elements of Intuitionism}.
|
114
|
64 |
\newblock Oxford University Press, 1977.
|
104
|
65 |
|
|
66 |
\bibitem{dyckhoff}
|
|
67 |
Roy Dyckhoff.
|
|
68 |
\newblock Contraction-free sequent calculi for intuitionistic logic.
|
598
|
69 |
\newblock {\em Journal of Symbolic Logic}, 57(3):795--807, 1992.
|
104
|
70 |
|
|
71 |
\bibitem{felty91a}
|
|
72 |
Amy Felty.
|
|
73 |
\newblock A logic program for transforming sequent proofs to natural deduction
|
|
74 |
proofs.
|
|
75 |
\newblock In Peter Schroeder-Heister, editor, {\em Extensions of Logic
|
|
76 |
Programming}, pages 157--178. Springer, 1991.
|
|
77 |
\newblock LNAI 475.
|
|
78 |
|
114
|
79 |
\bibitem{frost93}
|
|
80 |
Jacob Frost.
|
|
81 |
\newblock A case study of co-induction in {Isabelle HOL}.
|
598
|
82 |
\newblock Technical Report 308, Computer Laboratory, University of Cambridge,
|
|
83 |
August 1993.
|
104
|
84 |
|
|
85 |
\bibitem{gallier86}
|
|
86 |
J.~H. Gallier.
|
|
87 |
\newblock {\em Logic for Computer Science: Foundations of Automatic Theorem
|
|
88 |
Proving}.
|
|
89 |
\newblock Harper \& Row, 1986.
|
|
90 |
|
359
|
91 |
\bibitem{mgordon-hol}
|
|
92 |
M.~J.~C. Gordon and T.~F. Melham.
|
|
93 |
\newblock {\em Introduction to {HOL}: A Theorem Proving Environment for Higher
|
|
94 |
Order Logic}.
|
598
|
95 |
\newblock Cambridge University Press, 1993.
|
104
|
96 |
|
|
97 |
\bibitem{halmos60}
|
|
98 |
Paul~R. Halmos.
|
|
99 |
\newblock {\em Naive Set Theory}.
|
|
100 |
\newblock Van Nostrand, 1960.
|
|
101 |
|
|
102 |
\bibitem{huet78}
|
|
103 |
G.~P. Huet and B.~Lang.
|
|
104 |
\newblock Proving and applying program transformations expressed with
|
|
105 |
second-order patterns.
|
|
106 |
\newblock {\em Acta Informatica}, 11:31--55, 1978.
|
|
107 |
|
598
|
108 |
\bibitem{kunen80}
|
|
109 |
Kenneth Kunen.
|
|
110 |
\newblock {\em Set Theory: An Introduction to Independence Proofs}.
|
|
111 |
\newblock North-Holland, 1980.
|
|
112 |
|
359
|
113 |
\bibitem{alf}
|
|
114 |
Lena Magnusson and Bengt {Nordstr\"om}.
|
|
115 |
\newblock The {ALF} proof editor and its proof engine.
|
598
|
116 |
\newblock In {\em Types for Proofs and Programs: International Workshop {TYPES
|
|
117 |
'93}}, pages 213--237. Springer, published 1994.
|
359
|
118 |
\newblock LNCS 806.
|
|
119 |
|
114
|
120 |
\bibitem{mw81}
|
|
121 |
Zohar Manna and Richard Waldinger.
|
|
122 |
\newblock Deductive synthesis of the unification algorithm.
|
|
123 |
\newblock {\em Science of Computer Programming}, 1(1):5--48, 1981.
|
|
124 |
|
104
|
125 |
\bibitem{martinlof84}
|
|
126 |
Per Martin-L\"of.
|
|
127 |
\newblock {\em Intuitionistic type theory}.
|
|
128 |
\newblock Bibliopolis, 1984.
|
|
129 |
|
359
|
130 |
\bibitem{melham89}
|
|
131 |
Thomas~F. Melham.
|
|
132 |
\newblock Automating recursive type definitions in higher order logic.
|
|
133 |
\newblock In Graham Birtwistle and P.~A. Subrahmanyam, editors, {\em Current
|
|
134 |
Trends in Hardware Verification and Automated Theorem Proving}, pages
|
|
135 |
341--386. Springer, 1989.
|
|
136 |
|
114
|
137 |
\bibitem{milner-coind}
|
|
138 |
Robin Milner and Mads Tofte.
|
|
139 |
\newblock Co-induction in relational semantics.
|
|
140 |
\newblock {\em Theoretical Computer Science}, 87:209--220, 1991.
|
104
|
141 |
|
|
142 |
\bibitem{noel}
|
|
143 |
Philippe {No\"el}.
|
|
144 |
\newblock Experimenting with {Isabelle} in {ZF} set theory.
|
598
|
145 |
\newblock {\em Journal of Automated Reasoning}, 10(1):15--58, 1993.
|
104
|
146 |
|
|
147 |
\bibitem{nordstrom90}
|
|
148 |
Bengt {Nordstr\"om}, Kent Petersson, and Jan Smith.
|
|
149 |
\newblock {\em Programming in {Martin-L\"of}'s Type Theory. An Introduction}.
|
114
|
150 |
\newblock Oxford University Press, 1990.
|
|
151 |
|
|
152 |
\bibitem{paulin92}
|
|
153 |
Christine Paulin-Mohring.
|
|
154 |
\newblock Inductive definitions in the system {Coq}: Rules and properties.
|
|
155 |
\newblock Research Report 92-49, LIP, Ecole Normale Sup\'erieure de Lyon,
|
|
156 |
December 1992.
|
|
157 |
|
|
158 |
\bibitem{paulson85}
|
|
159 |
Lawrence~C. Paulson.
|
|
160 |
\newblock Verifying the unification algorithm in {LCF}.
|
|
161 |
\newblock {\em Science of Computer Programming}, 5:143--170, 1985.
|
104
|
162 |
|
|
163 |
\bibitem{paulson87}
|
|
164 |
Lawrence~C. Paulson.
|
|
165 |
\newblock {\em Logic and Computation: Interactive proof with Cambridge LCF}.
|
598
|
166 |
\newblock Cambridge University Press, 1987.
|
104
|
167 |
|
|
168 |
\bibitem{paulson-COLOG}
|
|
169 |
Lawrence~C. Paulson.
|
|
170 |
\newblock A formulation of the simple theory of types (for {Isabelle}).
|
|
171 |
\newblock In P.~Martin-L\"of and G.~Mints, editors, {\em COLOG-88:
|
|
172 |
International Conference on Computer Logic}, Tallinn, 1990. Estonian Academy
|
|
173 |
of Sciences, Springer.
|
|
174 |
\newblock LNCS 417.
|
|
175 |
|
114
|
176 |
\bibitem{paulson-coind}
|
|
177 |
Lawrence~C. Paulson.
|
|
178 |
\newblock Co-induction and co-recursion in higher-order logic.
|
598
|
179 |
\newblock Technical Report 304, Computer Laboratory, University of Cambridge,
|
|
180 |
July 1993.
|
359
|
181 |
|
|
182 |
\bibitem{paulson-set-I}
|
|
183 |
Lawrence~C. Paulson.
|
|
184 |
\newblock Set theory for verification: {I}. {From} foundations to functions.
|
598
|
185 |
\newblock {\em Journal of Automated Reasoning}, 11(3):353--389, 1993.
|
114
|
186 |
|
|
187 |
\bibitem{paulson-set-II}
|
|
188 |
Lawrence~C. Paulson.
|
|
189 |
\newblock Set theory for verification: {II}. {Induction} and recursion.
|
598
|
190 |
\newblock Technical Report 312, Computer Laboratory, University of Cambridge,
|
|
191 |
1993.
|
630
|
192 |
\newblock To appear in Journal of Automated Reasoning.
|
359
|
193 |
|
|
194 |
\bibitem{paulson-final}
|
|
195 |
Lawrence~C. Paulson.
|
|
196 |
\newblock A concrete final coalgebra theorem for {ZF} set theory.
|
598
|
197 |
\newblock Technical Report 334, Computer Laboratory, University of Cambridge,
|
|
198 |
1994.
|
|
199 |
|
|
200 |
\bibitem{paulson-CADE}
|
|
201 |
Lawrence~C. Paulson.
|
|
202 |
\newblock A fixedpoint approach to implementing (co)inductive definitions.
|
|
203 |
\newblock In Alan Bundy, editor, {\em 12th International Conference on
|
|
204 |
Automated Deduction}, pages 148--161. Springer, 1994.
|
|
205 |
\newblock LNAI 814.
|
114
|
206 |
|
104
|
207 |
\bibitem{pelletier86}
|
|
208 |
F.~J. Pelletier.
|
|
209 |
\newblock Seventy-five problems for testing automatic theorem provers.
|
598
|
210 |
\newblock {\em Journal of Automated Reasoning}, 2:191--216, 1986.
|
104
|
211 |
\newblock Errata, JAR 4 (1988), 235--236.
|
|
212 |
|
|
213 |
\bibitem{plaisted90}
|
|
214 |
David~A. Plaisted.
|
|
215 |
\newblock A sequent-style model elimination strategy and a positive refinement.
|
598
|
216 |
\newblock {\em Journal of Automated Reasoning}, 6(4):389--402, 1990.
|
104
|
217 |
|
|
218 |
\bibitem{quaife92}
|
|
219 |
Art Quaife.
|
|
220 |
\newblock Automated deduction in {von Neumann-Bernays-G\"odel} set theory.
|
598
|
221 |
\newblock {\em Journal of Automated Reasoning}, 8(1):91--147, 1992.
|
104
|
222 |
|
|
223 |
\bibitem{suppes72}
|
|
224 |
Patrick Suppes.
|
|
225 |
\newblock {\em Axiomatic Set Theory}.
|
|
226 |
\newblock Dover, 1972.
|
|
227 |
|
|
228 |
\bibitem{takeuti87}
|
|
229 |
G.~Takeuti.
|
|
230 |
\newblock {\em Proof Theory}.
|
|
231 |
\newblock North Holland, 2nd edition, 1987.
|
|
232 |
|
|
233 |
\bibitem{thompson91}
|
|
234 |
Simon Thompson.
|
|
235 |
\newblock {\em Type Theory and Functional Programming}.
|
|
236 |
\newblock Addison-Wesley, 1991.
|
|
237 |
|
|
238 |
\bibitem{principia}
|
|
239 |
A.~N. Whitehead and B.~Russell.
|
|
240 |
\newblock {\em Principia Mathematica}.
|
598
|
241 |
\newblock Cambridge University Press, 1962.
|
104
|
242 |
\newblock Paperback edition to *56, abridged from the 2nd edition (1927).
|
|
243 |
|
598
|
244 |
\bibitem{winskel93}
|
|
245 |
Glynn Winskel.
|
|
246 |
\newblock {\em The Formal Semantics of Programming Languages}.
|
|
247 |
\newblock MIT Press, 1993.
|
|
248 |
|
104
|
249 |
\end{thebibliography}
|