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