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