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