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