author  wenzelm 
Wed, 13 Oct 1999 19:44:15 +0200  
changeset 7858  2cd88d1eec0c 
parent 7350  708bd83745c5 
child 7966  4db0cdd752f7 
permissions  rwrr 
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="NorthHolland"} 

12 
@string{Prentice="PrenticeHall"} 

6607  13 
@string{PH="PrenticeHall"} 
6592  14 
@string{Springer="SpringerVerlag"} 
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 = {65116}, 

43 
editor = {David A. Turner}, 

44 
booktitle = {Research Topics in Functional Programming}, 

45 
publisher = {AddisonWesley}, 

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 = {739782}, 

60 
crossref = {barwisehandbk}} 

61 

62 
@Book{aczel88, 

63 
author = {Peter Aczel}, 

64 
title = {NonWellFounded 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 = {213237}} 

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 

7209  82 
@Misc{isamode, 
83 
author = {David Aspinall}, 

84 
title = {Isamode}, 

85 
note = {\url{http://www.dcs.ed.ac.uk/home/da/Isamode/}} 

86 
} 

87 

88 
@Misc{proofgeneral, 

89 
author = {David Aspinall and others}, 

90 
title = {{P}roof {G}eneral  {O}rganize your proofs!}, 

91 
note = {\url{http://www.dcs.ed.ac.uk/home/proofgen/}} 

92 
} 

93 

6592  94 
%B 
95 

96 
@incollection{basin91, 

97 
author = {David Basin and Matt Kaufmann}, 

98 
title = {The {BoyerMoore} Prover and {Nuprl}: An Experimental 

99 
Comparison}, 

100 
crossref = {huetplotkin91}, 

101 
pages = {89119}} 

102 

6624  103 

104 
@InProceedings{BerghoferWenzel:1999:TPHOL, 

105 
author = {Stefan Berghofer and Markus Wenzel}, 

7041  106 
title = {Inductive datatypes in {HOL}  lessons learned in 
107 
{F}ormal{L}ogic {E}ngineering}, 

108 
crossref = {tphols99}} 

6624  109 

6607  110 
@book{BirdWadler,author="Richard Bird and Philip Wadler", 
111 
title="Introduction to Functional Programming",publisher=PH,year=1988} 

112 

6592  113 
@Article{boyer86, 
114 
author = {Robert Boyer and Ewing Lusk and William McCune and Ross 

115 
Overbeek and Mark Stickel and Lawrence Wos}, 

116 
title = {Set Theory in FirstOrder Logic: Clauses for {G\"{o}del's} 

117 
Axioms}, 

118 
journal = JAR, 

119 
year = 1986, 

120 
volume = 2, 

121 
number = 3, 

122 
pages = {287327}} 

123 

124 
@book{bm79, 

125 
author = {Robert S. Boyer and J Strother Moore}, 

126 
title = {A Computational Logic}, 

127 
publisher = {Academic Press}, 

128 
year = 1979} 

129 

130 
@book{bm88book, 

131 
author = {Robert S. Boyer and J Strother Moore}, 

132 
title = {A Computational Logic Handbook}, 

133 
publisher = {Academic Press}, 

134 
year = 1988} 

135 

136 
@Article{debruijn72, 

137 
author = {N. G. de Bruijn}, 

138 
title = {Lambda Calculus Notation with Nameless Dummies, 

139 
a Tool for Automatic Formula Manipulation, 

140 
with Application to the {ChurchRosser Theorem}}, 

141 
journal = {Indag. Math.}, 

142 
volume = 34, 

143 
pages = {381392}, 

144 
year = 1972} 

145 

146 
%C 

147 

148 
@TechReport{camilleri92, 

149 
author = {J. Camilleri and T. F. Melham}, 

150 
title = {Reasoning with Inductively Defined Relations in the 

151 
{HOL} Theorem Prover}, 

152 
institution = CUCL, 

153 
year = 1992, 

154 
number = 265, 

155 
month = Aug} 

156 

157 
@Book{charniak80, 

158 
author = {E. Charniak and C. K. Riesbeck and D. V. McDermott}, 

159 
title = {Artificial Intelligence Programming}, 

160 
publisher = {Lawrence Erlbaum Associates}, 

161 
year = 1980} 

162 

163 
@article{church40, 

164 
author = "Alonzo Church", 

165 
title = "A Formulation of the Simple Theory of Types", 

166 
journal = JSL, 

167 
year = 1940, 

168 
volume = 5, 

169 
pages = "5668"} 

170 

171 
@PhdThesis{coen92, 

172 
author = {Martin D. Coen}, 

173 
title = {Interactive Program Derivation}, 

174 
school = {University of Cambridge}, 

175 
note = {Computer Laboratory Technical Report 272}, 

176 
month = nov, 

177 
year = 1992} 

178 

179 
@book{constable86, 

180 
author = {R. L. Constable and others}, 

181 
title = {Implementing Mathematics with the Nuprl Proof 

182 
Development System}, 

183 
publisher = Prentice, 

184 
year = 1986} 

185 

186 
%D 

187 

6745  188 
@Book{daveypriestley, 
6592  189 
author = {B. A. Davey and H. A. Priestley}, 
190 
title = {Introduction to Lattices and Order}, 

191 
publisher = CUP, 

192 
year = 1990} 

193 

194 
@Book{devlin79, 

195 
author = {Keith J. Devlin}, 

196 
title = {Fundamentals of Contemporary Set Theory}, 

197 
publisher = {Springer}, 

198 
year = 1979} 

199 

200 
@book{dummett, 

201 
author = {Michael Dummett}, 

202 
title = {Elements of Intuitionism}, 

203 
year = 1977, 

204 
publisher = {Oxford University Press}} 

205 

206 
@incollection{dybjer91, 

207 
author = {Peter Dybjer}, 

208 
title = {Inductive Sets and Families in {MartinL\"of's} Type 

209 
Theory and Their SetTheoretic Semantics}, 

210 
crossref = {huetplotkin91}, 

211 
pages = {280306}} 

212 

213 
@Article{dyckhoff, 

214 
author = {Roy Dyckhoff}, 

215 
title = {ContractionFree Sequent Calculi for Intuitionistic Logic}, 

216 
journal = JSL, 

217 
year = 1992, 

218 
volume = 57, 

219 
number = 3, 

220 
pages = {795807}} 

221 

222 
%F 

223 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

224 
@Article{IMPS, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

225 
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

226 
Thayer}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

227 
title = {{IMPS}: An Interactive Mathematical Proof System}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

228 
journal = JAR, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

229 
volume = 11, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

230 
number = 2, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

231 
year = 1993, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

232 
pages = {213248}} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

233 

6592  234 
@InProceedings{felty91a, 
235 
Author = {Amy Felty}, 

236 
Title = {A Logic Program for Transforming Sequent Proofs to Natural 

237 
Deduction Proofs}, 

238 
crossref = {extensions91}, 

239 
pages = {157178}} 

240 

241 
@TechReport{frost93, 

242 
author = {Jacob Frost}, 

243 
title = {A Case Study of Coinduction in {Isabelle HOL}}, 

244 
institution = CUCL, 

245 
number = 308, 

246 
year = 1993, 

247 
month = Aug} 

248 

249 
%revised version of frost93 

250 
@TechReport{frost95, 

251 
author = {Jacob Frost}, 

252 
title = {A Case Study of Coinduction in {Isabelle}}, 

253 
institution = CUCL, 

254 
number = 359, 

255 
year = 1995, 

256 
month = Feb} 

257 

258 
@inproceedings{OBJ, 

259 
author = {K. Futatsugi and J.A. Goguen and JeanPierre Jouannaud 

260 
and J. Meseguer}, 

261 
title = {Principles of {OBJ2}}, 

262 
booktitle = POPL, 

263 
year = 1985, 

264 
pages = {5266}} 

265 

266 
%G 

267 

268 
@book{gallier86, 

269 
author = {J. H. Gallier}, 

270 
title = {Logic for Computer Science: 

271 
Foundations of Automatic Theorem Proving}, 

272 
year = 1986, 

273 
publisher = {Harper \& Row}} 

274 

275 
@Book{galton90, 

276 
author = {Antony Galton}, 

277 
title = {Logic for Information Technology}, 

278 
publisher = {Wiley}, 

279 
year = 1990} 

280 

281 
@InProceedings{gimenezcodifying, 

282 
author = {Eduardo Gim{\'e}nez}, 

283 
title = {Codifying Guarded Definitions with Recursive Schemes}, 

284 
crossref = {types94}, 

285 
pages = {3959} 

286 
} 

287 

288 
@Book{mgordonhol, 

289 
author = {M. J. C. Gordon and T. F. Melham}, 

290 
title = {Introduction to {HOL}: A Theorem Proving Environment for 

291 
Higher Order Logic}, 

292 
publisher = CUP, 

293 
year = 1993} 

294 

295 
@book{mgordon79, 

296 
author = {Michael J. C. Gordon and Robin Milner and Christopher P. 

297 
Wadsworth}, 

298 
title = {Edinburgh {LCF}: A Mechanised Logic of Computation}, 

299 
year = 1979, 

300 
publisher = {Springer}, 

301 
series = {LNCS 78}} 

302 

6607  303 
@inproceedings{GunterHOL92,author={Elsa L. Gunter}, 
304 
title={Why we can't have {SML} style datatype declarations in {HOL}}, 

305 
booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\ 

306 
IFIP TC10/WG10.2 Intl. Workshop, 1992}, 

307 
editor={L.J.M. Claesen and M.J.C. Gordon}, 

308 
publisher=NH,year=1993,pages={561568}} 

309 

6592  310 
@InProceedings{guntertrees, 
311 
author = {Elsa L. Gunter}, 

312 
title = {A Broader Class of Trees for Recursive Type Definitions for 

313 
{HOL}}, 

314 
crossref = {hug93}, 

315 
pages = {141154}} 

316 

317 
%H 

318 

319 
@Book{halmos60, 

320 
author = {Paul R. Halmos}, 

321 
title = {Naive Set Theory}, 

322 
publisher = {Van Nostrand}, 

323 
year = 1960} 

324 

325 
@Book{hennessy90, 

326 
author = {Matthew Hennessy}, 

327 
title = {The Semantics of Programming Languages: An Elementary 

328 
Introduction Using Structural Operational Semantics}, 

329 
publisher = {Wiley}, 

330 
year = 1990} 

331 

332 
@Article{haskellreport, 

333 
author = {Paul Hudak and Simon Peyton Jones and Philip Wadler}, 

334 
title = {Report on the Programming Language {Haskell}: A 

335 
Nonstrict, Purely Functional Language}, 

336 
journal = SIGPLAN, 

337 
year = 1992, 

338 
volume = 27, 

339 
number = 5, 

340 
month = May, 

341 
note = {Version 1.2}} 

342 

343 
@Article{haskelltutorial, 

344 
author = {Paul Hudak and Joseph H. Fasel}, 

345 
title = {A Gentle Introduction to {Haskell}}, 

346 
journal = SIGPLAN, 

347 
year = 1992, 

348 
volume = 27, 

349 
number = 5, 

350 
month = May} 

351 

352 
@article{huet75, 

353 
author = {G. P. Huet}, 

354 
title = {A Unification Algorithm for Typed $\lambda$Calculus}, 

355 
journal = TCS, 

356 
volume = 1, 

357 
year = 1975, 

358 
pages = {2757}} 

359 

360 
@article{huet78, 

361 
author = {G. P. Huet and B. Lang}, 

362 
title = {Proving and Applying Program Transformations Expressed with 

363 
SecondOrder Patterns}, 

364 
journal = acta, 

365 
volume = 11, 

366 
year = 1978, 

367 
pages = {3155}} 

368 

369 
@inproceedings{huet88, 

370 
author = {G\'erard Huet}, 

371 
title = {Induction Principles Formalized in the {Calculus of 

372 
Constructions}}, 

373 
booktitle = {Programming of Future Generation Computers}, 

374 
editor = {K. Fuchi and M. Nivat}, 

375 
year = 1988, 

376 
pages = {205216}, 

377 
publisher = {Elsevier}} 

378 

7041  379 
@InProceedings{Harrison:1996:MizarHOL, 
380 
author = {J. Harrison}, 

381 
title = {A {Mizar} Mode for {HOL}}, 

382 
pages = {203220}, 

383 
crossref = {tphols96}} 

384 

6592  385 
%K 
386 

6670  387 
@InProceedings{kammuellerlocales, 
388 
author = {Florian Kamm{\"u}ller and Markus Wenzel and 

389 
Lawrence C. Paulson}, 

390 
title = {Locales: A Sectioning Concept for {Isabelle}}, 

391 
crossref = {tphols99}} 

392 

6607  393 
@book{Knuth375,author={Donald E. Knuth}, 
394 
title={The Art of Computer Programming, Volume 3: Sorting and Searching}, 

395 
publisher={AddisonWesley},year=1975} 

396 

6592  397 
@Book{kunen80, 
398 
author = {Kenneth Kunen}, 

399 
title = {Set Theory: An Introduction to Independence Proofs}, 

400 
publisher = NH, 

401 
year = 1980} 

402 

403 
%M 

404 

405 
@Article{mw81, 

406 
author = {Zohar Manna and Richard Waldinger}, 

407 
title = {Deductive Synthesis of the Unification Algorithm}, 

408 
journal = SCP, 

409 
year = 1981, 

410 
volume = 1, 

411 
number = 1, 

412 
pages = {548}} 

413 

414 
@InProceedings{martinnipkow, 

415 
author = {Ursula Martin and Tobias Nipkow}, 

416 
title = {Ordered Rewriting and Confluence}, 

417 
crossref = {cade10}, 

418 
pages = {366380}} 

419 

420 
@book{martinlof84, 

421 
author = {Per MartinL\"of}, 

422 
title = {Intuitionistic type theory}, 

423 
year = 1984, 

424 
publisher = {Bibliopolis}} 

425 

426 
@incollection{melham89, 

427 
author = {Thomas F. Melham}, 

428 
title = {Automating Recursive Type Definitions in Higher Order 

429 
Logic}, 

430 
pages = {341386}, 

431 
crossref = {birtwistle89}} 

432 

433 
@Article{millermixed, 

434 
Author = {Dale Miller}, 

435 
Title = {Unification Under a Mixed Prefix}, 

436 
journal = JSC, 

437 
volume = 14, 

438 
number = 4, 

439 
pages = {321358}, 

440 
Year = 1992} 

441 

442 
@Article{milner78, 

443 
author = {Robin Milner}, 

444 
title = {A Theory of Type Polymorphism in Programming}, 

445 
journal = "J. Comp.\ Sys.\ Sci.", 

446 
year = 1978, 

447 
volume = 17, 

448 
pages = {348375}} 

449 

450 
@TechReport{milnerind, 

451 
author = {Robin Milner}, 

452 
title = {How to Derive Inductions in {LCF}}, 

453 
institution = Edinburgh, 

454 
year = 1980, 

455 
type = {note}} 

456 

457 
@Article{milnercoind, 

458 
author = {Robin Milner and Mads Tofte}, 

459 
title = {Coinduction in Relational Semantics}, 

460 
journal = TCS, 

461 
year = 1991, 

462 
volume = 87, 

463 
pages = {209220}} 

464 

465 
@Book{milner89, 

466 
author = {Robin Milner}, 

467 
title = {Communication and Concurrency}, 

468 
publisher = Prentice, 

469 
year = 1989} 

470 

471 
@PhdThesis{monahan84, 

472 
author = {Brian Q. Monahan}, 

473 
title = {Data Type Proofs using Edinburgh {LCF}}, 

474 
school = {University of Edinburgh}, 

475 
year = 1984} 

476 

6607  477 
@article{MuellerNvOS99, 
478 
author= 

6745  479 
{Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, 
6607  480 
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999} 
481 

6592  482 
%N 
483 

484 
@InProceedings{NaraschewskiWTPHOLs98, 

485 
author = {Wolfgang Naraschewski and Markus Wenzel}, 

486 
title = 

7041  487 
{ObjectOriented Verification based on Record Subtyping in 
488 
HigherOrder Logic}, 

489 
crossref = {tphols98}} 

6592  490 

491 
@inproceedings{nazarethnipkow, 

492 
author = {Dieter Nazareth and Tobias Nipkow}, 

493 
title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, 

494 
crossref = {tphols96}, 

495 
pages = {331345}, 

496 
year = 1996} 

497 

498 
@inproceedings{nipkowW, 

499 
author = {Wolfgang Naraschewski and Tobias Nipkow}, 

500 
title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, 

501 
booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, 

502 
editor = {E. Gim\'enez and C. PaulinMohring}, 

503 
publisher = Springer, 

504 
series = LNCS, 

505 
volume = 1512, 

506 
pages = {317332}, 

507 
year = 1998} 

508 

509 
@inproceedings{NipkowCR, 

510 
author = {Tobias Nipkow}, 

511 
title = {More {ChurchRosser} Proofs (in {Isabelle/HOL})}, 

512 
booktitle = {Automated Deduction  CADE13}, 

513 
editor = {M. McRobbie and J.K. Slaney}, 

514 
publisher = Springer, 

515 
series = LNCS, 

516 
volume = 1104, 

517 
pages = {733747}, 

518 
year = 1996} 

519 

520 
% WAS NipkowLICS93 

521 
@InProceedings{nipkowpatterns, 

522 
title = {Functional Unification of HigherOrder Patterns}, 

523 
author = {Tobias Nipkow}, 

524 
pages = {6474}, 

525 
crossref = {lics8}, 

6745  526 
url = {\url{ftp://ftp.informatik.tumuenchen.de/local/lehrstuhl/nipkow/lics93.html}}, 
6592  527 
keywords = {unification}} 
528 

529 
@article{nipkowIMP, 

530 
author = {Tobias Nipkow}, 

531 
title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook}, 

532 
journal = FAC, 

533 
volume = 10, 

534 
pages = {171186}, 

535 
year = 1998} 

536 

6607  537 
@manual{isabelleHOL, 
538 
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, 

539 
title = {{Isabelle}'s Logics: {HOL}}, 

540 
institution = {Institut f\"ur Informatik, Technische Universi\"at 

541 
M\"unchen and Computer Laboratory, University of Cambridge}} 

542 

6592  543 
@article{nipkowprehofer, 
544 
author = {Tobias Nipkow and Christian Prehofer}, 

545 
title = {Type Reconstruction for Type Classes}, 

546 
journal = JFP, 

547 
volume = 5, 

548 
number = 2, 

549 
year = 1995, 

550 
pages = {201224}} 

551 

552 
@Article{noel, 

553 
author = {Philippe No{\"e}l}, 

554 
title = {Experimenting with {Isabelle} in {ZF} Set Theory}, 

555 
journal = JAR, 

556 
volume = 10, 

557 
number = 1, 

558 
pages = {1558}, 

559 
year = 1993} 

560 

561 
@book{nordstrom90, 

562 
author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith}, 

563 
title = {Programming in {MartinL\"of}'s Type Theory. An 

564 
Introduction}, 

565 
publisher = {Oxford University Press}, 

566 
year = 1990} 

567 

568 
%O 

569 

570 
@Manual{pvslanguage, 

571 
title = {The {PVS} specification language}, 

572 
author = {S. Owre and N. Shankar and J. M. Rushby}, 

573 
organization = {Computer Science Laboratory, SRI International}, 

574 
address = {Menlo Park, CA}, 

6745  575 
note = {Beta release}, 
6592  576 
year = 1993, 
577 
month = apr, 

6619  578 
url = {\url{http://www.csl.sri.com/reports/pvslanguage.dvi.Z}}} 
6592  579 

580 
%P 

581 

582 
% replaces paulin92 

583 
@InProceedings{paulintlca, 

584 
author = {Christine PaulinMohring}, 

585 
title = {Inductive Definitions in the System {Coq}: Rules and 

586 
Properties}, 

587 
crossref = {tlca93}, 

588 
pages = {328345}} 

589 

590 
@InProceedings{paulsonCADE, 

591 
author = {Lawrence C. Paulson}, 

592 
title = {A Fixedpoint Approach to Implementing (Co)Inductive 

593 
Definitions}, 

594 
pages = {148161}, 

595 
crossref = {cade12}} 

596 

597 
@InProceedings{paulsonCOLOG, 

598 
author = {Lawrence C. Paulson}, 

599 
title = {A Formulation of the Simple Theory of Types (for 

600 
{Isabelle})}, 

601 
pages = {246274}, 

602 
crossref = {colog88}, 

6619  603 
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175lcpsimple.dvi.gz}}} 
6592  604 

605 
@Article{paulsoncoind, 

606 
author = {Lawrence C. Paulson}, 

607 
title = {Mechanizing Coinduction and Corecursion in HigherOrder 

608 
Logic}, 

609 
journal = JLC, 

610 
year = 1997, 

611 
volume = 7, 

612 
number = 2, 

613 
month = mar, 

614 
pages = {175204}} 

615 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

616 
@manual{isabelleref, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

617 
author = {Lawrence C. Paulson}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

618 
title = {The {Isabelle} Reference Manual}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

619 
institution = CUCL} 
6607  620 

621 
@manual{isabelleZF, 

6592  622 
author = {Lawrence C. Paulson}, 
623 
title = {{Isabelle}'s Logics: {FOL} and {ZF}}, 

6607  624 
institution = CUCL} 
6592  625 

626 
@article{paulsonfound, 

627 
author = {Lawrence C. Paulson}, 

628 
title = {The Foundation of a Generic Theorem Prover}, 

629 
journal = JAR, 

630 
volume = 5, 

631 
number = 3, 

632 
pages = {363397}, 

633 
year = 1989, 

6619  634 
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130lcpgenerictheoremprover.dvi.gz}}} 
6592  635 

636 
%replaces paulsonfinal 

637 
@Article{paulsonmscs, 

638 
author = {Lawrence C. Paulson}, 

639 
title = {Final Coalgebras as Greatest Fixed Points in ZF Set Theory}, 

640 
journal = {Mathematical Structures in Computer Science}, 

641 
year = 1999, 

642 
volume = 9, 

643 
note = {in press}} 

644 

645 
@InCollection{paulsongeneric, 

646 
author = {Lawrence C. Paulson}, 

647 
title = {Generic Automatic Proof Tools}, 

648 
crossref = {wosfest}, 

649 
chapter = 3} 

650 

651 
@Article{paulsongr, 

652 
author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski}, 

653 
title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of 

654 
Choice}, 

655 
journal = JAR, 

656 
year = 1996, 

657 
volume = 17, 

658 
number = 3, 

659 
month = dec, 

660 
pages = {291323}} 

661 

662 
@InCollection{paulsonhandbook, 

663 
author = {Lawrence C. Paulson}, 

664 
title = {Designing a Theorem Prover}, 

665 
crossref = {handbklics2}, 

666 
pages = {415475}} 

667 

668 
@Book{paulsonisabook, 

669 
author = {Lawrence C. Paulson}, 

670 
title = {Isabelle: A Generic Theorem Prover}, 

671 
publisher = {Springer}, 

672 
year = 1994, 

673 
note = {LNCS 828}} 

674 

675 
@InCollection{paulsonmarkt, 

676 
author = {Lawrence C. Paulson}, 

677 
title = {Tool Support for Logics of Programs}, 

678 
booktitle = {Mathematical Methods in Program Development: 

679 
Summer School Marktoberdorf 1996}, 

680 
publisher = {Springer}, 

681 
pages = {461498}, 

682 
year = {Published 1997}, 

683 
editor = {Manfred Broy}, 

684 
series = {NATO ASI Series F}} 

685 

686 
%replaces PaulsonML and paulson91 

687 
@book{paulsonml2, 

688 
author = {Lawrence C. Paulson}, 

689 
title = {{ML} for the Working Programmer}, 

690 
year = 1996, 

691 
edition = {2nd}, 

692 
publisher = CUP} 

693 

694 
@article{paulsonnatural, 

695 
author = {Lawrence C. Paulson}, 

696 
title = {Natural Deduction as Higherorder Resolution}, 

697 
journal = JLP, 

698 
volume = 3, 

699 
pages = {237258}, 

700 
year = 1986, 

6619  701 
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82lcphigherorderresolution.dvi.gz}}} 
6592  702 

703 
@Article{paulsonsetI, 

704 
author = {Lawrence C. Paulson}, 

705 
title = {Set Theory for Verification: {I}. {From} 

706 
Foundations to Functions}, 

707 
journal = JAR, 

708 
volume = 11, 

709 
number = 3, 

710 
pages = {353389}, 

711 
year = 1993, 

6745  712 
url = {\url{ftp://ftp.cl.cam.ac.uk/ml/setI.ps.gz}}} 
6592  713 

714 
@Article{paulsonsetII, 

715 
author = {Lawrence C. Paulson}, 

716 
title = {Set Theory for Verification: {II}. {Induction} and 

717 
Recursion}, 

718 
journal = JAR, 

719 
volume = 15, 

720 
number = 2, 

721 
pages = {167215}, 

722 
year = 1995, 

6619  723 
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312lcpsetII.ps.gz}}} 
6592  724 

725 
@article{paulson85, 

726 
author = {Lawrence C. Paulson}, 

727 
title = {Verifying the Unification Algorithm in {LCF}}, 

728 
journal = SCP, 

729 
volume = 5, 

730 
pages = {143170}, 

731 
year = 1985} 

732 

733 
%replqces PaulsonLCF 

734 
@book{paulson87, 

735 
author = {Lawrence C. Paulson}, 

736 
title = {Logic and Computation: Interactive proof with Cambridge 

737 
LCF}, 

738 
year = 1987, 

739 
publisher = CUP} 

740 

741 
@incollection{paulson700, 

742 
author = {Lawrence C. Paulson}, 

743 
title = {{Isabelle}: The Next 700 Theorem Provers}, 

744 
crossref = {odifreddi90}, 

745 
pages = {361386}, 

6619  746 
url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143lcpexperience.dvi.gz}}} 
6592  747 

748 
% replaces paulsonns and paulsonsecurity 

749 
@Article{paulsonjcs, 

750 
author = {Lawrence C. Paulson}, 

751 
title = {The Inductive Approach to Verifying Cryptographic Protocols}, 

752 
journal = JCS, 

753 
year = 1998, 

754 
volume = 6, 

755 
pages = {85128}} 

756 

757 
@article{pelletier86, 

758 
author = {F. J. Pelletier}, 

759 
title = {Seventyfive Problems for Testing Automatic Theorem 

760 
Provers}, 

761 
journal = JAR, 

762 
volume = 2, 

763 
pages = {191216}, 

764 
year = 1986, 

765 
note = {Errata, JAR 4 (1988), 235236 and JAR 18 (1997), 135}} 

766 

767 
@Article{pitts94, 

768 
author = {Andrew M. Pitts}, 

769 
title = {A Coinduction Principle for Recursively Defined Domains}, 

770 
journal = TCS, 

771 
volume = 124, 

772 
pages = {195219}, 

773 
year = 1994} 

774 

775 
@Article{plaisted90, 

776 
author = {David A. Plaisted}, 

777 
title = {A SequentStyle Model Elimination Strategy and a Positive 

778 
Refinement}, 

779 
journal = JAR, 

780 
year = 1990, 

781 
volume = 6, 

782 
number = 4, 

783 
pages = {389402}} 

784 

785 
%Q 

786 

787 
@Article{quaife92, 

788 
author = {Art Quaife}, 

789 
title = {Automated Deduction in {von NeumannBernaysG\"{o}del} Set 

790 
Theory}, 

791 
journal = JAR, 

792 
year = 1992, 

793 
volume = 8, 

794 
number = 1, 

795 
pages = {91147}} 

796 

797 
%R 

798 

799 
@TechReport{rasmussen95, 

800 
author = {Ole Rasmussen}, 

801 
title = {The {ChurchRosser} Theorem in {Isabelle}: A Proof Porting 

802 
Experiment}, 

803 
institution = {Computer Laboratory, University of Cambridge}, 

804 
year = 1995, 

805 
number = 364, 

806 
month = may, 

6619  807 
url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364or200churchrosserisabelle.ps.gz}}} 
6592  808 

809 
@Book{reeves90, 

810 
author = {Steve Reeves and Michael Clarke}, 

811 
title = {Logic for Computer Science}, 

812 
publisher = {AddisonWesley}, 

813 
year = 1990} 

814 

7041  815 
@InProceedings{Rudnicki:1992:MizarOverview, 
816 
author = {P. Rudnicki}, 

817 
title = {An Overview of the {MIZAR} Project}, 

818 
booktitle = {1992 Workshop on Types for Proofs and Programs}, 

819 
year = 1992, 

820 
organization = {Chalmers University of Technology}, 

821 
publisher = {Bastad} 

822 
} 

823 

6592  824 
%S 
825 

826 
@inproceedings{saaltinkfme, 

827 
author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and 

828 
Dan Craigen and Irwin Meisels}, 

829 
title = {An {EVES} Data Abstraction Example}, 

830 
pages = {578596}, 

831 
crossref = {fme93}} 

832 

833 
@inproceedings{slindtfl, 

834 
author = {Konrad Slind}, 

835 
title = {Function Definition in Higher Order Logic}, 

836 
booktitle = {Theorem Proving in Higher Order Logics}, 

837 
editor = {J. von Wright and J. Grundy and J. Harrison}, 

838 
publisher = Springer, 

839 
series = LNCS, 

840 
volume = 1125, 

841 
pages = {381397}, 

842 
year = 1996} 

843 

844 
@book{suppes72, 

845 
author = {Patrick Suppes}, 

846 
title = {Axiomatic Set Theory}, 

847 
year = 1972, 

848 
publisher = {Dover}} 

849 

850 
@InCollection{szasz93, 

851 
author = {Nora Szasz}, 

852 
title = {A Machine Checked Proof that {Ackermann's} Function is not 

853 
Primitive Recursive}, 

854 
crossref = {huetplotkin93}, 

855 
pages = {317338}} 

856 

7041  857 
@TechReport{Syme:1997:DECLARE, 
858 
author = {D. Syme}, 

859 
title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic}, 

860 
institution = {University of Cambridge Computer Laboratory}, 

861 
year = 1997, 

862 
number = 416 

863 
} 

864 

865 
@PhdThesis{Syme:1998:thesis, 

866 
author = {D. Syme}, 

867 
title = {Declarative Theorem Proving for Operational Semantics}, 

868 
school = {University of Cambridge}, 

869 
year = 1998, 

870 
note = {Submitted} 

871 
} 

872 

873 
@InProceedings{Syme:1999:TPHOL, 

874 
author = {D. Syme}, 

875 
title = {Three Tactic Theorem Proving}, 

876 
crossref = {tphols99}} 

877 

6592  878 
%T 
879 

880 
@book{takeuti87, 

881 
author = {G. Takeuti}, 

882 
title = {Proof Theory}, 

883 
year = 1987, 

884 
publisher = NH, 

885 
edition = {2nd}} 

886 

887 
@Book{thompson91, 

888 
author = {Simon Thompson}, 

889 
title = {Type Theory and Functional Programming}, 

890 
publisher = {AddisonWesley}, 

891 
year = 1991} 

892 

7041  893 
@Unpublished{Trybulec:1993:MizarFeatures, 
894 
author = {A. Trybulec}, 

895 
title = {Some Features of the {Mizar} Language}, 

896 
note = {Presented at a workshop in Turin, Italy}, 

897 
year = 1993 

898 
} 

899 

6592  900 
%V 
901 

902 
@Unpublished{voelker94, 

903 
author = {Norbert V\"olker}, 

904 
title = {The Verification of a Timer Program using {Isabelle/HOL}}, 

6745  905 
url = {\url{ftp://ftp.fernunihagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}}, 
6592  906 
year = 1994, 
907 
month = aug} 

908 

909 
%W 

910 

7858  911 
@manual{isabellesys, 
912 
author = {Markus Wenzel and Stefan Berghofer}, 

913 
title = {The {Isabelle} System Manual}, 

914 
institution = TUM} 

915 

916 
@manual{isabelleisarref, 

917 
author = {Markus Wenzel}, 

918 
title = {The {Isabelle Isar} Reference Manual}, 

919 
institution = TUM} 

920 

921 

7041  922 
@InProceedings{Wenzel:1999:TPHOL, 
923 
author = {Markus Wenzel}, 

924 
title = {{Isar}  a Generic Interpretative Approach to Readable Formal Proof Documents}, 

925 
crossref = {tphols99}} 

6624  926 

927 
@InProceedings{Wenzel:1997:TPHOL, 

928 
author = {Markus Wenzel}, 

929 
title = {Type Classes and Overloading in HigherOrder Logic}, 

7041  930 
crossref = {tphols97}} 
931 

932 

6624  933 

6592  934 
@book{principia, 
935 
author = {A. N. Whitehead and B. Russell}, 

936 
title = {Principia Mathematica}, 

937 
year = 1962, 

938 
publisher = CUP, 

939 
note = {Paperback edition to *56, 

940 
abridged from the 2nd edition (1927)}} 

941 

942 
@book{winskel93, 

943 
author = {Glynn Winskel}, 

944 
title = {The Formal Semantics of Programming Languages}, 

945 
publisher = MIT,year=1993} 

946 

947 
@InCollection{wosbledsoe, 

948 
author = {Larry Wos}, 

949 
title = {Automated Reasoning and {Bledsoe's} Dream for the Field}, 

950 
crossref = {bledsoefest}, 

951 
pages = {297342}} 

952 

953 

954 
% CROSS REFERENCES 

955 

956 
@book{handbklics2, 

957 
editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum}, 

958 
title = {Handbook of Logic in Computer Science}, 

959 
booktitle = {Handbook of Logic in Computer Science}, 

960 
publisher = {Oxford University Press}, 

961 
year = 1992, 

962 
volume = 2} 

963 

964 
@book{types93, 

965 
editor = {Henk Barendregt and Tobias Nipkow}, 

966 
title = TYPES # {: International Workshop {TYPES '93}}, 

967 
booktitle = TYPES # {: International Workshop {TYPES '93}}, 

968 
year = {published 1994}, 

969 
publisher = {Springer}, 

970 
series = {LNCS 806}} 

971 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

972 
@book{barwisehandbk, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

973 
editor = {J. Barwise}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

974 
title = {Handbook of Mathematical Logic}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

975 
booktitle = {Handbook of Mathematical Logic}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

976 
year = 1977, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

977 
publisher = NH} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

978 

6592  979 
@Proceedings{tlca93, 
980 
title = {Typed Lambda Calculi and Applications}, 

981 
booktitle = {Typed Lambda Calculi and Applications}, 

982 
editor = {M. Bezem and J.F. Groote}, 

983 
year = 1993, 

984 
publisher = {Springer}, 

985 
series = {LNCS 664}} 

986 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

987 
@book{birtwistle89, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

988 
editor = {Graham Birtwistle and P. A. Subrahmanyam}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

989 
title = {Current Trends in Hardware Verification and Automated 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

990 
Theorem Proving}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

991 
booktitle = {Current Trends in Hardware Verification and Automated 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

992 
Theorem Proving}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

993 
publisher = {Springer}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

994 
year = 1989} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

995 

6592  996 
@book{bledsoefest, 
997 
title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, 

998 
booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, 

999 
publisher = {Kluwer Academic Publishers}, 

1000 
year = 1991, 

1001 
editor = {Robert S. Boyer}} 

1002 

1003 
@Proceedings{cade12, 

1004 
editor = {Alan Bundy}, 

1005 
title = {Automated Deduction  {CADE}12 

1006 
International Conference}, 

1007 
booktitle = {Automated Deduction  {CADE}12 

1008 
International Conference}, 

1009 
year = 1994, 

1010 
series = {LNAI 814}, 

1011 
publisher = {Springer}} 

1012 

1013 
@book{types94, 

1014 
editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith}, 

1015 
title = TYPES # {: International Workshop {TYPES '94}}, 

1016 
booktitle = TYPES # {: International Workshop {TYPES '94}}, 

1017 
year = 1995, 

1018 
publisher = {Springer}, 

1019 
series = {LNCS 996}} 

1020 

1021 
@book{huetplotkin91, 

1022 
editor = {{G\'erard} Huet and Gordon Plotkin}, 

1023 
title = {Logical Frameworks}, 

1024 
booktitle = {Logical Frameworks}, 

1025 
publisher = CUP, 

1026 
year = 1991} 

1027 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1028 
@book{huetplotkin93, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1029 
editor = {{G\'erard} Huet and Gordon Plotkin}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1030 
title = {Logical Environments}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1031 
booktitle = {Logical Environments}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1032 
publisher = CUP, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1033 
year = 1993} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1034 

250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1035 
@Proceedings{hug93, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1036 
editor = {J. Joyce and C. Seger}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1037 
title = {Higher Order Logic Theorem Proving and Its 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1038 
Applications: HUG '93}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1039 
booktitle = {Higher Order Logic Theorem Proving and Its 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1040 
Applications: HUG '93}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1041 
year = {Published 1994}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1042 
publisher = {Springer}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1043 
series = {LNCS 780}} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1044 

6592  1045 
@proceedings{colog88, 
1046 
editor = {P. MartinL\"of and G. Mints}, 

1047 
title = {COLOG88: International Conference on Computer Logic}, 

1048 
booktitle = {COLOG88: International Conference on Computer Logic}, 

1049 
year = {Published 1990}, 

1050 
publisher = {Springer}, 

1051 
organization = {Estonian Academy of Sciences}, 

1052 
address = {Tallinn}, 

1053 
series = {LNCS 417}} 

1054 

1055 
@book{odifreddi90, 

1056 
editor = {P. Odifreddi}, 

1057 
title = {Logic and Computer Science}, 

1058 
booktitle = {Logic and Computer Science}, 

1059 
publisher = {Academic Press}, 

1060 
year = 1990} 

1061 

1062 
@proceedings{extensions91, 

1063 
editor = {Peter SchroederHeister}, 

1064 
title = {Extensions of Logic Programming}, 

1065 
booktitle = {Extensions of Logic Programming}, 

1066 
year = 1991, 

1067 
series = {LNAI 475}, 

1068 
publisher = {Springer}} 

1069 

1070 
@proceedings{cade10, 

1071 
editor = {Mark E. Stickel}, 

1072 
title = {10th } # CADE, 

1073 
booktitle = {10th } # CADE, 

1074 
year = 1990, 

1075 
publisher = {Springer}, 

1076 
series = {LNAI 449}} 

1077 

1078 
@Proceedings{lics8, 

1079 
editor = {M. Vardi}, 

1080 
title = {Eighth Annual Symposium on Logic in Computer Science}, 

1081 
booktitle = {Eighth Annual Symposium on Logic in Computer Science}, 

1082 
publisher = IEEE, 

1083 
year = 1993} 

1084 

1085 
@book{wosfest, 

1086 
title = {Automated Reasoning and its Applications: 

1087 
Essays in Honor of {Larry Wos}}, 

1088 
booktitle = {Automated Reasoning and its Applications: 

1089 
Essays in Honor of {Larry Wos}}, 

1090 
publisher = {MIT Press}, 

1091 
year = 1997, 

1092 
editor = {Robert Veroff}} 

1093 

6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1094 
@proceedings{fme93, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1095 
editor = {J. C. P. Woodcock and P. G. Larsen}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1096 
title = {FME '93: IndustrialStrength Formal Methods}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1097 
booktitle = {FME '93: IndustrialStrength Formal Methods}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1098 
year = 1993, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1099 
publisher = {Springer}, 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1100 
series = {LNCS 670}} 
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

1101 

6592  1102 
@Proceedings{tphols96, 
1103 
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, 

1104 
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, 

1105 
editor = {J. von Wright and J. Grundy and J. Harrison}, 

1106 
series = {LNCS 1125}, 

1107 
year = 1996} 

6670  1108 

7041  1109 
@Proceedings{tphols97, 
1110 
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, 

1111 
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, 

1112 
editor = {Elsa L. Gunter and Amy Felty}, 

1113 
series = {LNCS 1275}, 

1114 
year = 1997} 

1115 

1116 
@Proceedings{tphols98, 

1117 
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, 

1118 
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, 

1119 
editor = {Jim Grundy and Malcom Newey}, 

1120 
series = {LNCS 1479}, 

1121 
year = 1998} 

1122 

6670  1123 
@Proceedings{tphols99, 
1124 
title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, 

1125 
booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, 

7350  1126 
editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and 
1127 
Paulin, C. and Thery, L.}, 

1128 
series = {LNCS 1690}, 

6670  1129 
year = 1999} 
1130 