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