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