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