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