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