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