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