author | wenzelm |
Thu, 29 Apr 2004 06:05:03 +0200 | |
changeset 14688 | edb7dacde656 |
parent 14385 | 6b15793a641a |
child 15429 | b08a5eaf22e3 |
permissions | -rw-r--r-- |
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"} |
|
11199 | 9 |
@string{LNCS="Lecture Notes in Computer Science"} |
6592 | 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 |
|
11199 | 17 |
@string{CUCL="Computer Laboratory, University of Cambridge"} |
18 |
@string{Edinburgh="Department of Computer Science, University of Edinburgh"} |
|
6592 | 19 |
|
20 |
%journals |
|
8284 | 21 |
@string{AI="Artificial Intelligence"} |
11199 | 22 |
@string{FAC="Formal Aspects of Computing"} |
23 |
@string{JAR="Journal of Automated Reasoning"} |
|
24 |
@string{JCS="Journal of Computer Security"} |
|
25 |
@string{JFP="Journal of Functional Programming"} |
|
26 |
@string{JLC="Journal of Logic and Computation"} |
|
27 |
@string{JLP="Journal of Logic Programming"} |
|
28 |
@string{JSC="Journal of Symbolic Computation"} |
|
29 |
@string{JSL="Journal of Symbolic Logic"} |
|
11246 | 30 |
@string{PROYAL="Proceedings of the Royal Society of London"} |
6592 | 31 |
@string{SIGPLAN="{SIGPLAN} Notices"} |
11246 | 32 |
@string{TISSEC="ACM Transactions on Information and System Security"} |
6592 | 33 |
|
34 |
%conferences |
|
35 |
@string{CADE="International Conference on Automated Deduction"} |
|
36 |
@string{POPL="Symposium on Principles of Programming Languages"} |
|
37 |
@string{TYPES="Types for Proofs and Programs"} |
|
38 |
||
39 |
||
40 |
%A |
|
41 |
||
42 |
@incollection{abramsky90, |
|
43 |
author = {Samson Abramsky}, |
|
44 |
title = {The Lazy Lambda Calculus}, |
|
45 |
pages = {65-116}, |
|
46 |
editor = {David A. Turner}, |
|
47 |
booktitle = {Research Topics in Functional Programming}, |
|
48 |
publisher = {Addison-Wesley}, |
|
49 |
year = 1990} |
|
50 |
||
51 |
@Unpublished{abrial93, |
|
52 |
author = {J. R. Abrial and G. Laffitte}, |
|
53 |
title = {Towards the Mechanization of the Proofs of some Classical |
|
54 |
Theorems of Set Theory}, |
|
55 |
note = {preprint}, |
|
56 |
year = 1993, |
|
57 |
month = Feb} |
|
58 |
||
59 |
@incollection{aczel77, |
|
60 |
author = {Peter Aczel}, |
|
61 |
title = {An Introduction to Inductive Definitions}, |
|
62 |
pages = {739-782}, |
|
63 |
crossref = {barwise-handbk}} |
|
64 |
||
65 |
@Book{aczel88, |
|
66 |
author = {Peter Aczel}, |
|
67 |
title = {Non-Well-Founded Sets}, |
|
68 |
publisher = {CSLI}, |
|
69 |
year = 1988} |
|
70 |
||
71 |
@InProceedings{alf, |
|
72 |
author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, |
|
73 |
title = {The {ALF} Proof Editor and Its Proof Engine}, |
|
74 |
crossref = {types93}, |
|
75 |
pages = {213-237}} |
|
76 |
||
77 |
@book{andrews86, |
|
78 |
author = "Peter Andrews", |
|
79 |
title = "An Introduction to Mathematical Logic and Type Theory: to Truth |
|
80 |
through Proof", |
|
81 |
publisher = AP, |
|
82 |
series = "Computer Science and Applied Mathematics", |
|
83 |
year = 1986} |
|
84 |
||
9599 | 85 |
@InProceedings{Aspinall:2000:eProof, |
86 |
author = {David Aspinall}, |
|
87 |
title = {Protocols for Interactive {e-Proof}}, |
|
88 |
booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)}, |
|
89 |
year = 2000, |
|
90 |
note = {Unpublished work-in-progress paper, |
|
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
91 |
\url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}} |
9599 | 92 |
} |
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
93 |
|
8505 | 94 |
@InProceedings{Aspinall:TACAS:2000, |
95 |
author = {David Aspinall}, |
|
10160 | 96 |
title = {{P}roof {G}eneral: A Generic Tool for Proof Development}, |
11205 | 97 |
booktitle = {Tools and Algorithms for the Construction and Analysis of |
98 |
Systems (TACAS)}, |
|
99 |
year = 2000, |
|
100 |
publisher = Springer, |
|
101 |
series = LNCS, |
|
102 |
volume = 1785, |
|
103 |
pages = "38--42" |
|
8505 | 104 |
} |
105 |
||
7209 | 106 |
@Misc{isamode, |
107 |
author = {David Aspinall}, |
|
8062 | 108 |
title = {Isamode --- {U}sing {I}sabelle with {E}macs}, |
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
109 |
note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}} |
7209 | 110 |
} |
111 |
||
112 |
@Misc{proofgeneral, |
|
11197 | 113 |
author = {David Aspinall}, |
114 |
title = {{P}roof {G}eneral}, |
|
14296
bcba1d67f854
updated references to the now-pornographic proofgeneral.org
paulson
parents:
14210
diff
changeset
|
115 |
note = {\url{http://proofgeneral.inf.ed.ac.uk/}} |
7209 | 116 |
} |
117 |
||
6592 | 118 |
%B |
119 |
||
10186 | 120 |
@book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow}, |
121 |
title="Term Rewriting and All That",publisher=CUP,year=1998} |
|
122 |
||
6592 | 123 |
@incollection{basin91, |
124 |
author = {David Basin and Matt Kaufmann}, |
|
125 |
title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental |
|
126 |
Comparison}, |
|
127 |
crossref = {huet-plotkin91}, |
|
128 |
pages = {89-119}} |
|
129 |
||
12466 | 130 |
@Unpublished{HOL-Library, |
131 |
author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and |
|
132 |
Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and |
|
133 |
Markus Wenzel}, |
|
134 |
title = {The Supplemental {Isabelle/HOL} Library}, |
|
12660 | 135 |
note = {Part of the Isabelle distribution, |
12466 | 136 |
\url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}}, |
12660 | 137 |
year = 2002 |
12466 | 138 |
} |
139 |
||
9567 | 140 |
@InProceedings{Bauer-Wenzel:2000:HB, |
141 |
author = {Gertrud Bauer and Markus Wenzel}, |
|
142 |
title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in |
|
143 |
{I}sabelle/{I}sar}, |
|
144 |
booktitle = {Types for Proofs and Programs: TYPES'99}, |
|
9599 | 145 |
editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m |
146 |
and Jan Smith}, |
|
9567 | 147 |
series = {LNCS}, |
9599 | 148 |
year = 2000 |
9567 | 149 |
} |
6624 | 150 |
|
12878 | 151 |
@InProceedings{Bauer-Wenzel:2001, |
152 |
author = {Gertrud Bauer and Markus Wenzel}, |
|
153 |
title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience}, |
|
154 |
crossref = {tphols2001}} |
|
155 |
||
11619 | 156 |
@INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL, |
157 |
crossref = "tphols2000", |
|
158 |
title = "Proof terms for simply typed higher order logic", |
|
159 |
author = "Stefan Berghofer and Tobias Nipkow", |
|
160 |
pages = "38--52"} |
|
161 |
||
12612 | 162 |
@InProceedings{Berghofer-Nipkow:2002, |
163 |
author = {Stefan Berghofer and Tobias Nipkow}, |
|
164 |
title = {Executing Higher Order Logic}, |
|
165 |
booktitle = {Types for Proofs and Programs: TYPES'2000}, |
|
166 |
editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, |
|
167 |
series = LNCS, |
|
168 |
publisher = Springer, |
|
13009 | 169 |
volume = 2277, |
12612 | 170 |
year = 2002} |
171 |
||
6624 | 172 |
@InProceedings{Berghofer-Wenzel:1999:TPHOL, |
173 |
author = {Stefan Berghofer and Markus Wenzel}, |
|
7041 | 174 |
title = {Inductive datatypes in {HOL} --- lessons learned in |
175 |
{F}ormal-{L}ogic {E}ngineering}, |
|
176 |
crossref = {tphols99}} |
|
6624 | 177 |
|
6607 | 178 |
@book{Bird-Wadler,author="Richard Bird and Philip Wadler", |
179 |
title="Introduction to Functional Programming",publisher=PH,year=1988} |
|
180 |
||
11209 | 181 |
@book{Bird-Haskell,author="Richard Bird", |
182 |
title="Introduction to Functional Programming using Haskell", |
|
183 |
publisher=PH,year=1998} |
|
184 |
||
6592 | 185 |
@Article{boyer86, |
186 |
author = {Robert Boyer and Ewing Lusk and William McCune and Ross |
|
187 |
Overbeek and Mark Stickel and Lawrence Wos}, |
|
188 |
title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's} |
|
189 |
Axioms}, |
|
190 |
journal = JAR, |
|
191 |
year = 1986, |
|
192 |
volume = 2, |
|
193 |
number = 3, |
|
194 |
pages = {287-327}} |
|
195 |
||
196 |
@book{bm79, |
|
197 |
author = {Robert S. Boyer and J Strother Moore}, |
|
198 |
title = {A Computational Logic}, |
|
199 |
publisher = {Academic Press}, |
|
200 |
year = 1979} |
|
201 |
||
202 |
@book{bm88book, |
|
203 |
author = {Robert S. Boyer and J Strother Moore}, |
|
204 |
title = {A Computational Logic Handbook}, |
|
205 |
publisher = {Academic Press}, |
|
206 |
year = 1988} |
|
207 |
||
208 |
@Article{debruijn72, |
|
209 |
author = {N. G. de Bruijn}, |
|
210 |
title = {Lambda Calculus Notation with Nameless Dummies, |
|
211 |
a Tool for Automatic Formula Manipulation, |
|
212 |
with Application to the {Church-Rosser Theorem}}, |
|
213 |
journal = {Indag. Math.}, |
|
214 |
volume = 34, |
|
215 |
pages = {381-392}, |
|
216 |
year = 1972} |
|
217 |
||
11246 | 218 |
@Article{ban89, |
219 |
author = {M. Burrows and M. Abadi and R. M. Needham}, |
|
220 |
title = {A Logic of Authentication}, |
|
221 |
journal = PROYAL, |
|
222 |
year = 1989, |
|
223 |
volume = 426, |
|
224 |
pages = {233-271}} |
|
225 |
||
6592 | 226 |
%C |
227 |
||
228 |
@TechReport{camilleri92, |
|
229 |
author = {J. Camilleri and T. F. Melham}, |
|
230 |
title = {Reasoning with Inductively Defined Relations in the |
|
231 |
{HOL} Theorem Prover}, |
|
232 |
institution = CUCL, |
|
233 |
year = 1992, |
|
234 |
number = 265, |
|
235 |
month = Aug} |
|
236 |
||
237 |
@Book{charniak80, |
|
238 |
author = {E. Charniak and C. K. Riesbeck and D. V. McDermott}, |
|
239 |
title = {Artificial Intelligence Programming}, |
|
240 |
publisher = {Lawrence Erlbaum Associates}, |
|
241 |
year = 1980} |
|
242 |
||
243 |
@article{church40, |
|
244 |
author = "Alonzo Church", |
|
245 |
title = "A Formulation of the Simple Theory of Types", |
|
246 |
journal = JSL, |
|
247 |
year = 1940, |
|
248 |
volume = 5, |
|
249 |
pages = "56-68"} |
|
250 |
||
10191 | 251 |
@book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled", |
252 |
title="Model Checking",publisher=MIT,year=1999} |
|
253 |
||
6592 | 254 |
@PhdThesis{coen92, |
255 |
author = {Martin D. Coen}, |
|
256 |
title = {Interactive Program Derivation}, |
|
257 |
school = {University of Cambridge}, |
|
258 |
note = {Computer Laboratory Technical Report 272}, |
|
259 |
month = nov, |
|
260 |
year = 1992} |
|
261 |
||
262 |
@book{constable86, |
|
263 |
author = {R. L. Constable and others}, |
|
264 |
title = {Implementing Mathematics with the Nuprl Proof |
|
265 |
Development System}, |
|
266 |
publisher = Prentice, |
|
267 |
year = 1986} |
|
268 |
||
269 |
%D |
|
270 |
||
6745 | 271 |
@Book{davey-priestley, |
6592 | 272 |
author = {B. A. Davey and H. A. Priestley}, |
273 |
title = {Introduction to Lattices and Order}, |
|
274 |
publisher = CUP, |
|
275 |
year = 1990} |
|
276 |
||
277 |
@Book{devlin79, |
|
278 |
author = {Keith J. Devlin}, |
|
279 |
title = {Fundamentals of Contemporary Set Theory}, |
|
280 |
publisher = {Springer}, |
|
281 |
year = 1979} |
|
282 |
||
283 |
@book{dummett, |
|
284 |
author = {Michael Dummett}, |
|
285 |
title = {Elements of Intuitionism}, |
|
286 |
year = 1977, |
|
287 |
publisher = {Oxford University Press}} |
|
288 |
||
289 |
@incollection{dybjer91, |
|
290 |
author = {Peter Dybjer}, |
|
10186 | 291 |
title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type |
6592 | 292 |
Theory and Their Set-Theoretic Semantics}, |
293 |
crossref = {huet-plotkin91}, |
|
294 |
pages = {280-306}} |
|
295 |
||
296 |
@Article{dyckhoff, |
|
297 |
author = {Roy Dyckhoff}, |
|
298 |
title = {Contraction-Free Sequent Calculi for Intuitionistic Logic}, |
|
299 |
journal = JSL, |
|
300 |
year = 1992, |
|
301 |
volume = 57, |
|
302 |
number = 3, |
|
303 |
pages = {795-807}} |
|
304 |
||
305 |
%F |
|
306 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
307 |
@Article{IMPS, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
308 |
author = {William M. Farmer and Joshua D. Guttman and F. Javier |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
309 |
Thayer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
310 |
title = {{IMPS}: An Interactive Mathematical Proof System}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
311 |
journal = JAR, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
312 |
volume = 11, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
313 |
number = 2, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
314 |
year = 1993, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
315 |
pages = {213-248}} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
316 |
|
6592 | 317 |
@InProceedings{felty91a, |
318 |
Author = {Amy Felty}, |
|
319 |
Title = {A Logic Program for Transforming Sequent Proofs to Natural |
|
320 |
Deduction Proofs}, |
|
321 |
crossref = {extensions91}, |
|
322 |
pages = {157-178}} |
|
323 |
||
10796 | 324 |
@Article{fleuriot-jcm, |
325 |
author = {Jacques Fleuriot and Lawrence C. Paulson}, |
|
326 |
title = {Mechanizing Nonstandard Real Analysis}, |
|
327 |
journal = {LMS Journal of Computation and Mathematics}, |
|
328 |
year = 2000, |
|
329 |
volume = 3, |
|
330 |
pages = {140-190}, |
|
331 |
note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}} |
|
332 |
} |
|
333 |
||
6592 | 334 |
@TechReport{frost93, |
335 |
author = {Jacob Frost}, |
|
336 |
title = {A Case Study of Co-induction in {Isabelle HOL}}, |
|
337 |
institution = CUCL, |
|
338 |
number = 308, |
|
339 |
year = 1993, |
|
340 |
month = Aug} |
|
341 |
||
342 |
%revised version of frost93 |
|
343 |
@TechReport{frost95, |
|
344 |
author = {Jacob Frost}, |
|
345 |
title = {A Case Study of Co-induction in {Isabelle}}, |
|
346 |
institution = CUCL, |
|
347 |
number = 359, |
|
348 |
year = 1995, |
|
349 |
month = Feb} |
|
350 |
||
351 |
@inproceedings{OBJ, |
|
352 |
author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud |
|
353 |
and J. Meseguer}, |
|
354 |
title = {Principles of {OBJ2}}, |
|
355 |
booktitle = POPL, |
|
356 |
year = 1985, |
|
357 |
pages = {52-66}} |
|
358 |
||
359 |
%G |
|
360 |
||
361 |
@book{gallier86, |
|
362 |
author = {J. H. Gallier}, |
|
363 |
title = {Logic for Computer Science: |
|
364 |
Foundations of Automatic Theorem Proving}, |
|
365 |
year = 1986, |
|
366 |
publisher = {Harper \& Row}} |
|
367 |
||
368 |
@Book{galton90, |
|
369 |
author = {Antony Galton}, |
|
370 |
title = {Logic for Information Technology}, |
|
371 |
publisher = {Wiley}, |
|
372 |
year = 1990} |
|
373 |
||
374 |
@InProceedings{gimenez-codifying, |
|
375 |
author = {Eduardo Gim{\'e}nez}, |
|
376 |
title = {Codifying Guarded Definitions with Recursive Schemes}, |
|
377 |
crossref = {types94}, |
|
378 |
pages = {39-59} |
|
379 |
} |
|
380 |
||
9816 | 381 |
@book{girard89, |
382 |
author = {Jean-Yves Girard}, |
|
383 |
title = {Proofs and Types}, |
|
384 |
year = 1989, |
|
385 |
publisher = CUP, |
|
386 |
note = {Translated by Yves LaFont and Paul Taylor}} |
|
387 |
||
6592 | 388 |
@Book{mgordon-hol, |
11205 | 389 |
editor = {M. J. C. Gordon and T. F. Melham}, |
6592 | 390 |
title = {Introduction to {HOL}: A Theorem Proving Environment for |
391 |
Higher Order Logic}, |
|
392 |
publisher = CUP, |
|
393 |
year = 1993} |
|
394 |
||
395 |
@book{mgordon79, |
|
396 |
author = {Michael J. C. Gordon and Robin Milner and Christopher P. |
|
397 |
Wadsworth}, |
|
398 |
title = {Edinburgh {LCF}: A Mechanised Logic of Computation}, |
|
399 |
year = 1979, |
|
400 |
publisher = {Springer}, |
|
401 |
series = {LNCS 78}} |
|
402 |
||
6607 | 403 |
@inproceedings{Gunter-HOL92,author={Elsa L. Gunter}, |
404 |
title={Why we can't have {SML} style datatype declarations in {HOL}}, |
|
405 |
booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\ |
|
406 |
IFIP TC10/WG10.2 Intl. Workshop, 1992}, |
|
407 |
editor={L.J.M. Claesen and M.J.C. Gordon}, |
|
408 |
publisher=NH,year=1993,pages={561--568}} |
|
409 |
||
6592 | 410 |
@InProceedings{gunter-trees, |
411 |
author = {Elsa L. Gunter}, |
|
412 |
title = {A Broader Class of Trees for Recursive Type Definitions for |
|
413 |
{HOL}}, |
|
414 |
crossref = {hug93}, |
|
415 |
pages = {141-154}} |
|
416 |
||
417 |
%H |
|
418 |
||
419 |
@Book{halmos60, |
|
420 |
author = {Paul R. Halmos}, |
|
421 |
title = {Naive Set Theory}, |
|
422 |
publisher = {Van Nostrand}, |
|
423 |
year = 1960} |
|
424 |
||
11207 | 425 |
@book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn}, |
426 |
title={Dynamic Logic},publisher=MIT,year=2000} |
|
427 |
||
6592 | 428 |
@Book{hennessy90, |
429 |
author = {Matthew Hennessy}, |
|
430 |
title = {The Semantics of Programming Languages: An Elementary |
|
431 |
Introduction Using Structural Operational Semantics}, |
|
432 |
publisher = {Wiley}, |
|
433 |
year = 1990} |
|
434 |
||
10244 | 435 |
@book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman}, |
436 |
title={Introduction to Automata Theory, Languages, and Computation.}, |
|
437 |
publisher={Addison-Wesley},year=1979} |
|
438 |
||
6592 | 439 |
@Article{haskell-report, |
440 |
author = {Paul Hudak and Simon Peyton Jones and Philip Wadler}, |
|
441 |
title = {Report on the Programming Language {Haskell}: A |
|
442 |
Non-strict, Purely Functional Language}, |
|
443 |
journal = SIGPLAN, |
|
444 |
year = 1992, |
|
445 |
volume = 27, |
|
446 |
number = 5, |
|
447 |
month = May, |
|
448 |
note = {Version 1.2}} |
|
449 |
||
450 |
@Article{haskell-tutorial, |
|
451 |
author = {Paul Hudak and Joseph H. Fasel}, |
|
452 |
title = {A Gentle Introduction to {Haskell}}, |
|
453 |
journal = SIGPLAN, |
|
454 |
year = 1992, |
|
455 |
volume = 27, |
|
456 |
number = 5, |
|
457 |
month = May} |
|
458 |
||
11209 | 459 |
@book{Hudak-Haskell,author={Paul Hudak}, |
460 |
title={The Haskell School of Expression},publisher=CUP,year=2000} |
|
461 |
||
6592 | 462 |
@article{huet75, |
463 |
author = {G. P. Huet}, |
|
464 |
title = {A Unification Algorithm for Typed $\lambda$-Calculus}, |
|
465 |
journal = TCS, |
|
466 |
volume = 1, |
|
467 |
year = 1975, |
|
468 |
pages = {27-57}} |
|
469 |
||
470 |
@article{huet78, |
|
471 |
author = {G. P. Huet and B. Lang}, |
|
472 |
title = {Proving and Applying Program Transformations Expressed with |
|
473 |
Second-Order Patterns}, |
|
474 |
journal = acta, |
|
475 |
volume = 11, |
|
476 |
year = 1978, |
|
477 |
pages = {31-55}} |
|
478 |
||
479 |
@inproceedings{huet88, |
|
10186 | 480 |
author = {G{\'e}rard Huet}, |
6592 | 481 |
title = {Induction Principles Formalized in the {Calculus of |
482 |
Constructions}}, |
|
483 |
booktitle = {Programming of Future Generation Computers}, |
|
484 |
editor = {K. Fuchi and M. Nivat}, |
|
485 |
year = 1988, |
|
486 |
pages = {205-216}, |
|
487 |
publisher = {Elsevier}} |
|
488 |
||
10186 | 489 |
@Book{Huth-Ryan-book, |
490 |
author = {Michael Huth and Mark Ryan}, |
|
491 |
title = {Logic in Computer Science. Modelling and reasoning about systems}, |
|
492 |
publisher = CUP, |
|
493 |
year = 2000} |
|
494 |
||
7041 | 495 |
@InProceedings{Harrison:1996:MizarHOL, |
496 |
author = {J. Harrison}, |
|
497 |
title = {A {Mizar} Mode for {HOL}}, |
|
498 |
pages = {203--220}, |
|
499 |
crossref = {tphols96}} |
|
500 |
||
6592 | 501 |
%K |
502 |
||
6670 | 503 |
@InProceedings{kammueller-locales, |
504 |
author = {Florian Kamm{\"u}ller and Markus Wenzel and |
|
505 |
Lawrence C. Paulson}, |
|
506 |
title = {Locales: A Sectioning Concept for {Isabelle}}, |
|
507 |
crossref = {tphols99}} |
|
508 |
||
8284 | 509 |
@book{Knuth3-75, |
510 |
author={Donald E. Knuth}, |
|
511 |
title={The Art of Computer Programming, Volume 3: Sorting and Searching}, |
|
512 |
publisher={Addison-Wesley}, |
|
513 |
year=1975} |
|
514 |
||
515 |
@Article{korf85, |
|
516 |
author = {R. E. Korf}, |
|
517 |
title = {Depth-First Iterative-Deepening: an Optimal Admissible |
|
518 |
Tree Search}, |
|
519 |
journal = AI, |
|
520 |
year = 1985, |
|
521 |
volume = 27, |
|
522 |
pages = {97-109}} |
|
6607 | 523 |
|
6592 | 524 |
@Book{kunen80, |
525 |
author = {Kenneth Kunen}, |
|
526 |
title = {Set Theory: An Introduction to Independence Proofs}, |
|
527 |
publisher = NH, |
|
528 |
year = 1980} |
|
529 |
||
11246 | 530 |
%L |
531 |
||
532 |
@InProceedings{lowe-fdr, |
|
533 |
author = {Gavin Lowe}, |
|
534 |
title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key |
|
535 |
Protocol using {CSP} and {FDR}}, |
|
536 |
booktitle = {Tools and Algorithms for the Construction and Analysis |
|
537 |
of Systems: second international workshop, TACAS '96}, |
|
538 |
editor = {T. Margaria and B. Steffen}, |
|
539 |
series = {LNCS 1055}, |
|
540 |
year = 1996, |
|
541 |
publisher = {Springer}, |
|
542 |
pages = {147-166}} |
|
543 |
||
544 |
||
6592 | 545 |
%M |
546 |
||
547 |
@Article{mw81, |
|
548 |
author = {Zohar Manna and Richard Waldinger}, |
|
549 |
title = {Deductive Synthesis of the Unification Algorithm}, |
|
550 |
journal = SCP, |
|
551 |
year = 1981, |
|
552 |
volume = 1, |
|
553 |
number = 1, |
|
554 |
pages = {5-48}} |
|
555 |
||
556 |
@InProceedings{martin-nipkow, |
|
557 |
author = {Ursula Martin and Tobias Nipkow}, |
|
558 |
title = {Ordered Rewriting and Confluence}, |
|
559 |
crossref = {cade10}, |
|
560 |
pages = {366-380}} |
|
561 |
||
562 |
@book{martinlof84, |
|
10186 | 563 |
author = {Per Martin-L{\"o}f}, |
6592 | 564 |
title = {Intuitionistic type theory}, |
565 |
year = 1984, |
|
566 |
publisher = {Bibliopolis}} |
|
567 |
||
568 |
@incollection{melham89, |
|
569 |
author = {Thomas F. Melham}, |
|
570 |
title = {Automating Recursive Type Definitions in Higher Order |
|
571 |
Logic}, |
|
572 |
pages = {341-386}, |
|
573 |
crossref = {birtwistle89}} |
|
574 |
||
575 |
@Article{miller-mixed, |
|
576 |
Author = {Dale Miller}, |
|
577 |
Title = {Unification Under a Mixed Prefix}, |
|
578 |
journal = JSC, |
|
579 |
volume = 14, |
|
580 |
number = 4, |
|
581 |
pages = {321-358}, |
|
582 |
Year = 1992} |
|
583 |
||
584 |
@Article{milner78, |
|
585 |
author = {Robin Milner}, |
|
586 |
title = {A Theory of Type Polymorphism in Programming}, |
|
587 |
journal = "J. Comp.\ Sys.\ Sci.", |
|
588 |
year = 1978, |
|
589 |
volume = 17, |
|
590 |
pages = {348-375}} |
|
591 |
||
592 |
@TechReport{milner-ind, |
|
593 |
author = {Robin Milner}, |
|
594 |
title = {How to Derive Inductions in {LCF}}, |
|
595 |
institution = Edinburgh, |
|
596 |
year = 1980, |
|
597 |
type = {note}} |
|
598 |
||
599 |
@Article{milner-coind, |
|
600 |
author = {Robin Milner and Mads Tofte}, |
|
601 |
title = {Co-induction in Relational Semantics}, |
|
602 |
journal = TCS, |
|
603 |
year = 1991, |
|
604 |
volume = 87, |
|
605 |
pages = {209-220}} |
|
606 |
||
607 |
@Book{milner89, |
|
608 |
author = {Robin Milner}, |
|
609 |
title = {Communication and Concurrency}, |
|
610 |
publisher = Prentice, |
|
611 |
year = 1989} |
|
612 |
||
10970 | 613 |
@book{SML,author="Robin Milner and Mads Tofte and Robert Harper", |
614 |
title="The Definition of Standard ML",publisher=MIT,year=1990} |
|
615 |
||
6592 | 616 |
@PhdThesis{monahan84, |
617 |
author = {Brian Q. Monahan}, |
|
618 |
title = {Data Type Proofs using Edinburgh {LCF}}, |
|
619 |
school = {University of Edinburgh}, |
|
620 |
year = 1984} |
|
621 |
||
6607 | 622 |
@article{MuellerNvOS99, |
623 |
author= |
|
11564 | 624 |
{Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, |
11197 | 625 |
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}} |
6607 | 626 |
|
9599 | 627 |
@Manual{Muzalewski:Mizar, |
628 |
title = {An Outline of {PC} {Mizar}}, |
|
629 |
author = {Micha{\l} Muzalewski}, |
|
630 |
organization = {Fondation of Logic, Mathematics and Informatics |
|
631 |
--- Mizar Users Group}, |
|
632 |
year = 1993, |
|
633 |
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}} |
|
634 |
} |
|
635 |
||
6592 | 636 |
%N |
637 |
||
638 |
@InProceedings{NaraschewskiW-TPHOLs98, |
|
639 |
author = {Wolfgang Naraschewski and Markus Wenzel}, |
|
640 |
title = |
|
7041 | 641 |
{Object-Oriented Verification based on Record Subtyping in |
642 |
Higher-Order Logic}, |
|
643 |
crossref = {tphols98}} |
|
6592 | 644 |
|
645 |
@inproceedings{nazareth-nipkow, |
|
646 |
author = {Dieter Nazareth and Tobias Nipkow}, |
|
647 |
title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, |
|
648 |
crossref = {tphols96}, |
|
649 |
pages = {331-345}, |
|
650 |
year = 1996} |
|
651 |
||
11246 | 652 |
@Article{needham-schroeder, |
653 |
author = "Roger M. Needham and Michael D. Schroeder", |
|
654 |
title = "Using Encryption for Authentication in Large Networks |
|
655 |
of Computers", |
|
656 |
journal = cacm, |
|
657 |
volume = 21, |
|
658 |
number = 12, |
|
659 |
pages = "993-999", |
|
660 |
month = dec, |
|
661 |
year = 1978} |
|
662 |
||
6592 | 663 |
@inproceedings{nipkow-W, |
664 |
author = {Wolfgang Naraschewski and Tobias Nipkow}, |
|
665 |
title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, |
|
666 |
booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, |
|
10186 | 667 |
editor = {E. Gim{\'e}nez and C. Paulin-Mohring}, |
6592 | 668 |
publisher = Springer, |
669 |
series = LNCS, |
|
670 |
volume = 1512, |
|
671 |
pages = {317-332}, |
|
672 |
year = 1998} |
|
673 |
||
8892 | 674 |
@InCollection{nipkow-sorts93, |
675 |
author = {T. Nipkow}, |
|
676 |
title = {Order-Sorted Polymorphism in {Isabelle}}, |
|
677 |
booktitle = {Logical Environments}, |
|
678 |
publisher = CUP, |
|
679 |
year = 1993, |
|
680 |
editor = {G. Huet and G. Plotkin}, |
|
681 |
pages = {164--188} |
|
682 |
} |
|
683 |
||
684 |
@Misc{nipkow-types93, |
|
685 |
author = {Tobias Nipkow}, |
|
686 |
title = {Axiomatic Type Classes (in {I}sabelle)}, |
|
687 |
howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen}, |
|
688 |
year = 1993 |
|
689 |
} |
|
690 |
||
6592 | 691 |
@inproceedings{Nipkow-CR, |
692 |
author = {Tobias Nipkow}, |
|
693 |
title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})}, |
|
694 |
booktitle = {Automated Deduction --- CADE-13}, |
|
695 |
editor = {M. McRobbie and J.K. Slaney}, |
|
696 |
publisher = Springer, |
|
697 |
series = LNCS, |
|
698 |
volume = 1104, |
|
699 |
pages = {733-747}, |
|
700 |
year = 1996} |
|
701 |
||
702 |
% WAS Nipkow-LICS-93 |
|
703 |
@InProceedings{nipkow-patterns, |
|
704 |
title = {Functional Unification of Higher-Order Patterns}, |
|
705 |
author = {Tobias Nipkow}, |
|
706 |
pages = {64-74}, |
|
707 |
crossref = {lics8}, |
|
6745 | 708 |
url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}}, |
6592 | 709 |
keywords = {unification}} |
710 |
||
711 |
@article{nipkow-IMP, |
|
712 |
author = {Tobias Nipkow}, |
|
713 |
title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook}, |
|
714 |
journal = FAC, |
|
715 |
volume = 10, |
|
716 |
pages = {171-186}, |
|
717 |
year = 1998} |
|
718 |
||
6607 | 719 |
@manual{isabelle-HOL, |
720 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
721 |
title = {{Isabelle}'s Logics: {HOL}}, |
|
10186 | 722 |
institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t |
723 |
M{\"u}nchen and Computer Laboratory, University of Cambridge}, |
|
8892 | 724 |
note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}} |
6607 | 725 |
|
6592 | 726 |
@article{nipkow-prehofer, |
727 |
author = {Tobias Nipkow and Christian Prehofer}, |
|
728 |
title = {Type Reconstruction for Type Classes}, |
|
729 |
journal = JFP, |
|
730 |
volume = 5, |
|
731 |
number = 2, |
|
732 |
year = 1995, |
|
733 |
pages = {201-224}} |
|
734 |
||
14147 | 735 |
@Book{isa-tutorial, |
736 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
737 |
title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic}, |
|
738 |
publisher = {Springer}, |
|
739 |
year = 2002, |
|
740 |
note = {LNCS Tutorial 2283}} |
|
741 |
||
6592 | 742 |
@Article{noel, |
743 |
author = {Philippe No{\"e}l}, |
|
744 |
title = {Experimenting with {Isabelle} in {ZF} Set Theory}, |
|
745 |
journal = JAR, |
|
746 |
volume = 10, |
|
747 |
number = 1, |
|
748 |
pages = {15-58}, |
|
749 |
year = 1993} |
|
750 |
||
751 |
@book{nordstrom90, |
|
10186 | 752 |
author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith}, |
753 |
title = {Programming in {Martin-L{\"o}f}'s Type Theory. An |
|
6592 | 754 |
Introduction}, |
755 |
publisher = {Oxford University Press}, |
|
756 |
year = 1990} |
|
757 |
||
758 |
%O |
|
759 |
||
760 |
@Manual{pvs-language, |
|
761 |
title = {The {PVS} specification language}, |
|
762 |
author = {S. Owre and N. Shankar and J. M. Rushby}, |
|
763 |
organization = {Computer Science Laboratory, SRI International}, |
|
764 |
address = {Menlo Park, CA}, |
|
6745 | 765 |
note = {Beta release}, |
6592 | 766 |
year = 1993, |
767 |
month = apr, |
|
6619 | 768 |
url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}} |
6592 | 769 |
|
770 |
%P |
|
771 |
||
772 |
% replaces paulin92 |
|
773 |
@InProceedings{paulin-tlca, |
|
774 |
author = {Christine Paulin-Mohring}, |
|
775 |
title = {Inductive Definitions in the System {Coq}: Rules and |
|
776 |
Properties}, |
|
777 |
crossref = {tlca93}, |
|
778 |
pages = {328-345}} |
|
779 |
||
780 |
@InProceedings{paulson-CADE, |
|
781 |
author = {Lawrence C. Paulson}, |
|
782 |
title = {A Fixedpoint Approach to Implementing (Co)Inductive |
|
783 |
Definitions}, |
|
784 |
pages = {148-161}, |
|
785 |
crossref = {cade12}} |
|
786 |
||
787 |
@InProceedings{paulson-COLOG, |
|
788 |
author = {Lawrence C. Paulson}, |
|
789 |
title = {A Formulation of the Simple Theory of Types (for |
|
790 |
{Isabelle})}, |
|
791 |
pages = {246-274}, |
|
792 |
crossref = {colog88}, |
|
6619 | 793 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}} |
6592 | 794 |
|
795 |
@Article{paulson-coind, |
|
796 |
author = {Lawrence C. Paulson}, |
|
797 |
title = {Mechanizing Coinduction and Corecursion in Higher-Order |
|
798 |
Logic}, |
|
799 |
journal = JLC, |
|
800 |
year = 1997, |
|
801 |
volume = 7, |
|
802 |
number = 2, |
|
803 |
month = mar, |
|
804 |
pages = {175-204}} |
|
805 |
||
12616 | 806 |
@manual{isabelle-intro, |
807 |
author = {Lawrence C. Paulson}, |
|
808 |
title = {Introduction to {Isabelle}}, |
|
809 |
institution = CUCL, |
|
810 |
note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}} |
|
811 |
||
812 |
@manual{isabelle-logics, |
|
813 |
author = {Lawrence C. Paulson}, |
|
814 |
title = {{Isabelle's} Logics}, |
|
815 |
institution = CUCL, |
|
816 |
note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}} |
|
817 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
818 |
@manual{isabelle-ref, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
819 |
author = {Lawrence C. Paulson}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
820 |
title = {The {Isabelle} Reference Manual}, |
8892 | 821 |
institution = CUCL, |
822 |
note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}} |
|
6607 | 823 |
|
824 |
@manual{isabelle-ZF, |
|
6592 | 825 |
author = {Lawrence C. Paulson}, |
826 |
title = {{Isabelle}'s Logics: {FOL} and {ZF}}, |
|
8892 | 827 |
institution = CUCL, |
828 |
note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}} |
|
6592 | 829 |
|
830 |
@article{paulson-found, |
|
831 |
author = {Lawrence C. Paulson}, |
|
832 |
title = {The Foundation of a Generic Theorem Prover}, |
|
833 |
journal = JAR, |
|
834 |
volume = 5, |
|
835 |
number = 3, |
|
836 |
pages = {363-397}, |
|
837 |
year = 1989, |
|
6619 | 838 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}} |
6592 | 839 |
|
840 |
%replaces paulson-final |
|
841 |
@Article{paulson-mscs, |
|
842 |
author = {Lawrence C. Paulson}, |
|
7991 | 843 |
title = {Final Coalgebras as Greatest Fixed Points |
844 |
in {ZF} Set Theory}, |
|
6592 | 845 |
journal = {Mathematical Structures in Computer Science}, |
846 |
year = 1999, |
|
847 |
volume = 9, |
|
848 |
note = {in press}} |
|
849 |
||
850 |
@InCollection{paulson-generic, |
|
851 |
author = {Lawrence C. Paulson}, |
|
852 |
title = {Generic Automatic Proof Tools}, |
|
853 |
crossref = {wos-fest}, |
|
854 |
chapter = 3} |
|
855 |
||
856 |
@Article{paulson-gr, |
|
857 |
author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski}, |
|
858 |
title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of |
|
859 |
Choice}, |
|
860 |
journal = JAR, |
|
861 |
year = 1996, |
|
862 |
volume = 17, |
|
863 |
number = 3, |
|
864 |
month = dec, |
|
865 |
pages = {291-323}} |
|
866 |
||
14210 | 867 |
@InCollection{paulson-fixedpt-milner, |
868 |
author = {Lawrence C. Paulson}, |
|
869 |
title = {A Fixedpoint Approach to (Co)inductive and |
|
870 |
(Co)datatype Definitions}, |
|
871 |
pages = {187-211}, |
|
872 |
crossref = {milner-fest}} |
|
873 |
||
874 |
@book{milner-fest, |
|
875 |
title = {Proof, Language, and Interaction: |
|
876 |
Essays in Honor of {Robin Milner}}, |
|
877 |
booktitle = {Proof, Language, and Interaction: |
|
878 |
Essays in Honor of {Robin Milner}}, |
|
879 |
publisher = {MIT Press}, |
|
880 |
year = 2000, |
|
881 |
editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} |
|
882 |
||
6592 | 883 |
@InCollection{paulson-handbook, |
884 |
author = {Lawrence C. Paulson}, |
|
885 |
title = {Designing a Theorem Prover}, |
|
886 |
crossref = {handbk-lics2}, |
|
887 |
pages = {415-475}} |
|
888 |
||
889 |
@Book{paulson-isa-book, |
|
890 |
author = {Lawrence C. Paulson}, |
|
891 |
title = {Isabelle: A Generic Theorem Prover}, |
|
892 |
publisher = {Springer}, |
|
893 |
year = 1994, |
|
894 |
note = {LNCS 828}} |
|
895 |
||
12878 | 896 |
@Book{isabelle-hol-book, |
897 |
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, |
|
898 |
title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic}, |
|
899 |
publisher = {Springer}, |
|
900 |
year = 2002, |
|
901 |
note = {LNCS 2283}} |
|
902 |
||
6592 | 903 |
@InCollection{paulson-markt, |
904 |
author = {Lawrence C. Paulson}, |
|
905 |
title = {Tool Support for Logics of Programs}, |
|
906 |
booktitle = {Mathematical Methods in Program Development: |
|
907 |
Summer School Marktoberdorf 1996}, |
|
908 |
publisher = {Springer}, |
|
909 |
pages = {461-498}, |
|
910 |
year = {Published 1997}, |
|
911 |
editor = {Manfred Broy}, |
|
912 |
series = {NATO ASI Series F}} |
|
913 |
||
914 |
%replaces Paulson-ML and paulson91 |
|
915 |
@book{paulson-ml2, |
|
916 |
author = {Lawrence C. Paulson}, |
|
917 |
title = {{ML} for the Working Programmer}, |
|
918 |
year = 1996, |
|
919 |
edition = {2nd}, |
|
920 |
publisher = CUP} |
|
921 |
||
922 |
@article{paulson-natural, |
|
923 |
author = {Lawrence C. Paulson}, |
|
924 |
title = {Natural Deduction as Higher-order Resolution}, |
|
925 |
journal = JLP, |
|
926 |
volume = 3, |
|
927 |
pages = {237-258}, |
|
928 |
year = 1986, |
|
6619 | 929 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}} |
6592 | 930 |
|
931 |
@Article{paulson-set-I, |
|
932 |
author = {Lawrence C. Paulson}, |
|
933 |
title = {Set Theory for Verification: {I}. {From} |
|
934 |
Foundations to Functions}, |
|
935 |
journal = JAR, |
|
936 |
volume = 11, |
|
937 |
number = 3, |
|
938 |
pages = {353-389}, |
|
939 |
year = 1993, |
|
14385 | 940 |
url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}} |
6592 | 941 |
|
942 |
@Article{paulson-set-II, |
|
943 |
author = {Lawrence C. Paulson}, |
|
944 |
title = {Set Theory for Verification: {II}. {Induction} and |
|
945 |
Recursion}, |
|
946 |
journal = JAR, |
|
947 |
volume = 15, |
|
948 |
number = 2, |
|
949 |
pages = {167-215}, |
|
950 |
year = 1995, |
|
6619 | 951 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}} |
6592 | 952 |
|
953 |
@article{paulson85, |
|
954 |
author = {Lawrence C. Paulson}, |
|
955 |
title = {Verifying the Unification Algorithm in {LCF}}, |
|
956 |
journal = SCP, |
|
957 |
volume = 5, |
|
958 |
pages = {143-170}, |
|
959 |
year = 1985} |
|
960 |
||
11564 | 961 |
%replaces Paulson-LCF |
6592 | 962 |
@book{paulson87, |
963 |
author = {Lawrence C. Paulson}, |
|
964 |
title = {Logic and Computation: Interactive proof with Cambridge |
|
965 |
LCF}, |
|
966 |
year = 1987, |
|
967 |
publisher = CUP} |
|
968 |
||
969 |
@incollection{paulson700, |
|
970 |
author = {Lawrence C. Paulson}, |
|
971 |
title = {{Isabelle}: The Next 700 Theorem Provers}, |
|
972 |
crossref = {odifreddi90}, |
|
973 |
pages = {361-386}, |
|
6619 | 974 |
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}} |
6592 | 975 |
|
976 |
% replaces paulson-ns and paulson-security |
|
977 |
@Article{paulson-jcs, |
|
978 |
author = {Lawrence C. Paulson}, |
|
979 |
title = {The Inductive Approach to Verifying Cryptographic Protocols}, |
|
980 |
journal = JCS, |
|
981 |
year = 1998, |
|
982 |
volume = 6, |
|
983 |
pages = {85-128}} |
|
984 |
||
11246 | 985 |
@Article{paulson-tls, |
986 |
author = {Lawrence C. Paulson}, |
|
987 |
title = {Inductive Analysis of the {Internet} Protocol {TLS}}, |
|
988 |
journal = TISSEC, |
|
989 |
month = aug, |
|
990 |
year = 1999, |
|
991 |
volume = 2, |
|
992 |
number = 3, |
|
993 |
pages = {332-351}} |
|
11268 | 994 |
@Article{paulson-yahalom, author = {Lawrence C. Paulson}, title = {Relations Between Secrets: Two Formal Analyses of the {Yahalom} Protocol}, journal = JCS, note = {in press}} |
11246 | 995 |
|
6592 | 996 |
@article{pelletier86, |
997 |
author = {F. J. Pelletier}, |
|
998 |
title = {Seventy-five Problems for Testing Automatic Theorem |
|
999 |
Provers}, |
|
1000 |
journal = JAR, |
|
1001 |
volume = 2, |
|
1002 |
pages = {191-216}, |
|
1003 |
year = 1986, |
|
1004 |
note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}} |
|
1005 |
||
1006 |
@Article{pitts94, |
|
1007 |
author = {Andrew M. Pitts}, |
|
1008 |
title = {A Co-induction Principle for Recursively Defined Domains}, |
|
1009 |
journal = TCS, |
|
1010 |
volume = 124, |
|
1011 |
pages = {195-219}, |
|
1012 |
year = 1994} |
|
1013 |
||
1014 |
@Article{plaisted90, |
|
1015 |
author = {David A. Plaisted}, |
|
1016 |
title = {A Sequent-Style Model Elimination Strategy and a Positive |
|
1017 |
Refinement}, |
|
1018 |
journal = JAR, |
|
1019 |
year = 1990, |
|
1020 |
volume = 6, |
|
1021 |
number = 4, |
|
1022 |
pages = {389-402}} |
|
1023 |
||
1024 |
%Q |
|
1025 |
||
1026 |
@Article{quaife92, |
|
1027 |
author = {Art Quaife}, |
|
1028 |
title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set |
|
1029 |
Theory}, |
|
1030 |
journal = JAR, |
|
1031 |
year = 1992, |
|
1032 |
volume = 8, |
|
1033 |
number = 1, |
|
1034 |
pages = {91-147}} |
|
1035 |
||
1036 |
%R |
|
1037 |
||
1038 |
@TechReport{rasmussen95, |
|
1039 |
author = {Ole Rasmussen}, |
|
1040 |
title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting |
|
1041 |
Experiment}, |
|
1042 |
institution = {Computer Laboratory, University of Cambridge}, |
|
1043 |
year = 1995, |
|
1044 |
number = 364, |
|
1045 |
month = may, |
|
6619 | 1046 |
url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}} |
6592 | 1047 |
|
1048 |
@Book{reeves90, |
|
1049 |
author = {Steve Reeves and Michael Clarke}, |
|
1050 |
title = {Logic for Computer Science}, |
|
1051 |
publisher = {Addison-Wesley}, |
|
1052 |
year = 1990} |
|
1053 |
||
11209 | 1054 |
@book{Rosen-DMA,author={Kenneth H. Rosen}, |
1055 |
title={Discrete Mathematics and Its Applications}, |
|
1056 |
publisher={McGraw-Hill},year=1998} |
|
1057 |
||
7041 | 1058 |
@InProceedings{Rudnicki:1992:MizarOverview, |
1059 |
author = {P. Rudnicki}, |
|
1060 |
title = {An Overview of the {MIZAR} Project}, |
|
1061 |
booktitle = {1992 Workshop on Types for Proofs and Programs}, |
|
1062 |
year = 1992, |
|
1063 |
organization = {Chalmers University of Technology}, |
|
1064 |
publisher = {Bastad} |
|
1065 |
} |
|
1066 |
||
6592 | 1067 |
%S |
1068 |
||
1069 |
@inproceedings{saaltink-fme, |
|
1070 |
author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and |
|
1071 |
Dan Craigen and Irwin Meisels}, |
|
1072 |
title = {An {EVES} Data Abstraction Example}, |
|
1073 |
pages = {578-596}, |
|
1074 |
crossref = {fme93}} |
|
1075 |
||
1076 |
@inproceedings{slind-tfl, |
|
1077 |
author = {Konrad Slind}, |
|
1078 |
title = {Function Definition in Higher Order Logic}, |
|
1079 |
booktitle = {Theorem Proving in Higher Order Logics}, |
|
1080 |
editor = {J. von Wright and J. Grundy and J. Harrison}, |
|
1081 |
publisher = Springer, |
|
1082 |
series = LNCS, |
|
1083 |
volume = 1125, |
|
1084 |
pages = {381-397}, |
|
1085 |
year = 1996} |
|
1086 |
||
1087 |
@book{suppes72, |
|
1088 |
author = {Patrick Suppes}, |
|
1089 |
title = {Axiomatic Set Theory}, |
|
1090 |
year = 1972, |
|
1091 |
publisher = {Dover}} |
|
1092 |
||
1093 |
@InCollection{szasz93, |
|
1094 |
author = {Nora Szasz}, |
|
1095 |
title = {A Machine Checked Proof that {Ackermann's} Function is not |
|
1096 |
Primitive Recursive}, |
|
1097 |
crossref = {huet-plotkin93}, |
|
1098 |
pages = {317-338}} |
|
1099 |
||
7041 | 1100 |
@TechReport{Syme:1997:DECLARE, |
1101 |
author = {D. Syme}, |
|
1102 |
title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic}, |
|
1103 |
institution = {University of Cambridge Computer Laboratory}, |
|
1104 |
year = 1997, |
|
1105 |
number = 416 |
|
1106 |
} |
|
1107 |
||
1108 |
@PhdThesis{Syme:1998:thesis, |
|
1109 |
author = {D. Syme}, |
|
1110 |
title = {Declarative Theorem Proving for Operational Semantics}, |
|
1111 |
school = {University of Cambridge}, |
|
1112 |
year = 1998, |
|
1113 |
note = {Submitted} |
|
1114 |
} |
|
1115 |
||
1116 |
@InProceedings{Syme:1999:TPHOL, |
|
1117 |
author = {D. Syme}, |
|
1118 |
title = {Three Tactic Theorem Proving}, |
|
1119 |
crossref = {tphols99}} |
|
1120 |
||
6592 | 1121 |
%T |
1122 |
||
1123 |
@book{takeuti87, |
|
1124 |
author = {G. Takeuti}, |
|
1125 |
title = {Proof Theory}, |
|
1126 |
year = 1987, |
|
1127 |
publisher = NH, |
|
1128 |
edition = {2nd}} |
|
1129 |
||
1130 |
@Book{thompson91, |
|
1131 |
author = {Simon Thompson}, |
|
1132 |
title = {Type Theory and Functional Programming}, |
|
1133 |
publisher = {Addison-Wesley}, |
|
1134 |
year = 1991} |
|
1135 |
||
11209 | 1136 |
@book{Thompson-Haskell,author={Simon Thompson}, |
1137 |
title={Haskell: The Craft of Functional Programming}, |
|
1138 |
publisher={Addison-Wesley},year=1999} |
|
1139 |
||
7041 | 1140 |
@Unpublished{Trybulec:1993:MizarFeatures, |
1141 |
author = {A. Trybulec}, |
|
1142 |
title = {Some Features of the {Mizar} Language}, |
|
1143 |
note = {Presented at a workshop in Turin, Italy}, |
|
1144 |
year = 1993 |
|
1145 |
} |
|
1146 |
||
6592 | 1147 |
%V |
1148 |
||
1149 |
@Unpublished{voelker94, |
|
10186 | 1150 |
author = {Norbert V{\"o}lker}, |
6592 | 1151 |
title = {The Verification of a Timer Program using {Isabelle/HOL}}, |
6745 | 1152 |
url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}}, |
6592 | 1153 |
year = 1994, |
1154 |
month = aug} |
|
1155 |
||
1156 |
%W |
|
1157 |
||
8505 | 1158 |
@Misc{x-symbol, |
1159 |
author = {Christoph Wedler}, |
|
1160 |
title = {Emacs package ``{X-Symbol}''}, |
|
13141 | 1161 |
note = {\url{http://x-symbol.sourceforge.net}} |
8505 | 1162 |
} |
1163 |
||
7858 | 1164 |
@manual{isabelle-sys, |
1165 |
author = {Markus Wenzel and Stefan Berghofer}, |
|
1166 |
title = {The {Isabelle} System Manual}, |
|
8892 | 1167 |
institution = {TU Munich}, |
1168 |
note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}} |
|
7858 | 1169 |
|
1170 |
@manual{isabelle-isar-ref, |
|
1171 |
author = {Markus Wenzel}, |
|
7966 | 1172 |
title = {The {Isabelle/Isar} Reference Manual}, |
8892 | 1173 |
institution = {TU Munich}, |
1174 |
note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}} |
|
1175 |
||
1176 |
@manual{isabelle-axclass, |
|
1177 |
author = {Markus Wenzel}, |
|
1178 |
title = {Using Axiomatic Type Classes in {I}sabelle}, |
|
1179 |
institution = {TU Munich}, |
|
9567 | 1180 |
year = 2000, |
8892 | 1181 |
note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}} |
7858 | 1182 |
|
1183 |
||
7041 | 1184 |
@InProceedings{Wenzel:1999:TPHOL, |
1185 |
author = {Markus Wenzel}, |
|
1186 |
title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents}, |
|
1187 |
crossref = {tphols99}} |
|
6624 | 1188 |
|
1189 |
@InProceedings{Wenzel:1997:TPHOL, |
|
1190 |
author = {Markus Wenzel}, |
|
1191 |
title = {Type Classes and Overloading in Higher-Order Logic}, |
|
7041 | 1192 |
crossref = {tphols97}} |
1193 |
||
14147 | 1194 |
@phdthesis{Wenzel-PhD, |
1195 |
author={Markus Wenzel}, |
|
1196 |
title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents}, |
|
1197 |
school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, |
|
1198 |
year=2002, |
|
12901 | 1199 |
note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}} |
7041 | 1200 |
|
6592 | 1201 |
@book{principia, |
1202 |
author = {A. N. Whitehead and B. Russell}, |
|
1203 |
title = {Principia Mathematica}, |
|
1204 |
year = 1962, |
|
1205 |
publisher = CUP, |
|
1206 |
note = {Paperback edition to *56, |
|
1207 |
abridged from the 2nd edition (1927)}} |
|
1208 |
||
9599 | 1209 |
@Misc{Wiedijk:1999:Mizar, |
1210 |
author = {Freek Wiedijk}, |
|
1211 |
title = {Mizar: An Impression}, |
|
1212 |
howpublished = {Unpublished paper}, |
|
1213 |
year = 1999, |
|
1214 |
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}} |
|
1215 |
} |
|
1216 |
||
1217 |
@Misc{Wiedijk:2000:MV, |
|
1218 |
author = {Freek Wiedijk}, |
|
1219 |
title = {The Mathematical Vernacular}, |
|
1220 |
howpublished = {Unpublished paper}, |
|
1221 |
year = 2000, |
|
1222 |
note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}} |
|
1223 |
} |
|
1224 |
||
6592 | 1225 |
@book{winskel93, |
1226 |
author = {Glynn Winskel}, |
|
1227 |
title = {The Formal Semantics of Programming Languages}, |
|
1228 |
publisher = MIT,year=1993} |
|
1229 |
||
1230 |
@InCollection{wos-bledsoe, |
|
1231 |
author = {Larry Wos}, |
|
1232 |
title = {Automated Reasoning and {Bledsoe's} Dream for the Field}, |
|
1233 |
crossref = {bledsoe-fest}, |
|
1234 |
pages = {297-342}} |
|
1235 |
||
7989 | 1236 |
@InProceedings{Zammit:1999:TPHOL, |
1237 |
author = {Vincent Zammit}, |
|
1238 |
title = {On the Implementation of an Extensible Declarative Proof Language}, |
|
1239 |
crossref = {tphols99}} |
|
1240 |
||
1241 |
%Z |
|
1242 |
||
6592 | 1243 |
|
1244 |
% CROSS REFERENCES |
|
1245 |
||
1246 |
@book{handbk-lics2, |
|
1247 |
editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum}, |
|
1248 |
title = {Handbook of Logic in Computer Science}, |
|
1249 |
booktitle = {Handbook of Logic in Computer Science}, |
|
1250 |
publisher = {Oxford University Press}, |
|
1251 |
year = 1992, |
|
1252 |
volume = 2} |
|
1253 |
||
1254 |
@book{types93, |
|
1255 |
editor = {Henk Barendregt and Tobias Nipkow}, |
|
1256 |
title = TYPES # {: International Workshop {TYPES '93}}, |
|
1257 |
booktitle = TYPES # {: International Workshop {TYPES '93}}, |
|
1258 |
year = {published 1994}, |
|
1259 |
publisher = {Springer}, |
|
1260 |
series = {LNCS 806}} |
|
1261 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1262 |
@book{barwise-handbk, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1263 |
editor = {J. Barwise}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1264 |
title = {Handbook of Mathematical Logic}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1265 |
booktitle = {Handbook of Mathematical Logic}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1266 |
year = 1977, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1267 |
publisher = NH} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1268 |
|
6592 | 1269 |
@Proceedings{tlca93, |
1270 |
title = {Typed Lambda Calculi and Applications}, |
|
1271 |
booktitle = {Typed Lambda Calculi and Applications}, |
|
1272 |
editor = {M. Bezem and J.F. Groote}, |
|
1273 |
year = 1993, |
|
1274 |
publisher = {Springer}, |
|
1275 |
series = {LNCS 664}} |
|
1276 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1277 |
@book{birtwistle89, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1278 |
editor = {Graham Birtwistle and P. A. Subrahmanyam}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1279 |
title = {Current Trends in Hardware Verification and Automated |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1280 |
Theorem Proving}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1281 |
booktitle = {Current Trends in Hardware Verification and Automated |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1282 |
Theorem Proving}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1283 |
publisher = {Springer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1284 |
year = 1989} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1285 |
|
6592 | 1286 |
@book{bledsoe-fest, |
1287 |
title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, |
|
1288 |
booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, |
|
1289 |
publisher = {Kluwer Academic Publishers}, |
|
1290 |
year = 1991, |
|
1291 |
editor = {Robert S. Boyer}} |
|
1292 |
||
1293 |
@Proceedings{cade12, |
|
1294 |
editor = {Alan Bundy}, |
|
1295 |
title = {Automated Deduction --- {CADE}-12 |
|
1296 |
International Conference}, |
|
1297 |
booktitle = {Automated Deduction --- {CADE}-12 |
|
1298 |
International Conference}, |
|
1299 |
year = 1994, |
|
1300 |
series = {LNAI 814}, |
|
1301 |
publisher = {Springer}} |
|
1302 |
||
1303 |
@book{types94, |
|
10186 | 1304 |
editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith}, |
6592 | 1305 |
title = TYPES # {: International Workshop {TYPES '94}}, |
1306 |
booktitle = TYPES # {: International Workshop {TYPES '94}}, |
|
1307 |
year = 1995, |
|
1308 |
publisher = {Springer}, |
|
1309 |
series = {LNCS 996}} |
|
1310 |
||
1311 |
@book{huet-plotkin91, |
|
10186 | 1312 |
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, |
6592 | 1313 |
title = {Logical Frameworks}, |
1314 |
booktitle = {Logical Frameworks}, |
|
1315 |
publisher = CUP, |
|
1316 |
year = 1991} |
|
1317 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1318 |
@book{huet-plotkin93, |
10186 | 1319 |
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, |
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1320 |
title = {Logical Environments}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1321 |
booktitle = {Logical Environments}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1322 |
publisher = CUP, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1323 |
year = 1993} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1324 |
|
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1325 |
@Proceedings{hug93, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1326 |
editor = {J. Joyce and C. Seger}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1327 |
title = {Higher Order Logic Theorem Proving and Its |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1328 |
Applications: HUG '93}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1329 |
booktitle = {Higher Order Logic Theorem Proving and Its |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1330 |
Applications: HUG '93}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1331 |
year = {Published 1994}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1332 |
publisher = {Springer}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1333 |
series = {LNCS 780}} |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1334 |
|
6592 | 1335 |
@proceedings{colog88, |
10186 | 1336 |
editor = {P. Martin-L{\"o}f and G. Mints}, |
6592 | 1337 |
title = {COLOG-88: International Conference on Computer Logic}, |
1338 |
booktitle = {COLOG-88: International Conference on Computer Logic}, |
|
1339 |
year = {Published 1990}, |
|
1340 |
publisher = {Springer}, |
|
1341 |
organization = {Estonian Academy of Sciences}, |
|
1342 |
address = {Tallinn}, |
|
1343 |
series = {LNCS 417}} |
|
1344 |
||
1345 |
@book{odifreddi90, |
|
1346 |
editor = {P. Odifreddi}, |
|
1347 |
title = {Logic and Computer Science}, |
|
1348 |
booktitle = {Logic and Computer Science}, |
|
1349 |
publisher = {Academic Press}, |
|
1350 |
year = 1990} |
|
1351 |
||
1352 |
@proceedings{extensions91, |
|
1353 |
editor = {Peter Schroeder-Heister}, |
|
1354 |
title = {Extensions of Logic Programming}, |
|
1355 |
booktitle = {Extensions of Logic Programming}, |
|
1356 |
year = 1991, |
|
1357 |
series = {LNAI 475}, |
|
1358 |
publisher = {Springer}} |
|
1359 |
||
1360 |
@proceedings{cade10, |
|
1361 |
editor = {Mark E. Stickel}, |
|
1362 |
title = {10th } # CADE, |
|
1363 |
booktitle = {10th } # CADE, |
|
1364 |
year = 1990, |
|
1365 |
publisher = {Springer}, |
|
1366 |
series = {LNAI 449}} |
|
1367 |
||
1368 |
@Proceedings{lics8, |
|
1369 |
editor = {M. Vardi}, |
|
1370 |
title = {Eighth Annual Symposium on Logic in Computer Science}, |
|
1371 |
booktitle = {Eighth Annual Symposium on Logic in Computer Science}, |
|
1372 |
publisher = IEEE, |
|
1373 |
year = 1993} |
|
1374 |
||
1375 |
@book{wos-fest, |
|
1376 |
title = {Automated Reasoning and its Applications: |
|
1377 |
Essays in Honor of {Larry Wos}}, |
|
1378 |
booktitle = {Automated Reasoning and its Applications: |
|
1379 |
Essays in Honor of {Larry Wos}}, |
|
1380 |
publisher = {MIT Press}, |
|
1381 |
year = 1997, |
|
1382 |
editor = {Robert Veroff}} |
|
1383 |
||
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1384 |
@proceedings{fme93, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1385 |
editor = {J. C. P. Woodcock and P. G. Larsen}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1386 |
title = {FME '93: Industrial-Strength Formal Methods}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1387 |
booktitle = {FME '93: Industrial-Strength Formal Methods}, |
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1388 |
year = 1993, |
13009 | 1389 |
publisher = Springer, |
1390 |
series = LNCS, |
|
1391 |
volume = 670} |
|
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset
|
1392 |
|
6592 | 1393 |
@Proceedings{tphols96, |
1394 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, |
|
1395 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, |
|
1396 |
editor = {J. von Wright and J. Grundy and J. Harrison}, |
|
13009 | 1397 |
publisher = Springer, |
1398 |
series = LNCS, |
|
1399 |
volume = 1125, |
|
6592 | 1400 |
year = 1996} |
6670 | 1401 |
|
7041 | 1402 |
@Proceedings{tphols97, |
1403 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, |
|
1404 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, |
|
1405 |
editor = {Elsa L. Gunter and Amy Felty}, |
|
13009 | 1406 |
publisher = Springer, |
1407 |
series = LNCS, |
|
1408 |
volume = 1275, |
|
7041 | 1409 |
year = 1997} |
1410 |
||
1411 |
@Proceedings{tphols98, |
|
1412 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, |
|
1413 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, |
|
1414 |
editor = {Jim Grundy and Malcom Newey}, |
|
13009 | 1415 |
publisher = Springer, |
1416 |
series = LNCS, |
|
1417 |
volume = 1479, |
|
7041 | 1418 |
year = 1998} |
1419 |
||
6670 | 1420 |
@Proceedings{tphols99, |
1421 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, |
|
1422 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, |
|
7350 | 1423 |
editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and |
1424 |
Paulin, C. and Thery, L.}, |
|
13009 | 1425 |
publisher = Springer, |
1426 |
series = LNCS, |
|
1427 |
volume = 1690, |
|
6670 | 1428 |
year = 1999} |
1429 |
||
12878 | 1430 |
@Proceedings{tphols2000, |
1431 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, |
|
1432 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, |
|
1433 |
editor = {J. Harrison and M. Aagaard}, |
|
13009 | 1434 |
publisher = Springer, |
1435 |
series = LNCS, |
|
1436 |
volume = 1869, |
|
12878 | 1437 |
year = 2000} |
1438 |
||
1439 |
@Proceedings{tphols2001, |
|
1440 |
title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, |
|
1441 |
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, |
|
1442 |
editor = {R. J. Boulton and P. B. Jackson}, |
|
13009 | 1443 |
publisher = Springer, |
1444 |
series = LNCS, |
|
1445 |
volume = 2152, |
|
12878 | 1446 |
year = 2001} |