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