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