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