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