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