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