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