author  haftmann 
Thu, 04 Oct 2007 19:41:55 +0200  
changeset 24841  df8448bc7a8b 
parent 24628  33137422d7fd 
child 25093  41ec22a00c41 
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"} 

11199  9 
@string{LNCS="Lecture Notes in Computer Science"} 
6592  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 

11199  17 
@string{CUCL="Computer Laboratory, University of Cambridge"} 
18 
@string{Edinburgh="Department of Computer Science, University of Edinburgh"} 

21074  19 
@string{TUM="Department of Informatics, Technical University of Munich"} 
6592  20 

21 
%journals 

8284  22 
@string{AI="Artificial Intelligence"} 
11199  23 
@string{FAC="Formal Aspects of Computing"} 
24 
@string{JAR="Journal of Automated Reasoning"} 

25 
@string{JCS="Journal of Computer Security"} 

26 
@string{JFP="Journal of Functional Programming"} 

27 
@string{JLC="Journal of Logic and Computation"} 

28 
@string{JLP="Journal of Logic Programming"} 

29 
@string{JSC="Journal of Symbolic Computation"} 

30 
@string{JSL="Journal of Symbolic Logic"} 

11246  31 
@string{PROYAL="Proceedings of the Royal Society of London"} 
6592  32 
@string{SIGPLAN="{SIGPLAN} Notices"} 
11246  33 
@string{TISSEC="ACM Transactions on Information and System Security"} 
6592  34 

35 
%conferences 

36 
@string{CADE="International Conference on Automated Deduction"} 

37 
@string{POPL="Symposium on Principles of Programming Languages"} 

38 
@string{TYPES="Types for Proofs and Programs"} 

39 

40 

41 
%A 

42 

43 
@incollection{abramsky90, 

44 
author = {Samson Abramsky}, 

45 
title = {The Lazy Lambda Calculus}, 

46 
pages = {65116}, 

47 
editor = {David A. Turner}, 

48 
booktitle = {Research Topics in Functional Programming}, 

49 
publisher = {AddisonWesley}, 

50 
year = 1990} 

51 

52 
@Unpublished{abrial93, 

53 
author = {J. R. Abrial and G. Laffitte}, 

54 
title = {Towards the Mechanization of the Proofs of some Classical 

55 
Theorems of Set Theory}, 

56 
note = {preprint}, 

57 
year = 1993, 

58 
month = Feb} 

59 

60 
@incollection{aczel77, 

61 
author = {Peter Aczel}, 

62 
title = {An Introduction to Inductive Definitions}, 

63 
pages = {739782}, 

64 
crossref = {barwisehandbk}} 

65 

66 
@Book{aczel88, 

67 
author = {Peter Aczel}, 

68 
title = {NonWellFounded Sets}, 

69 
publisher = {CSLI}, 

70 
year = 1988} 

71 

72 
@InProceedings{alf, 

73 
author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, 

74 
title = {The {ALF} Proof Editor and Its Proof Engine}, 

75 
crossref = {types93}, 

76 
pages = {213237}} 

77 

78 
@book{andrews86, 

79 
author = "Peter Andrews", 

80 
title = "An Introduction to Mathematical Logic and Type Theory: to Truth 

81 
through Proof", 

82 
publisher = AP, 

83 
series = "Computer Science and Applied Mathematics", 

84 
year = 1986} 

85 

9599  86 
@InProceedings{Aspinall:2000:eProof, 
87 
author = {David Aspinall}, 

88 
title = {Protocols for Interactive {eProof}}, 

89 
booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)}, 

90 
year = 2000, 

91 
note = {Unpublished workinprogress paper, 

14296
bcba1d67f854
updated references to the nowpornographic proofgeneral.org
paulson
parents:
14210
diff
changeset

92 
\url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}} 
9599  93 
} 
14296
bcba1d67f854
updated references to the nowpornographic proofgeneral.org
paulson
parents:
14210
diff
changeset

94 

8505  95 
@InProceedings{Aspinall:TACAS:2000, 
96 
author = {David Aspinall}, 

10160  97 
title = {{P}roof {G}eneral: A Generic Tool for Proof Development}, 
11205  98 
booktitle = {Tools and Algorithms for the Construction and Analysis of 
99 
Systems (TACAS)}, 

100 
year = 2000, 

101 
publisher = Springer, 

102 
series = LNCS, 

103 
volume = 1785, 

104 
pages = "3842" 

8505  105 
} 
106 

7209  107 
@Misc{isamode, 
108 
author = {David Aspinall}, 

8062  109 
title = {Isamode  {U}sing {I}sabelle with {E}macs}, 
14296
bcba1d67f854
updated references to the nowpornographic proofgeneral.org
paulson
parents:
14210
diff
changeset

110 
note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}} 
7209  111 
} 
112 

113 
@Misc{proofgeneral, 

11197  114 
author = {David Aspinall}, 
115 
title = {{P}roof {G}eneral}, 

14296
bcba1d67f854
updated references to the nowpornographic proofgeneral.org
paulson
parents:
14210
diff
changeset

116 
note = {\url{http://proofgeneral.inf.ed.ac.uk/}} 
7209  117 
} 
118 

6592  119 
%B 
120 

10186  121 
@book{BaaderNipkow,author={Franz Baader and Tobias Nipkow}, 
122 
title="Term Rewriting and All That",publisher=CUP,year=1998} 

123 

20482  124 
@InCollection{BarendregtGeuvers:2001, 
125 
author = {H. Barendregt and H. Geuvers}, 

126 
title = {Proof Assistants using Dependent Type Systems}, 

127 
booktitle = {Handbook of Automated Reasoning}, 

128 
publisher = {Elsevier}, 

129 
year = 2001, 

130 
editor = {A. Robinson and A. Voronkov} 

131 
} 

132 

6592  133 
@incollection{basin91, 
134 
author = {David Basin and Matt Kaufmann}, 

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

136 
Comparison}, 

137 
crossref = {huetplotkin91}, 

138 
pages = {89119}} 

139 

12466  140 
@Unpublished{HOLLibrary, 
141 
author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and 

142 
Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and 

143 
Markus Wenzel}, 

144 
title = {The Supplemental {Isabelle/HOL} Library}, 

12660  145 
note = {Part of the Isabelle distribution, 
12466  146 
\url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}}, 
12660  147 
year = 2002 
12466  148 
} 
149 

9567  150 
@InProceedings{BauerWenzel:2000:HB, 
151 
author = {Gertrud Bauer and Markus Wenzel}, 

152 
title = {ComputerAssisted Mathematics at Work  The {H}ahn{B}anach Theorem in 

153 
{I}sabelle/{I}sar}, 

154 
booktitle = {Types for Proofs and Programs: TYPES'99}, 

9599  155 
editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m 
156 
and Jan Smith}, 

9567  157 
series = {LNCS}, 
9599  158 
year = 2000 
9567  159 
} 
6624  160 

12878  161 
@InProceedings{BauerWenzel:2001, 
162 
author = {Gertrud Bauer and Markus Wenzel}, 

163 
title = {Calculational reasoning revisited  an {Isabelle/Isar} experience}, 

164 
crossref = {tphols2001}} 

165 

11619  166 
@INPROCEEDINGS{BerghoferNipkow:2000:TPHOL, 
167 
crossref = "tphols2000", 

168 
title = "Proof terms for simply typed higher order logic", 

169 
author = "Stefan Berghofer and Tobias Nipkow", 

170 
pages = "3852"} 

171 

12612  172 
@InProceedings{BerghoferNipkow:2002, 
173 
author = {Stefan Berghofer and Tobias Nipkow}, 

174 
title = {Executing Higher Order Logic}, 

175 
booktitle = {Types for Proofs and Programs: TYPES'2000}, 

176 
editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, 

177 
series = LNCS, 

178 
publisher = Springer, 

13009  179 
volume = 2277, 
12612  180 
year = 2002} 
181 

6624  182 
@InProceedings{BerghoferWenzel:1999:TPHOL, 
183 
author = {Stefan Berghofer and Markus Wenzel}, 

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

186 
crossref = {tphols99}} 

6624  187 

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

190 

11209  191 
@book{BirdHaskell,author="Richard Bird", 
192 
title="Introduction to Functional Programming using Haskell", 

193 
publisher=PH,year=1998} 

194 

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

197 
Overbeek and Mark Stickel and Lawrence Wos}, 

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

199 
Axioms}, 

200 
journal = JAR, 

201 
year = 1986, 

202 
volume = 2, 

203 
number = 3, 

204 
pages = {287327}} 

205 

206 
@book{bm79, 

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

208 
title = {A Computational Logic}, 

209 
publisher = {Academic Press}, 

210 
year = 1979} 

211 

212 
@book{bm88book, 

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

214 
title = {A Computational Logic Handbook}, 

215 
publisher = {Academic Press}, 

216 
year = 1988} 

217 

218 
@Article{debruijn72, 

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

220 
title = {Lambda Calculus Notation with Nameless Dummies, 

221 
a Tool for Automatic Formula Manipulation, 

222 
with Application to the {ChurchRosser Theorem}}, 

223 
journal = {Indag. Math.}, 

224 
volume = 34, 

225 
pages = {381392}, 

226 
year = 1972} 

227 

23187  228 
@InProceedings{bulwahnKN07, 
229 
author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow}, 

230 
title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}}, 

231 
booktitle = {TPHOLS 2007}, 

232 
year = {2007}, 

233 
publisher = Springer, 

234 
note = {To appear}} 

235 

11246  236 
@Article{ban89, 
237 
author = {M. Burrows and M. Abadi and R. M. Needham}, 

238 
title = {A Logic of Authentication}, 

239 
journal = PROYAL, 

240 
year = 1989, 

241 
volume = 426, 

242 
pages = {233271}} 

243 

6592  244 
%C 
245 

246 
@TechReport{camilleri92, 

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

248 
title = {Reasoning with Inductively Defined Relations in the 

249 
{HOL} Theorem Prover}, 

250 
institution = CUCL, 

251 
year = 1992, 

252 
number = 265, 

253 
month = Aug} 

254 

255 
@Book{charniak80, 

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

257 
title = {Artificial Intelligence Programming}, 

258 
publisher = {Lawrence Erlbaum Associates}, 

259 
year = 1980} 

260 

261 
@article{church40, 

262 
author = "Alonzo Church", 

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

264 
journal = JSL, 

265 
year = 1940, 

266 
volume = 5, 

267 
pages = "5668"} 

268 

10191  269 
@book{ClarkeGPbook,author="Edmund Clarke and Orna Grumberg and Doron Peled", 
270 
title="Model Checking",publisher=MIT,year=1999} 

271 

6592  272 
@PhdThesis{coen92, 
273 
author = {Martin D. Coen}, 

274 
title = {Interactive Program Derivation}, 

275 
school = {University of Cambridge}, 

276 
note = {Computer Laboratory Technical Report 272}, 

277 
month = nov, 

278 
year = 1992} 

279 

280 
@book{constable86, 

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

282 
title = {Implementing Mathematics with the Nuprl Proof 

283 
Development System}, 

284 
publisher = Prentice, 

285 
year = 1986} 

286 

287 
%D 

288 

6745  289 
@Book{daveypriestley, 
6592  290 
author = {B. A. Davey and H. A. Priestley}, 
291 
title = {Introduction to Lattices and Order}, 

292 
publisher = CUP, 

293 
year = 1990} 

294 

295 
@Book{devlin79, 

296 
author = {Keith J. Devlin}, 

297 
title = {Fundamentals of Contemporary Set Theory}, 

298 
publisher = {Springer}, 

299 
year = 1979} 

300 

301 
@book{dummett, 

302 
author = {Michael Dummett}, 

303 
title = {Elements of Intuitionism}, 

304 
year = 1977, 

305 
publisher = {Oxford University Press}} 

306 

307 
@incollection{dybjer91, 

308 
author = {Peter Dybjer}, 

10186  309 
title = {Inductive Sets and Families in {MartinL{\"o}f's} Type 
6592  310 
Theory and Their SetTheoretic Semantics}, 
311 
crossref = {huetplotkin91}, 

312 
pages = {280306}} 

313 

314 
@Article{dyckhoff, 

315 
author = {Roy Dyckhoff}, 

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

317 
journal = JSL, 

318 
year = 1992, 

319 
volume = 57, 

320 
number = 3, 

321 
pages = {795807}} 

322 

323 
%F 

324 

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

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

326 
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

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

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

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

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

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

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

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

334 

6592  335 
@InProceedings{felty91a, 
336 
Author = {Amy Felty}, 

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

338 
Deduction Proofs}, 

339 
crossref = {extensions91}, 

340 
pages = {157178}} 

341 

10796  342 
@Article{fleuriotjcm, 
343 
author = {Jacques Fleuriot and Lawrence C. Paulson}, 

344 
title = {Mechanizing Nonstandard Real Analysis}, 

345 
journal = {LMS Journal of Computation and Mathematics}, 

346 
year = 2000, 

347 
volume = 3, 

348 
pages = {140190}, 

349 
note = {\url{http://www.lms.ac.uk/jcm/3/lms1999027/}} 

350 
} 

351 

6592  352 
@TechReport{frost93, 
353 
author = {Jacob Frost}, 

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

355 
institution = CUCL, 

356 
number = 308, 

357 
year = 1993, 

358 
month = Aug} 

359 

360 
%revised version of frost93 

361 
@TechReport{frost95, 

362 
author = {Jacob Frost}, 

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

364 
institution = CUCL, 

365 
number = 359, 

366 
year = 1995, 

367 
month = Feb} 

368 

369 
@inproceedings{OBJ, 

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

371 
and J. Meseguer}, 

372 
title = {Principles of {OBJ2}}, 

373 
booktitle = POPL, 

374 
year = 1985, 

375 
pages = {5266}} 

376 

377 
%G 

378 

379 
@book{gallier86, 

380 
author = {J. H. Gallier}, 

381 
title = {Logic for Computer Science: 

382 
Foundations of Automatic Theorem Proving}, 

383 
year = 1986, 

384 
publisher = {Harper \& Row}} 

385 

386 
@Book{galton90, 

387 
author = {Antony Galton}, 

388 
title = {Logic for Information Technology}, 

389 
publisher = {Wiley}, 

390 
year = 1990} 

391 

20506  392 
@Article{Gentzen:1935, 
393 
author = {G. Gentzen}, 

394 
title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en}, 

395 
journal = {Math. Zeitschrift}, 

396 
year = 1935 

397 
} 

398 

6592  399 
@InProceedings{gimenezcodifying, 
400 
author = {Eduardo Gim{\'e}nez}, 

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

402 
crossref = {types94}, 

403 
pages = {3959} 

404 
} 

405 

9816  406 
@book{girard89, 
407 
author = {JeanYves Girard}, 

408 
title = {Proofs and Types}, 

409 
year = 1989, 

410 
publisher = CUP, 

411 
note = {Translated by Yves LaFont and Paul Taylor}} 

412 

6592  413 
@Book{mgordonhol, 
11205  414 
editor = {M. J. C. Gordon and T. F. Melham}, 
6592  415 
title = {Introduction to {HOL}: A Theorem Proving Environment for 
416 
Higher Order Logic}, 

417 
publisher = CUP, 

418 
year = 1993} 

419 

420 
@book{mgordon79, 

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

422 
Wadsworth}, 

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

424 
year = 1979, 

425 
publisher = {Springer}, 

426 
series = {LNCS 78}} 

427 

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

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

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

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

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

434 

6592  435 
@InProceedings{guntertrees, 
436 
author = {Elsa L. Gunter}, 

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

438 
{HOL}}, 

439 
crossref = {hug93}, 

440 
pages = {141154}} 

441 

442 
%H 

443 

23956  444 
@InProceedings{HaftmannWenzel:2006:classes, 
445 
author = {Florian Haftmann and Makarius Wenzel}, 

446 
title = {Constructive Type Classes in {Isabelle}}, 

24628  447 
editor = {T. Altenkirch and C. McBride}, 
448 
booktitle = {Types for Proofs and Programs, TYPES 2006}, 

449 
publisher = {Springer}, 

450 
series = {LNCS}, 

451 
volume = {4502}, 

452 
year = {2007} 

24193  453 
} 
454 

455 
@TechReport{HaftmannNipkow:2007:codegen, 

456 
author = {Florian Haftmann and Tobias Nipkow}, 

457 
title = {A Code Generator Framework for {Isabelle/HOL}}, 

24628  458 
editor = {Klaus Schneider and Jens Brandt}, 
459 
booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings}, 

460 
month = {08}, 

461 
year = {2007}, 

462 
institution = {Department of Computer Science, University of Kaiserslautern}, 

463 
number = {364/07} 

23956  464 
} 
465 

22290  466 
@manual{isabelleclasses, 
24193  467 
author = {Florian Haftmann}, 
468 
title = {Haskellstyle type classes with {Isabelle}/{Isar}}, 

469 
institution = TUM, 

470 
note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}} 

471 
} 

22290  472 

473 
@manual{isabellecodegen, 

24193  474 
author = {Florian Haftmann}, 
475 
title = {Code generation from Isabelle theories}, 

476 
institution = TUM, 

477 
note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}} 

478 
} 

22290  479 

6592  480 
@Book{halmos60, 
481 
author = {Paul R. Halmos}, 

482 
title = {Naive Set Theory}, 

483 
publisher = {Van Nostrand}, 

484 
year = 1960} 

485 

11207  486 
@book{HarelKTDL,author={David Harel and Dexter Kozen and Jerzy Tiuryn}, 
487 
title={Dynamic Logic},publisher=MIT,year=2000} 

488 

6592  489 
@Book{hennessy90, 
490 
author = {Matthew Hennessy}, 

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

492 
Introduction Using Structural Operational Semantics}, 

493 
publisher = {Wiley}, 

494 
year = 1990} 

495 

10244  496 
@book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman}, 
497 
title={Introduction to Automata Theory, Languages, and Computation.}, 

498 
publisher={AddisonWesley},year=1979} 

499 

6592  500 
@Article{haskellreport, 
501 
author = {Paul Hudak and Simon Peyton Jones and Philip Wadler}, 

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

503 
Nonstrict, Purely Functional Language}, 

504 
journal = SIGPLAN, 

505 
year = 1992, 

506 
volume = 27, 

507 
number = 5, 

508 
month = May, 

509 
note = {Version 1.2}} 

510 

511 
@Article{haskelltutorial, 

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

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

514 
journal = SIGPLAN, 

515 
year = 1992, 

516 
volume = 27, 

517 
number = 5, 

518 
month = May} 

519 

11209  520 
@book{HudakHaskell,author={Paul Hudak}, 
521 
title={The Haskell School of Expression},publisher=CUP,year=2000} 

522 

6592  523 
@article{huet75, 
524 
author = {G. P. Huet}, 

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

526 
journal = TCS, 

527 
volume = 1, 

528 
year = 1975, 

529 
pages = {2757}} 

530 

531 
@article{huet78, 

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

533 
title = {Proving and Applying Program Transformations Expressed with 

534 
SecondOrder Patterns}, 

535 
journal = acta, 

536 
volume = 11, 

537 
year = 1978, 

538 
pages = {3155}} 

539 

540 
@inproceedings{huet88, 

10186  541 
author = {G{\'e}rard Huet}, 
6592  542 
title = {Induction Principles Formalized in the {Calculus of 
543 
Constructions}}, 

544 
booktitle = {Programming of Future Generation Computers}, 

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

546 
year = 1988, 

547 
pages = {205216}, 

548 
publisher = {Elsevier}} 

549 

10186  550 
@Book{HuthRyanbook, 
551 
author = {Michael Huth and Mark Ryan}, 

552 
title = {Logic in Computer Science. Modelling and reasoning about systems}, 

553 
publisher = CUP, 

554 
year = 2000} 

555 

7041  556 
@InProceedings{Harrison:1996:MizarHOL, 
557 
author = {J. Harrison}, 

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

559 
pages = {203220}, 

560 
crossref = {tphols96}} 

561 

22290  562 
%J 
563 

564 
@article{haskellrevisedreport, 

565 
author = {Simon {Peyton Jones} and others}, 

566 
title = {The {Haskell} 98 Language and Libraries: The Revised Report}, 

567 
journal = {Journal of Functional Programming}, 

568 
volume = 13, 

569 
number = 1, 

570 
pages = {0255}, 

571 
month = {Jan}, 

572 
year = 2003, 

573 
note = {\url{http://www.haskell.org/definition/}}} 

574 

6592  575 
%K 
576 

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

579 
Lawrence C. Paulson}, 

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

581 
crossref = {tphols99}} 

582 

8284  583 
@book{Knuth375, 
584 
author={Donald E. Knuth}, 

585 
title={The Art of Computer Programming, Volume 3: Sorting and Searching}, 

586 
publisher={AddisonWesley}, 

587 
year=1975} 

588 

589 
@Article{korf85, 

590 
author = {R. E. Korf}, 

591 
title = {DepthFirst IterativeDeepening: an Optimal Admissible 

592 
Tree Search}, 

593 
journal = AI, 

594 
year = 1985, 

595 
volume = 27, 

596 
pages = {97109}} 

6607  597 

23187  598 
@InProceedings{krauss2006, 
599 
author = {Alexander Krauss}, 

600 
title = {Partial Recursive Functions in {HigherOrder Logic}}, 

601 
crossref = {ijcar2006}, 

602 
pages = {589603}} 

603 

24524  604 
@manual{isabellefunction, 
605 
author = {Alexander Krauss}, 

606 
title = {Defining Recursive Functions in {Isabelle/HOL}}, 

607 
institution = TUM, 

608 
note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}} 

609 
} 

610 

6592  611 
@Book{kunen80, 
612 
author = {Kenneth Kunen}, 

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

614 
publisher = NH, 

615 
year = 1980} 

616 

11246  617 
%L 
618 

22290  619 
@manual{OCaml, 
620 
author = {Xavier Leroy and others}, 

621 
title = {The Objective Caml system  Documentation and user's manual}, 

622 
note = {\url{http://caml.inria.fr/pub/docs/manualocaml/}}} 

623 

11246  624 
@InProceedings{lowefdr, 
625 
author = {Gavin Lowe}, 

626 
title = {Breaking and Fixing the {Needham}{Schroeder} PublicKey 

627 
Protocol using {CSP} and {FDR}}, 

628 
booktitle = {Tools and Algorithms for the Construction and Analysis 

629 
of Systems: second international workshop, TACAS '96}, 

630 
editor = {T. Margaria and B. Steffen}, 

631 
series = {LNCS 1055}, 

632 
year = 1996, 

633 
publisher = {Springer}, 

634 
pages = {147166}} 

635 

6592  636 
%M 
637 

638 
@Article{mw81, 

639 
author = {Zohar Manna and Richard Waldinger}, 

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

641 
journal = SCP, 

642 
year = 1981, 

643 
volume = 1, 

644 
number = 1, 

645 
pages = {548}} 

646 

647 
@InProceedings{martinnipkow, 

648 
author = {Ursula Martin and Tobias Nipkow}, 

649 
title = {Ordered Rewriting and Confluence}, 

650 
crossref = {cade10}, 

651 
pages = {366380}} 

652 

653 
@book{martinlof84, 

10186  654 
author = {Per MartinL{\"o}f}, 
6592  655 
title = {Intuitionistic type theory}, 
656 
year = 1984, 

657 
publisher = {Bibliopolis}} 

658 

659 
@incollection{melham89, 

660 
author = {Thomas F. Melham}, 

661 
title = {Automating Recursive Type Definitions in Higher Order 

662 
Logic}, 

663 
pages = {341386}, 

664 
crossref = {birtwistle89}} 

665 

666 
@Article{millermixed, 

667 
Author = {Dale Miller}, 

668 
Title = {Unification Under a Mixed Prefix}, 

669 
journal = JSC, 

670 
volume = 14, 

671 
number = 4, 

672 
pages = {321358}, 

673 
Year = 1992} 

674 

675 
@Article{milner78, 

676 
author = {Robin Milner}, 

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

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

679 
year = 1978, 

680 
volume = 17, 

681 
pages = {348375}} 

682 

683 
@TechReport{milnerind, 

684 
author = {Robin Milner}, 

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

686 
institution = Edinburgh, 

687 
year = 1980, 

688 
type = {note}} 

689 

690 
@Article{milnercoind, 

691 
author = {Robin Milner and Mads Tofte}, 

692 
title = {Coinduction in Relational Semantics}, 

693 
journal = TCS, 

694 
year = 1991, 

695 
volume = 87, 

696 
pages = {209220}} 

697 

698 
@Book{milner89, 

699 
author = {Robin Milner}, 

700 
title = {Communication and Concurrency}, 

701 
publisher = Prentice, 

702 
year = 1989} 

703 

10970  704 
@book{SML,author="Robin Milner and Mads Tofte and Robert Harper", 
705 
title="The Definition of Standard ML",publisher=MIT,year=1990} 

706 

6592  707 
@PhdThesis{monahan84, 
708 
author = {Brian Q. Monahan}, 

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

710 
school = {University of Edinburgh}, 

711 
year = 1984} 

712 

6607  713 
@article{MuellerNvOS99, 
714 
author= 

11564  715 
{Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, 
11197  716 
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191223}} 
6607  717 

9599  718 
@Manual{Muzalewski:Mizar, 
719 
title = {An Outline of {PC} {Mizar}}, 

720 
author = {Micha{\l} Muzalewski}, 

721 
organization = {Fondation of Logic, Mathematics and Informatics 

722 
 Mizar Users Group}, 

723 
year = 1993, 

724 
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}} 

725 
} 

726 

6592  727 
%N 
728 

729 
@InProceedings{NaraschewskiWTPHOLs98, 

730 
author = {Wolfgang Naraschewski and Markus Wenzel}, 

731 
title = 

7041  732 
{ObjectOriented Verification based on Record Subtyping in 
733 
HigherOrder Logic}, 

734 
crossref = {tphols98}} 

6592  735 

736 
@inproceedings{nazarethnipkow, 

737 
author = {Dieter Nazareth and Tobias Nipkow}, 

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

739 
crossref = {tphols96}, 

740 
pages = {331345}, 

741 
year = 1996} 

742 

11246  743 
@Article{needhamschroeder, 
744 
author = "Roger M. Needham and Michael D. Schroeder", 

745 
title = "Using Encryption for Authentication in Large Networks 

746 
of Computers", 

747 
journal = cacm, 

748 
volume = 21, 

749 
number = 12, 

750 
pages = "993999", 

751 
month = dec, 

752 
year = 1978} 

753 

6592  754 
@inproceedings{nipkowW, 
755 
author = {Wolfgang Naraschewski and Tobias Nipkow}, 

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

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

10186  758 
editor = {E. Gim{\'e}nez and C. PaulinMohring}, 
6592  759 
publisher = Springer, 
760 
series = LNCS, 

761 
volume = 1512, 

762 
pages = {317332}, 

763 
year = 1998} 

764 

8892  765 
@InCollection{nipkowsorts93, 
766 
author = {T. Nipkow}, 

767 
title = {OrderSorted Polymorphism in {Isabelle}}, 

768 
booktitle = {Logical Environments}, 

769 
publisher = CUP, 

770 
year = 1993, 

771 
editor = {G. Huet and G. Plotkin}, 

772 
pages = {164188} 

773 
} 

774 

775 
@Misc{nipkowtypes93, 

776 
author = {Tobias Nipkow}, 

777 
title = {Axiomatic Type Classes (in {I}sabelle)}, 

778 
howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen}, 

779 
year = 1993 

780 
} 

781 

6592  782 
@inproceedings{NipkowCR, 
783 
author = {Tobias Nipkow}, 

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

785 
booktitle = {Automated Deduction  CADE13}, 

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

787 
publisher = Springer, 

788 
series = LNCS, 

789 
volume = 1104, 

790 
pages = {733747}, 

791 
year = 1996} 

792 

793 
% WAS NipkowLICS93 

794 
@InProceedings{nipkowpatterns, 

795 
title = {Functional Unification of HigherOrder Patterns}, 

796 
author = {Tobias Nipkow}, 

797 
pages = {6474}, 

798 
crossref = {lics8}, 

6745  799 
url = {\url{ftp://ftp.informatik.tumuenchen.de/local/lehrstuhl/nipkow/lics93.html}}, 
6592  800 
keywords = {unification}} 
801 

802 
@article{nipkowIMP, 

803 
author = {Tobias Nipkow}, 

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

805 
journal = FAC, 

806 
volume = 10, 

807 
pages = {171186}, 

808 
year = 1998} 

809 

15429  810 
@inproceedings{NipkowTYPES02, 
811 
author = {Tobias Nipkow}, 

812 
title = {{Structured Proofs in Isar/HOL}}, 

813 
booktitle = {Types for Proofs and Programs (TYPES 2002)}, 

814 
editor = {H. Geuvers and F. Wiedijk}, 

815 
year = 2003, 

816 
publisher = Springer, 

817 
series = LNCS, 

818 
volume = 2646, 

819 
pages = {259278}} 

820 

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

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

10186  824 
institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t 
825 
M{\"u}nchen and Computer Laboratory, University of Cambridge}, 

8892  826 
note = {\url{http://isabelle.in.tum.de/doc/logicsHOL.pdf}}} 
6607  827 

6592  828 
@article{nipkowprehofer, 
829 
author = {Tobias Nipkow and Christian Prehofer}, 

830 
title = {Type Reconstruction for Type Classes}, 

831 
journal = JFP, 

832 
volume = 5, 

833 
number = 2, 

834 
year = 1995, 

835 
pages = {201224}} 

836 

23956  837 
@InProceedings{NipkowPrehofer:1993, 
838 
author = {T. Nipkow and C. Prehofer}, 

839 
title = {Type checking type classes}, 

840 
booktitle = {ACM Symp.\ Principles of Programming Languages}, 

841 
year = 1993 

842 
} 

843 

14147  844 
@Book{isatutorial, 
845 
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, 

846 
title = {Isabelle/HOL: A Proof Assistant for HigherOrder Logic}, 

847 
publisher = {Springer}, 

848 
year = 2002, 

849 
note = {LNCS Tutorial 2283}} 

850 

6592  851 
@Article{noel, 
852 
author = {Philippe No{\"e}l}, 

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

854 
journal = JAR, 

855 
volume = 10, 

856 
number = 1, 

857 
pages = {1558}, 

858 
year = 1993} 

859 

860 
@book{nordstrom90, 

10186  861 
author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith}, 
862 
title = {Programming in {MartinL{\"o}f}'s Type Theory. An 

6592  863 
Introduction}, 
864 
publisher = {Oxford University Press}, 

865 
year = 1990} 

866 

867 
%O 

868 

869 
@Manual{pvslanguage, 

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

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

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

873 
address = {Menlo Park, CA}, 

6745  874 
note = {Beta release}, 
6592  875 
year = 1993, 
876 
month = apr, 

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

879 
%P 

880 

881 
% replaces paulin92 

882 
@InProceedings{paulintlca, 

883 
author = {Christine PaulinMohring}, 

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

885 
Properties}, 

886 
crossref = {tlca93}, 

887 
pages = {328345}} 

888 

889 
@InProceedings{paulsonCADE, 

890 
author = {Lawrence C. Paulson}, 

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

892 
Definitions}, 

893 
pages = {148161}, 

894 
crossref = {cade12}} 

895 

896 
@InProceedings{paulsonCOLOG, 

897 
author = {Lawrence C. Paulson}, 

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

899 
{Isabelle})}, 

900 
pages = {246274}, 

901 
crossref = {colog88}, 

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

904 
@Article{paulsoncoind, 

905 
author = {Lawrence C. Paulson}, 

906 
title = {Mechanizing Coinduction and Corecursion in HigherOrder 

907 
Logic}, 

908 
journal = JLC, 

909 
year = 1997, 

910 
volume = 7, 

911 
number = 2, 

912 
month = mar, 

913 
pages = {175204}} 

914 

12616  915 
@manual{isabelleintro, 
916 
author = {Lawrence C. Paulson}, 

917 
title = {Introduction to {Isabelle}}, 

918 
institution = CUCL, 

919 
note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}} 

920 

921 
@manual{isabellelogics, 

922 
author = {Lawrence C. Paulson}, 

923 
title = {{Isabelle's} Logics}, 

924 
institution = CUCL, 

925 
note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}} 

926 

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

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

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

929 
title = {The {Isabelle} Reference Manual}, 
8892  930 
institution = CUCL, 
931 
note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}} 

6607  932 

933 
@manual{isabelleZF, 

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

8892  936 
institution = CUCL, 
937 
note = {\url{http://isabelle.in.tum.de/doc/logicsZF.pdf}}} 

6592  938 

939 
@article{paulsonfound, 

940 
author = {Lawrence C. Paulson}, 

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

942 
journal = JAR, 

943 
volume = 5, 

944 
number = 3, 

945 
pages = {363397}, 

946 
year = 1989, 

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

949 
%replaces paulsonfinal 

950 
@Article{paulsonmscs, 

951 
author = {Lawrence C. Paulson}, 

7991  952 
title = {Final Coalgebras as Greatest Fixed Points 
953 
in {ZF} Set Theory}, 

6592  954 
journal = {Mathematical Structures in Computer Science}, 
955 
year = 1999, 

956 
volume = 9, 

23505  957 
number = 5, 
958 
pages = {545567}} 

6592  959 

960 
@InCollection{paulsongeneric, 

961 
author = {Lawrence C. Paulson}, 

962 
title = {Generic Automatic Proof Tools}, 

963 
crossref = {wosfest}, 

964 
chapter = 3} 

965 

966 
@Article{paulsongr, 

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

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

969 
Choice}, 

970 
journal = JAR, 

971 
year = 1996, 

972 
volume = 17, 

973 
number = 3, 

974 
month = dec, 

975 
pages = {291323}} 

976 

14210  977 
@InCollection{paulsonfixedptmilner, 
978 
author = {Lawrence C. Paulson}, 

979 
title = {A Fixedpoint Approach to (Co)inductive and 

980 
(Co)datatype Definitions}, 

981 
pages = {187211}, 

982 
crossref = {milnerfest}} 

983 

984 
@book{milnerfest, 

985 
title = {Proof, Language, and Interaction: 

986 
Essays in Honor of {Robin Milner}}, 

987 
booktitle = {Proof, Language, and Interaction: 

988 
Essays in Honor of {Robin Milner}}, 

989 
publisher = {MIT Press}, 

990 
year = 2000, 

991 
editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} 

992 

6592  993 
@InCollection{paulsonhandbook, 
994 
author = {Lawrence C. Paulson}, 

995 
title = {Designing a Theorem Prover}, 

996 
crossref = {handbklics2}, 

997 
pages = {415475}} 

998 

999 
@Book{paulsonisabook, 

1000 
author = {Lawrence C. Paulson}, 

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

1002 
publisher = {Springer}, 

1003 
year = 1994, 

1004 
note = {LNCS 828}} 

1005 

12878  1006 
@Book{isabelleholbook, 
1007 
author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, 

1008 
title = {Isabelle/HOL  A Proof Assistant for HigherOrder Logic}, 

1009 
publisher = {Springer}, 

1010 
year = 2002, 

1011 
note = {LNCS 2283}} 

1012 

6592  1013 
@InCollection{paulsonmarkt, 
1014 
author = {Lawrence C. Paulson}, 

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

1016 
booktitle = {Mathematical Methods in Program Development: 

1017 
Summer School Marktoberdorf 1996}, 

1018 
publisher = {Springer}, 

1019 
pages = {461498}, 

1020 
year = {Published 1997}, 

1021 
editor = {Manfred Broy}, 

1022 
series = {NATO ASI Series F}} 

1023 

1024 
%replaces PaulsonML and paulson91 

1025 
@book{paulsonml2, 

1026 
author = {Lawrence C. Paulson}, 

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

1028 
year = 1996, 

1029 
edition = {2nd}, 

1030 
publisher = CUP} 

1031 

1032 
@article{paulsonnatural, 

1033 
author = {Lawrence C. Paulson}, 

1034 
title = {Natural Deduction as Higherorder Resolution}, 

1035 
journal = JLP, 

1036 
volume = 3, 

1037 
pages = {237258}, 

1038 
year = 1986, 

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

1041 
@Article{paulsonsetI, 

1042 
author = {Lawrence C. Paulson}, 

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

1044 
Foundations to Functions}, 

1045 
journal = JAR, 

1046 
volume = 11, 

1047 
number = 3, 

1048 
pages = {353389}, 

1049 
year = 1993, 

14385  1050 
url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/setI.pdf}}} 
6592  1051 

1052 
@Article{paulsonsetII, 

1053 
author = {Lawrence C. Paulson}, 

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

1055 
Recursion}, 

1056 
journal = JAR, 

1057 
volume = 15, 

1058 
number = 2, 

1059 
pages = {167215}, 

1060 
year = 1995, 

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

1063 
@article{paulson85, 

1064 
author = {Lawrence C. Paulson}, 

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

1066 
journal = SCP, 

1067 
volume = 5, 

1068 
pages = {143170}, 

1069 
year = 1985} 

1070 

11564  1071 
%replaces PaulsonLCF 
6592  1072 
@book{paulson87, 
1073 
author = {Lawrence C. Paulson}, 

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

1075 
LCF}, 

1076 
year = 1987, 

1077 
publisher = CUP} 

1078 

1079 
@incollection{paulson700, 

1080 
author = {Lawrence C. Paulson}, 

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

1082 
crossref = {odifreddi90}, 

1083 
pages = {361386}, 

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

1086 
% replaces paulsonns and paulsonsecurity 

1087 
@Article{paulsonjcs, 

1088 
author = {Lawrence C. Paulson}, 

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

1090 
journal = JCS, 

1091 
year = 1998, 

1092 
volume = 6, 

1093 
pages = {85128}} 

1094 

11246  1095 
@Article{paulsontls, 
1096 
author = {Lawrence C. Paulson}, 

1097 
title = {Inductive Analysis of the {Internet} Protocol {TLS}}, 

1098 
journal = TISSEC, 

1099 
month = aug, 

1100 
year = 1999, 

1101 
volume = 2, 

1102 
number = 3, 

1103 
pages = {332351}} 

21074  1104 

1105 
@Article{paulsonyahalom, 

1106 
author = {Lawrence C. Paulson}, 

1107 
title = {Relations Between Secrets: 

1108 
Two Formal Analyses of the {Yahalom} Protocol}, 

1109 
journal = JCS, 

23505  1110 
volume = 9, 
1111 
number = 3, 

1112 
pages = {197216}, 

1113 
year = 2001}} 

11246  1114 

6592  1115 
@article{pelletier86, 
1116 
author = {F. J. Pelletier}, 

1117 
title = {Seventyfive Problems for Testing Automatic Theorem 

1118 
Provers}, 

1119 
journal = JAR, 

1120 
volume = 2, 

1121 
pages = {191216}, 

1122 
year = 1986, 

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

1124 

1125 
@Article{pitts94, 

1126 
author = {Andrew M. Pitts}, 

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

1128 
journal = TCS, 

1129 
volume = 124, 

1130 
pages = {195219}, 

1131 
year = 1994} 

1132 

1133 
@Article{plaisted90, 

1134 
author = {David A. Plaisted}, 

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

1136 
Refinement}, 

1137 
journal = JAR, 

1138 
year = 1990, 

1139 
volume = 6, 

1140 
number = 4, 

1141 
pages = {389402}} 

1142 

1143 
%Q 

1144 

1145 
@Article{quaife92, 

1146 
author = {Art Quaife}, 

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

1148 
Theory}, 

1149 
journal = JAR, 

1150 
year = 1992, 

1151 
volume = 8, 

1152 
number = 1, 

1153 
pages = {91147}} 

1154 

1155 
%R 

1156 

1157 
@TechReport{rasmussen95, 

1158 
author = {Ole Rasmussen}, 

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

1160 
Experiment}, 

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

1162 
year = 1995, 

1163 
number = 364, 

1164 
month = may, 

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

1167 
@Book{reeves90, 

1168 
author = {Steve Reeves and Michael Clarke}, 

1169 
title = {Logic for Computer Science}, 

1170 
publisher = {AddisonWesley}, 

1171 
year = 1990} 

1172 

11209  1173 
@book{RosenDMA,author={Kenneth H. Rosen}, 
1174 
title={Discrete Mathematics and Its Applications}, 

1175 
publisher={McGrawHill},year=1998} 

1176 

7041  1177 
@InProceedings{Rudnicki:1992:MizarOverview, 
1178 
author = {P. Rudnicki}, 

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

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

1181 
year = 1992, 

1182 
organization = {Chalmers University of Technology}, 

1183 
publisher = {Bastad} 

1184 
} 

1185 

6592  1186 
%S 
1187 

1188 
@inproceedings{saaltinkfme, 

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

1190 
Dan Craigen and Irwin Meisels}, 

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

1192 
pages = {578596}, 

1193 
crossref = {fme93}} 

1194 

1195 
@inproceedings{slindtfl, 

1196 
author = {Konrad Slind}, 

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

23187  1198 
crossref = {tphols96}, 
1199 
pages = {381397}} 

6592  1200 

1201 
@book{suppes72, 

1202 
author = {Patrick Suppes}, 

1203 
title = {Axiomatic Set Theory}, 

1204 
year = 1972, 

1205 
publisher = {Dover}} 

1206 

1207 
@InCollection{szasz93, 

1208 
author = {Nora Szasz}, 

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

1210 
Primitive Recursive}, 

1211 
crossref = {huetplotkin93}, 

1212 
pages = {317338}} 

1213 

7041  1214 
@TechReport{Syme:1997:DECLARE, 
1215 
author = {D. Syme}, 

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

1217 
institution = {University of Cambridge Computer Laboratory}, 

1218 
year = 1997, 

1219 
number = 416 

1220 
} 

1221 

1222 
@PhdThesis{Syme:1998:thesis, 

1223 
author = {D. Syme}, 

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

1225 
school = {University of Cambridge}, 

1226 
year = 1998, 

1227 
note = {Submitted} 

1228 
} 

1229 

1230 
@InProceedings{Syme:1999:TPHOL, 

1231 
author = {D. Syme}, 

1232 
title = {Three Tactic Theorem Proving}, 

1233 
crossref = {tphols99}} 

1234 

6592  1235 
%T 
1236 

1237 
@book{takeuti87, 

1238 
author = {G. Takeuti}, 

1239 
title = {Proof Theory}, 

1240 
year = 1987, 

1241 
publisher = NH, 

1242 
edition = {2nd}} 

1243 

1244 
@Book{thompson91, 

1245 
author = {Simon Thompson}, 

1246 
title = {Type Theory and Functional Programming}, 

1247 
publisher = {AddisonWesley}, 

1248 
year = 1991} 

1249 

11209  1250 
@book{ThompsonHaskell,author={Simon Thompson}, 
1251 
title={Haskell: The Craft of Functional Programming}, 

1252 
publisher={AddisonWesley},year=1999} 

1253 

7041  1254 
@Unpublished{Trybulec:1993:MizarFeatures, 
1255 
author = {A. Trybulec}, 

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

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

1258 
year = 1993 

1259 
} 

1260 

6592  1261 
%V 
1262 

1263 
@Unpublished{voelker94, 

10186  1264 
author = {Norbert V{\"o}lker}, 
6592  1265 
title = {The Verification of a Timer Program using {Isabelle/HOL}}, 
6745  1266 
url = {\url{ftp://ftp.fernunihagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}}, 
6592  1267 
year = 1994, 
1268 
month = aug} 

1269 

1270 
%W 

1271 

23956  1272 
@inproceedings{wadler89how, 
1273 
author = {P. Wadler and S. Blott}, 

1274 
title = {How to make adhoc polymorphism less adhoc}, 

1275 
booktitle = {ACM Symp.\ Principles of Programming Languages}, 

1276 
year = 1989 

1277 
} 

1278 

8505  1279 
@Misc{xsymbol, 
1280 
author = {Christoph Wedler}, 

1281 
title = {Emacs package ``{XSymbol}''}, 

13141  1282 
note = {\url{http://xsymbol.sourceforge.net}} 
8505  1283 
} 
1284 

7858  1285 
@manual{isabellesys, 
1286 
author = {Markus Wenzel and Stefan Berghofer}, 

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

8892  1288 
institution = {TU Munich}, 
1289 
note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}} 

7858  1290 

1291 
@manual{isabelleisarref, 

1292 
author = {Markus Wenzel}, 

7966  1293 
title = {The {Isabelle/Isar} Reference Manual}, 
8892  1294 
institution = {TU Munich}, 
1295 
note = {\url{http://isabelle.in.tum.de/doc/isarref.pdf}}} 

1296 

1297 
@manual{isabelleaxclass, 

1298 
author = {Markus Wenzel}, 

1299 
title = {Using Axiomatic Type Classes in {I}sabelle}, 

1300 
institution = {TU Munich}, 

9567  1301 
year = 2000, 
8892  1302 
note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}} 
7858  1303 

1304 

7041  1305 
@InProceedings{Wenzel:1999:TPHOL, 
1306 
author = {Markus Wenzel}, 

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

1308 
crossref = {tphols99}} 

6624  1309 

1310 
@InProceedings{Wenzel:1997:TPHOL, 

1311 
author = {Markus Wenzel}, 

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

7041  1313 
crossref = {tphols97}} 
1314 

14147  1315 
@phdthesis{WenzelPhD, 
1316 
author={Markus Wenzel}, 

1317 
title={Isabelle/Isar  a versatile environment for humanreadable formal proof documents}, 

1318 
school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, 

1319 
year=2002, 

12901  1320 
note = {\url{http://tumb1.biblio.tumuenchen.de/publ/diss/in/2002/wenzel.html}}} 
7041  1321 

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

1324 
title = {Principia Mathematica}, 

1325 
year = 1962, 

1326 
publisher = CUP, 

1327 
note = {Paperback edition to *56, 

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

1329 

9599  1330 
@Misc{Wiedijk:1999:Mizar, 
1331 
author = {Freek Wiedijk}, 

1332 
title = {Mizar: An Impression}, 

1333 
howpublished = {Unpublished paper}, 

1334 
year = 1999, 

1335 
note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}} 

1336 
} 

1337 

1338 
@Misc{Wiedijk:2000:MV, 

1339 
author = {Freek Wiedijk}, 

1340 
title = {The Mathematical Vernacular}, 

1341 
howpublished = {Unpublished paper}, 

1342 
year = 2000, 

1343 
note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}} 

1344 
} 

1345 

6592  1346 
@book{winskel93, 
1347 
author = {Glynn Winskel}, 

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

1349 
publisher = MIT,year=1993} 

1350 

1351 
@InCollection{wosbledsoe, 

1352 
author = {Larry Wos}, 

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

1354 
crossref = {bledsoefest}, 

1355 
pages = {297342}} 

1356 

7989  1357 
@InProceedings{Zammit:1999:TPHOL, 
1358 
author = {Vincent Zammit}, 

1359 
title = {On the Implementation of an Extensible Declarative Proof Language}, 

1360 
crossref = {tphols99}} 

1361 

1362 
%Z 

1363 

6592  1364 

1365 
% CROSS REFERENCES 

1366 

1367 
@book{handbklics2, 

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

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

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

1371 
publisher = {Oxford University Press}, 

1372 
year = 1992, 

1373 
volume = 2} 

1374 

1375 
@book{types93, 

1376 
editor = {Henk Barendregt and Tobias Nipkow}, 

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

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

1379 
year = {published 1994}, 

1380 
publisher = {Springer}, 

1381 
series = {LNCS 806}} 

1382 

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

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

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

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

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

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

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

1389 

6592  1390 
@Proceedings{tlca93, 
1391 
title = {Typed Lambda Calculi and Applications}, 

1392 
booktitle = {Typed Lambda Calculi and Applications}, 

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

1394 
year = 1993, 

1395 
publisher = {Springer}, 

1396 
series = {LNCS 664}} 

1397 

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

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

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

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

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

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

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

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

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

1406 

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

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

1410 
publisher = {Kluwer Academic Publishers}, 

1411 
year = 1991, 

1412 
editor = {Robert S. Boyer}} 

1413 

1414 
@Proceedings{cade12, 

1415 
editor = {Alan Bundy}, 

1416 
title = {Automated Deduction  {CADE}12 

1417 
International Conference}, 

1418 
booktitle = {Automated Deduction  {CADE}12 

1419 
International Conference}, 

1420 
year = 1994, 

1421 
series = {LNAI 814}, 

1422 
publisher = {Springer}} 

1423 

1424 
@book{types94, 

10186  1425 
editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith}, 
6592  1426 
title = TYPES # {: International Workshop {TYPES '94}}, 
1427 
booktitle = TYPES # {: International Workshop {TYPES '94}}, 

1428 
year = 1995, 

1429 
publisher = {Springer}, 

1430 
series = {LNCS 996}} 

1431 

1432 
@book{huetplotkin91, 

10186  1433 
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, 
6592  1434 
title = {Logical Frameworks}, 
1435 
booktitle = {Logical Frameworks}, 

1436 
publisher = CUP, 

1437 
year = 1991} 

1438 

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

1439 
@book{huetplotkin93, 
10186  1440 
editor = {{G{\'e}rard} Huet and Gordon Plotkin}, 
6613
250a0ca35ef5
new refererences for Inductive manual, but still incomplete
paulson
parents:
6607
diff
changeset

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

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

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

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

1445 

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

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

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

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

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

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

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

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

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

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

1455 

6592  1456 
@proceedings{colog88, 
10186  1457 
editor = {P. MartinL{\"o}f and G. Mints}, 
6592  1458 
title = {COLOG88: International Conference on Computer Logic}, 
1459 
booktitle = {COLOG88: International Conference on Computer Logic}, 

1460 
year = {Published 1990}, 

1461 
publisher = {Springer}, 

1462 
organization = {Estonian Academy of Sciences}, 

1463 
address = {Tallinn}, 

1464 
series = {LNCS 417}} 

1465 

