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