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