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