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