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