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