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