6592
|
1 |
% BibTeX database for the Isabelle documentation
|
|
2 |
%
|
|
3 |
% Lawrence C Paulson $Id$
|
|
4 |
|
|
5 |
%publishers
|
|
6 |
@string{AP="Academic Press"}
|
|
7 |
@string{CUP="Cambridge University Press"}
|
|
8 |
@string{IEEE="{\sc ieee} Computer Society Press"}
|
|
9 |
@string{LNCS="Lect.\ Notes in Comp.\ Sci."}
|
|
10 |
@string{MIT="MIT Press"}
|
|
11 |
@string{NH="North-Holland"}
|
|
12 |
@string{Prentice="Prentice-Hall"}
|
6607
|
13 |
@string{PH="Prentice-Hall"}
|
6592
|
14 |
@string{Springer="Springer-Verlag"}
|
|
15 |
|
|
16 |
%institutions
|
|
17 |
@string{CUCL="Computer Laboratory, University of Cambridge"}
|
|
18 |
|
|
19 |
%journals
|
|
20 |
@string{FAC="Formal Aspects Comput."}
|
|
21 |
@string{JAR="J. Auto. Reas."}
|
|
22 |
@string{JCS="J. Comput. Secur."}
|
|
23 |
@string{JFP="J. Func. Prog."}
|
|
24 |
@string{JLC="J. Logic and Comput."}
|
|
25 |
@string{JLP="J. Logic Prog."}
|
|
26 |
@string{JSC="J. Symb. Comput."}
|
|
27 |
@string{JSL="J. Symb. Logic"}
|
|
28 |
@string{SIGPLAN="{SIGPLAN} Notices"}
|
|
29 |
|
|
30 |
%conferences
|
|
31 |
@string{CADE="International Conference on Automated Deduction"}
|
|
32 |
@string{POPL="Symposium on Principles of Programming Languages"}
|
|
33 |
@string{TYPES="Types for Proofs and Programs"}
|
|
34 |
|
|
35 |
|
|
36 |
%A
|
|
37 |
|
|
38 |
@incollection{abramsky90,
|
|
39 |
author = {Samson Abramsky},
|
|
40 |
title = {The Lazy Lambda Calculus},
|
|
41 |
pages = {65-116},
|
|
42 |
editor = {David A. Turner},
|
|
43 |
booktitle = {Research Topics in Functional Programming},
|
|
44 |
publisher = {Addison-Wesley},
|
|
45 |
year = 1990}
|
|
46 |
|
|
47 |
@Unpublished{abrial93,
|
|
48 |
author = {J. R. Abrial and G. Laffitte},
|
|
49 |
title = {Towards the Mechanization of the Proofs of some Classical
|
|
50 |
Theorems of Set Theory},
|
|
51 |
note = {preprint},
|
|
52 |
year = 1993,
|
|
53 |
month = Feb}
|
|
54 |
|
|
55 |
@incollection{aczel77,
|
|
56 |
author = {Peter Aczel},
|
|
57 |
title = {An Introduction to Inductive Definitions},
|
|
58 |
pages = {739-782},
|
|
59 |
crossref = {barwise-handbk}}
|
|
60 |
|
|
61 |
@Book{aczel88,
|
|
62 |
author = {Peter Aczel},
|
|
63 |
title = {Non-Well-Founded Sets},
|
|
64 |
publisher = {CSLI},
|
|
65 |
year = 1988}
|
|
66 |
|
|
67 |
@InProceedings{alf,
|
|
68 |
author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
|
|
69 |
title = {The {ALF} Proof Editor and Its Proof Engine},
|
|
70 |
crossref = {types93},
|
|
71 |
pages = {213-237}}
|
|
72 |
|
|
73 |
@book{andrews86,
|
|
74 |
author = "Peter Andrews",
|
|
75 |
title = "An Introduction to Mathematical Logic and Type Theory: to Truth
|
|
76 |
through Proof",
|
|
77 |
publisher = AP,
|
|
78 |
series = "Computer Science and Applied Mathematics",
|
|
79 |
year = 1986}
|
|
80 |
|
|
81 |
%B
|
|
82 |
|
|
83 |
@incollection{basin91,
|
|
84 |
author = {David Basin and Matt Kaufmann},
|
|
85 |
title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
|
|
86 |
Comparison},
|
|
87 |
crossref = {huet-plotkin91},
|
|
88 |
pages = {89-119}}
|
|
89 |
|
6607
|
90 |
@book{Bird-Wadler,author="Richard Bird and Philip Wadler",
|
|
91 |
title="Introduction to Functional Programming",publisher=PH,year=1988}
|
|
92 |
|
6592
|
93 |
@Article{boyer86,
|
|
94 |
author = {Robert Boyer and Ewing Lusk and William McCune and Ross
|
|
95 |
Overbeek and Mark Stickel and Lawrence Wos},
|
|
96 |
title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
|
|
97 |
Axioms},
|
|
98 |
journal = JAR,
|
|
99 |
year = 1986,
|
|
100 |
volume = 2,
|
|
101 |
number = 3,
|
|
102 |
pages = {287-327}}
|
|
103 |
|
|
104 |
@book{bm79,
|
|
105 |
author = {Robert S. Boyer and J Strother Moore},
|
|
106 |
title = {A Computational Logic},
|
|
107 |
publisher = {Academic Press},
|
|
108 |
year = 1979}
|
|
109 |
|
|
110 |
@book{bm88book,
|
|
111 |
author = {Robert S. Boyer and J Strother Moore},
|
|
112 |
title = {A Computational Logic Handbook},
|
|
113 |
publisher = {Academic Press},
|
|
114 |
year = 1988}
|
|
115 |
|
|
116 |
@Article{debruijn72,
|
|
117 |
author = {N. G. de Bruijn},
|
|
118 |
title = {Lambda Calculus Notation with Nameless Dummies,
|
|
119 |
a Tool for Automatic Formula Manipulation,
|
|
120 |
with Application to the {Church-Rosser Theorem}},
|
|
121 |
journal = {Indag. Math.},
|
|
122 |
volume = 34,
|
|
123 |
pages = {381-392},
|
|
124 |
year = 1972}
|
|
125 |
|
|
126 |
%C
|
|
127 |
|
|
128 |
@TechReport{camilleri92,
|
|
129 |
author = {J. Camilleri and T. F. Melham},
|
|
130 |
title = {Reasoning with Inductively Defined Relations in the
|
|
131 |
{HOL} Theorem Prover},
|
|
132 |
institution = CUCL,
|
|
133 |
year = 1992,
|
|
134 |
number = 265,
|
|
135 |
month = Aug}
|
|
136 |
|
|
137 |
@Book{charniak80,
|
|
138 |
author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
|
|
139 |
title = {Artificial Intelligence Programming},
|
|
140 |
publisher = {Lawrence Erlbaum Associates},
|
|
141 |
year = 1980}
|
|
142 |
|
|
143 |
@article{church40,
|
|
144 |
author = "Alonzo Church",
|
|
145 |
title = "A Formulation of the Simple Theory of Types",
|
|
146 |
journal = JSL,
|
|
147 |
year = 1940,
|
|
148 |
volume = 5,
|
|
149 |
pages = "56-68"}
|
|
150 |
|
|
151 |
@PhdThesis{coen92,
|
|
152 |
author = {Martin D. Coen},
|
|
153 |
title = {Interactive Program Derivation},
|
|
154 |
school = {University of Cambridge},
|
|
155 |
note = {Computer Laboratory Technical Report 272},
|
|
156 |
month = nov,
|
|
157 |
year = 1992}
|
|
158 |
|
|
159 |
@book{constable86,
|
|
160 |
author = {R. L. Constable and others},
|
|
161 |
title = {Implementing Mathematics with the Nuprl Proof
|
|
162 |
Development System},
|
|
163 |
publisher = Prentice,
|
|
164 |
year = 1986}
|
|
165 |
|
|
166 |
%D
|
|
167 |
|
|
168 |
@Book{davey&priestley,
|
|
169 |
author = {B. A. Davey and H. A. Priestley},
|
|
170 |
title = {Introduction to Lattices and Order},
|
|
171 |
publisher = CUP,
|
|
172 |
year = 1990}
|
|
173 |
|
|
174 |
@Book{devlin79,
|
|
175 |
author = {Keith J. Devlin},
|
|
176 |
title = {Fundamentals of Contemporary Set Theory},
|
|
177 |
publisher = {Springer},
|
|
178 |
year = 1979}
|
|
179 |
|
|
180 |
@book{dummett,
|
|
181 |
author = {Michael Dummett},
|
|
182 |
title = {Elements of Intuitionism},
|
|
183 |
year = 1977,
|
|
184 |
publisher = {Oxford University Press}}
|
|
185 |
|
|
186 |
@incollection{dybjer91,
|
|
187 |
author = {Peter Dybjer},
|
|
188 |
title = {Inductive Sets and Families in {Martin-L\"of's} Type
|
|
189 |
Theory and Their Set-Theoretic Semantics},
|
|
190 |
crossref = {huet-plotkin91},
|
|
191 |
pages = {280-306}}
|
|
192 |
|
|
193 |
@Article{dyckhoff,
|
|
194 |
author = {Roy Dyckhoff},
|
|
195 |
title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
|
|
196 |
journal = JSL,
|
|
197 |
year = 1992,
|
|
198 |
volume = 57,
|
|
199 |
number = 3,
|
|
200 |
pages = {795-807}}
|
|
201 |
|
|
202 |
%F
|
|
203 |
|
|
204 |
@InProceedings{felty91a,
|
|
205 |
Author = {Amy Felty},
|
|
206 |
Title = {A Logic Program for Transforming Sequent Proofs to Natural
|
|
207 |
Deduction Proofs},
|
|
208 |
crossref = {extensions91},
|
|
209 |
pages = {157-178}}
|
|
210 |
|
|
211 |
@TechReport{frost93,
|
|
212 |
author = {Jacob Frost},
|
|
213 |
title = {A Case Study of Co-induction in {Isabelle HOL}},
|
|
214 |
institution = CUCL,
|
|
215 |
number = 308,
|
|
216 |
year = 1993,
|
|
217 |
month = Aug}
|
|
218 |
|
|
219 |
%revised version of frost93
|
|
220 |
@TechReport{frost95,
|
|
221 |
author = {Jacob Frost},
|
|
222 |
title = {A Case Study of Co-induction in {Isabelle}},
|
|
223 |
institution = CUCL,
|
|
224 |
number = 359,
|
|
225 |
year = 1995,
|
|
226 |
month = Feb}
|
|
227 |
|
|
228 |
@inproceedings{OBJ,
|
|
229 |
author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
|
|
230 |
and J. Meseguer},
|
|
231 |
title = {Principles of {OBJ2}},
|
|
232 |
booktitle = POPL,
|
|
233 |
year = 1985,
|
|
234 |
pages = {52-66}}
|
|
235 |
|
|
236 |
%G
|
|
237 |
|
|
238 |
@book{gallier86,
|
|
239 |
author = {J. H. Gallier},
|
|
240 |
title = {Logic for Computer Science:
|
|
241 |
Foundations of Automatic Theorem Proving},
|
|
242 |
year = 1986,
|
|
243 |
publisher = {Harper \& Row}}
|
|
244 |
|
|
245 |
@Book{galton90,
|
|
246 |
author = {Antony Galton},
|
|
247 |
title = {Logic for Information Technology},
|
|
248 |
publisher = {Wiley},
|
|
249 |
year = 1990}
|
|
250 |
|
|
251 |
@InProceedings{gimenez-codifying,
|
|
252 |
author = {Eduardo Gim{\'e}nez},
|
|
253 |
title = {Codifying Guarded Definitions with Recursive Schemes},
|
|
254 |
crossref = {types94},
|
|
255 |
pages = {39-59}
|
|
256 |
}
|
|
257 |
|
|
258 |
@Book{mgordon-hol,
|
|
259 |
author = {M. J. C. Gordon and T. F. Melham},
|
|
260 |
title = {Introduction to {HOL}: A Theorem Proving Environment for
|
|
261 |
Higher Order Logic},
|
|
262 |
publisher = CUP,
|
|
263 |
year = 1993}
|
|
264 |
|
|
265 |
@book{mgordon79,
|
|
266 |
author = {Michael J. C. Gordon and Robin Milner and Christopher P.
|
|
267 |
Wadsworth},
|
|
268 |
title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
|
|
269 |
year = 1979,
|
|
270 |
publisher = {Springer},
|
|
271 |
series = {LNCS 78}}
|
|
272 |
|
6607
|
273 |
@inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
|
|
274 |
title={Why we can't have {SML} style datatype declarations in {HOL}},
|
|
275 |
booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
|
|
276 |
IFIP TC10/WG10.2 Intl. Workshop, 1992},
|
|
277 |
editor={L.J.M. Claesen and M.J.C. Gordon},
|
|
278 |
publisher=NH,year=1993,pages={561--568}}
|
|
279 |
|
6592
|
280 |
@InProceedings{gunter-trees,
|
|
281 |
author = {Elsa L. Gunter},
|
|
282 |
title = {A Broader Class of Trees for Recursive Type Definitions for
|
|
283 |
{HOL}},
|
|
284 |
crossref = {hug93},
|
|
285 |
pages = {141-154}}
|
|
286 |
|
|
287 |
%H
|
|
288 |
|
|
289 |
@Book{halmos60,
|
|
290 |
author = {Paul R. Halmos},
|
|
291 |
title = {Naive Set Theory},
|
|
292 |
publisher = {Van Nostrand},
|
|
293 |
year = 1960}
|
|
294 |
|
|
295 |
@Book{hennessy90,
|
|
296 |
author = {Matthew Hennessy},
|
|
297 |
title = {The Semantics of Programming Languages: An Elementary
|
|
298 |
Introduction Using Structural Operational Semantics},
|
|
299 |
publisher = {Wiley},
|
|
300 |
year = 1990}
|
|
301 |
|
|
302 |
@Article{haskell-report,
|
|
303 |
author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
|
|
304 |
title = {Report on the Programming Language {Haskell}: A
|
|
305 |
Non-strict, Purely Functional Language},
|
|
306 |
journal = SIGPLAN,
|
|
307 |
year = 1992,
|
|
308 |
volume = 27,
|
|
309 |
number = 5,
|
|
310 |
month = May,
|
|
311 |
note = {Version 1.2}}
|
|
312 |
|
|
313 |
@Article{haskell-tutorial,
|
|
314 |
author = {Paul Hudak and Joseph H. Fasel},
|
|
315 |
title = {A Gentle Introduction to {Haskell}},
|
|
316 |
journal = SIGPLAN,
|
|
317 |
year = 1992,
|
|
318 |
volume = 27,
|
|
319 |
number = 5,
|
|
320 |
month = May}
|
|
321 |
|
|
322 |
@article{huet75,
|
|
323 |
author = {G. P. Huet},
|
|
324 |
title = {A Unification Algorithm for Typed $\lambda$-Calculus},
|
|
325 |
journal = TCS,
|
|
326 |
volume = 1,
|
|
327 |
year = 1975,
|
|
328 |
pages = {27-57}}
|
|
329 |
|
|
330 |
@article{huet78,
|
|
331 |
author = {G. P. Huet and B. Lang},
|
|
332 |
title = {Proving and Applying Program Transformations Expressed with
|
|
333 |
Second-Order Patterns},
|
|
334 |
journal = acta,
|
|
335 |
volume = 11,
|
|
336 |
year = 1978,
|
|
337 |
pages = {31-55}}
|
|
338 |
|
|
339 |
@inproceedings{huet88,
|
|
340 |
author = {G\'erard Huet},
|
|
341 |
title = {Induction Principles Formalized in the {Calculus of
|
|
342 |
Constructions}},
|
|
343 |
booktitle = {Programming of Future Generation Computers},
|
|
344 |
editor = {K. Fuchi and M. Nivat},
|
|
345 |
year = 1988,
|
|
346 |
pages = {205-216},
|
|
347 |
publisher = {Elsevier}}
|
|
348 |
|
|
349 |
%K
|
|
350 |
|
6607
|
351 |
@book{Knuth3-75,author={Donald E. Knuth},
|
|
352 |
title={The Art of Computer Programming, Volume 3: Sorting and Searching},
|
|
353 |
publisher={Addison-Wesley},year=1975}
|
|
354 |
|
6592
|
355 |
@Book{kunen80,
|
|
356 |
author = {Kenneth Kunen},
|
|
357 |
title = {Set Theory: An Introduction to Independence Proofs},
|
|
358 |
publisher = NH,
|
|
359 |
year = 1980}
|
|
360 |
|
|
361 |
%M
|
|
362 |
|
|
363 |
@Article{mw81,
|
|
364 |
author = {Zohar Manna and Richard Waldinger},
|
|
365 |
title = {Deductive Synthesis of the Unification Algorithm},
|
|
366 |
journal = SCP,
|
|
367 |
year = 1981,
|
|
368 |
volume = 1,
|
|
369 |
number = 1,
|
|
370 |
pages = {5-48}}
|
|
371 |
|
|
372 |
@InProceedings{martin-nipkow,
|
|
373 |
author = {Ursula Martin and Tobias Nipkow},
|
|
374 |
title = {Ordered Rewriting and Confluence},
|
|
375 |
crossref = {cade10},
|
|
376 |
pages = {366-380}}
|
|
377 |
|
|
378 |
@book{martinlof84,
|
|
379 |
author = {Per Martin-L\"of},
|
|
380 |
title = {Intuitionistic type theory},
|
|
381 |
year = 1984,
|
|
382 |
publisher = {Bibliopolis}}
|
|
383 |
|
|
384 |
@incollection{melham89,
|
|
385 |
author = {Thomas F. Melham},
|
|
386 |
title = {Automating Recursive Type Definitions in Higher Order
|
|
387 |
Logic},
|
|
388 |
pages = {341-386},
|
|
389 |
crossref = {birtwistle89}}
|
|
390 |
|
|
391 |
@Article{miller-mixed,
|
|
392 |
Author = {Dale Miller},
|
|
393 |
Title = {Unification Under a Mixed Prefix},
|
|
394 |
journal = JSC,
|
|
395 |
volume = 14,
|
|
396 |
number = 4,
|
|
397 |
pages = {321-358},
|
|
398 |
Year = 1992}
|
|
399 |
|
|
400 |
@Article{milner78,
|
|
401 |
author = {Robin Milner},
|
|
402 |
title = {A Theory of Type Polymorphism in Programming},
|
|
403 |
journal = "J. Comp.\ Sys.\ Sci.",
|
|
404 |
year = 1978,
|
|
405 |
volume = 17,
|
|
406 |
pages = {348-375}}
|
|
407 |
|
|
408 |
@TechReport{milner-ind,
|
|
409 |
author = {Robin Milner},
|
|
410 |
title = {How to Derive Inductions in {LCF}},
|
|
411 |
institution = Edinburgh,
|
|
412 |
year = 1980,
|
|
413 |
type = {note}}
|
|
414 |
|
|
415 |
@Article{milner-coind,
|
|
416 |
author = {Robin Milner and Mads Tofte},
|
|
417 |
title = {Co-induction in Relational Semantics},
|
|
418 |
journal = TCS,
|
|
419 |
year = 1991,
|
|
420 |
volume = 87,
|
|
421 |
pages = {209-220}}
|
|
422 |
|
|
423 |
@Book{milner89,
|
|
424 |
author = {Robin Milner},
|
|
425 |
title = {Communication and Concurrency},
|
|
426 |
publisher = Prentice,
|
|
427 |
year = 1989}
|
|
428 |
|
|
429 |
@PhdThesis{monahan84,
|
|
430 |
author = {Brian Q. Monahan},
|
|
431 |
title = {Data Type Proofs using Edinburgh {LCF}},
|
|
432 |
school = {University of Edinburgh},
|
|
433 |
year = 1984}
|
|
434 |
|
6607
|
435 |
@article{MuellerNvOS99,
|
|
436 |
author=
|
|
437 |
{Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oskar Slotosch},
|
|
438 |
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
|
|
439 |
|
6592
|
440 |
%N
|
|
441 |
|
|
442 |
@InProceedings{NaraschewskiW-TPHOLs98,
|
|
443 |
author = {Wolfgang Naraschewski and Markus Wenzel},
|
|
444 |
title =
|
|
445 |
{Object-Oriented Verification based on Record Subtyping in Higher-Order Logic},
|
|
446 |
booktitle = {Theorem Proving in Higher Order Logics (TPHOLs'98)},
|
|
447 |
publisher = Springer,
|
|
448 |
volume = 1479,
|
|
449 |
series = LNCS,
|
|
450 |
year = 1998}
|
|
451 |
|
|
452 |
@inproceedings{nazareth-nipkow,
|
|
453 |
author = {Dieter Nazareth and Tobias Nipkow},
|
|
454 |
title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
|
|
455 |
crossref = {tphols96},
|
|
456 |
pages = {331-345},
|
|
457 |
year = 1996}
|
|
458 |
|
|
459 |
@inproceedings{nipkow-W,
|
|
460 |
author = {Wolfgang Naraschewski and Tobias Nipkow},
|
|
461 |
title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
|
|
462 |
booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
|
|
463 |
editor = {E. Gim\'enez and C. Paulin-Mohring},
|
|
464 |
publisher = Springer,
|
|
465 |
series = LNCS,
|
|
466 |
volume = 1512,
|
|
467 |
pages = {317-332},
|
|
468 |
year = 1998}
|
|
469 |
|
|
470 |
@inproceedings{Nipkow-CR,
|
|
471 |
author = {Tobias Nipkow},
|
|
472 |
title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
|
|
473 |
booktitle = {Automated Deduction --- CADE-13},
|
|
474 |
editor = {M. McRobbie and J.K. Slaney},
|
|
475 |
publisher = Springer,
|
|
476 |
series = LNCS,
|
|
477 |
volume = 1104,
|
|
478 |
pages = {733-747},
|
|
479 |
year = 1996}
|
|
480 |
|
|
481 |
% WAS Nipkow-LICS-93
|
|
482 |
@InProceedings{nipkow-patterns,
|
|
483 |
title = {Functional Unification of Higher-Order Patterns},
|
|
484 |
author = {Tobias Nipkow},
|
|
485 |
pages = {64-74},
|
|
486 |
crossref = {lics8},
|
|
487 |
url = {ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html},
|
|
488 |
keywords = {unification}}
|
|
489 |
|
|
490 |
@article{nipkow-IMP,
|
|
491 |
author = {Tobias Nipkow},
|
|
492 |
title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
|
|
493 |
journal = FAC,
|
|
494 |
volume = 10,
|
|
495 |
pages = {171-186},
|
|
496 |
year = 1998}
|
|
497 |
|
6607
|
498 |
@manual{isabelle-HOL,
|
|
499 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
|
|
500 |
title = {{Isabelle}'s Logics: {HOL}},
|
|
501 |
institution = {Institut f\"ur Informatik, Technische Universi\"at
|
|
502 |
M\"unchen and Computer Laboratory, University of Cambridge}}
|
|
503 |
|
6592
|
504 |
@article{nipkow-prehofer,
|
|
505 |
author = {Tobias Nipkow and Christian Prehofer},
|
|
506 |
title = {Type Reconstruction for Type Classes},
|
|
507 |
journal = JFP,
|
|
508 |
volume = 5,
|
|
509 |
number = 2,
|
|
510 |
year = 1995,
|
|
511 |
pages = {201-224}}
|
|
512 |
|
|
513 |
@Article{noel,
|
|
514 |
author = {Philippe No{\"e}l},
|
|
515 |
title = {Experimenting with {Isabelle} in {ZF} Set Theory},
|
|
516 |
journal = JAR,
|
|
517 |
volume = 10,
|
|
518 |
number = 1,
|
|
519 |
pages = {15-58},
|
|
520 |
year = 1993}
|
|
521 |
|
|
522 |
@book{nordstrom90,
|
|
523 |
author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},
|
|
524 |
title = {Programming in {Martin-L\"of}'s Type Theory. An
|
|
525 |
Introduction},
|
|
526 |
publisher = {Oxford University Press},
|
|
527 |
year = 1990}
|
|
528 |
|
|
529 |
%O
|
|
530 |
|
|
531 |
@Manual{pvs-language,
|
|
532 |
title = {The {PVS} specification language},
|
|
533 |
author = {S. Owre and N. Shankar and J. M. Rushby},
|
|
534 |
organization = {Computer Science Laboratory, SRI International},
|
|
535 |
address = {Menlo Park, CA},
|
|
536 |
note = {Beta release},
|
|
537 |
year = 1993,
|
|
538 |
month = apr,
|
|
539 |
url = {\verb|http://www.csl.sri.com/reports/pvs-language.dvi.Z|}}
|
|
540 |
|
|
541 |
%P
|
|
542 |
|
|
543 |
% replaces paulin92
|
|
544 |
@InProceedings{paulin-tlca,
|
|
545 |
author = {Christine Paulin-Mohring},
|
|
546 |
title = {Inductive Definitions in the System {Coq}: Rules and
|
|
547 |
Properties},
|
|
548 |
crossref = {tlca93},
|
|
549 |
pages = {328-345}}
|
|
550 |
|
|
551 |
@InProceedings{paulson-CADE,
|
|
552 |
author = {Lawrence C. Paulson},
|
|
553 |
title = {A Fixedpoint Approach to Implementing (Co)Inductive
|
|
554 |
Definitions},
|
|
555 |
pages = {148-161},
|
|
556 |
crossref = {cade12}}
|
|
557 |
|
|
558 |
@InProceedings{paulson-COLOG,
|
|
559 |
author = {Lawrence C. Paulson},
|
|
560 |
title = {A Formulation of the Simple Theory of Types (for
|
|
561 |
{Isabelle})},
|
|
562 |
pages = {246-274},
|
|
563 |
crossref = {colog88},
|
|
564 |
url = {http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}
|
|
565 |
|
|
566 |
@Article{paulson-coind,
|
|
567 |
author = {Lawrence C. Paulson},
|
|
568 |
title = {Mechanizing Coinduction and Corecursion in Higher-Order
|
|
569 |
Logic},
|
|
570 |
journal = JLC,
|
|
571 |
year = 1997,
|
|
572 |
volume = 7,
|
|
573 |
number = 2,
|
|
574 |
month = mar,
|
|
575 |
pages = {175-204}}
|
|
576 |
|
6607
|
577 |
@manual{isabelle-ref,author="Lawrence C. Paulson",
|
|
578 |
title="The Isabelle Reference Manual",organization=CUCL}
|
|
579 |
|
|
580 |
@manual{isabelle-ZF,
|
6592
|
581 |
author = {Lawrence C. Paulson},
|
|
582 |
title = {{Isabelle}'s Logics: {FOL} and {ZF}},
|
6607
|
583 |
institution = CUCL}
|
6592
|
584 |
|
|
585 |
@article{paulson-found,
|
|
586 |
author = {Lawrence C. Paulson},
|
|
587 |
title = {The Foundation of a Generic Theorem Prover},
|
|
588 |
journal = JAR,
|
|
589 |
volume = 5,
|
|
590 |
number = 3,
|
|
591 |
pages = {363-397},
|
|
592 |
year = 1989,
|
|
593 |
url = {http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}
|
|
594 |
|
|
595 |
%replaces paulson-final
|
|
596 |
@Article{paulson-mscs,
|
|
597 |
author = {Lawrence C. Paulson},
|
|
598 |
title = {Final Coalgebras as Greatest Fixed Points in ZF Set Theory},
|
|
599 |
journal = {Mathematical Structures in Computer Science},
|
|
600 |
year = 1999,
|
|
601 |
volume = 9,
|
|
602 |
note = {in press}}
|
|
603 |
|
|
604 |
@InCollection{paulson-generic,
|
|
605 |
author = {Lawrence C. Paulson},
|
|
606 |
title = {Generic Automatic Proof Tools},
|
|
607 |
crossref = {wos-fest},
|
|
608 |
chapter = 3}
|
|
609 |
|
|
610 |
@Article{paulson-gr,
|
|
611 |
author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
|
|
612 |
title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
|
|
613 |
Choice},
|
|
614 |
journal = JAR,
|
|
615 |
year = 1996,
|
|
616 |
volume = 17,
|
|
617 |
number = 3,
|
|
618 |
month = dec,
|
|
619 |
pages = {291-323}}
|
|
620 |
|
|
621 |
@InCollection{paulson-handbook,
|
|
622 |
author = {Lawrence C. Paulson},
|
|
623 |
title = {Designing a Theorem Prover},
|
|
624 |
crossref = {handbk-lics2},
|
|
625 |
pages = {415-475}}
|
|
626 |
|
|
627 |
@Book{paulson-isa-book,
|
|
628 |
author = {Lawrence C. Paulson},
|
|
629 |
title = {Isabelle: A Generic Theorem Prover},
|
|
630 |
publisher = {Springer},
|
|
631 |
year = 1994,
|
|
632 |
note = {LNCS 828}}
|
|
633 |
|
|
634 |
@InCollection{paulson-markt,
|
|
635 |
author = {Lawrence C. Paulson},
|
|
636 |
title = {Tool Support for Logics of Programs},
|
|
637 |
booktitle = {Mathematical Methods in Program Development:
|
|
638 |
Summer School Marktoberdorf 1996},
|
|
639 |
publisher = {Springer},
|
|
640 |
pages = {461-498},
|
|
641 |
year = {Published 1997},
|
|
642 |
editor = {Manfred Broy},
|
|
643 |
series = {NATO ASI Series F}}
|
|
644 |
|
|
645 |
%replaces Paulson-ML and paulson91
|
|
646 |
@book{paulson-ml2,
|
|
647 |
author = {Lawrence C. Paulson},
|
|
648 |
title = {{ML} for the Working Programmer},
|
|
649 |
year = 1996,
|
|
650 |
edition = {2nd},
|
|
651 |
publisher = CUP}
|
|
652 |
|
|
653 |
@article{paulson-natural,
|
|
654 |
author = {Lawrence C. Paulson},
|
|
655 |
title = {Natural Deduction as Higher-order Resolution},
|
|
656 |
journal = JLP,
|
|
657 |
volume = 3,
|
|
658 |
pages = {237-258},
|
|
659 |
year = 1986,
|
|
660 |
url = {http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}
|
|
661 |
|
|
662 |
@Article{paulson-set-I,
|
|
663 |
author = {Lawrence C. Paulson},
|
|
664 |
title = {Set Theory for Verification: {I}. {From}
|
|
665 |
Foundations to Functions},
|
|
666 |
journal = JAR,
|
|
667 |
volume = 11,
|
|
668 |
number = 3,
|
|
669 |
pages = {353-389},
|
|
670 |
year = 1993,
|
|
671 |
url = {ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}
|
|
672 |
|
|
673 |
@Article{paulson-set-II,
|
|
674 |
author = {Lawrence C. Paulson},
|
|
675 |
title = {Set Theory for Verification: {II}. {Induction} and
|
|
676 |
Recursion},
|
|
677 |
journal = JAR,
|
|
678 |
volume = 15,
|
|
679 |
number = 2,
|
|
680 |
pages = {167-215},
|
|
681 |
year = 1995,
|
|
682 |
url = {http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}
|
|
683 |
|
|
684 |
@article{paulson85,
|
|
685 |
author = {Lawrence C. Paulson},
|
|
686 |
title = {Verifying the Unification Algorithm in {LCF}},
|
|
687 |
journal = SCP,
|
|
688 |
volume = 5,
|
|
689 |
pages = {143-170},
|
|
690 |
year = 1985}
|
|
691 |
|
|
692 |
%replqces Paulson-LCF
|
|
693 |
@book{paulson87,
|
|
694 |
author = {Lawrence C. Paulson},
|
|
695 |
title = {Logic and Computation: Interactive proof with Cambridge
|
|
696 |
LCF},
|
|
697 |
year = 1987,
|
|
698 |
publisher = CUP}
|
|
699 |
|
|
700 |
@incollection{paulson700,
|
|
701 |
author = {Lawrence C. Paulson},
|
|
702 |
title = {{Isabelle}: The Next 700 Theorem Provers},
|
|
703 |
crossref = {odifreddi90},
|
|
704 |
pages = {361-386},
|
|
705 |
url = {http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}
|
|
706 |
|
|
707 |
% replaces paulson-ns and paulson-security
|
|
708 |
@Article{paulson-jcs,
|
|
709 |
author = {Lawrence C. Paulson},
|
|
710 |
title = {The Inductive Approach to Verifying Cryptographic Protocols},
|
|
711 |
journal = JCS,
|
|
712 |
year = 1998,
|
|
713 |
volume = 6,
|
|
714 |
pages = {85-128}}
|
|
715 |
|
|
716 |
@article{pelletier86,
|
|
717 |
author = {F. J. Pelletier},
|
|
718 |
title = {Seventy-five Problems for Testing Automatic Theorem
|
|
719 |
Provers},
|
|
720 |
journal = JAR,
|
|
721 |
volume = 2,
|
|
722 |
pages = {191-216},
|
|
723 |
year = 1986,
|
|
724 |
note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
|
|
725 |
|
|
726 |
@Article{pitts94,
|
|
727 |
author = {Andrew M. Pitts},
|
|
728 |
title = {A Co-induction Principle for Recursively Defined Domains},
|
|
729 |
journal = TCS,
|
|
730 |
volume = 124,
|
|
731 |
pages = {195-219},
|
|
732 |
year = 1994}
|
|
733 |
|
|
734 |
@Article{plaisted90,
|
|
735 |
author = {David A. Plaisted},
|
|
736 |
title = {A Sequent-Style Model Elimination Strategy and a Positive
|
|
737 |
Refinement},
|
|
738 |
journal = JAR,
|
|
739 |
year = 1990,
|
|
740 |
volume = 6,
|
|
741 |
number = 4,
|
|
742 |
pages = {389-402}}
|
|
743 |
|
|
744 |
%Q
|
|
745 |
|
|
746 |
@Article{quaife92,
|
|
747 |
author = {Art Quaife},
|
|
748 |
title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
|
|
749 |
Theory},
|
|
750 |
journal = JAR,
|
|
751 |
year = 1992,
|
|
752 |
volume = 8,
|
|
753 |
number = 1,
|
|
754 |
pages = {91-147}}
|
|
755 |
|
|
756 |
%R
|
|
757 |
|
|
758 |
@TechReport{rasmussen95,
|
|
759 |
author = {Ole Rasmussen},
|
|
760 |
title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
|
|
761 |
Experiment},
|
|
762 |
institution = {Computer Laboratory, University of Cambridge},
|
|
763 |
year = 1995,
|
|
764 |
number = 364,
|
|
765 |
month = may,
|
|
766 |
url = {http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}
|
|
767 |
|
|
768 |
@Book{reeves90,
|
|
769 |
author = {Steve Reeves and Michael Clarke},
|
|
770 |
title = {Logic for Computer Science},
|
|
771 |
publisher = {Addison-Wesley},
|
|
772 |
year = 1990}
|
|
773 |
|
|
774 |
%S
|
|
775 |
|
|
776 |
@inproceedings{saaltink-fme,
|
|
777 |
author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
|
|
778 |
Dan Craigen and Irwin Meisels},
|
|
779 |
title = {An {EVES} Data Abstraction Example},
|
|
780 |
pages = {578-596},
|
|
781 |
crossref = {fme93}}
|
|
782 |
|
|
783 |
@inproceedings{slind-tfl,
|
|
784 |
author = {Konrad Slind},
|
|
785 |
title = {Function Definition in Higher Order Logic},
|
|
786 |
booktitle = {Theorem Proving in Higher Order Logics},
|
|
787 |
editor = {J. von Wright and J. Grundy and J. Harrison},
|
|
788 |
publisher = Springer,
|
|
789 |
series = LNCS,
|
|
790 |
volume = 1125,
|
|
791 |
pages = {381-397},
|
|
792 |
year = 1996}
|
|
793 |
|
|
794 |
@book{suppes72,
|
|
795 |
author = {Patrick Suppes},
|
|
796 |
title = {Axiomatic Set Theory},
|
|
797 |
year = 1972,
|
|
798 |
publisher = {Dover}}
|
|
799 |
|
|
800 |
@InCollection{szasz93,
|
|
801 |
author = {Nora Szasz},
|
|
802 |
title = {A Machine Checked Proof that {Ackermann's} Function is not
|
|
803 |
Primitive Recursive},
|
|
804 |
crossref = {huet-plotkin93},
|
|
805 |
pages = {317-338}}
|
|
806 |
|
|
807 |
%T
|
|
808 |
|
|
809 |
@book{takeuti87,
|
|
810 |
author = {G. Takeuti},
|
|
811 |
title = {Proof Theory},
|
|
812 |
year = 1987,
|
|
813 |
publisher = NH,
|
|
814 |
edition = {2nd}}
|
|
815 |
|
|
816 |
@Book{thompson91,
|
|
817 |
author = {Simon Thompson},
|
|
818 |
title = {Type Theory and Functional Programming},
|
|
819 |
publisher = {Addison-Wesley},
|
|
820 |
year = 1991}
|
|
821 |
|
|
822 |
%V
|
|
823 |
|
|
824 |
@Unpublished{voelker94,
|
|
825 |
author = {Norbert V\"olker},
|
|
826 |
title = {The Verification of a Timer Program using {Isabelle/HOL}},
|
|
827 |
url = {ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz},
|
|
828 |
year = 1994,
|
|
829 |
month = aug}
|
|
830 |
|
|
831 |
%W
|
|
832 |
|
|
833 |
@book{principia,
|
|
834 |
author = {A. N. Whitehead and B. Russell},
|
|
835 |
title = {Principia Mathematica},
|
|
836 |
year = 1962,
|
|
837 |
publisher = CUP,
|
|
838 |
note = {Paperback edition to *56,
|
|
839 |
abridged from the 2nd edition (1927)}}
|
|
840 |
|
|
841 |
@book{winskel93,
|
|
842 |
author = {Glynn Winskel},
|
|
843 |
title = {The Formal Semantics of Programming Languages},
|
|
844 |
publisher = MIT,year=1993}
|
|
845 |
|
|
846 |
@InCollection{wos-bledsoe,
|
|
847 |
author = {Larry Wos},
|
|
848 |
title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
|
|
849 |
crossref = {bledsoe-fest},
|
|
850 |
pages = {297-342}}
|
|
851 |
|
|
852 |
|
|
853 |
% CROSS REFERENCES
|
|
854 |
|
|
855 |
@book{handbk-lics2,
|
|
856 |
editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
|
|
857 |
title = {Handbook of Logic in Computer Science},
|
|
858 |
booktitle = {Handbook of Logic in Computer Science},
|
|
859 |
publisher = {Oxford University Press},
|
|
860 |
year = 1992,
|
|
861 |
volume = 2}
|
|
862 |
|
|
863 |
@book{types93,
|
|
864 |
editor = {Henk Barendregt and Tobias Nipkow},
|
|
865 |
title = TYPES # {: International Workshop {TYPES '93}},
|
|
866 |
booktitle = TYPES # {: International Workshop {TYPES '93}},
|
|
867 |
year = {published 1994},
|
|
868 |
publisher = {Springer},
|
|
869 |
series = {LNCS 806}}
|
|
870 |
|
|
871 |
@Proceedings{tlca93,
|
|
872 |
title = {Typed Lambda Calculi and Applications},
|
|
873 |
booktitle = {Typed Lambda Calculi and Applications},
|
|
874 |
editor = {M. Bezem and J.F. Groote},
|
|
875 |
year = 1993,
|
|
876 |
publisher = {Springer},
|
|
877 |
series = {LNCS 664}}
|
|
878 |
|
|
879 |
@book{bledsoe-fest,
|
|
880 |
title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
|
|
881 |
booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
|
|
882 |
publisher = {Kluwer Academic Publishers},
|
|
883 |
year = 1991,
|
|
884 |
editor = {Robert S. Boyer}}
|
|
885 |
|
|
886 |
@Proceedings{cade12,
|
|
887 |
editor = {Alan Bundy},
|
|
888 |
title = {Automated Deduction --- {CADE}-12
|
|
889 |
International Conference},
|
|
890 |
booktitle = {Automated Deduction --- {CADE}-12
|
|
891 |
International Conference},
|
|
892 |
year = 1994,
|
|
893 |
series = {LNAI 814},
|
|
894 |
publisher = {Springer}}
|
|
895 |
|
|
896 |
@book{types94,
|
|
897 |
editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},
|
|
898 |
title = TYPES # {: International Workshop {TYPES '94}},
|
|
899 |
booktitle = TYPES # {: International Workshop {TYPES '94}},
|
|
900 |
year = 1995,
|
|
901 |
publisher = {Springer},
|
|
902 |
series = {LNCS 996}}
|
|
903 |
|
|
904 |
@book{huet-plotkin91,
|
|
905 |
editor = {{G\'erard} Huet and Gordon Plotkin},
|
|
906 |
title = {Logical Frameworks},
|
|
907 |
booktitle = {Logical Frameworks},
|
|
908 |
publisher = CUP,
|
|
909 |
year = 1991}
|
|
910 |
|
|
911 |
@proceedings{colog88,
|
|
912 |
editor = {P. Martin-L\"of and G. Mints},
|
|
913 |
title = {COLOG-88: International Conference on Computer Logic},
|
|
914 |
booktitle = {COLOG-88: International Conference on Computer Logic},
|
|
915 |
year = {Published 1990},
|
|
916 |
publisher = {Springer},
|
|
917 |
organization = {Estonian Academy of Sciences},
|
|
918 |
address = {Tallinn},
|
|
919 |
series = {LNCS 417}}
|
|
920 |
|
|
921 |
@book{odifreddi90,
|
|
922 |
editor = {P. Odifreddi},
|
|
923 |
title = {Logic and Computer Science},
|
|
924 |
booktitle = {Logic and Computer Science},
|
|
925 |
publisher = {Academic Press},
|
|
926 |
year = 1990}
|
|
927 |
|
|
928 |
@proceedings{extensions91,
|
|
929 |
editor = {Peter Schroeder-Heister},
|
|
930 |
title = {Extensions of Logic Programming},
|
|
931 |
booktitle = {Extensions of Logic Programming},
|
|
932 |
year = 1991,
|
|
933 |
series = {LNAI 475},
|
|
934 |
publisher = {Springer}}
|
|
935 |
|
|
936 |
@proceedings{cade10,
|
|
937 |
editor = {Mark E. Stickel},
|
|
938 |
title = {10th } # CADE,
|
|
939 |
booktitle = {10th } # CADE,
|
|
940 |
year = 1990,
|
|
941 |
publisher = {Springer},
|
|
942 |
series = {LNAI 449}}
|
|
943 |
|
|
944 |
@Proceedings{lics8,
|
|
945 |
editor = {M. Vardi},
|
|
946 |
title = {Eighth Annual Symposium on Logic in Computer Science},
|
|
947 |
booktitle = {Eighth Annual Symposium on Logic in Computer Science},
|
|
948 |
publisher = IEEE,
|
|
949 |
year = 1993}
|
|
950 |
|
|
951 |
@book{wos-fest,
|
|
952 |
title = {Automated Reasoning and its Applications:
|
|
953 |
Essays in Honor of {Larry Wos}},
|
|
954 |
booktitle = {Automated Reasoning and its Applications:
|
|
955 |
Essays in Honor of {Larry Wos}},
|
|
956 |
publisher = {MIT Press},
|
|
957 |
year = 1997,
|
|
958 |
editor = {Robert Veroff}}
|
|
959 |
|
|
960 |
@Proceedings{tphols96,
|
|
961 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
|
|
962 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
|
|
963 |
editor = {J. von Wright and J. Grundy and J. Harrison},
|
|
964 |
series = {LNCS 1125},
|
|
965 |
year = 1996}
|