doc-src/manual.bib
author blanchet
Fri Apr 30 09:36:45 2010 +0200 (2010-04-30)
changeset 36569 3a29eb7606c3
parent 35665 ff2bf50505ab
child 36926 90bb12cf8e36
permissions -rw-r--r--
added "no_atp" for theorems that are automatically used or included by Sledgehammer when appropriate (about combinators and fequal)
paulson@6592
     1
% BibTeX database for the Isabelle documentation
paulson@6592
     2
paulson@6592
     3
%publishers
paulson@6592
     4
@string{AP="Academic Press"}
paulson@6592
     5
@string{CUP="Cambridge University Press"}
blanchet@35078
     6
@string{IEEE="IEEE Computer Society Press"}
paulson@11199
     7
@string{LNCS="Lecture Notes in Computer Science"}
paulson@6592
     8
@string{MIT="MIT Press"}
paulson@6592
     9
@string{NH="North-Holland"}
paulson@6592
    10
@string{Prentice="Prentice-Hall"}
nipkow@6607
    11
@string{PH="Prentice-Hall"}
paulson@6592
    12
@string{Springer="Springer-Verlag"}
paulson@6592
    13
paulson@6592
    14
%institutions
paulson@11199
    15
@string{CUCL="Computer Laboratory, University of Cambridge"}
paulson@11199
    16
@string{Edinburgh="Department of Computer Science, University of Edinburgh"}
haftmann@21074
    17
@string{TUM="Department of Informatics, Technical University of Munich"}
paulson@6592
    18
paulson@6592
    19
%journals
paulson@8284
    20
@string{AI="Artificial Intelligence"}
paulson@11199
    21
@string{FAC="Formal Aspects of Computing"}
paulson@11199
    22
@string{JAR="Journal of Automated Reasoning"}
paulson@11199
    23
@string{JCS="Journal of Computer Security"}
paulson@11199
    24
@string{JFP="Journal of Functional Programming"}
paulson@11199
    25
@string{JLC="Journal of Logic and Computation"}
paulson@11199
    26
@string{JLP="Journal of Logic Programming"}
paulson@11199
    27
@string{JSC="Journal of Symbolic Computation"}
paulson@11199
    28
@string{JSL="Journal of Symbolic Logic"}
paulson@11246
    29
@string{PROYAL="Proceedings of the Royal Society of London"}
paulson@6592
    30
@string{SIGPLAN="{SIGPLAN} Notices"}
paulson@11246
    31
@string{TISSEC="ACM Transactions on Information and System Security"}
paulson@6592
    32
paulson@6592
    33
%conferences
paulson@6592
    34
@string{CADE="International Conference on Automated Deduction"}
paulson@6592
    35
@string{POPL="Symposium on Principles of Programming Languages"}
paulson@6592
    36
@string{TYPES="Types for Proofs and Programs"}
paulson@6592
    37
paulson@6592
    38
paulson@6592
    39
%A
paulson@6592
    40
paulson@6592
    41
@incollection{abramsky90,
paulson@6592
    42
  author	= {Samson Abramsky},
paulson@6592
    43
  title		= {The Lazy Lambda Calculus},
paulson@6592
    44
  pages		= {65-116},
paulson@6592
    45
  editor	= {David A. Turner},
paulson@6592
    46
  booktitle	= {Research Topics in Functional Programming},
paulson@6592
    47
  publisher	= {Addison-Wesley},
paulson@6592
    48
  year		= 1990}
paulson@6592
    49
paulson@6592
    50
@Unpublished{abrial93,
paulson@6592
    51
  author	= {J. R. Abrial and G. Laffitte},
blanchet@33191
    52
  title		= {Towards the Mechanization of the Proofs of Some Classical
paulson@6592
    53
		  Theorems of Set Theory},
paulson@6592
    54
  note		= {preprint},
paulson@6592
    55
  year		= 1993,
paulson@6592
    56
  month		= Feb}
paulson@6592
    57
paulson@6592
    58
@incollection{aczel77,
paulson@6592
    59
  author	= {Peter Aczel},
paulson@6592
    60
  title		= {An Introduction to Inductive Definitions},
paulson@6592
    61
  pages		= {739-782},
paulson@6592
    62
  crossref	= {barwise-handbk}}
paulson@6592
    63
paulson@6592
    64
@Book{aczel88,
paulson@6592
    65
  author	= {Peter Aczel},
paulson@6592
    66
  title		= {Non-Well-Founded Sets},
paulson@6592
    67
  publisher	= {CSLI},
paulson@6592
    68
  year		= 1988}
paulson@6592
    69
paulson@6592
    70
@InProceedings{alf,
paulson@6592
    71
  author	= {Lena Magnusson and Bengt {Nordstr\"{o}m}},
paulson@6592
    72
  title		= {The {ALF} Proof Editor and Its Proof Engine},
paulson@6592
    73
  crossref	= {types93},
paulson@6592
    74
  pages		= {213-237}}
paulson@6592
    75
blanchet@33191
    76
@inproceedings{andersson-1993,
blanchet@33191
    77
  author = "Arne Andersson",
blanchet@33191
    78
  title = "Balanced Search Trees Made Simple",
blanchet@33191
    79
  editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides",
blanchet@33191
    80
  booktitle = "WADS 1993",
blanchet@33191
    81
  series = LNCS,
blanchet@33191
    82
  volume = {709},
blanchet@33191
    83
  pages = "61--70",
blanchet@33191
    84
  year = 1993,
blanchet@33191
    85
  publisher = Springer}
blanchet@33191
    86
paulson@6592
    87
@book{andrews86,
paulson@6592
    88
  author	= "Peter Andrews",
paulson@6592
    89
  title		= "An Introduction to Mathematical Logic and Type Theory: to Truth
paulson@6592
    90
through Proof",
paulson@6592
    91
  publisher	= AP,
paulson@6592
    92
  series	= "Computer Science and Applied Mathematics",
paulson@6592
    93
  year		= 1986}
paulson@6592
    94
wenzelm@9599
    95
@InProceedings{Aspinall:2000:eProof,
wenzelm@9599
    96
  author = 	 {David Aspinall},
wenzelm@9599
    97
  title = 	 {Protocols for Interactive {e-Proof}},
wenzelm@9599
    98
  booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs)},
wenzelm@9599
    99
  year =	 2000,
wenzelm@9599
   100
  note =	 {Unpublished work-in-progress paper,
paulson@14296
   101
                  \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
wenzelm@9599
   102
}
paulson@14296
   103
wenzelm@8505
   104
@InProceedings{Aspinall:TACAS:2000,
wenzelm@8505
   105
  author = 	 {David Aspinall},
wenzelm@10160
   106
  title = 	 {{P}roof {G}eneral: A Generic Tool for Proof Development},
nipkow@11205
   107
  booktitle = 	 {Tools and Algorithms for the Construction and Analysis of
nipkow@11205
   108
                  Systems (TACAS)},
nipkow@11205
   109
  year =	 2000,
nipkow@11205
   110
  publisher	= Springer,
nipkow@11205
   111
  series	= LNCS,
nipkow@11205
   112
  volume	= 1785,
nipkow@11205
   113
  pages = "38--42"
wenzelm@8505
   114
}
wenzelm@8505
   115
wenzelm@7209
   116
@Misc{isamode,
wenzelm@7209
   117
  author =	 {David Aspinall},
wenzelm@8062
   118
  title =	 {Isamode --- {U}sing {I}sabelle with {E}macs},
paulson@14296
   119
  note =	 {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
wenzelm@7209
   120
}
wenzelm@7209
   121
wenzelm@7209
   122
@Misc{proofgeneral,
nipkow@11197
   123
  author =	 {David Aspinall},
nipkow@11197
   124
  title =	 {{P}roof {G}eneral},
paulson@14296
   125
  note =	 {\url{http://proofgeneral.inf.ed.ac.uk/}}
wenzelm@7209
   126
}
wenzelm@7209
   127
paulson@6592
   128
%B
paulson@6592
   129
nipkow@10186
   130
@book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
nipkow@10186
   131
title="Term Rewriting and All That",publisher=CUP,year=1998}
nipkow@10186
   132
wenzelm@20482
   133
@InCollection{Barendregt-Geuvers:2001,
wenzelm@20482
   134
  author = 	 {H. Barendregt and H. Geuvers},
wenzelm@20482
   135
  title = 	 {Proof Assistants using Dependent Type Systems},
wenzelm@20482
   136
  booktitle = 	 {Handbook of Automated Reasoning},
wenzelm@20482
   137
  publisher =	 {Elsevier},
wenzelm@20482
   138
  year =	 2001,
wenzelm@20482
   139
  editor =	 {A. Robinson and A. Voronkov}
wenzelm@20482
   140
}
wenzelm@20482
   141
paulson@6592
   142
@incollection{basin91,
paulson@6592
   143
  author	= {David Basin and Matt Kaufmann},
paulson@6592
   144
  title		= {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
paulson@6592
   145
		   Comparison}, 
paulson@6592
   146
  crossref	= {huet-plotkin91},
paulson@6592
   147
  pages		= {89-119}}
paulson@6592
   148
wenzelm@12466
   149
@Unpublished{HOL-Library,
wenzelm@12466
   150
  author =       {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
wenzelm@12466
   151
                  Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
wenzelm@12466
   152
                  Markus Wenzel},
wenzelm@12466
   153
  title =        {The Supplemental {Isabelle/HOL} Library},
wenzelm@12660
   154
  note =         {Part of the Isabelle distribution,
wenzelm@12466
   155
                  \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
wenzelm@12660
   156
  year =         2002
wenzelm@12466
   157
}
wenzelm@12466
   158
wenzelm@9567
   159
@InProceedings{Bauer-Wenzel:2000:HB,
wenzelm@9567
   160
  author = 	 {Gertrud Bauer and Markus Wenzel},
wenzelm@9567
   161
  title = 	 {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
wenzelm@9567
   162
      {I}sabelle/{I}sar},
wenzelm@9567
   163
  booktitle = 	 {Types for Proofs and Programs: TYPES'99},
wenzelm@9599
   164
  editor =       {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
wenzelm@9599
   165
                  and Jan Smith},
wenzelm@9567
   166
  series =	 {LNCS},
wenzelm@9599
   167
  year =	 2000
wenzelm@9567
   168
}
wenzelm@6624
   169
wenzelm@12878
   170
@InProceedings{Bauer-Wenzel:2001,
wenzelm@12878
   171
  author =       {Gertrud Bauer and Markus Wenzel},
wenzelm@12878
   172
  title =        {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
wenzelm@12878
   173
  crossref =     {tphols2001}}
wenzelm@12878
   174
bulwahn@33926
   175
@inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL,
bulwahn@33926
   176
    author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian},
bulwahn@33926
   177
    booktitle = {Theorem Proving in Higher Order Logics},
bulwahn@33926
   178
    pages = {131--146},
bulwahn@33926
   179
    title = {Turning Inductive into Equational Specifications},
bulwahn@33926
   180
    year = {2009}
bulwahn@33926
   181
}
bulwahn@33926
   182
berghofe@11619
   183
@INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
berghofe@11619
   184
  crossref        = "tphols2000",
berghofe@11619
   185
  title           = "Proof terms for simply typed higher order logic",
berghofe@11619
   186
  author          = "Stefan Berghofer and Tobias Nipkow",
berghofe@11619
   187
  pages           = "38--52"}
berghofe@11619
   188
blanchet@33191
   189
@inproceedings{berghofer-nipkow-2004,
blanchet@33191
   190
  author = {Stefan Berghofer and Tobias Nipkow},
blanchet@33191
   191
  title = {Random Testing in {I}sabelle/{HOL}},
blanchet@33191
   192
  pages = {230--239},
blanchet@33191
   193
  editor = "J. Cuellar and Z. Liu",
blanchet@33191
   194
  booktitle = {{SEFM} 2004},
blanchet@33191
   195
  publisher = IEEE,
blanchet@33191
   196
  year = 2004}
blanchet@33191
   197
berghofe@12612
   198
@InProceedings{Berghofer-Nipkow:2002,
berghofe@12612
   199
  author =       {Stefan Berghofer and Tobias Nipkow},
berghofe@12612
   200
  title =        {Executing Higher Order Logic},
berghofe@12612
   201
  booktitle =    {Types for Proofs and Programs: TYPES'2000},
berghofe@12612
   202
  editor =       {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
berghofe@12612
   203
  series =       LNCS,
berghofe@12612
   204
  publisher =    Springer,
berghofe@13009
   205
  volume =       2277,
berghofe@12612
   206
  year =         2002}
berghofe@12612
   207
wenzelm@6624
   208
@InProceedings{Berghofer-Wenzel:1999:TPHOL,
wenzelm@6624
   209
  author = 	 {Stefan Berghofer and Markus Wenzel},
wenzelm@7041
   210
  title = 	 {Inductive datatypes in {HOL} --- lessons learned in
wenzelm@7041
   211
                  {F}ormal-{L}ogic {E}ngineering},
wenzelm@7041
   212
  crossref =     {tphols99}}
wenzelm@6624
   213
wenzelm@30170
   214
wenzelm@30170
   215
@InProceedings{Bezem-Coquand:2005,
wenzelm@30170
   216
  author = 	 {M.A. Bezem and T. Coquand},
wenzelm@30170
   217
  title = 	 {Automating {Coherent Logic}},
wenzelm@30170
   218
  booktitle = {LPAR-12},
wenzelm@30170
   219
  editor = 	 {G. Sutcliffe and A. Voronkov},
wenzelm@30170
   220
  volume = 	 3835,
wenzelm@30170
   221
  series = 	 LNCS,
wenzelm@30170
   222
  publisher = Springer}
wenzelm@30170
   223
nipkow@6607
   224
@book{Bird-Wadler,author="Richard Bird and Philip Wadler",
nipkow@6607
   225
title="Introduction to Functional Programming",publisher=PH,year=1988}
nipkow@6607
   226
nipkow@11209
   227
@book{Bird-Haskell,author="Richard Bird",
nipkow@11209
   228
title="Introduction to Functional Programming using Haskell",
nipkow@11209
   229
publisher=PH,year=1998}
nipkow@11209
   230
blanchet@33191
   231
@inproceedings{blanchette-nipkow-2009,
blanchet@33191
   232
  title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)",
blanchet@33191
   233
  author = "Jasmin Christian Blanchette and Tobias Nipkow",
blanchet@33191
   234
  booktitle = "{TAP} 2009: Short Papers",
blanchet@33191
   235
  editor = "Catherine Dubois",
blanchet@33191
   236
  publisher = "ETH Technical Report 630",
blanchet@33191
   237
  year = 2009}
blanchet@33191
   238
paulson@6592
   239
@Article{boyer86,
paulson@6592
   240
  author	= {Robert Boyer and Ewing Lusk and William McCune and Ross
paulson@6592
   241
		   Overbeek and Mark Stickel and Lawrence Wos},
paulson@6592
   242
  title		= {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
paulson@6592
   243
		   Axioms},
paulson@6592
   244
  journal	= JAR,
paulson@6592
   245
  year		= 1986,
paulson@6592
   246
  volume	= 2,
paulson@6592
   247
  number	= 3,
paulson@6592
   248
  pages		= {287-327}}
paulson@6592
   249
paulson@6592
   250
@book{bm79,
paulson@6592
   251
  author	= {Robert S. Boyer and J Strother Moore},
paulson@6592
   252
  title		= {A Computational Logic},
paulson@6592
   253
  publisher	= {Academic Press},
paulson@6592
   254
  year		= 1979}
paulson@6592
   255
paulson@6592
   256
@book{bm88book,
paulson@6592
   257
  author	= {Robert S. Boyer and J Strother Moore},
paulson@6592
   258
  title		= {A Computational Logic Handbook},
paulson@6592
   259
  publisher	= {Academic Press},
paulson@6592
   260
  year		= 1988}
paulson@6592
   261
paulson@6592
   262
@Article{debruijn72,
paulson@6592
   263
  author	= {N. G. de Bruijn},
paulson@6592
   264
  title		= {Lambda Calculus Notation with Nameless Dummies,
paulson@6592
   265
	a Tool for Automatic Formula Manipulation,
paulson@6592
   266
	with Application to the {Church-Rosser Theorem}},
paulson@6592
   267
  journal	= {Indag. Math.},
paulson@6592
   268
  volume	= 34,
paulson@6592
   269
  pages		= {381-392},
paulson@6592
   270
  year		= 1972}
paulson@6592
   271
krauss@23187
   272
@InProceedings{bulwahnKN07,
krauss@25093
   273
  author   = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
krauss@25093
   274
  title    = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
krauss@25093
   275
  crossref = {tphols2007},
krauss@25093
   276
  pages    = {38--53}
krauss@25093
   277
}
krauss@23187
   278
haftmann@28593
   279
@InProceedings{bulwahn-et-al:2008:imperative,
blanchet@33191
   280
  author   = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
haftmann@28593
   281
  title    = {Imperative Functional Programming with {Isabelle/HOL}},
haftmann@28593
   282
  crossref = {tphols2008},
haftmann@28593
   283
}
haftmann@28593
   284
%  pages    = {38--53}
haftmann@28593
   285
paulson@11246
   286
@Article{ban89,
paulson@11246
   287
  author	= {M. Burrows and M. Abadi and R. M. Needham},
paulson@11246
   288
  title		= {A Logic of Authentication},
paulson@11246
   289
  journal	= PROYAL,
paulson@11246
   290
  year		= 1989,
paulson@11246
   291
  volume	= 426,
paulson@11246
   292
  pages		= {233-271}}
paulson@11246
   293
paulson@6592
   294
%C
paulson@6592
   295
paulson@6592
   296
@TechReport{camilleri92,
paulson@6592
   297
  author	= {J. Camilleri and T. F. Melham},
paulson@6592
   298
  title		= {Reasoning with Inductively Defined Relations in the
paulson@6592
   299
		 {HOL} Theorem Prover},
paulson@6592
   300
  institution	= CUCL,
paulson@6592
   301
  year		= 1992,
paulson@6592
   302
  number	= 265,
paulson@6592
   303
  month		= Aug}
paulson@6592
   304
paulson@6592
   305
@Book{charniak80,
paulson@6592
   306
  author	= {E. Charniak and C. K. Riesbeck and D. V. McDermott},
paulson@6592
   307
  title		= {Artificial Intelligence Programming},
paulson@6592
   308
  publisher	= {Lawrence Erlbaum Associates},
paulson@6592
   309
  year		= 1980}
paulson@6592
   310
paulson@6592
   311
@article{church40,
paulson@6592
   312
  author	= "Alonzo Church",
paulson@6592
   313
  title		= "A Formulation of the Simple Theory of Types",
paulson@6592
   314
  journal	= JSL,
paulson@6592
   315
  year		= 1940,
paulson@6592
   316
  volume	= 5,
paulson@6592
   317
  pages		= "56-68"}
paulson@6592
   318
nipkow@10191
   319
@book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
nipkow@10191
   320
title="Model Checking",publisher=MIT,year=1999}
nipkow@10191
   321
paulson@6592
   322
@PhdThesis{coen92,
paulson@6592
   323
  author	= {Martin D. Coen},
paulson@6592
   324
  title		= {Interactive Program Derivation},
paulson@6592
   325
  school	= {University of Cambridge},
paulson@6592
   326
  note		= {Computer Laboratory Technical Report 272},
paulson@6592
   327
  month		= nov,
paulson@6592
   328
  year		= 1992}
paulson@6592
   329
paulson@6592
   330
@book{constable86,
paulson@6592
   331
  author	= {R. L. Constable and others},
paulson@6592
   332
  title		= {Implementing Mathematics with the Nuprl Proof
paulson@6592
   333
		 Development System}, 
paulson@6592
   334
  publisher	= Prentice,
paulson@6592
   335
  year		= 1986}
paulson@6592
   336
paulson@6592
   337
%D
paulson@6592
   338
wenzelm@6745
   339
@Book{davey-priestley,
paulson@6592
   340
  author	= {B. A. Davey and H. A. Priestley},
paulson@6592
   341
  title		= {Introduction to Lattices and Order},
paulson@6592
   342
  publisher	= CUP,
paulson@6592
   343
  year		= 1990}
paulson@6592
   344
paulson@6592
   345
@Book{devlin79,
paulson@6592
   346
  author	= {Keith J. Devlin},
paulson@6592
   347
  title		= {Fundamentals of Contemporary Set Theory},
paulson@6592
   348
  publisher	= {Springer},
paulson@6592
   349
  year		= 1979}
paulson@6592
   350
paulson@6592
   351
@book{dummett,
paulson@6592
   352
  author	= {Michael Dummett},
paulson@6592
   353
  title		= {Elements of Intuitionism},
paulson@6592
   354
  year		= 1977,
paulson@6592
   355
  publisher	= {Oxford University Press}}
paulson@6592
   356
paulson@6592
   357
@incollection{dybjer91,
paulson@6592
   358
  author	= {Peter Dybjer},
nipkow@10186
   359
  title		= {Inductive Sets and Families in {Martin-L{\"o}f's} Type
paulson@6592
   360
		  Theory and Their Set-Theoretic Semantics}, 
paulson@6592
   361
  crossref	= {huet-plotkin91},
paulson@6592
   362
  pages		= {280-306}}
paulson@6592
   363
paulson@6592
   364
@Article{dyckhoff,
paulson@6592
   365
  author	= {Roy Dyckhoff},
paulson@6592
   366
  title		= {Contraction-Free Sequent Calculi for Intuitionistic Logic},
paulson@6592
   367
  journal	= JSL,
paulson@6592
   368
  year		= 1992,
paulson@6592
   369
  volume	= 57,
paulson@6592
   370
  number	= 3,
paulson@6592
   371
  pages		= {795-807}}
paulson@6592
   372
paulson@6592
   373
%F
paulson@6592
   374
paulson@6613
   375
@Article{IMPS,
paulson@6613
   376
  author	= {William M. Farmer and Joshua D. Guttman and F. Javier
paulson@6613
   377
		 Thayer},
paulson@6613
   378
  title		= {{IMPS}: An Interactive Mathematical Proof System},
paulson@6613
   379
  journal	= JAR,
paulson@6613
   380
  volume	= 11,
paulson@6613
   381
  number	= 2,
paulson@6613
   382
  year		= 1993,
paulson@6613
   383
  pages		= {213-248}}
paulson@6613
   384
paulson@6592
   385
@InProceedings{felty91a,
paulson@6592
   386
  Author	= {Amy Felty},
paulson@6592
   387
  Title		= {A Logic Program for Transforming Sequent Proofs to Natural
paulson@6592
   388
		  Deduction Proofs}, 
paulson@6592
   389
  crossref	= {extensions91},
paulson@6592
   390
  pages		= {157-178}}
paulson@6592
   391
paulson@10796
   392
@Article{fleuriot-jcm,
paulson@10796
   393
  author = 	 {Jacques Fleuriot and Lawrence C. Paulson},
paulson@10796
   394
  title = 	 {Mechanizing Nonstandard Real Analysis},
paulson@10796
   395
  journal = 	 {LMS Journal of Computation and Mathematics},
paulson@10796
   396
  year = 	 2000,
paulson@10796
   397
  volume =	 3,
paulson@10796
   398
  pages =	 {140-190},
paulson@10796
   399
  note =	 {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
paulson@10796
   400
}
paulson@10796
   401
paulson@6592
   402
@TechReport{frost93,
paulson@6592
   403
  author	= {Jacob Frost},
paulson@6592
   404
  title		= {A Case Study of Co-induction in {Isabelle HOL}},
paulson@6592
   405
  institution	= CUCL,
paulson@6592
   406
  number	= 308,
paulson@6592
   407
  year		= 1993,
paulson@6592
   408
  month		= Aug}
paulson@6592
   409
paulson@6592
   410
%revised version of frost93
paulson@6592
   411
@TechReport{frost95,
paulson@6592
   412
  author	= {Jacob Frost},
paulson@6592
   413
  title		= {A Case Study of Co-induction in {Isabelle}},
paulson@6592
   414
  institution	= CUCL,
paulson@6592
   415
  number	= 359,
paulson@6592
   416
  year		= 1995,
paulson@6592
   417
  month		= Feb}
paulson@6592
   418
paulson@6592
   419
@inproceedings{OBJ,
paulson@6592
   420
  author	= {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
paulson@6592
   421
		 and J. Meseguer}, 
paulson@6592
   422
  title		= {Principles of {OBJ2}},
paulson@6592
   423
  booktitle	= POPL, 
paulson@6592
   424
  year		= 1985,
paulson@6592
   425
  pages		= {52-66}}
paulson@6592
   426
paulson@6592
   427
%G
paulson@6592
   428
paulson@6592
   429
@book{gallier86,
paulson@6592
   430
  author	= {J. H. Gallier},
paulson@6592
   431
  title		= {Logic for Computer Science: 
paulson@6592
   432
		Foundations of Automatic Theorem Proving},
paulson@6592
   433
  year		= 1986,
paulson@6592
   434
  publisher	= {Harper \& Row}}
paulson@6592
   435
paulson@6592
   436
@Book{galton90,
paulson@6592
   437
  author	= {Antony Galton},
paulson@6592
   438
  title		= {Logic for Information Technology},
paulson@6592
   439
  publisher	= {Wiley},
paulson@6592
   440
  year		= 1990}
paulson@6592
   441
wenzelm@20506
   442
@Article{Gentzen:1935,
wenzelm@20506
   443
  author =       {G. Gentzen},
wenzelm@20506
   444
  title =        {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
wenzelm@20506
   445
  journal =      {Math. Zeitschrift},
wenzelm@20506
   446
  year =         1935
wenzelm@20506
   447
}
wenzelm@20506
   448
paulson@6592
   449
@InProceedings{gimenez-codifying,
paulson@6592
   450
  author	= {Eduardo Gim{\'e}nez},
paulson@6592
   451
  title		= {Codifying Guarded Definitions with Recursive Schemes},
paulson@6592
   452
  crossref	= {types94},
paulson@6592
   453
  pages		= {39-59}
paulson@6592
   454
}
paulson@6592
   455
paulson@9816
   456
@book{girard89,
paulson@9816
   457
  author	= {Jean-Yves Girard},
paulson@9816
   458
  title		= {Proofs and Types},
paulson@9816
   459
  year		= 1989,
paulson@9816
   460
  publisher	= CUP, 
paulson@9816
   461
  note		= {Translated by Yves LaFont and Paul Taylor}}
paulson@9816
   462
paulson@6592
   463
@Book{mgordon-hol,
nipkow@11205
   464
  editor	= {M. J. C. Gordon and T. F. Melham},
paulson@6592
   465
  title		= {Introduction to {HOL}: A Theorem Proving Environment for
paulson@6592
   466
		 Higher Order Logic},
paulson@6592
   467
  publisher	= CUP,
paulson@6592
   468
  year		= 1993}
paulson@6592
   469
paulson@6592
   470
@book{mgordon79,
paulson@6592
   471
  author	= {Michael J. C. Gordon and Robin Milner and Christopher P.
paulson@6592
   472
		 Wadsworth},
paulson@6592
   473
  title		= {Edinburgh {LCF}: A Mechanised Logic of Computation},
paulson@6592
   474
  year		= 1979,
paulson@6592
   475
  publisher	= {Springer},
paulson@6592
   476
  series	= {LNCS 78}}
paulson@6592
   477
nipkow@6607
   478
@inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
nipkow@6607
   479
title={Why we can't have {SML} style datatype declarations in {HOL}},
nipkow@6607
   480
booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
nipkow@6607
   481
IFIP TC10/WG10.2 Intl. Workshop, 1992},
nipkow@6607
   482
editor={L.J.M. Claesen and M.J.C. Gordon},
nipkow@6607
   483
publisher=NH,year=1993,pages={561--568}}
nipkow@6607
   484
paulson@6592
   485
@InProceedings{gunter-trees,
paulson@6592
   486
  author	= {Elsa L. Gunter},
paulson@6592
   487
  title		= {A Broader Class of Trees for Recursive Type Definitions for
paulson@6592
   488
		  {HOL}},
paulson@6592
   489
  crossref	= {hug93},
paulson@6592
   490
  pages		= {141-154}}
paulson@6592
   491
paulson@6592
   492
%H
paulson@6592
   493
haftmann@23956
   494
@InProceedings{Haftmann-Wenzel:2006:classes,
haftmann@23956
   495
  author        = {Florian Haftmann and Makarius Wenzel},
haftmann@23956
   496
  title         = {Constructive Type Classes in {Isabelle}},
haftmann@24628
   497
  editor        = {T. Altenkirch and C. McBride},
haftmann@24628
   498
  booktitle     = {Types for Proofs and Programs, TYPES 2006},
haftmann@24628
   499
  publisher     = {Springer},
haftmann@24628
   500
  series        = {LNCS},
haftmann@24628
   501
  volume        = {4502},
haftmann@24628
   502
  year          = {2007}
haftmann@24193
   503
}
haftmann@24193
   504
haftmann@24193
   505
@TechReport{Haftmann-Nipkow:2007:codegen,
haftmann@24193
   506
  author        = {Florian Haftmann and Tobias Nipkow},
haftmann@24193
   507
  title         = {A Code Generator Framework for {Isabelle/HOL}},
haftmann@24628
   508
  editor        = {Klaus Schneider and Jens Brandt},
haftmann@24628
   509
  booktitle     = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
haftmann@24628
   510
  month         = {08},
haftmann@24628
   511
  year          = {2007},
haftmann@24628
   512
  institution   = {Department of Computer Science, University of Kaiserslautern},
haftmann@24628
   513
  number        = {364/07}
haftmann@23956
   514
}
haftmann@23956
   515
wenzelm@30115
   516
@InProceedings{Haftmann-Wenzel:2009,
wenzelm@30115
   517
  author        = {Florian Haftmann and Makarius Wenzel},
wenzelm@30115
   518
  title         = {Local theory specifications in {Isabelle/Isar}},
wenzelm@30115
   519
  editor        = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
wenzelm@30115
   520
  booktitle     = {Types for Proofs and Programs, TYPES 2008},
wenzelm@30115
   521
  publisher     = {Springer},
wenzelm@30115
   522
  series        = {LNCS},
wenzelm@32572
   523
  volume        = {5497},
wenzelm@30115
   524
  year          = {2009}
wenzelm@30115
   525
}
wenzelm@30115
   526
haftmann@22290
   527
@manual{isabelle-classes,
haftmann@24193
   528
  author        = {Florian Haftmann},
haftmann@24193
   529
  title         = {Haskell-style type classes with {Isabelle}/{Isar}},
haftmann@24193
   530
  institution   = TUM,
haftmann@24193
   531
  note          = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
haftmann@24193
   532
}
haftmann@22290
   533
haftmann@22290
   534
@manual{isabelle-codegen,
haftmann@24193
   535
  author        = {Florian Haftmann},
haftmann@24193
   536
  title         = {Code generation from Isabelle theories},
haftmann@24193
   537
  institution   = TUM,
haftmann@24193
   538
  note          = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
haftmann@24193
   539
}
haftmann@22290
   540
paulson@6592
   541
@Book{halmos60,
paulson@6592
   542
  author	= {Paul R. Halmos},
paulson@6592
   543
  title		= {Naive Set Theory},
paulson@6592
   544
  publisher	= {Van Nostrand},
paulson@6592
   545
  year		= 1960}
paulson@6592
   546
nipkow@11207
   547
@book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
nipkow@11207
   548
title={Dynamic Logic},publisher=MIT,year=2000}
nipkow@11207
   549
paulson@6592
   550
@Book{hennessy90,
paulson@6592
   551
  author	= {Matthew Hennessy},
paulson@6592
   552
  title		= {The Semantics of Programming Languages: An Elementary
paulson@6592
   553
		  Introduction Using Structural Operational Semantics},
paulson@6592
   554
  publisher	= {Wiley},
paulson@6592
   555
  year		= 1990}
paulson@6592
   556
nipkow@10244
   557
@book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
nipkow@10244
   558
title={Introduction to Automata Theory, Languages, and Computation.},
nipkow@10244
   559
publisher={Addison-Wesley},year=1979}
nipkow@10244
   560
paulson@6592
   561
@Article{haskell-report,
paulson@6592
   562
  author	= {Paul Hudak and Simon Peyton Jones and Philip Wadler},
paulson@6592
   563
  title		= {Report on the Programming Language {Haskell}: A
paulson@6592
   564
		 Non-strict, Purely Functional Language},
paulson@6592
   565
  journal	= SIGPLAN,
paulson@6592
   566
  year		= 1992,
paulson@6592
   567
  volume	= 27,
paulson@6592
   568
  number	= 5,
paulson@6592
   569
  month		= May,
paulson@6592
   570
  note		= {Version 1.2}}
paulson@6592
   571
paulson@6592
   572
@Article{haskell-tutorial,
paulson@6592
   573
  author	= {Paul Hudak and Joseph H. Fasel},
paulson@6592
   574
  title		= {A Gentle Introduction to {Haskell}},
paulson@6592
   575
  journal	= SIGPLAN,
paulson@6592
   576
  year		= 1992,
paulson@6592
   577
  volume	= 27,
paulson@6592
   578
  number	= 5,
paulson@6592
   579
  month		= May}
paulson@6592
   580
nipkow@11209
   581
@book{Hudak-Haskell,author={Paul Hudak},
nipkow@11209
   582
title={The Haskell School of Expression},publisher=CUP,year=2000}
nipkow@11209
   583
paulson@6592
   584
@article{huet75,
paulson@6592
   585
  author	= {G. P. Huet},
paulson@6592
   586
  title		= {A Unification Algorithm for Typed $\lambda$-Calculus},
paulson@6592
   587
  journal	= TCS,
paulson@6592
   588
  volume	= 1,
paulson@6592
   589
  year		= 1975,
paulson@6592
   590
  pages		= {27-57}}
paulson@6592
   591
paulson@6592
   592
@article{huet78,
paulson@6592
   593
  author	= {G. P. Huet and B. Lang},
paulson@6592
   594
  title		= {Proving and Applying Program Transformations Expressed with 
paulson@6592
   595
			Second-Order Patterns},
paulson@6592
   596
  journal	= acta,
paulson@6592
   597
  volume	= 11,
paulson@6592
   598
  year		= 1978, 
paulson@6592
   599
  pages		= {31-55}}
paulson@6592
   600
paulson@6592
   601
@inproceedings{huet88,
nipkow@10186
   602
  author	= {G{\'e}rard Huet},
paulson@6592
   603
  title		= {Induction Principles Formalized in the {Calculus of
paulson@6592
   604
		 Constructions}}, 
paulson@6592
   605
  booktitle	= {Programming of Future Generation Computers},
paulson@6592
   606
  editor	= {K. Fuchi and M. Nivat},
paulson@6592
   607
  year		= 1988,
paulson@6592
   608
  pages		= {205-216}, 
paulson@6592
   609
  publisher	= {Elsevier}}
paulson@6592
   610
nipkow@10186
   611
@Book{Huth-Ryan-book,
nipkow@10186
   612
  author	= {Michael Huth and Mark Ryan},
nipkow@10186
   613
  title		= {Logic in Computer Science. Modelling and reasoning about systems},
nipkow@10186
   614
  publisher	= CUP,
nipkow@10186
   615
  year		= 2000}
nipkow@10186
   616
wenzelm@7041
   617
@InProceedings{Harrison:1996:MizarHOL,
wenzelm@7041
   618
  author = 	 {J. Harrison},
wenzelm@7041
   619
  title = 	 {A {Mizar} Mode for {HOL}},
wenzelm@7041
   620
  pages =	 {203--220},
wenzelm@7041
   621
  crossref =     {tphols96}}
wenzelm@7041
   622
haftmann@22290
   623
%J
haftmann@22290
   624
haftmann@22290
   625
@article{haskell-revised-report,
haftmann@22290
   626
  author =  {Simon {Peyton Jones} and others},
haftmann@22290
   627
  title =   {The {Haskell} 98 Language and Libraries: The Revised Report},
haftmann@22290
   628
  journal = {Journal of Functional Programming},
haftmann@22290
   629
  volume =  13,
haftmann@22290
   630
  number =  1,
haftmann@22290
   631
  pages =   {0--255},
haftmann@22290
   632
  month =   {Jan},
haftmann@22290
   633
  year =    2003,
haftmann@22290
   634
  note =    {\url{http://www.haskell.org/definition/}}}
haftmann@22290
   635
blanchet@33191
   636
@book{jackson-2006,
blanchet@33191
   637
  author = "Daniel Jackson",
blanchet@33191
   638
  title = "Software Abstractions: Logic, Language, and Analysis",
blanchet@33191
   639
  publisher = MIT,
blanchet@33191
   640
  year = 2006}
blanchet@33191
   641
paulson@6592
   642
%K
paulson@6592
   643
paulson@6670
   644
@InProceedings{kammueller-locales,
paulson@6670
   645
  author = 	 {Florian Kamm{\"u}ller and Markus Wenzel and 
paulson@6670
   646
                  Lawrence C. Paulson},
paulson@6670
   647
  title = 	 {Locales: A Sectioning Concept for {Isabelle}},
paulson@6670
   648
  crossref =	 {tphols99}}
paulson@6670
   649
paulson@8284
   650
@book{Knuth3-75,
paulson@8284
   651
  author={Donald E. Knuth},
paulson@8284
   652
  title={The Art of Computer Programming, Volume 3: Sorting and Searching},
paulson@8284
   653
  publisher={Addison-Wesley},
paulson@8284
   654
  year=1975}
paulson@8284
   655
paulson@8284
   656
@Article{korf85,
paulson@8284
   657
  author	= {R. E. Korf},
paulson@8284
   658
  title		= {Depth-First Iterative-Deepening: an Optimal Admissible
paulson@8284
   659
		 Tree Search},
paulson@8284
   660
  journal	= AI,
paulson@8284
   661
  year		= 1985,
paulson@8284
   662
  volume	= 27,
paulson@8284
   663
  pages		= {97-109}}
nipkow@6607
   664
krauss@23187
   665
@InProceedings{krauss2006,
krauss@23187
   666
  author   =  {Alexander Krauss},
krauss@23187
   667
  title    =  {Partial Recursive Functions in {Higher-Order Logic}},
krauss@23187
   668
  crossref =  {ijcar2006},
krauss@23187
   669
  pages =     {589--603}}
krauss@23187
   670
krauss@33856
   671
@PhdThesis{krauss_phd,
krauss@33856
   672
	author = {Alexander Krauss},
krauss@33856
   673
	title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
krauss@33856
   674
  school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
krauss@33856
   675
	year = {2009},
krauss@33856
   676
	address = {Germany}
krauss@33856
   677
}
krauss@33856
   678
krauss@24524
   679
@manual{isabelle-function,
krauss@24524
   680
  author        = {Alexander Krauss},
krauss@24524
   681
  title         = {Defining Recursive Functions in {Isabelle/HOL}},
krauss@24524
   682
  institution   = TUM,
nipkow@25280
   683
  note          = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
krauss@24524
   684
}
krauss@24524
   685
paulson@6592
   686
@Book{kunen80,
paulson@6592
   687
  author	= {Kenneth Kunen},
paulson@6592
   688
  title		= {Set Theory: An Introduction to Independence Proofs},
paulson@6592
   689
  publisher	= NH,
paulson@6592
   690
  year		= 1980}
paulson@6592
   691
paulson@11246
   692
%L
paulson@11246
   693
haftmann@22290
   694
@manual{OCaml,
haftmann@22290
   695
  author =  {Xavier Leroy and others},
haftmann@22290
   696
  title =   {The Objective Caml system -- Documentation and user's manual},
haftmann@22290
   697
  note =    {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
haftmann@22290
   698
paulson@11246
   699
@InProceedings{lowe-fdr,
paulson@11246
   700
  author	= {Gavin Lowe},
paulson@11246
   701
  title		= {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
paulson@11246
   702
		  Protocol using {CSP} and {FDR}},
paulson@11246
   703
  booktitle = 	 {Tools and Algorithms for the Construction and Analysis 
paulson@11246
   704
                  of Systems:  second international workshop, TACAS '96},
paulson@11246
   705
  editor =	 {T. Margaria and B. Steffen},
paulson@11246
   706
  series =	 {LNCS 1055},
paulson@11246
   707
  year =	 1996,
paulson@11246
   708
  publisher =	 {Springer},
paulson@11246
   709
  pages		= {147-166}}
paulson@11246
   710
paulson@6592
   711
%M
paulson@6592
   712
paulson@6592
   713
@Article{mw81,
paulson@6592
   714
  author	= {Zohar Manna and Richard Waldinger},
paulson@6592
   715
  title		= {Deductive Synthesis of the Unification Algorithm},
paulson@6592
   716
  journal	= SCP,
paulson@6592
   717
  year		= 1981,
paulson@6592
   718
  volume	= 1,
paulson@6592
   719
  number	= 1,
paulson@6592
   720
  pages		= {5-48}}
paulson@6592
   721
paulson@6592
   722
@InProceedings{martin-nipkow,
paulson@6592
   723
  author	= {Ursula Martin and Tobias Nipkow},
paulson@6592
   724
  title		= {Ordered Rewriting and Confluence},
paulson@6592
   725
  crossref	= {cade10},
paulson@6592
   726
  pages		= {366-380}}
paulson@6592
   727
paulson@6592
   728
@book{martinlof84,
nipkow@10186
   729
  author	= {Per Martin-L{\"o}f},
paulson@6592
   730
  title		= {Intuitionistic type theory},
paulson@6592
   731
  year		= 1984,
paulson@6592
   732
  publisher	= {Bibliopolis}}
paulson@6592
   733
paulson@6592
   734
@incollection{melham89,
paulson@6592
   735
  author	= {Thomas F. Melham},
paulson@6592
   736
  title		= {Automating Recursive Type Definitions in Higher Order
paulson@6592
   737
		 Logic}, 
paulson@6592
   738
  pages		= {341-386},
paulson@6592
   739
  crossref	= {birtwistle89}}
paulson@6592
   740
wenzelm@29728
   741
@Article{Miller:1991,
wenzelm@29728
   742
  author = 	 {Dale Miller},
wenzelm@29728
   743
  title = 	 {A Logic Programming Language with Lambda-Abstraction, Function Variables,
wenzelm@29728
   744
    and Simple Unification},
wenzelm@29728
   745
  journal = 	 {Journal of Logic and Computation},
wenzelm@29728
   746
  year = 	 1991,
wenzelm@29728
   747
  volume =	 1,
wenzelm@29728
   748
  number =	 4
wenzelm@29728
   749
}
wenzelm@29728
   750
paulson@6592
   751
@Article{miller-mixed,
paulson@6592
   752
  Author	= {Dale Miller},
paulson@6592
   753
  Title		= {Unification Under a Mixed Prefix},
paulson@6592
   754
  journal	= JSC,
paulson@6592
   755
  volume	= 14,
paulson@6592
   756
  number	= 4,
paulson@6592
   757
  pages		= {321-358},
paulson@6592
   758
  Year		= 1992}
paulson@6592
   759
paulson@6592
   760
@Article{milner78,
paulson@6592
   761
  author	= {Robin Milner},
paulson@6592
   762
  title		= {A Theory of Type Polymorphism in Programming},
paulson@6592
   763
  journal	= "J. Comp.\ Sys.\ Sci.",
paulson@6592
   764
  year		= 1978,
paulson@6592
   765
  volume	= 17,
paulson@6592
   766
  pages		= {348-375}}
paulson@6592
   767
paulson@6592
   768
@TechReport{milner-ind,
paulson@6592
   769
  author	= {Robin Milner},
paulson@6592
   770
  title		= {How to Derive Inductions in {LCF}},
paulson@6592
   771
  institution	= Edinburgh,
paulson@6592
   772
  year		= 1980,
paulson@6592
   773
  type		= {note}}
paulson@6592
   774
paulson@6592
   775
@Article{milner-coind,
paulson@6592
   776
  author	= {Robin Milner and Mads Tofte},
paulson@6592
   777
  title		= {Co-induction in Relational Semantics},
paulson@6592
   778
  journal	= TCS,
paulson@6592
   779
  year		= 1991,
paulson@6592
   780
  volume	= 87,
paulson@6592
   781
  pages		= {209-220}}
paulson@6592
   782
paulson@6592
   783
@Book{milner89,
paulson@6592
   784
  author	= {Robin Milner},
paulson@6592
   785
  title		= {Communication and Concurrency},
paulson@6592
   786
  publisher	= Prentice,
paulson@6592
   787
  year		= 1989}
paulson@6592
   788
nipkow@10970
   789
@book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
nipkow@10970
   790
title="The Definition of Standard ML",publisher=MIT,year=1990}
nipkow@10970
   791
paulson@6592
   792
@PhdThesis{monahan84,
paulson@6592
   793
  author	= {Brian Q. Monahan},
paulson@6592
   794
  title		= {Data Type Proofs using Edinburgh {LCF}},
paulson@6592
   795
  school	= {University of Edinburgh},
paulson@6592
   796
  year		= 1984}
paulson@6592
   797
nipkow@6607
   798
@article{MuellerNvOS99,
nipkow@6607
   799
author=
wenzelm@11564
   800
{Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
nipkow@11197
   801
title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
nipkow@6607
   802
wenzelm@9599
   803
@Manual{Muzalewski:Mizar,
wenzelm@9599
   804
  title = 	 {An Outline of {PC} {Mizar}},
wenzelm@9599
   805
  author =	 {Micha{\l} Muzalewski},
wenzelm@9599
   806
  organization = {Fondation of Logic, Mathematics and Informatics
wenzelm@9599
   807
                  --- Mizar Users Group},
wenzelm@9599
   808
  year =	 1993,
wenzelm@9599
   809
  note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
wenzelm@9599
   810
}
wenzelm@9599
   811
paulson@6592
   812
%N
paulson@6592
   813
paulson@6592
   814
@InProceedings{NaraschewskiW-TPHOLs98,
paulson@6592
   815
  author	= {Wolfgang Naraschewski and Markus Wenzel},
paulson@6592
   816
  title		= 
wenzelm@7041
   817
{Object-Oriented Verification based on Record Subtyping in
wenzelm@7041
   818
                  Higher-Order Logic},
wenzelm@7041
   819
  crossref      = {tphols98}}
paulson@6592
   820
paulson@6592
   821
@inproceedings{nazareth-nipkow,
paulson@6592
   822
  author	= {Dieter Nazareth and Tobias Nipkow},
paulson@6592
   823
  title		= {Formal Verification of Algorithm {W}: The Monomorphic Case},
paulson@6592
   824
  crossref	= {tphols96},
paulson@6592
   825
  pages		= {331-345},
paulson@6592
   826
  year		= 1996}
paulson@6592
   827
paulson@11246
   828
@Article{needham-schroeder,
paulson@11246
   829
  author =       "Roger M. Needham and Michael D. Schroeder",
paulson@11246
   830
  title =        "Using Encryption for Authentication in Large Networks
paulson@11246
   831
                 of Computers",
paulson@11246
   832
  journal =      cacm,
paulson@11246
   833
  volume =       21,
paulson@11246
   834
  number =       12,
paulson@11246
   835
  pages =        "993-999",
paulson@11246
   836
  month =        dec,
paulson@11246
   837
  year =         1978}
paulson@11246
   838
paulson@6592
   839
@inproceedings{nipkow-W,
paulson@6592
   840
  author	= {Wolfgang Naraschewski and Tobias Nipkow},
paulson@6592
   841
  title		= {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
paulson@6592
   842
  booktitle	= {Types for Proofs and Programs: Intl. Workshop TYPES '96},
nipkow@10186
   843
  editor	= {E. Gim{\'e}nez and C. Paulin-Mohring},
paulson@6592
   844
  publisher	= Springer,
paulson@6592
   845
  series	= LNCS,
paulson@6592
   846
  volume	= 1512,
paulson@6592
   847
  pages		= {317-332},
paulson@6592
   848
  year		= 1998}
paulson@6592
   849
wenzelm@8892
   850
@InCollection{nipkow-sorts93,
wenzelm@8892
   851
  author = 	 {T. Nipkow},
wenzelm@8892
   852
  title = 	 {Order-Sorted Polymorphism in {Isabelle}},
wenzelm@8892
   853
  booktitle = 	 {Logical Environments},
wenzelm@8892
   854
  publisher =	 CUP,
wenzelm@8892
   855
  year =	 1993,
wenzelm@8892
   856
  editor =	 {G. Huet and G. Plotkin},
wenzelm@8892
   857
  pages =	 {164--188}
wenzelm@8892
   858
}
wenzelm@8892
   859
wenzelm@8892
   860
@Misc{nipkow-types93,
wenzelm@8892
   861
  author =	 {Tobias Nipkow},
wenzelm@8892
   862
  title =	 {Axiomatic Type Classes (in {I}sabelle)},
wenzelm@8892
   863
  howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
wenzelm@8892
   864
  year =	 1993
wenzelm@8892
   865
}
wenzelm@8892
   866
paulson@6592
   867
@inproceedings{Nipkow-CR,
paulson@6592
   868
  author	= {Tobias Nipkow},
paulson@6592
   869
  title		= {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
paulson@6592
   870
  booktitle	= {Automated Deduction --- CADE-13},
paulson@6592
   871
  editor	= {M. McRobbie and J.K. Slaney},
paulson@6592
   872
  publisher	= Springer,
paulson@6592
   873
  series	= LNCS,
paulson@6592
   874
  volume	= 1104,
paulson@6592
   875
  pages		= {733-747},
paulson@6592
   876
  year		= 1996}
paulson@6592
   877
paulson@6592
   878
% WAS Nipkow-LICS-93
paulson@6592
   879
@InProceedings{nipkow-patterns,
paulson@6592
   880
  title		= {Functional Unification of Higher-Order Patterns},
paulson@6592
   881
  author	= {Tobias Nipkow},
paulson@6592
   882
  pages		= {64-74},
paulson@6592
   883
  crossref	= {lics8},
wenzelm@6745
   884
  url		= {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
paulson@6592
   885
  keywords	= {unification}}
paulson@6592
   886
paulson@6592
   887
@article{nipkow-IMP,
paulson@6592
   888
  author	= {Tobias Nipkow},
paulson@6592
   889
  title		= {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
paulson@6592
   890
  journal	= FAC,
paulson@6592
   891
  volume	= 10,
paulson@6592
   892
  pages		= {171-186},
paulson@6592
   893
  year		= 1998}
paulson@6592
   894
nipkow@15429
   895
@inproceedings{Nipkow-TYPES02,
nipkow@15429
   896
  author        = {Tobias Nipkow},
nipkow@15429
   897
  title         = {{Structured Proofs in Isar/HOL}},
nipkow@15429
   898
  booktitle     = {Types for Proofs and Programs (TYPES 2002)},
nipkow@15429
   899
  editor        = {H. Geuvers and F. Wiedijk},
nipkow@15429
   900
  year          = 2003,
nipkow@15429
   901
  publisher     = Springer,
nipkow@15429
   902
  series        = LNCS,
nipkow@15429
   903
  volume        = 2646,
nipkow@15429
   904
  pages         = {259-278}}
nipkow@15429
   905
nipkow@6607
   906
@manual{isabelle-HOL,
nipkow@6607
   907
  author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
nipkow@6607
   908
  title		= {{Isabelle}'s Logics: {HOL}},
nipkow@10186
   909
  institution	= {Institut f{\"u}r Informatik, Technische Universi{\"a}t
nipkow@10186
   910
                  M{\"u}nchen and Computer Laboratory, University of Cambridge},
wenzelm@8892
   911
  note          = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
nipkow@6607
   912
paulson@6592
   913
@article{nipkow-prehofer,
paulson@6592
   914
  author	= {Tobias Nipkow and Christian Prehofer},
paulson@6592
   915
  title		= {Type Reconstruction for Type Classes},
paulson@6592
   916
  journal	= JFP,
paulson@6592
   917
  volume	= 5,
paulson@6592
   918
  number	= 2,
paulson@6592
   919
  year		= 1995,
paulson@6592
   920
  pages		= {201-224}}
paulson@6592
   921
haftmann@23956
   922
@InProceedings{Nipkow-Prehofer:1993,
haftmann@23956
   923
  author =       {T. Nipkow and C. Prehofer},
haftmann@23956
   924
  title =        {Type checking type classes},
haftmann@23956
   925
  booktitle =    {ACM Symp.\ Principles of Programming Languages},
haftmann@23956
   926
  year =         1993
haftmann@23956
   927
}
haftmann@23956
   928
paulson@14147
   929
@Book{isa-tutorial,
paulson@14147
   930
  author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
blanchet@33191
   931
  title		= {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
blanchet@33191
   932
  publisher	= Springer,
paulson@14147
   933
  year		= 2002,
blanchet@33191
   934
  series    = LNCS,
blanchet@33191
   935
  volume    = 2283}
paulson@14147
   936
paulson@6592
   937
@Article{noel,
paulson@6592
   938
  author	= {Philippe No{\"e}l},
paulson@6592
   939
  title		= {Experimenting with {Isabelle} in {ZF} Set Theory},
paulson@6592
   940
  journal	= JAR,
paulson@6592
   941
  volume	= 10,
paulson@6592
   942
  number	= 1,
paulson@6592
   943
  pages		= {15-58},
paulson@6592
   944
  year		= 1993}
paulson@6592
   945
paulson@6592
   946
@book{nordstrom90,
nipkow@10186
   947
  author	= {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
nipkow@10186
   948
  title		= {Programming in {Martin-L{\"o}f}'s Type Theory.  An
paulson@6592
   949
		 Introduction}, 
paulson@6592
   950
  publisher	= {Oxford University Press}, 
paulson@6592
   951
  year		= 1990}
paulson@6592
   952
paulson@6592
   953
%O
paulson@6592
   954
paulson@6592
   955
@Manual{pvs-language,
paulson@6592
   956
  title		= {The {PVS} specification language},
paulson@6592
   957
  author	= {S. Owre and N. Shankar and J. M. Rushby},
paulson@6592
   958
  organization	= {Computer Science Laboratory, SRI International},
paulson@6592
   959
  address	= {Menlo Park, CA},
wenzelm@6745
   960
  note          = {Beta release},
paulson@6592
   961
  year		= 1993,
paulson@6592
   962
  month		= apr,
wenzelm@6619
   963
  url		= {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
paulson@6592
   964
paulson@6592
   965
%P
paulson@6592
   966
paulson@6592
   967
% replaces paulin92
paulson@6592
   968
@InProceedings{paulin-tlca,
paulson@6592
   969
  author	= {Christine Paulin-Mohring},
paulson@6592
   970
  title		= {Inductive Definitions in the System {Coq}: Rules and
paulson@6592
   971
		 Properties},
paulson@6592
   972
  crossref	= {tlca93},
paulson@6592
   973
  pages		= {328-345}}
paulson@6592
   974
paulson@6592
   975
@InProceedings{paulson-CADE,
paulson@6592
   976
  author	= {Lawrence C. Paulson},
paulson@6592
   977
  title		= {A Fixedpoint Approach to Implementing (Co)Inductive
paulson@6592
   978
		  Definitions},
paulson@6592
   979
  pages		= {148-161},
paulson@6592
   980
  crossref	= {cade12}}
paulson@6592
   981
paulson@6592
   982
@InProceedings{paulson-COLOG,
paulson@6592
   983
  author	= {Lawrence C. Paulson},
paulson@6592
   984
  title		= {A Formulation of the Simple Theory of Types (for
paulson@6592
   985
		 {Isabelle})}, 
paulson@6592
   986
  pages		= {246-274},
paulson@6592
   987
  crossref	= {colog88},
wenzelm@6619
   988
  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
paulson@6592
   989
paulson@6592
   990
@Article{paulson-coind,
paulson@6592
   991
  author	= {Lawrence C. Paulson},
paulson@6592
   992
  title		= {Mechanizing Coinduction and Corecursion in Higher-Order
paulson@6592
   993
		  Logic},
paulson@6592
   994
  journal	= JLC,
paulson@6592
   995
  year		= 1997,
paulson@6592
   996
  volume	= 7,
paulson@6592
   997
  number	= 2,
paulson@6592
   998
  month		= mar,
paulson@6592
   999
  pages		= {175-204}}
paulson@6592
  1000
wenzelm@12616
  1001
@manual{isabelle-intro,
wenzelm@12616
  1002
  author	= {Lawrence C. Paulson},
wenzelm@12616
  1003
  title		= {Introduction to {Isabelle}},
wenzelm@12616
  1004
  institution	= CUCL,
wenzelm@12616
  1005
  note          = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
wenzelm@12616
  1006
wenzelm@12616
  1007
@manual{isabelle-logics,
wenzelm@12616
  1008
  author	= {Lawrence C. Paulson},
wenzelm@12616
  1009
  title		= {{Isabelle's} Logics},
wenzelm@12616
  1010
  institution	= CUCL,
wenzelm@12616
  1011
  note          = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
wenzelm@12616
  1012
paulson@6613
  1013
@manual{isabelle-ref,
paulson@6613
  1014
  author	= {Lawrence C. Paulson},
paulson@6613
  1015
  title		= {The {Isabelle} Reference Manual},
wenzelm@8892
  1016
  institution	= CUCL,
wenzelm@8892
  1017
  note          = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
nipkow@6607
  1018
nipkow@6607
  1019
@manual{isabelle-ZF,
paulson@6592
  1020
  author	= {Lawrence C. Paulson},
paulson@6592
  1021
  title		= {{Isabelle}'s Logics: {FOL} and {ZF}},
wenzelm@8892
  1022
  institution	= CUCL,
wenzelm@8892
  1023
  note          = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
paulson@6592
  1024
paulson@6592
  1025
@article{paulson-found,
paulson@6592
  1026
  author	= {Lawrence C. Paulson},
paulson@6592
  1027
  title		= {The Foundation of a Generic Theorem Prover},
paulson@6592
  1028
  journal	= JAR,
paulson@6592
  1029
  volume	= 5,
paulson@6592
  1030
  number	= 3,
paulson@6592
  1031
  pages		= {363-397},
paulson@6592
  1032
  year		= 1989,
wenzelm@6619
  1033
  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
paulson@6592
  1034
paulson@6592
  1035
%replaces paulson-final
paulson@6592
  1036
@Article{paulson-mscs,
paulson@6592
  1037
  author	= {Lawrence C. Paulson},
paulson@7991
  1038
  title = 	 {Final Coalgebras as Greatest Fixed Points 
paulson@7991
  1039
                  in {ZF} Set Theory},
paulson@6592
  1040
  journal	= {Mathematical Structures in Computer Science},
paulson@6592
  1041
  year		= 1999,
paulson@6592
  1042
  volume	= 9,
paulson@23505
  1043
  number = 5,
paulson@23505
  1044
  pages = {545-567}}
paulson@6592
  1045
paulson@6592
  1046
@InCollection{paulson-generic,
paulson@6592
  1047
  author	= {Lawrence C. Paulson},
paulson@6592
  1048
  title		= {Generic Automatic Proof Tools},
paulson@6592
  1049
  crossref	= {wos-fest},
paulson@6592
  1050
  chapter	= 3}
paulson@6592
  1051
paulson@6592
  1052
@Article{paulson-gr,
paulson@6592
  1053
  author	= {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
paulson@6592
  1054
  title		= {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
paulson@6592
  1055
		  Choice},
paulson@6592
  1056
  journal	= JAR,
paulson@6592
  1057
  year		= 1996,
paulson@6592
  1058
  volume	= 17,
paulson@6592
  1059
  number	= 3,
paulson@6592
  1060
  month		= dec,
paulson@6592
  1061
  pages		= {291-323}}
paulson@6592
  1062
paulson@14210
  1063
@InCollection{paulson-fixedpt-milner,
paulson@14210
  1064
  author	= {Lawrence C. Paulson},
paulson@14210
  1065
  title		= {A Fixedpoint Approach to (Co)inductive and
paulson@14210
  1066
                  (Co)datatype Definitions},
paulson@14210
  1067
  pages		= {187-211},
paulson@14210
  1068
  crossref	= {milner-fest}}
paulson@14210
  1069
paulson@14210
  1070
@book{milner-fest,
paulson@14210
  1071
  title		= {Proof, Language, and Interaction: 
paulson@14210
  1072
                   Essays in Honor of {Robin Milner}},
paulson@14210
  1073
  booktitle	= {Proof, Language, and Interaction: 
paulson@14210
  1074
                   Essays in Honor of {Robin Milner}},
blanchet@33191
  1075
  publisher	= MIT,
paulson@14210
  1076
  year		= 2000,
paulson@14210
  1077
  editor	= {Gordon Plotkin and Colin Stirling and Mads Tofte}}
paulson@14210
  1078
paulson@6592
  1079
@InCollection{paulson-handbook,
paulson@6592
  1080
  author	= {Lawrence C. Paulson},
paulson@6592
  1081
  title		= {Designing a Theorem Prover},
paulson@6592
  1082
  crossref	= {handbk-lics2},
paulson@6592
  1083
  pages		= {415-475}}
paulson@6592
  1084
paulson@6592
  1085
@Book{paulson-isa-book,
paulson@6592
  1086
  author	= {Lawrence C. Paulson},
paulson@6592
  1087
  title		= {Isabelle: A Generic Theorem Prover},
paulson@6592
  1088
  publisher	= {Springer},
paulson@6592
  1089
  year		= 1994,
paulson@6592
  1090
  note		= {LNCS 828}}
paulson@6592
  1091
wenzelm@12878
  1092
@Book{isabelle-hol-book,
wenzelm@12878
  1093
  author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
wenzelm@12878
  1094
  title		= {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
wenzelm@12878
  1095
  publisher	= {Springer},
wenzelm@12878
  1096
  year		= 2002,
wenzelm@12878
  1097
  note		= {LNCS 2283}}
wenzelm@12878
  1098
paulson@6592
  1099
@InCollection{paulson-markt,
paulson@6592
  1100
  author	= {Lawrence C. Paulson},
paulson@6592
  1101
  title		= {Tool Support for Logics of Programs},
paulson@6592
  1102
  booktitle	= {Mathematical Methods in Program Development:
paulson@6592
  1103
                  Summer School Marktoberdorf 1996},
paulson@6592
  1104
  publisher	= {Springer},
paulson@6592
  1105
  pages		= {461-498},
paulson@6592
  1106
  year		= {Published 1997},
paulson@6592
  1107
  editor	= {Manfred Broy},
paulson@6592
  1108
  series	= {NATO ASI Series F}}
paulson@6592
  1109
paulson@6592
  1110
%replaces Paulson-ML and paulson91
paulson@6592
  1111
@book{paulson-ml2,
paulson@6592
  1112
  author	= {Lawrence C. Paulson},
paulson@6592
  1113
  title		= {{ML} for the Working Programmer},
paulson@6592
  1114
  year		= 1996,
paulson@6592
  1115
  edition	= {2nd},
paulson@6592
  1116
  publisher	= CUP}
paulson@6592
  1117
paulson@6592
  1118
@article{paulson-natural,
paulson@6592
  1119
  author	= {Lawrence C. Paulson},
paulson@6592
  1120
  title		= {Natural Deduction as Higher-order Resolution},
paulson@6592
  1121
  journal	= JLP,
paulson@6592
  1122
  volume	= 3,
paulson@6592
  1123
  pages		= {237-258},
paulson@6592
  1124
  year		= 1986,
wenzelm@6619
  1125
  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
paulson@6592
  1126
paulson@6592
  1127
@Article{paulson-set-I,
paulson@6592
  1128
  author	= {Lawrence C. Paulson},
paulson@6592
  1129
  title		= {Set Theory for Verification: {I}.  {From}
paulson@6592
  1130
		 Foundations to Functions},
paulson@6592
  1131
  journal	= JAR,
paulson@6592
  1132
  volume	= 11,
paulson@6592
  1133
  number	= 3,
paulson@6592
  1134
  pages		= {353-389},
paulson@6592
  1135
  year		= 1993,
nipkow@14385
  1136
  url		= {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
paulson@6592
  1137
paulson@6592
  1138
@Article{paulson-set-II,
paulson@6592
  1139
  author	= {Lawrence C. Paulson},
paulson@6592
  1140
  title		= {Set Theory for Verification: {II}.  {Induction} and
paulson@6592
  1141
		 Recursion},
paulson@6592
  1142
  journal	= JAR,
paulson@6592
  1143
  volume	= 15,
paulson@6592
  1144
  number	= 2,
paulson@6592
  1145
  pages		= {167-215},
paulson@6592
  1146
  year		= 1995,
wenzelm@6619
  1147
  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
paulson@6592
  1148
paulson@6592
  1149
@article{paulson85,
paulson@6592
  1150
  author	= {Lawrence C. Paulson},
paulson@6592
  1151
  title		= {Verifying the Unification Algorithm in {LCF}},
paulson@6592
  1152
  journal	= SCP,
paulson@6592
  1153
  volume	= 5,
paulson@6592
  1154
  pages		= {143-170},
paulson@6592
  1155
  year		= 1985}
paulson@6592
  1156
wenzelm@11564
  1157
%replaces Paulson-LCF
paulson@6592
  1158
@book{paulson87,
paulson@6592
  1159
  author	= {Lawrence C. Paulson},
paulson@6592
  1160
  title		= {Logic and Computation: Interactive proof with Cambridge
paulson@6592
  1161
		 LCF}, 
paulson@6592
  1162
  year		= 1987,
paulson@6592
  1163
  publisher	= CUP}
paulson@6592
  1164
paulson@6592
  1165
@incollection{paulson700,
paulson@6592
  1166
  author	= {Lawrence C. Paulson},
paulson@6592
  1167
  title		= {{Isabelle}: The Next 700 Theorem Provers},
paulson@6592
  1168
  crossref	= {odifreddi90},
paulson@6592
  1169
  pages		= {361-386},
wenzelm@6619
  1170
  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
paulson@6592
  1171
paulson@6592
  1172
% replaces paulson-ns and paulson-security
paulson@6592
  1173
@Article{paulson-jcs,
paulson@6592
  1174
  author	= {Lawrence C. Paulson},
paulson@6592
  1175
  title		= {The Inductive Approach to Verifying Cryptographic Protocols},
paulson@6592
  1176
  journal	= JCS,
paulson@6592
  1177
  year		= 1998,
paulson@6592
  1178
  volume	= 6,
paulson@6592
  1179
  pages		= {85-128}}
paulson@6592
  1180
paulson@11246
  1181
@Article{paulson-tls,
paulson@11246
  1182
  author = 	 {Lawrence C. Paulson},
paulson@11246
  1183
  title = 	 {Inductive Analysis of the {Internet} Protocol {TLS}},
paulson@11246
  1184
  journal = 	 TISSEC,
paulson@11246
  1185
  month =        aug,
paulson@11246
  1186
  year = 	 1999,
paulson@11246
  1187
  volume	= 2,
paulson@11246
  1188
  number        = 3,
paulson@11246
  1189
  pages		= {332-351}}
haftmann@21074
  1190
haftmann@21074
  1191
@Article{paulson-yahalom,
haftmann@21074
  1192
  author = 	 {Lawrence C. Paulson},
haftmann@21074
  1193
  title = 	 {Relations Between Secrets:
haftmann@21074
  1194
                  Two Formal Analyses of the {Yahalom} Protocol},
haftmann@21074
  1195
  journal = 	 JCS,
paulson@23505
  1196
  volume = 9,
paulson@23505
  1197
  number = 3,
paulson@23505
  1198
  pages = {197-216},
paulson@23505
  1199
  year = 2001}}
paulson@11246
  1200
paulson@6592
  1201
@article{pelletier86,
paulson@6592
  1202
  author	= {F. J. Pelletier},
paulson@6592
  1203
  title		= {Seventy-five Problems for Testing Automatic Theorem
paulson@6592
  1204
		 Provers}, 
paulson@6592
  1205
  journal	= JAR,
paulson@6592
  1206
  volume	= 2,
paulson@6592
  1207
  pages		= {191-216},
paulson@6592
  1208
  year		= 1986,
paulson@6592
  1209
  note		= {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
paulson@6592
  1210
paulson@6592
  1211
@Article{pitts94,  
paulson@6592
  1212
  author	= {Andrew M. Pitts},
paulson@6592
  1213
  title		= {A Co-induction Principle for Recursively Defined Domains},
paulson@6592
  1214
  journal	= TCS,
paulson@6592
  1215
  volume	= 124, 
paulson@6592
  1216
  pages		= {195-219},
paulson@6592
  1217
  year		= 1994} 
paulson@6592
  1218
paulson@6592
  1219
@Article{plaisted90,
paulson@6592
  1220
  author	= {David A. Plaisted},
paulson@6592
  1221
  title		= {A Sequent-Style Model Elimination Strategy and a Positive
paulson@6592
  1222
		 Refinement},
paulson@6592
  1223
  journal	= JAR,
paulson@6592
  1224
  year		= 1990,
paulson@6592
  1225
  volume	= 6,
paulson@6592
  1226
  number	= 4,
paulson@6592
  1227
  pages		= {389-402}}
paulson@6592
  1228
paulson@6592
  1229
%Q
paulson@6592
  1230
paulson@6592
  1231
@Article{quaife92,
paulson@6592
  1232
  author	= {Art Quaife},
paulson@6592
  1233
  title		= {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
paulson@6592
  1234
		 Theory},
paulson@6592
  1235
  journal	= JAR,
paulson@6592
  1236
  year		= 1992,
paulson@6592
  1237
  volume	= 8,
paulson@6592
  1238
  number	= 1,
paulson@6592
  1239
  pages		= {91-147}}
paulson@6592
  1240
paulson@6592
  1241
%R
paulson@6592
  1242
paulson@6592
  1243
@TechReport{rasmussen95,
paulson@6592
  1244
  author	= {Ole Rasmussen},
paulson@6592
  1245
  title		= {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
paulson@6592
  1246
		  Experiment},
paulson@6592
  1247
  institution	= {Computer Laboratory, University of Cambridge},
paulson@6592
  1248
  year		= 1995,
paulson@6592
  1249
  number	= 364,
paulson@6592
  1250
  month		= may,
wenzelm@6619
  1251
  url		= {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
paulson@6592
  1252
paulson@6592
  1253
@Book{reeves90,
paulson@6592
  1254
  author	= {Steve Reeves and Michael Clarke},
paulson@6592
  1255
  title		= {Logic for Computer Science},
paulson@6592
  1256
  publisher	= {Addison-Wesley},
paulson@6592
  1257
  year		= 1990}
paulson@6592
  1258
nipkow@11209
  1259
@book{Rosen-DMA,author={Kenneth H. Rosen},
nipkow@11209
  1260
title={Discrete Mathematics and Its Applications},
nipkow@11209
  1261
publisher={McGraw-Hill},year=1998}
nipkow@11209
  1262
wenzelm@7041
  1263
@InProceedings{Rudnicki:1992:MizarOverview,
wenzelm@7041
  1264
  author = 	 {P. Rudnicki},
wenzelm@7041
  1265
  title = 	 {An Overview of the {MIZAR} Project},
wenzelm@7041
  1266
  booktitle = 	 {1992 Workshop on Types for Proofs and Programs},
wenzelm@7041
  1267
  year =	 1992,
wenzelm@7041
  1268
  organization = {Chalmers University of Technology},
wenzelm@7041
  1269
  publisher =	 {Bastad}
wenzelm@7041
  1270
}
wenzelm@7041
  1271
paulson@6592
  1272
%S
paulson@6592
  1273
paulson@6592
  1274
@inproceedings{saaltink-fme,
paulson@6592
  1275
  author	= {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
paulson@6592
  1276
		 Dan Craigen and Irwin Meisels},
paulson@6592
  1277
  title		= {An {EVES} Data Abstraction Example}, 
paulson@6592
  1278
  pages		= {578-596},
paulson@6592
  1279
  crossref	= {fme93}}
paulson@6592
  1280
wenzelm@29728
  1281
@Article{Schroeder-Heister:1984,
wenzelm@29728
  1282
  author =       {Peter Schroeder-Heister},
wenzelm@29728
  1283
  title =        {A Natural Extension of Natural Deduction},
wenzelm@29728
  1284
  journal =      {Journal of Symbolic Logic},
wenzelm@29728
  1285
  year =         1984,
wenzelm@29728
  1286
  volume =       49,
wenzelm@29728
  1287
  number =       4
wenzelm@29728
  1288
}
wenzelm@29728
  1289
blanchet@33191
  1290
@misc{sledgehammer-2009,
blanchet@33191
  1291
  key = "Sledgehammer",
blanchet@33191
  1292
  title = "The {S}ledgehammer: Let Automatic Theorem Provers
blanchet@33191
  1293
Write Your {I}s\-a\-belle Scripts",
blanchet@33191
  1294
  note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
blanchet@33191
  1295
paulson@6592
  1296
@inproceedings{slind-tfl,
paulson@6592
  1297
  author	= {Konrad Slind},
paulson@6592
  1298
  title		= {Function Definition in Higher Order Logic},
krauss@23187
  1299
  crossref  = {tphols96},
krauss@23187
  1300
  pages		= {381-397}}
paulson@6592
  1301
paulson@6592
  1302
@book{suppes72,
paulson@6592
  1303
  author	= {Patrick Suppes},
paulson@6592
  1304
  title		= {Axiomatic Set Theory},
paulson@6592
  1305
  year		= 1972,
paulson@6592
  1306
  publisher	= {Dover}}
paulson@6592
  1307
paulson@6592
  1308
@InCollection{szasz93,
paulson@6592
  1309
  author	= {Nora Szasz},
paulson@6592
  1310
  title		= {A Machine Checked Proof that {Ackermann's} Function is not
paulson@6592
  1311
		  Primitive Recursive},
paulson@6592
  1312
  crossref	= {huet-plotkin93},
paulson@6592
  1313
  pages		= {317-338}}
paulson@6592
  1314
wenzelm@7041
  1315
@TechReport{Syme:1997:DECLARE,
wenzelm@7041
  1316
  author = 	 {D. Syme},
wenzelm@7041
  1317
  title = 	 {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
wenzelm@7041
  1318
  institution =  {University of Cambridge Computer Laboratory},
wenzelm@7041
  1319
  year = 	 1997,
wenzelm@7041
  1320
  number =	 416
wenzelm@7041
  1321
}
wenzelm@7041
  1322
wenzelm@7041
  1323
@PhdThesis{Syme:1998:thesis,
wenzelm@7041
  1324
  author = 	 {D. Syme},
wenzelm@7041
  1325
  title = 	 {Declarative Theorem Proving for Operational Semantics},
wenzelm@7041
  1326
  school = 	 {University of Cambridge},
wenzelm@7041
  1327
  year = 	 1998,
wenzelm@7041
  1328
  note =	 {Submitted}
wenzelm@7041
  1329
}
wenzelm@7041
  1330
wenzelm@7041
  1331
@InProceedings{Syme:1999:TPHOL,
wenzelm@7041
  1332
  author = 	 {D. Syme},
wenzelm@7041
  1333
  title = 	 {Three Tactic Theorem Proving},
wenzelm@7041
  1334
  crossref =     {tphols99}}
wenzelm@7041
  1335
paulson@6592
  1336
%T
paulson@6592
  1337
paulson@6592
  1338
@book{takeuti87,
paulson@6592
  1339
  author	= {G. Takeuti},
paulson@6592
  1340
  title		= {Proof Theory},
paulson@6592
  1341
  year		= 1987,
paulson@6592
  1342
  publisher	= NH,
paulson@6592
  1343
  edition	= {2nd}}
paulson@6592
  1344
paulson@6592
  1345
@Book{thompson91,
paulson@6592
  1346
  author	= {Simon Thompson},
paulson@6592
  1347
  title		= {Type Theory and Functional Programming},
paulson@6592
  1348
  publisher	= {Addison-Wesley},
paulson@6592
  1349
  year		= 1991}
paulson@6592
  1350
nipkow@11209
  1351
@book{Thompson-Haskell,author={Simon Thompson},
nipkow@11209
  1352
title={Haskell: The Craft of Functional Programming},
nipkow@11209
  1353
publisher={Addison-Wesley},year=1999}
nipkow@11209
  1354
blanchet@33191
  1355
@misc{kodkod-2009,
blanchet@33191
  1356
  author = "Emina Torlak",
blanchet@33191
  1357
  title = {Kodkod: Constraint Solver for Relational Logic},
blanchet@33191
  1358
  note = "\url{http://alloy.mit.edu/kodkod/}"}
blanchet@33191
  1359
blanchet@33191
  1360
@misc{kodkod-2009-options,
blanchet@33191
  1361
  author = "Emina Torlak",
blanchet@33191
  1362
  title = "Kodkod {API}: Class {Options}",
blanchet@33191
  1363
  note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
blanchet@33191
  1364
blanchet@33191
  1365
@inproceedings{torlak-jackson-2007,
blanchet@33191
  1366
  title = "Kodkod: A Relational Model Finder",
blanchet@33191
  1367
  author = "Emina Torlak and Daniel Jackson",
blanchet@33191
  1368
  editor = "Orna Grumberg and Michael Huth",
blanchet@33191
  1369
  booktitle = "TACAS 2007",
blanchet@33191
  1370
  series = LNCS,
blanchet@33191
  1371
  volume = {4424},
blanchet@33191
  1372
  pages = "632--647",
blanchet@33191
  1373
  year = 2007,
blanchet@33191
  1374
  publisher = Springer}
blanchet@33191
  1375
wenzelm@7041
  1376
@Unpublished{Trybulec:1993:MizarFeatures,
wenzelm@7041
  1377
  author = 	 {A. Trybulec},
wenzelm@7041
  1378
  title = 	 {Some Features of the {Mizar} Language},
wenzelm@7041
  1379
  note = 	 {Presented at a workshop in Turin, Italy},
wenzelm@7041
  1380
  year =	 1993
wenzelm@7041
  1381
}
wenzelm@7041
  1382
paulson@6592
  1383
%V
paulson@6592
  1384
paulson@6592
  1385
@Unpublished{voelker94,
nipkow@10186
  1386
  author	= {Norbert V{\"o}lker},
paulson@6592
  1387
  title		= {The Verification of a Timer Program using {Isabelle/HOL}},
wenzelm@6745
  1388
  url		= {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
paulson@6592
  1389
  year		= 1994,
paulson@6592
  1390
  month		= aug}
paulson@6592
  1391
paulson@6592
  1392
%W
paulson@6592
  1393
haftmann@23956
  1394
@inproceedings{wadler89how,
haftmann@23956
  1395
  author        = {P. Wadler and S. Blott},
haftmann@23956
  1396
  title         = {How to make ad-hoc polymorphism less ad-hoc},
haftmann@23956
  1397
  booktitle     = {ACM Symp.\ Principles of Programming Languages},
haftmann@23956
  1398
  year          = 1989
haftmann@23956
  1399
}
haftmann@23956
  1400
blanchet@33191
  1401
@phdthesis{weber-2008,
blanchet@33191
  1402
  author = "Tjark Weber",
blanchet@33191
  1403
  title = "SAT-Based Finite Model Generation for Higher-Order Logic",
blanchet@33191
  1404
  school = {Dept.\ of Informatics, T.U. M\"unchen},
blanchet@33191
  1405
  type = "{Ph.D.}\ thesis",
blanchet@33191
  1406
  year = 2008}
blanchet@33191
  1407
wenzelm@8505
  1408
@Misc{x-symbol,
wenzelm@8505
  1409
  author =	 {Christoph Wedler},
wenzelm@8505
  1410
  title =	 {Emacs package ``{X-Symbol}''},
wenzelm@13141
  1411
  note =	 {\url{http://x-symbol.sourceforge.net}}
wenzelm@8505
  1412
}
wenzelm@8505
  1413
wenzelm@7858
  1414
@manual{isabelle-sys,
wenzelm@7858
  1415
  author	= {Markus Wenzel and Stefan Berghofer},
wenzelm@7858
  1416
  title		= {The {Isabelle} System Manual},
wenzelm@8892
  1417
  institution	= {TU Munich},
wenzelm@8892
  1418
  note          = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
wenzelm@7858
  1419
wenzelm@7858
  1420
@manual{isabelle-isar-ref,
wenzelm@28837
  1421
  author	= {Makarius Wenzel},
wenzelm@7966
  1422
  title		= {The {Isabelle/Isar} Reference Manual},
wenzelm@8892
  1423
  institution	= {TU Munich},
wenzelm@8892
  1424
  note          = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
wenzelm@8892
  1425
wenzelm@28837
  1426
@manual{isabelle-implementation,
wenzelm@28837
  1427
  author	= {Makarius Wenzel},
wenzelm@28837
  1428
  title		= {The {Isabelle/Isar} Implementation},
wenzelm@28837
  1429
  institution	= {TU Munich},
wenzelm@28837
  1430
  note          = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
wenzelm@28837
  1431
wenzelm@7041
  1432
@InProceedings{Wenzel:1999:TPHOL,
wenzelm@7041
  1433
  author = 	 {Markus Wenzel},
wenzelm@7041
  1434
  title = 	 {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
wenzelm@7041
  1435
  crossref =     {tphols99}}
wenzelm@6624
  1436
wenzelm@6624
  1437
@InProceedings{Wenzel:1997:TPHOL,
wenzelm@6624
  1438
  author = 	 {Markus Wenzel},
wenzelm@6624
  1439
  title = 	 {Type Classes and Overloading in Higher-Order Logic},
wenzelm@7041
  1440
  crossref =     {tphols97}}
wenzelm@7041
  1441
paulson@14147
  1442
@phdthesis{Wenzel-PhD,
paulson@14147
  1443
  author={Markus Wenzel},
paulson@14147
  1444
    title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
paulson@14147
  1445
  school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
paulson@14147
  1446
  year=2002,
wenzelm@12901
  1447
  note =	 {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
wenzelm@7041
  1448
wenzelm@29715
  1449
@Article{Wenzel-Wiedijk:2002,
wenzelm@29715
  1450
  author = 	 {Freek Wiedijk and Markus Wenzel},
wenzelm@29715
  1451
  title = 	 {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
wenzelm@29715
  1452
  journal = 	 {Journal of Automated Reasoning},
wenzelm@29715
  1453
  year = 	 2002,
wenzelm@29715
  1454
  volume =	 29,
wenzelm@29715
  1455
  number =	 {3-4}
wenzelm@29715
  1456
}
wenzelm@29715
  1457
wenzelm@29715
  1458
@InCollection{Wenzel-Paulson:2006,
wenzelm@29715
  1459
  author = 	 {Markus Wenzel and Lawrence C. Paulson},
wenzelm@29715
  1460
  title = 	 {{Isabelle/Isar}},
wenzelm@29715
  1461
  booktitle = 	 {The Seventeen Provers of the World},
wenzelm@29715
  1462
  year =	 2006,
wenzelm@29715
  1463
  editor =	 {F. Wiedijk},
wenzelm@29715
  1464
  series =	 {LNAI 3600}
wenzelm@29715
  1465
}
wenzelm@29715
  1466
wenzelm@27060
  1467
@InCollection{Wenzel:2006:Festschrift,
wenzelm@27060
  1468
  author = 	 {Makarius Wenzel},
wenzelm@27060
  1469
  title = 	 {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
wenzelm@27060
  1470
  booktitle = 	 {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
wenzelm@27060
  1471
  publisher =	 {University of Bia{\l}ystok},
wenzelm@27060
  1472
  year =	 2007,
wenzelm@27060
  1473
  editor =	 {R. Matuszewski and A. Zalewska},
wenzelm@27060
  1474
  volume =	 {10(23)},
wenzelm@27060
  1475
  series =	 {Studies in Logic, Grammar, and Rhetoric},
wenzelm@27060
  1476
  note =         {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
wenzelm@27060
  1477
}
wenzelm@27060
  1478
paulson@6592
  1479
@book{principia,
paulson@6592
  1480
  author	= {A. N. Whitehead and B. Russell},
paulson@6592
  1481
  title		= {Principia Mathematica},
paulson@6592
  1482
  year		= 1962,
paulson@6592
  1483
  publisher	= CUP, 
paulson@6592
  1484
  note		= {Paperback edition to *56,
paulson@6592
  1485
  abridged from the 2nd edition (1927)}}
paulson@6592
  1486
wenzelm@9599
  1487
@Misc{Wiedijk:1999:Mizar,
wenzelm@9599
  1488
  author =	 {Freek Wiedijk},
wenzelm@9599
  1489
  title =	 {Mizar: An Impression},
wenzelm@9599
  1490
  howpublished = {Unpublished paper},
wenzelm@9599
  1491
  year =         1999,
wenzelm@9599
  1492
  note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
wenzelm@9599
  1493
}
wenzelm@9599
  1494
wenzelm@9599
  1495
@Misc{Wiedijk:2000:MV,
wenzelm@9599
  1496
  author =	 {Freek Wiedijk},
wenzelm@9599
  1497
  title =	 {The Mathematical Vernacular},
wenzelm@9599
  1498
  howpublished = {Unpublished paper},
wenzelm@9599
  1499
  year =         2000,
wenzelm@9599
  1500
  note =	 {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
wenzelm@9599
  1501
}
wenzelm@9599
  1502
paulson@6592
  1503
@book{winskel93,
paulson@6592
  1504
  author	= {Glynn Winskel},
paulson@6592
  1505
  title		= {The Formal Semantics of Programming Languages},
paulson@6592
  1506
  publisher	= MIT,year=1993}
paulson@6592
  1507
paulson@6592
  1508
@InCollection{wos-bledsoe,
paulson@6592
  1509
  author	= {Larry Wos},
paulson@6592
  1510
  title		= {Automated Reasoning and {Bledsoe's} Dream for the Field},
paulson@6592
  1511
  crossref	= {bledsoe-fest},
paulson@6592
  1512
  pages		= {297-342}}
paulson@6592
  1513
wenzelm@7989
  1514
@InProceedings{Zammit:1999:TPHOL,
wenzelm@7989
  1515
  author = 	 {Vincent Zammit},
wenzelm@7989
  1516
  title = 	 {On the Implementation of an Extensible Declarative Proof Language},
wenzelm@7989
  1517
  crossref =     {tphols99}}
wenzelm@7989
  1518
wenzelm@7989
  1519
%Z
wenzelm@7989
  1520
paulson@6592
  1521
paulson@6592
  1522
% CROSS REFERENCES
paulson@6592
  1523
paulson@6592
  1524
@book{handbk-lics2,
paulson@6592
  1525
  editor	= {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
paulson@6592
  1526
  title		= {Handbook of Logic in Computer Science},
paulson@6592
  1527
  booktitle	= {Handbook of Logic in Computer Science},
paulson@6592
  1528
  publisher	= {Oxford University Press},
paulson@6592
  1529
  year		= 1992,
paulson@6592
  1530
  volume	= 2}
paulson@6592
  1531
paulson@6592
  1532
@book{types93,
paulson@6592
  1533
  editor	= {Henk Barendregt and Tobias Nipkow},
paulson@6592
  1534
  title		= TYPES # {: International Workshop {TYPES '93}},
paulson@6592
  1535
  booktitle	= TYPES # {: International Workshop {TYPES '93}},
paulson@6592
  1536
  year		= {published 1994},
paulson@6592
  1537
  publisher	= {Springer},
paulson@6592
  1538
  series	= {LNCS 806}}
paulson@6592
  1539
paulson@6613
  1540
@book{barwise-handbk,
paulson@6613
  1541
  editor	= {J. Barwise},
paulson@6613
  1542
  title		= {Handbook of Mathematical Logic},
paulson@6613
  1543
  booktitle	= {Handbook of Mathematical Logic},
paulson@6613
  1544
  year		= 1977,
paulson@6613
  1545
  publisher	= NH}
paulson@6613
  1546
paulson@6592
  1547
@Proceedings{tlca93,
paulson@6592
  1548
  title		= {Typed Lambda Calculi and Applications},
paulson@6592
  1549
  booktitle	= {Typed Lambda Calculi and Applications},
paulson@6592
  1550
  editor	= {M. Bezem and J.F. Groote},
paulson@6592
  1551
  year		= 1993,
paulson@6592
  1552
  publisher	= {Springer},
paulson@6592
  1553
  series	= {LNCS 664}}
paulson@6592
  1554
paulson@6613
  1555
@book{birtwistle89,
paulson@6613
  1556
  editor	= {Graham Birtwistle and P. A. Subrahmanyam},
paulson@6613
  1557
  title		= {Current Trends in Hardware Verification and Automated
paulson@6613
  1558
		 Theorem Proving}, 
paulson@6613
  1559
  booktitle	= {Current Trends in Hardware Verification and Automated
paulson@6613
  1560
		 Theorem Proving}, 
paulson@6613
  1561
  publisher	= {Springer},
paulson@6613
  1562
  year		= 1989}
paulson@6613
  1563
paulson@6592
  1564
@book{bledsoe-fest,
paulson@6592
  1565
  title		= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
paulson@6592
  1566
  booktitle	= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
paulson@6592
  1567
  publisher	= {Kluwer Academic Publishers},
paulson@6592
  1568
  year		= 1991,
paulson@6592
  1569
  editor	= {Robert S. Boyer}}
paulson@6592
  1570
paulson@6592
  1571
@Proceedings{cade12,
paulson@6592
  1572
  editor	= {Alan Bundy},
paulson@6592
  1573
  title		= {Automated Deduction --- {CADE}-12 
paulson@6592
  1574
		  International Conference},
paulson@6592
  1575
  booktitle	= {Automated Deduction --- {CADE}-12 
paulson@6592
  1576
		  International Conference},
paulson@6592
  1577
  year		= 1994,
paulson@6592
  1578
  series	= {LNAI 814},
paulson@6592
  1579
  publisher	= {Springer}}
paulson@6592
  1580
paulson@6592
  1581
@book{types94,
nipkow@10186
  1582
  editor	= {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
paulson@6592
  1583
  title		= TYPES # {: International Workshop {TYPES '94}},
paulson@6592
  1584
  booktitle	= TYPES # {: International Workshop {TYPES '94}},
paulson@6592
  1585
  year		= 1995,
paulson@6592
  1586
  publisher	= {Springer},
paulson@6592
  1587
  series	= {LNCS 996}}
paulson@6592
  1588
paulson@6592
  1589
@book{huet-plotkin91,
nipkow@10186
  1590
  editor	= {{G{\'e}rard} Huet and Gordon Plotkin},
paulson@6592
  1591
  title		= {Logical Frameworks},
paulson@6592
  1592
  booktitle	= {Logical Frameworks},
paulson@6592
  1593
  publisher	= CUP,
paulson@6592
  1594
  year		= 1991}
paulson@6592
  1595
paulson@6613
  1596
@book{huet-plotkin93,
nipkow@10186
  1597
  editor	= {{G{\'e}rard} Huet and Gordon Plotkin},
paulson@6613
  1598
  title		= {Logical Environments},
paulson@6613
  1599
  booktitle	= {Logical Environments},
paulson@6613
  1600
  publisher	= CUP,
paulson@6613
  1601
  year		= 1993}
paulson@6613
  1602
paulson@6613
  1603
@Proceedings{hug93,
paulson@6613
  1604
  editor	= {J. Joyce and C. Seger},
paulson@6613
  1605
  title		= {Higher Order Logic Theorem Proving and Its
paulson@6613
  1606
		  Applications: HUG '93},
paulson@6613
  1607
  booktitle	= {Higher Order Logic Theorem Proving and Its
paulson@6613
  1608
		  Applications: HUG '93},
paulson@6613
  1609
  year		= {Published 1994},
paulson@6613
  1610
  publisher	= {Springer},
paulson@6613
  1611
  series	= {LNCS 780}}
paulson@6613
  1612
paulson@6592
  1613
@proceedings{colog88,
nipkow@10186
  1614
  editor	= {P. Martin-L{\"o}f and G. Mints},
paulson@6592
  1615
  title		= {COLOG-88: International Conference on Computer Logic},
paulson@6592
  1616
  booktitle	= {COLOG-88: International Conference on Computer Logic},
paulson@6592
  1617
  year		= {Published 1990},
paulson@6592
  1618
  publisher	= {Springer},
paulson@6592
  1619
  organization	= {Estonian Academy of Sciences},
paulson@6592
  1620
  address	= {Tallinn},
paulson@6592
  1621
  series	= {LNCS 417}}
paulson@6592
  1622
paulson@6592
  1623
@book{odifreddi90,
paulson@6592
  1624
  editor	= {P. Odifreddi},
paulson@6592
  1625
  title		= {Logic and Computer Science},
paulson@6592
  1626
  booktitle	= {Logic and Computer Science},
paulson@6592
  1627
  publisher	= {Academic Press},
paulson@6592
  1628
  year		= 1990}
paulson@6592
  1629
paulson@6592
  1630
@proceedings{extensions91,
paulson@6592
  1631
  editor	= {Peter Schroeder-Heister},
paulson@6592
  1632
  title		= {Extensions of Logic Programming},
paulson@6592
  1633
  booktitle	= {Extensions of Logic Programming},
paulson@6592
  1634
  year		= 1991,
paulson@6592
  1635
  series	= {LNAI 475}, 
paulson@6592
  1636
  publisher	= {Springer}}
paulson@6592
  1637
paulson@6592
  1638
@proceedings{cade10,
paulson@6592
  1639
  editor	= {Mark E. Stickel},
paulson@6592
  1640
  title		= {10th } # CADE,
paulson@6592
  1641
  booktitle	= {10th } # CADE,
paulson@6592
  1642
  year		= 1990,
paulson@6592
  1643
  publisher	= {Springer},
paulson@6592
  1644
  series	= {LNAI 449}}
paulson@6592
  1645
paulson@6592
  1646
@Proceedings{lics8,
paulson@6592
  1647
  editor	= {M. Vardi},
paulson@6592
  1648
  title		= {Eighth Annual Symposium on Logic in Computer Science},
paulson@6592
  1649
  booktitle	= {Eighth Annual Symposium on Logic in Computer Science},
paulson@6592
  1650
  publisher	= IEEE,
paulson@6592
  1651
  year		= 1993}
paulson@6592
  1652
paulson@6592
  1653
@book{wos-fest,
paulson@6592
  1654
  title		= {Automated Reasoning and its Applications: 
paulson@6592
  1655
			Essays in Honor of {Larry Wos}},
paulson@6592
  1656
  booktitle	= {Automated Reasoning and its Applications: 
paulson@6592
  1657
			Essays in Honor of {Larry Wos}},
blanchet@33191
  1658
  publisher	= MIT,
paulson@6592
  1659
  year		= 1997,
paulson@6592
  1660
  editor	= {Robert Veroff}}
paulson@6592
  1661
paulson@6613
  1662
@proceedings{fme93,
paulson@6613
  1663
  editor	= {J. C. P. Woodcock and P. G. Larsen},
paulson@6613
  1664
  title		= {FME '93: Industrial-Strength Formal Methods},
paulson@6613
  1665
  booktitle	= {FME '93: Industrial-Strength Formal Methods},
paulson@6613
  1666
  year		= 1993,
berghofe@13009
  1667
  publisher	= Springer,
berghofe@13009
  1668
  series	= LNCS,
berghofe@13009
  1669
  volume        = 670}
paulson@6613
  1670
paulson@6592
  1671
@Proceedings{tphols96,
paulson@6592
  1672
  title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
paulson@6592
  1673
  booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
paulson@6592
  1674
  editor	= {J. von Wright and J. Grundy and J. Harrison},
berghofe@13009
  1675
  publisher     = Springer,
berghofe@13009
  1676
  series	= LNCS,
berghofe@13009
  1677
  volume        = 1125,
paulson@6592
  1678
  year		= 1996}
paulson@6670
  1679
wenzelm@7041
  1680
@Proceedings{tphols97,
wenzelm@7041
  1681
  title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
wenzelm@7041
  1682
  booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
wenzelm@7041
  1683
  editor	= {Elsa L. Gunter and Amy Felty},
berghofe@13009
  1684
  publisher     = Springer,
berghofe@13009
  1685
  series	= LNCS,
berghofe@13009
  1686
  volume        = 1275,
wenzelm@7041
  1687
  year		= 1997}
wenzelm@7041
  1688
wenzelm@7041
  1689
@Proceedings{tphols98,
wenzelm@7041
  1690
  title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
wenzelm@7041
  1691
  booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
wenzelm@7041
  1692
  editor	= {Jim Grundy and Malcom Newey},
berghofe@13009
  1693
  publisher     = Springer,
berghofe@13009
  1694
  series	= LNCS,
berghofe@13009
  1695
  volume        = 1479,
wenzelm@7041
  1696
  year		= 1998}
wenzelm@7041
  1697
paulson@6670
  1698
@Proceedings{tphols99,
paulson@6670
  1699
  title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
paulson@6670
  1700
  booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
wenzelm@7350
  1701
  editor	= {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
wenzelm@7350
  1702
                  Paulin, C. and Thery, L.},
berghofe@13009
  1703
  publisher     = Springer,
berghofe@13009
  1704
  series	= LNCS,
berghofe@13009
  1705
  volume        = 1690,
paulson@6670
  1706
  year		= 1999}
paulson@6670
  1707
wenzelm@12878
  1708
@Proceedings{tphols2000,
wenzelm@12878
  1709
  title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
wenzelm@12878
  1710
  booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
wenzelm@12878
  1711
  editor        = {J. Harrison and M. Aagaard},
berghofe@13009
  1712
  publisher     = Springer,
berghofe@13009
  1713
  series        = LNCS,
berghofe@13009
  1714
  volume        = 1869,
wenzelm@12878
  1715
  year          = 2000}
wenzelm@12878
  1716
wenzelm@12878
  1717
@Proceedings{tphols2001,
wenzelm@12878
  1718
  title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
wenzelm@12878
  1719
  booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
wenzelm@12878
  1720
  editor        = {R. J. Boulton and P. B. Jackson},
berghofe@13009
  1721
  publisher     = Springer,
berghofe@13009
  1722
  series        = LNCS,
berghofe@13009
  1723
  volume        = 2152,
wenzelm@12878
  1724
  year          = 2001}
haftmann@22317
  1725
krauss@23187
  1726
@Proceedings{ijcar2006,
krauss@23187
  1727
  title         = {Automated Reasoning: {IJCAR} 2006},
krauss@23187
  1728
  booktitle     = {Automated Reasoning: {IJCAR} 2006},
krauss@23187
  1729
  editor        = {U. Furbach and N. Shankar},
krauss@23187
  1730
  publisher     = Springer,
krauss@23187
  1731
  series        = LNCS,
krauss@23187
  1732
  volume        = 4130,
krauss@23187
  1733
  year          = 2006}
krauss@23187
  1734
krauss@25093
  1735
@Proceedings{tphols2007,
krauss@25093
  1736
  title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
krauss@25093
  1737
  booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
krauss@25093
  1738
  editor        = {K. Schneider and J. Brandt},
krauss@25093
  1739
  publisher     = Springer,
krauss@25093
  1740
  series        = LNCS,
krauss@25093
  1741
  volume        = 4732,
krauss@25093
  1742
  year          = 2007}
krauss@25093
  1743
haftmann@28593
  1744
@Proceedings{tphols2008,
haftmann@28593
  1745
  title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
haftmann@28593
  1746
  booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
haftmann@28593
  1747
  publisher     = Springer,
haftmann@28593
  1748
  series        = LNCS,
haftmann@28593
  1749
  year          = 2008}
haftmann@28593
  1750
%  editor        =
haftmann@28593
  1751
%  volume        = 4732,
haftmann@28593
  1752
haftmann@22317
  1753
@unpublished{classes_modules,
haftmann@23956
  1754
  title         = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
haftmann@22317
  1755
  author        = {Stefan Wehr et. al.}
haftmann@22317
  1756
}
blanchet@33191
  1757
blanchet@33191
  1758
@misc{wikipedia-2009-aa-trees,
blanchet@33191
  1759
  key = "Wikipedia",
blanchet@33191
  1760
  title = "Wikipedia: {AA} Tree",
blanchet@33191
  1761
  note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
blanchet@35665
  1762
blanchet@35665
  1763
@incollection{lochbihler-2010,
blanchet@35665
  1764
  title = "Coinduction",
blanchet@35665
  1765
  author = "Andreas Lochbihler",
blanchet@35665
  1766
  booktitle = "The Archive of Formal Proofs",
blanchet@35665
  1767
  editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
blanchet@35665
  1768
  publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",
blanchet@35665
  1769
  month = "Feb.",
blanchet@35665
  1770
  year = 2010}