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