author  wenzelm 
Wed, 15 Apr 2009 11:14:48 +0200  
changeset 30895  bad26d8f0adf 
parent 30242  aea5d7fa7ef5 
child 31256  cf75908fd3c3 
permissions  rwrr 
6592  1 
% BibTeX database for the Isabelle documentation 
2 

3 
%publishers 

4 
@string{AP="Academic Press"} 

5 
@string{CUP="Cambridge University Press"} 

6 
@string{IEEE="{\sc ieee} Computer Society Press"} 

11199  7 
@string{LNCS="Lecture Notes in Computer Science"} 
6592  8 
@string{MIT="MIT Press"} 
9 
@string{NH="NorthHolland"} 

10 
@string{Prentice="PrenticeHall"} 

6607  11 
@string{PH="PrenticeHall"} 
6592  12 
@string{Springer="SpringerVerlag"} 
13 

14 
%institutions 

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

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

19 
%journals 

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

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

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

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

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

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

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

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

33 
%conferences 

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

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

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

37 

38 

39 
%A 

40 

41 
@incollection{abramsky90, 

42 
author = {Samson Abramsky}, 

43 
title = {The Lazy Lambda Calculus}, 

44 
pages = {65116}, 

45 
editor = {David A. Turner}, 

46 
booktitle = {Research Topics in Functional Programming}, 

47 
publisher = {AddisonWesley}, 

48 
year = 1990} 

49 

50 
@Unpublished{abrial93, 

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

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

53 
Theorems of Set Theory}, 

54 
note = {preprint}, 

55 
year = 1993, 

56 
month = Feb} 

57 

58 
@incollection{aczel77, 

59 
author = {Peter Aczel}, 

60 
title = {An Introduction to Inductive Definitions}, 

61 
pages = {739782}, 

62 
crossref = {barwisehandbk}} 

63 

64 
@Book{aczel88, 

65 
author = {Peter Aczel}, 

66 
title = {NonWellFounded Sets}, 

67 
publisher = {CSLI}, 

68 
year = 1988} 

69 

70 
@InProceedings{alf, 

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

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

73 
crossref = {types93}, 

74 
pages = {213237}} 

75 

76 
@book{andrews86, 

77 
author = "Peter Andrews", 

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

79 
through Proof", 

80 
publisher = AP, 

81 
series = "Computer Science and Applied Mathematics", 

82 
year = 1986} 

83 

9599  84 
@InProceedings{Aspinall:2000:eProof, 
85 
author = {David Aspinall}, 

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

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

88 
year = 2000, 

89 
note = {Unpublished workinprogress paper, 

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

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

92 

8505  93 
@InProceedings{Aspinall:TACAS:2000, 
94 
author = {David Aspinall}, 

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

98 
year = 2000, 

99 
publisher = Springer, 

100 
series = LNCS, 

101 
volume = 1785, 

102 
pages = "3842" 

8505  103 
} 
104 

7209  105 
@Misc{isamode, 
106 
author = {David Aspinall}, 

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

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

111 
@Misc{proofgeneral, 

11197  112 
author = {David Aspinall}, 
113 
title = {{P}roof {G}eneral}, 

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

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

6592  117 
%B 
118 

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

121 

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

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

125 
booktitle = {Handbook of Automated Reasoning}, 

126 
publisher = {Elsevier}, 

127 
year = 2001, 

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

129 
} 

130 

6592  131 
@incollection{basin91, 
132 
author = {David Basin and Matt Kaufmann}, 

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

134 
Comparison}, 

135 
crossref = {huetplotkin91}, 

136 
pages = {89119}} 

137 

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

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

141 
Markus Wenzel}, 

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

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

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

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

151 
{I}sabelle/{I}sar}, 

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

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

9567  155 
series = {LNCS}, 
9599  156 
year = 2000 
9567  157 
} 
6624  158 

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

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

162 
crossref = {tphols2001}} 

163 

11619  164 
@INPROCEEDINGS{BerghoferNipkow:2000:TPHOL, 
165 
crossref = "tphols2000", 

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

167 
author = "Stefan Berghofer and Tobias Nipkow", 

168 
pages = "3852"} 

169 

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

172 
title = {Executing Higher Order Logic}, 

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

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

175 
series = LNCS, 

176 
publisher = Springer, 

13009  177 
volume = 2277, 
12612  178 
year = 2002} 
179 

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

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

184 
crossref = {tphols99}} 

6624  185 

30170  186 

187 
@InProceedings{BezemCoquand:2005, 

188 
author = {M.A. Bezem and T. Coquand}, 

189 
title = {Automating {Coherent Logic}}, 

190 
booktitle = {LPAR12}, 

191 
editor = {G. Sutcliffe and A. Voronkov}, 

192 
volume = 3835, 

193 
series = LNCS, 

194 
publisher = Springer} 

195 

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

198 

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

201 
publisher=PH,year=1998} 

202 

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

205 
Overbeek and Mark Stickel and Lawrence Wos}, 

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

207 
Axioms}, 

208 
journal = JAR, 

209 
year = 1986, 

210 
volume = 2, 

211 
number = 3, 

212 
pages = {287327}} 

213 

214 
@book{bm79, 

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

216 
title = {A Computational Logic}, 

217 
publisher = {Academic Press}, 

218 
year = 1979} 

219 

220 
@book{bm88book, 

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

222 
title = {A Computational Logic Handbook}, 

223 
publisher = {Academic Press}, 

224 
year = 1988} 

225 

226 
@Article{debruijn72, 

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

228 
title = {Lambda Calculus Notation with Nameless Dummies, 

229 
a Tool for Automatic Formula Manipulation, 

230 
with Application to the {ChurchRosser Theorem}}, 

231 
journal = {Indag. Math.}, 

232 
volume = 34, 

233 
pages = {381392}, 

234 
year = 1972} 

235 

23187  236 
@InProceedings{bulwahnKN07, 
25093  237 
author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow}, 
238 
title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}}, 

239 
crossref = {tphols2007}, 

240 
pages = {3853} 

241 
} 

23187  242 

28593  243 
@InProceedings{bulwahnetal:2008:imperative, 
244 
author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews}, 

245 
title = {Imperative Functional Programming with {Isabelle/HOL}}, 

246 
crossref = {tphols2008}, 

247 
} 

248 
% pages = {3853} 

249 

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

252 
title = {A Logic of Authentication}, 

253 
journal = PROYAL, 

254 
year = 1989, 

255 
volume = 426, 

256 
pages = {233271}} 

257 

6592  258 
%C 
259 

260 
@TechReport{camilleri92, 

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

262 
title = {Reasoning with Inductively Defined Relations in the 

263 
{HOL} Theorem Prover}, 

264 
institution = CUCL, 

265 
year = 1992, 

266 
number = 265, 

267 
month = Aug} 

268 

269 
@Book{charniak80, 

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

271 
title = {Artificial Intelligence Programming}, 

272 
publisher = {Lawrence Erlbaum Associates}, 

273 
year = 1980} 

274 

275 
@article{church40, 

276 
author = "Alonzo Church", 

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

278 
journal = JSL, 

279 
year = 1940, 

280 
volume = 5, 

281 
pages = "5668"} 

282 

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

285 

6592  286 
@PhdThesis{coen92, 
287 
author = {Martin D. Coen}, 

288 
title = {Interactive Program Derivation}, 

289 
school = {University of Cambridge}, 

290 
note = {Computer Laboratory Technical Report 272}, 

291 
month = nov, 

292 
year = 1992} 

293 

294 
@book{constable86, 

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

296 
title = {Implementing Mathematics with the Nuprl Proof 

297 
Development System}, 

298 
publisher = Prentice, 

299 
year = 1986} 

300 

301 
%D 

302 

6745  303 
@Book{daveypriestley, 
6592  304 
author = {B. A. Davey and H. A. Priestley}, 
305 
title = {Introduction to Lattices and Order}, 

306 
publisher = CUP, 

307 
year = 1990} 

308 

309 
@Book{devlin79, 

310 
author = {Keith J. Devlin}, 

311 
title = {Fundamentals of Contemporary Set Theory}, 

312 
publisher = {Springer}, 

313 
year = 1979} 

314 

315 
@book{dummett, 

316 
author = {Michael Dummett}, 

317 
title = {Elements of Intuitionism}, 

318 
year = 1977, 

319 
publisher = {Oxford University Press}} 

320 

321 
@incollection{dybjer91, 

322 
author = {Peter Dybjer}, 

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

326 
pages = {280306}} 

327 

328 
@Article{dyckhoff, 

329 
author = {Roy Dyckhoff}, 

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

331 
journal = JSL, 

332 
year = 1992, 

333 
volume = 57, 

334 
number = 3, 

335 
pages = {795807}} 

336 

337 
%F 

338 

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

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

340 
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

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

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

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

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

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

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

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

348 

6592  349 
@InProceedings{felty91a, 
350 
Author = {Amy Felty}, 

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

352 
Deduction Proofs}, 

353 
crossref = {extensions91}, 

354 
pages = {157178}} 

355 

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

358 
title = {Mechanizing Nonstandard Real Analysis}, 

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

360 
year = 2000, 

361 
volume = 3, 

362 
pages = {140190}, 

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

364 
} 

365 

6592  366 
@TechReport{frost93, 
367 
author = {Jacob Frost}, 

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

369 
institution = CUCL, 

370 
number = 308, 

371 
year = 1993, 

372 
month = Aug} 

373 

374 
%revised version of frost93 

375 
@TechReport{frost95, 

376 
author = {Jacob Frost}, 

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

378 
institution = CUCL, 

379 
number = 359, 

380 
year = 1995, 

381 
month = Feb} 

382 

383 
@inproceedings{OBJ, 

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

385 
and J. Meseguer}, 

386 
title = {Principles of {OBJ2}}, 

387 
booktitle = POPL, 

388 
year = 1985, 

389 
pages = {5266}} 

390 

391 
%G 

392 

393 
@book{gallier86, 

394 
author = {J. H. Gallier}, 

395 
title = {Logic for Computer Science: 

396 
Foundations of Automatic Theorem Proving}, 

397 
year = 1986, 

398 
publisher = {Harper \& Row}} 

399 

400 
@Book{galton90, 

401 
author = {Antony Galton}, 

402 
title = {Logic for Information Technology}, 

403 
publisher = {Wiley}, 

404 
year = 1990} 

405 

20506  406 
@Article{Gentzen:1935, 
407 
author = {G. Gentzen}, 

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

409 
journal = {Math. Zeitschrift}, 

410 
year = 1935 

411 
} 

412 

6592  413 
@InProceedings{gimenezcodifying, 
414 
author = {Eduardo Gim{\'e}nez}, 

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

416 
crossref = {types94}, 

417 
pages = {3959} 

418 
} 

419 

9816  420 
@book{girard89, 
421 
author = {JeanYves Girard}, 

422 
title = {Proofs and Types}, 

423 
year = 1989, 

424 
publisher = CUP, 

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

426 

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

431 
publisher = CUP, 

432 
year = 1993} 

433 

434 
@book{mgordon79, 

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

436 
Wadsworth}, 

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

438 
year = 1979, 

439 
publisher = {Springer}, 

440 
series = {LNCS 78}} 

441 

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

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

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

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

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

448 

6592  449 
@InProceedings{guntertrees, 
450 
author = {Elsa L. Gunter}, 

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

452 
{HOL}}, 

453 
crossref = {hug93}, 

454 
pages = {141154}} 

455 

456 
%H 

457 

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

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

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

463 
publisher = {Springer}, 

464 
series = {LNCS}, 

465 
volume = {4502}, 

466 
year = {2007} 

24193  467 
} 
468 

469 
@TechReport{HaftmannNipkow:2007:codegen, 

470 
author = {Florian Haftmann and Tobias Nipkow}, 

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

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

474 
month = {08}, 

475 
year = {2007}, 

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

477 
number = {364/07} 

23956  478 
} 
479 

30115  480 
@InProceedings{HaftmannWenzel:2009, 
481 
author = {Florian Haftmann and Makarius Wenzel}, 

482 
title = {Local theory specifications in {Isabelle/Isar}}, 

483 
editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo}, 

484 
booktitle = {Types for Proofs and Programs, TYPES 2008}, 

485 
publisher = {Springer}, 

486 
series = {LNCS}, 

487 
volume = {????}, 

488 
year = {2009} 

489 
} 

490 

22290  491 
@manual{isabelleclasses, 
24193  492 
author = {Florian Haftmann}, 
493 
title = {Haskellstyle type classes with {Isabelle}/{Isar}}, 

494 
institution = TUM, 

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

496 
} 

22290  497 

498 
@manual{isabellecodegen, 

24193  499 
author = {Florian Haftmann}, 
500 
title = {Code generation from Isabelle theories}, 

501 
institution = TUM, 

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

503 
} 

22290  504 

6592  505 
@Book{halmos60, 
506 
author = {Paul R. Halmos}, 

507 
title = {Naive Set Theory}, 

508 
publisher = {Van Nostrand}, 

509 
year = 1960} 

510 

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

513 

6592  514 
@Book{hennessy90, 
515 
author = {Matthew Hennessy}, 

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

517 
Introduction Using Structural Operational Semantics}, 

518 
publisher = {Wiley}, 

519 
year = 1990} 

520 

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

523 
publisher={AddisonWesley},year=1979} 

524 

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

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

528 
Nonstrict, Purely Functional Language}, 

529 
journal = SIGPLAN, 

530 
year = 1992, 

531 
volume = 27, 

532 
number = 5, 

533 
month = May, 

534 
note = {Version 1.2}} 

535 

536 
@Article{haskelltutorial, 

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

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

539 
journal = SIGPLAN, 

540 
year = 1992, 

541 
volume = 27, 

542 
number = 5, 

543 
month = May} 

544 

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

547 

6592  548 
@article{huet75, 
549 
author = {G. P. Huet}, 

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

551 
journal = TCS, 

552 
volume = 1, 

553 
year = 1975, 

554 
pages = {2757}} 

555 

556 
@article{huet78, 

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

558 
title = {Proving and Applying Program Transformations Expressed with 

559 
SecondOrder Patterns}, 

560 
journal = acta, 

561 
volume = 11, 

562 
year = 1978, 

563 
pages = {3155}} 

564 

565 
@inproceedings{huet88, 

10186  566 
author = {G{\'e}rard Huet}, 
6592  567 
title = {Induction Principles Formalized in the {Calculus of 
568 
Constructions}}, 

569 
booktitle = {Programming of Future Generation Computers}, 

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

571 
year = 1988, 

572 
pages = {205216}, 

573 
publisher = {Elsevier}} 

574 

10186  575 
@Book{HuthRyanbook, 
576 
author = {Michael Huth and Mark Ryan}, 

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

578 
publisher = CUP, 

579 
year = 2000} 

580 

7041  581 
@InProceedings{Harrison:1996:MizarHOL, 
582 
author = {J. Harrison}, 

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

584 
pages = {203220}, 

585 
crossref = {tphols96}} 

586 

22290  587 
%J 
588 

589 
@article{haskellrevisedreport, 

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

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

592 
journal = {Journal of Functional Programming}, 

593 
volume = 13, 

594 
number = 1, 

595 
pages = {0255}, 

596 
month = {Jan}, 

597 
year = 2003, 

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

599 

6592  600 
%K 
601 

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

604 
Lawrence C. Paulson}, 

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

606 
crossref = {tphols99}} 

607 

8284  608 
@book{Knuth375, 
609 
author={Donald E. Knuth}, 

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

611 
publisher={AddisonWesley}, 

612 
year=1975} 

613 

614 
@Article{korf85, 

615 
author = {R. E. Korf}, 

616 
title = {DepthFirst IterativeDeepening: an Optimal Admissible 

617 
Tree Search}, 

618 
journal = AI, 

619 
year = 1985, 

620 
volume = 27, 

621 
pages = {97109}} 

6607  622 

23187  623 
@InProceedings{krauss2006, 
624 
author = {Alexander Krauss}, 

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

626 
crossref = {ijcar2006}, 

627 
pages = {589603}} 

628 

24524  629 
@manual{isabellefunction, 
630 
author = {Alexander Krauss}, 

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

632 
institution = TUM, 

25280  633 
note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}} 
24524  634 
} 
635 

6592  636 
@Book{kunen80, 
637 
author = {Kenneth Kunen}, 

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

639 
publisher = NH, 

640 
year = 1980} 

641 

11246  642 
%L 
643 

22290  644 
@manual{OCaml, 
645 
author = {Xavier Leroy and others}, 

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

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

648 

11246  649 
@InProceedings{lowefdr, 
650 
author = {Gavin Lowe}, 

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

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

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

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

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

656 
series = {LNCS 1055}, 

657 
year = 1996, 

658 
publisher = {Springer}, 

659 
pages = {147166}} 

660 

6592  661 
%M 
662 

663 
@Article{mw81, 

664 
author = {Zohar Manna and Richard Waldinger}, 

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

666 
journal = SCP, 

667 
year = 1981, 

668 
volume = 1, 

669 
number = 1, 

670 
pages = {548}} 

671 

672 
@InProceedings{martinnipkow, 

673 
author = {Ursula Martin and Tobias Nipkow}, 

674 
title = {Ordered Rewriting and Confluence}, 

675 
crossref = {cade10}, 

676 
pages = {366380}} 

677 

678 
@book{martinlof84, 

10186  679 
author = {Per MartinL{\"o}f}, 
6592  680 
title = {Intuitionistic type theory}, 
681 
year = 1984, 

682 
publisher = {Bibliopolis}} 

683 

684 
@incollection{melham89, 

685 
author = {Thomas F. Melham}, 

686 
title = {Automating Recursive Type Definitions in Higher Order 

687 
Logic}, 

688 
pages = {341386}, 

689 
crossref = {birtwistle89}} 

690 

29728  691 
@Article{Miller:1991, 
692 
author = {Dale Miller}, 

693 
title = {A Logic Programming Language with LambdaAbstraction, Function Variables, 

694 
and Simple Unification}, 

695 
journal = {Journal of Logic and Computation}, 

696 
year = 1991, 

697 
volume = 1, 

698 
number = 4 

699 
} 

700 

6592  701 
@Article{millermixed, 
702 
Author = {Dale Miller}, 

703 
Title = {Unification Under a Mixed Prefix}, 

704 
journal = JSC, 

705 
volume = 14, 

706 
number = 4, 

707 
pages = {321358}, 

708 
Year = 1992} 

709 

710 
@Article{milner78, 

711 
author = {Robin Milner}, 

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

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

714 
year = 1978, 

715 
volume = 17, 

716 
pages = {348375}} 

717 

718 
@TechReport{milnerind, 

719 
author = {Robin Milner}, 

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

721 
institution = Edinburgh, 

722 
year = 1980, 

723 
type = {note}} 

724 

725 
@Article{milnercoind, 

726 
author = {Robin Milner and Mads Tofte}, 

727 
title = {Coinduction in Relational Semantics}, 

728 
journal = TCS, 

729 
year = 1991, 

730 
volume = 87, 

731 
pages = {209220}} 

732 

733 
@Book{milner89, 

734 
author = {Robin Milner}, 

735 
title = {Communication and Concurrency}, 

736 
publisher = Prentice, 

737 
year = 1989} 

738 

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

741 

6592  742 
@PhdThesis{monahan84, 
743 
author = {Brian Q. Monahan}, 

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

745 
school = {University of Edinburgh}, 

746 
year = 1984} 

747 

6607  748 
@article{MuellerNvOS99, 
749 
author= 

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

9599  753 
@Manual{Muzalewski:Mizar, 
754 
title = {An Outline of {PC} {Mizar}}, 

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

756 
organization = {Fondation of Logic, Mathematics and Informatics 

757 
 Mizar Users Group}, 

758 
year = 1993, 

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

760 
} 

761 

6592  762 
%N 
763 

764 
@InProceedings{NaraschewskiWTPHOLs98, 

765 
author = {Wolfgang Naraschewski and Markus Wenzel}, 

766 
title = 

7041  767 
{ObjectOriented Verification based on Record Subtyping in 
768 
HigherOrder Logic}, 

769 
crossref = {tphols98}} 

6592  770 

771 
@inproceedings{nazarethnipkow, 

772 
author = {Dieter Nazareth and Tobias Nipkow}, 

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

774 
crossref = {tphols96}, 

775 
pages = {331345}, 

776 
year = 1996} 

777 

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

780 
title = "Using Encryption for Authentication in Large Networks 

781 
of Computers", 

782 
journal = cacm, 

783 
volume = 21, 

784 
number = 12, 

785 
pages = "993999", 

786 
month = dec, 

787 
year = 1978} 

788 

6592  789 
@inproceedings{nipkowW, 
790 
author = {Wolfgang Naraschewski and Tobias Nipkow}, 

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

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

10186  793 
editor = {E. Gim{\'e}nez and C. PaulinMohring}, 
6592  794 
publisher = Springer, 
795 
series = LNCS, 

796 
volume = 1512, 

797 
pages = {317332}, 

798 
year = 1998} 

799 

8892  800 
@InCollection{nipkowsorts93, 
801 
author = {T. Nipkow}, 

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

803 
booktitle = {Logical Environments}, 

804 
publisher = CUP, 

805 
year = 1993, 

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

807 
pages = {164188} 

808 
} 

809 

810 
@Misc{nipkowtypes93, 

811 
author = {Tobias Nipkow}, 

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

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

814 
year = 1993 

815 
} 

816 

6592  817 
@inproceedings{NipkowCR, 
818 
author = {Tobias Nipkow}, 

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

820 
booktitle = {Automated Deduction  CADE13}, 

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

822 
publisher = Springer, 

823 
series = LNCS, 

824 
volume = 1104, 

825 
pages = {733747}, 

826 
year = 1996} 

827 

828 
% WAS NipkowLICS93 

829 
@InProceedings{nipkowpatterns, 

830 
title = {Functional Unification of HigherOrder Patterns}, 

831 
author = {Tobias Nipkow}, 

832 
pages = {6474}, 

833 
crossref = {lics8}, 

6745  834 
url = {\url{ftp://ftp.informatik.tumuenchen.de/local/lehrstuhl/nipkow/lics93.html}}, 
6592  835 
keywords = {unification}} 
836 

837 
@article{nipkowIMP, 

838 
author = {Tobias Nipkow}, 

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

840 
journal = FAC, 

841 
volume = 10, 

842 
pages = {171186}, 

843 
year = 1998} 

844 

15429  845 
@inproceedings{NipkowTYPES02, 
846 
author = {Tobias Nipkow}, 

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

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

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

850 
year = 2003, 

851 
publisher = Springer, 

852 
series = LNCS, 

853 
volume = 2646, 

854 
pages = {259278}} 

855 

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

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

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

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

6592  863 
@article{nipkowprehofer, 
864 
author = {Tobias Nipkow and Christian Prehofer}, 

865 
title = {Type Reconstruction for Type Classes}, 

866 
journal = JFP, 

867 
volume = 5, 

868 
number = 2, 

869 
year = 1995, 

870 
pages = {201224}} 

871 

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

874 
title = {Type checking type classes}, 

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

876 
year = 1993 

877 
} 

878 

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

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

882 
publisher = {Springer}, 

883 
year = 2002, 

884 
note = {LNCS Tutorial 2283}} 

885 

6592  886 
@Article{noel, 
887 
author = {Philippe No{\"e}l}, 

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

889 
journal = JAR, 

890 
volume = 10, 

891 
number = 1, 

892 
pages = {1558}, 

893 
year = 1993} 

894 

895 
@book{nordstrom90, 

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

6592  898 
Introduction}, 
899 
publisher = {Oxford University Press}, 

900 
year = 1990} 

901 

902 
%O 

903 

904 
@Manual{pvslanguage, 

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

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

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

908 
address = {Menlo Park, CA}, 

6745  909 
note = {Beta release}, 
6592  910 
year = 1993, 
911 
month = apr, 

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

914 
%P 

915 

916 
% replaces paulin92 

917 
@InProceedings{paulintlca, 

918 
author = {Christine PaulinMohring}, 

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

920 
Properties}, 

921 
crossref = {tlca93}, 

922 
pages = {328345}} 

923 

924 
@InProceedings{paulsonCADE, 

925 
author = {Lawrence C. Paulson}, 

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

927 
Definitions}, 

928 
pages = {148161}, 

929 
crossref = {cade12}} 

930 

931 
@InProceedings{paulsonCOLOG, 

932 
author = {Lawrence C. Paulson}, 

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

934 
{Isabelle})}, 

935 
pages = {246274}, 

936 
crossref = {colog88}, 

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

939 
@Article{paulsoncoind, 

940 
author = {Lawrence C. Paulson}, 

941 
title = {Mechanizing Coinduction and Corecursion in HigherOrder 

942 
Logic}, 

943 
journal = JLC, 

944 
year = 1997, 

945 
volume = 7, 

946 
number = 2, 

947 
month = mar, 

948 
pages = {175204}} 

949 

12616  950 
@manual{isabelleintro, 
951 
author = {Lawrence C. Paulson}, 

952 
title = {Introduction to {Isabelle}}, 

953 
institution = CUCL, 

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

955 

956 
@manual{isabellelogics, 

957 
author = {Lawrence C. Paulson}, 

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

959 
institution = CUCL, 

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

961 

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

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

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

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

6607  967 

968 
@manual{isabelleZF, 

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

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

6592  973 

974 
@article{paulsonfound, 

975 
author = {Lawrence C. Paulson}, 

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

977 
journal = JAR, 

978 
volume = 5, 

979 
number = 3, 

980 
pages = {363397}, 

981 
year = 1989, 

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

984 
%replaces paulsonfinal 

985 
@Article{paulsonmscs, 

986 
author = {Lawrence C. Paulson}, 

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

6592  989 
journal = {Mathematical Structures in Computer Science}, 
990 
year = 1999, 

991 
volume = 9, 

23505  992 
number = 5, 
993 
pages = {545567}} 

6592  994 

995 
@InCollection{paulsongeneric, 

996 
author = {Lawrence C. Paulson}, 

997 
title = {Generic Automatic Proof Tools}, 

998 
crossref = {wosfest}, 

999 
chapter = 3} 

1000 

1001 
@Article{paulsongr, 

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

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

1004 
Choice}, 

1005 
journal = JAR, 

1006 
year = 1996, 

1007 
volume = 17, 

1008 
number = 3, 

1009 
month = dec, 

1010 
pages = {291323}} 

1011 

14210  1012 
@InCollection{paulsonfixedptmilner, 
1013 
author = {Lawrence C. Paulson}, 

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

1015 
(Co)datatype Definitions}, 

1016 
pages = {187211}, 

1017 
crossref = {milnerfest}} 

1018 

1019 
@book{milnerfest, 

1020 
title = {Proof, Language, and Interaction: 

1021 
Essays in Honor of {Robin Milner}}, 

1022 
booktitle = {Proof, Language, and Interaction: 

1023 
Essays in Honor of {Robin Milner}}, 

1024 
publisher = {MIT Press}, 

1025 
year = 2000, 

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

1027 

6592  1028 
@InCollection{paulsonhandbook, 
1029 
author = {Lawrence C. Paulson}, 

1030 
title = {Designing a Theorem Prover}, 

1031 
crossref = {handbklics2}, 

1032 
pages = {415475}} 

1033 

1034 
@Book{paulsonisabook, 

1035 
author = {Lawrence C. Paulson}, 

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

1037 
publisher = {Springer}, 

1038 
year = 1994, 

1039 
note = {LNCS 828}} 

1040 

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

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

1044 
publisher = {Springer}, 

1045 
year = 2002, 

1046 
note = {LNCS 2283}} 

1047 

6592  1048 
@InCollection{paulsonmarkt, 
1049 
author = {Lawrence C. Paulson}, 

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

1051 
booktitle = {Mathematical Methods in Program Development: 

1052 
Summer School Marktoberdorf 1996}, 

1053 
publisher = {Springer}, 

1054 
pages = {461498}, 

1055 
year = {Published 1997}, 

1056 
editor = {Manfred Broy}, 

1057 
series = {NATO ASI Series F}} 

1058 

1059 
%replaces PaulsonML and paulson91 

1060 
@book{paulsonml2, 

1061 
author = {Lawrence C. Paulson}, 

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

1063 
year = 1996, 

1064 
edition = {2nd}, 

1065 
publisher = CUP} 

1066 

1067 
@article{paulsonnatural, 

1068 
author = {Lawrence C. Paulson}, 

1069 
title = {Natural Deduction as Higherorder Resolution}, 

1070 
journal = JLP, 

1071 
volume = 3, 

1072 
pages = {237258}, 

1073 
year = 1986, 

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

1076 
@Article{paulsonsetI, 

1077 
author = {Lawrence C. Paulson}, 

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

1079 
Foundations to Functions}, 

1080 
journal = JAR, 

1081 
volume = 11, 

1082 
number = 3, 

1083 
pages = {353389}, 

1084 
year = 1993, 

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

1087 
@Article{paulsonsetII, 

1088 
author = {Lawrence C. Paulson}, 

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

1090 
Recursion}, 

1091 
journal = JAR, 

1092 
volume = 15, 

1093 
number = 2, 

1094 
pages = {167215}, 

1095 
year = 1995, 

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

1098 
@article{paulson85, 

1099 
author = {Lawrence C. Paulson}, 

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

1101 
journal = SCP, 

1102 
volume = 5, 

1103 
pages = {143170}, 

1104 
year = 1985} 

1105 

11564  1106 
%replaces PaulsonLCF 
6592  1107 
@book{paulson87, 
1108 
author = {Lawrence C. Paulson}, 

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

1110 
LCF}, 

1111 
year = 1987, 

1112 
publisher = CUP} 

1113 

1114 
@incollection{paulson700, 

1115 
author = {Lawrence C. Paulson}, 

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

1117 
crossref = {odifreddi90}, 

1118 
pages = {361386}, 

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

1121 
% replaces paulsonns and paulsonsecurity 

1122 
@Article{paulsonjcs, 

1123 
author = {Lawrence C. Paulson}, 

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

1125 
journal = JCS, 

1126 
year = 1998, 

1127 
volume = 6, 

1128 
pages = {85128}} 

1129 

11246  1130 
@Article{paulsontls, 
1131 
author = {Lawrence C. Paulson}, 

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

1133 
journal = TISSEC, 

1134 
month = aug, 

1135 
year = 1999, 

1136 
volume = 2, 

1137 
number = 3, 

1138 
pages = {332351}} 

21074  1139 

1140 
@Article{paulsonyahalom, 

1141 
author = {Lawrence C. Paulson}, 

1142 
title = {Relations Between Secrets: 

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

1144 
journal = JCS, 

23505  1145 
volume = 9, 
1146 
number = 3, 

1147 
pages = {197216}, 

1148 
year = 2001}} 

11246  1149 

6592  1150 
@article{pelletier86, 
1151 
author = {F. J. Pelletier}, 

1152 
title = {Seventyfive Problems for Testing Automatic Theorem 

1153 
Provers}, 

1154 
journal = JAR, 

1155 
volume = 2, 

1156 
pages = {191216}, 

1157 
year = 1986, 

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

1159 

1160 
@Article{pitts94, 

1161 
author = {Andrew M. Pitts}, 

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

1163 
journal = TCS, 

1164 
volume = 124, 

1165 
pages = {195219}, 

1166 
year = 1994} 

1167 

1168 
@Article{plaisted90, 

1169 
author = {David A. Plaisted}, 

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

1171 
Refinement}, 

1172 
journal = JAR, 

1173 
year = 1990, 

1174 
volume = 6, 

1175 
number = 4, 

1176 
pages = {389402}} 

1177 

1178 
%Q 

1179 

1180 
@Article{quaife92, 

1181 
author = {Art Quaife}, 

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

1183 
Theory}, 

1184 
journal = JAR, 

1185 
year = 1992, 

1186 
volume = 8, 

1187 
number = 1, 

1188 
pages = {91147}} 

1189 

1190 
%R 

1191 

1192 
@TechReport{rasmussen95, 

1193 
author = {Ole Rasmussen}, 

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

1195 
Experiment}, 

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

1197 
year = 1995, 

1198 
number = 364, 

1199 
month = may, 

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

1202 
@Book{reeves90, 

1203 
author = {Steve Reeves and Michael Clarke}, 

1204 
title = {Logic for Computer Science}, 

1205 
publisher = {AddisonWesley}, 

1206 
year = 1990} 

1207 

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

1210 
publisher={McGrawHill},year=1998} 

1211 

7041  1212 
@InProceedings{Rudnicki:1992:MizarOverview, 
1213 
author = {P. Rudnicki}, 

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

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

1216 
year = 1992, 

1217 
organization = {Chalmers University of Technology}, 

1218 
publisher = {Bastad} 

1219 
} 

1220 

6592  1221 
%S 
1222 

1223 
@inproceedings{saaltinkfme, 

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

1225 
Dan Craigen and Irwin Meisels}, 

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

1227 
pages = {578596}, 

1228 
crossref = {fme93}} 

1229 

29728  1230 
@Article{SchroederHeister:1984, 
1231 
author = {Peter SchroederHeister}, 

1232 
title = {A Natural Extension of Natural Deduction}, 

1233 
journal = {Journal of Symbolic Logic}, 

1234 
year = 1984, 

1235 
volume = 49, 

1236 
number = 4 

1237 
} 

1238 

6592  1239 
@inproceedings{slindtfl, 
1240 
author = {Konrad Slind}, 

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

23187  1242 
crossref = {tphols96}, 
1243 
pages = {381397}} 

6592  1244 

1245 
@book{suppes72, 

1246 
author = {Patrick Suppes}, 

1247 
title = {Axiomatic Set Theory}, 

1248 
year = 1972, 

1249 
publisher = {Dover}} 

1250 

1251 
@InCollection{szasz93, 

1252 
author = {Nora Szasz}, 

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

1254 
Primitive Recursive}, 

1255 
crossref = {huetplotkin93}, 

1256 
pages = {317338}} 

1257 

7041  1258 
@TechReport{Syme:1997:DECLARE, 
1259 
author = {D. Syme}, 

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

1261 
institution = {University of Cambridge Computer Laboratory}, 

1262 
year = 1997, 

1263 
number = 416 

1264 
} 

1265 

1266 
@PhdThesis{Syme:1998:thesis, 

1267 
author = {D. Syme}, 

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

1269 
school = {University of Cambridge}, 

1270 
year = 1998, 

1271 
note = {Submitted} 

1272 
} 

1273 

1274 
@InProceedings{Syme:1999:TPHOL, 

1275 
author = {D. Syme}, 

1276 
title = {Three Tactic Theorem Proving}, 

1277 
crossref = {tphols99}} 

1278 

6592  1279 
%T 
1280 

1281 
@book{takeuti87, 

1282 
author = {G. Takeuti}, 

1283 
title = {Proof Theory}, 

1284 
year = 1987, 

1285 
publisher = NH, 

1286 
edition = {2nd}} 

1287 

1288 
@Book{thompson91, 

1289 
author = {Simon Thompson}, 

1290 
title = {Type Theory and Functional Programming}, 

1291 
publisher = {AddisonWesley}, 

1292 
year = 1991} 

1293 

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

1296 
publisher={AddisonWesley},year=1999} 

1297 

7041  1298 
@Unpublished{Trybulec:1993:MizarFeatures, 
1299 
author = {A. Trybulec}, 

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

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

1302 
year = 1993 

1303 
} 

1304 

6592  1305 
%V 
1306 

1307 
@Unpublished{voelker94, 

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

1313 

1314 
%W 

1315 

23956  1316 
@inproceedings{wadler89how, 
1317 
author = {P. Wadler and S. Blott}, 

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

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

1320 
year = 1989 

1321 
} 

1322 

8505  1323 
@Misc{xsymbol, 
1324 
author = {Christoph Wedler}, 

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

13141  1326 
note = {\url{http://xsymbol.sourceforge.net}} 
8505  1327 
} 
1328 

7858  1329 
@manual{isabellesys, 
1330 
author = {Markus Wenzel and Stefan Berghofer}, 

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

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

7858  1334 

1335 
@manual{isabelleisarref, 

28837  1336 
author = {Makarius Wenzel}, 
7966  1337 
title = {The {Isabelle/Isar} Reference Manual}, 
8892  1338 
institution = {TU Munich}, 
1339 
note = {\url{http://isabelle.in.tum.de/doc/isarref.pdf}}} 

1340 

28837  1341 
@manual{isabelleimplementation, 
1342 
author = {Makarius Wenzel}, 

1343 
title = {The {Isabelle/Isar} Implementation}, 

1344 
institution = {TU Munich}, 

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

1346 

8892  1347 
@manual{isabelleaxclass, 
1348 
author = {Markus Wenzel}, 

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

1350 
institution = {TU Munich}, 

9567  1351 
year = 2000, 
8892  1352 
note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}} 
7858  1353 

1354 

7041  1355 
@InProceedings{Wenzel:1999:TPHOL, 
1356 
author = {Markus Wenzel}, 

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

1358 
crossref = {tphols99}} 

6624  1359 

1360 
@InProceedings{Wenzel:1997:TPHOL, 

1361 
author = {Markus Wenzel}, 

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

7041  1363 
crossref = {tphols97}} 
1364 

14147  1365 
@phdthesis{WenzelPhD, 
1366 
author={Markus Wenzel}, 

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

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

1369 
year=2002, 

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

29715  1372 
@Article{WenzelWiedijk:2002, 
1373 
author = {Freek Wiedijk and Markus Wenzel}, 

1374 
title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.}, 

1375 
journal = {Journal of Automated Reasoning}, 

1376 
year = 2002, 

1377 
volume = 29, 

1378 
number = {34} 

1379 
} 

1380 

1381 
@InCollection{WenzelPaulson:2006, 

1382 
author = {Markus Wenzel and Lawrence C. Paulson}, 

1383 
title = {{Isabelle/Isar}}, 

1384 
booktitle = {The Seventeen Provers of the World}, 

1385 
year = 2006, 

1386 
editor = {F. Wiedijk}, 

1387 
series = {LNAI 3600} 

1388 
} 

1389 

27060  1390 
@InCollection{Wenzel:2006:Festschrift, 
1391 
author = {Makarius Wenzel}, 

1392 
title = {{Isabelle/Isar}  a generic framework for humanreadable proof documents}, 

1393 
booktitle = {From Insight to Proof  Festschrift in Honour of Andrzej Trybulec}, 

1394 
publisher = {University of Bia{\l}ystok}, 

1395 
year = 2007, 

1396 
editor = {R. Matuszewski and A. Zalewska}, 

1397 
volume = {10(23)}, 

1398 
series = {Studies in Logic, Grammar, and Rhetoric}, 

1399 
note = {\url{http://www.in.tum.de/~wenzelm/papers/isarframework.pdf}} 

1400 
} 

1401 

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

1404 
title = {Principia Mathematica}, 

1405 
year = 1962, 

1406 
publisher = CUP, 

1407 
note = {Paperback edition to *56, 

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

1409 

9599  1410 
@Misc{Wiedijk:1999:Mizar, 
1411 
author = {Freek Wiedijk}, 

1412 
title = {Mizar: An Impression}, 

1413 
howpublished = {Unpublished paper}, 

1414 
year = 1999, 

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

1416 
} 

1417 

1418 
@Misc{Wiedijk:2000:MV, 

1419 
author = {Freek Wiedijk}, 

1420 
title = {The Mathematical Vernacular}, 

1421 
howpublished = {Unpublished paper}, 

1422 
year = 2000, 

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

1424 
} 

1425 

6592  1426 
@book{winskel93, 
1427 
author = {Glynn Winskel}, 

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

1429 
publisher = MIT,year=1993} 

1430 

1431 
@InCollection{wosbledsoe, 

1432 
author = {Larry Wos}, 

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

1434 
crossref = {bledsoefest}, 

1435 
pages = {297342}} 

1436 

7989  1437 
@InProceedings{Zammit:1999:TPHOL, 
1438 
author = {Vincent Zammit}, 

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

1440 
crossref = {tphols99}} 

1441 

1442 
%Z 

1443 

6592  1444 

1445 
% CROSS REFERENCES 

1446 

1447 
@book{handbklics2, 

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

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

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

1451 
publisher = {Oxford University Press}, 

1452 
year = 1992, 

1453 
volume = 2} 

1454 

1455 
@book{types93, 

1456 
editor = {Henk Barendregt and Tobias Nipkow}, 

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

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

1459 
year = {published 1994}, 

1460 
publisher = {Springer}, 

1461 
series = {LNCS 806}} 

1462 

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