wneuper/isa: doc-src/manual.bib@5f4182667032

     1 % BibTeX database for the Isabelle documentation

2 %

     3 % Lawrence C Paulson $Id$

     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"}

    16 %institutions

    17 @string{CUCL="Computer Laboratory, University of Cambridge"}

    18 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}

    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"}

    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"}

    40 %A

    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}

    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}

    59 @incollection{aczel77,

    60   author	= {Peter Aczel},

    61   title		= {An Introduction to Inductive Definitions},

    62   pages		= {739-782},

    63   crossref	= {barwise-handbk}}

    65 @Book{aczel88,

    66   author	= {Peter Aczel},

    67   title		= {Non-Well-Founded Sets},

    68   publisher	= {CSLI},

    69   year		= 1988}

    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}}

    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}

    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 }

   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 }

   111 @Misc{proofgeneral,

   112   author =	 {David Aspinall},

   113   title =	 {{P}roof {G}eneral},

   114   note =	 {\url{http://www.proofgeneral.org}}

   115 }

   117 %B

   119 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},

   120 title="Term Rewriting and All That",publisher=CUP,year=1998}

   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}}

   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 Isabelle2001 distribution,

   135                   \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},

   136   year =         2001

   137 }

   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 }

   150 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,

   151   crossref        = "tphols2000",

   152   title           = "Proof terms for simply typed higher order logic",

   153   author          = "Stefan Berghofer and Tobias Nipkow",

   154   pages           = "38--52"}

   156 @InProceedings{Berghofer-Wenzel:1999:TPHOL,

   157   author = 	 {Stefan Berghofer and Markus Wenzel},

   158   title = 	 {Inductive datatypes in {HOL} --- lessons learned in

   159                   {F}ormal-{L}ogic {E}ngineering},

   160   crossref =     {tphols99}}

   162 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",

   163 title="Introduction to Functional Programming",publisher=PH,year=1988}

   165 @book{Bird-Haskell,author="Richard Bird",

   166 title="Introduction to Functional Programming using Haskell",

   167 publisher=PH,year=1998}

   169 @Article{boyer86,

   170   author	= {Robert Boyer and Ewing Lusk and William McCune and Ross

   171 		   Overbeek and Mark Stickel and Lawrence Wos},

   172   title		= {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}

   173 		   Axioms},

   174   journal	= JAR,

   175   year		= 1986,

   176   volume	= 2,

   177   number	= 3,

   178   pages		= {287-327}}

   180 @book{bm79,

   181   author	= {Robert S. Boyer and J Strother Moore},

   182   title		= {A Computational Logic},

   183   publisher	= {Academic Press},

   184   year		= 1979}

   186 @book{bm88book,

   187   author	= {Robert S. Boyer and J Strother Moore},

   188   title		= {A Computational Logic Handbook},

   189   publisher	= {Academic Press},

   190   year		= 1988}

   192 @Article{debruijn72,

   193   author	= {N. G. de Bruijn},

   194   title		= {Lambda Calculus Notation with Nameless Dummies,

   195 	a Tool for Automatic Formula Manipulation,

   196 	with Application to the {Church-Rosser Theorem}},

   197   journal	= {Indag. Math.},

   198   volume	= 34,

   199   pages		= {381-392},

   200   year		= 1972}

   202 @Article{ban89,

   203   author	= {M. Burrows and M. Abadi and R. M. Needham},

   204   title		= {A Logic of Authentication},

   205   journal	= PROYAL,

   206   year		= 1989,

   207   volume	= 426,

   208   pages		= {233-271}}

   210 %C

   212 @TechReport{camilleri92,

   213   author	= {J. Camilleri and T. F. Melham},

   214   title		= {Reasoning with Inductively Defined Relations in the

   215 		 {HOL} Theorem Prover},

   216   institution	= CUCL,

   217   year		= 1992,

   218   number	= 265,

   219   month		= Aug}

   221 @Book{charniak80,

   222   author	= {E. Charniak and C. K. Riesbeck and D. V. McDermott},

   223   title		= {Artificial Intelligence Programming},

   224   publisher	= {Lawrence Erlbaum Associates},

   225   year		= 1980}

   227 @article{church40,

   228   author	= "Alonzo Church",

   229   title		= "A Formulation of the Simple Theory of Types",

   230   journal	= JSL,

   231   year		= 1940,

   232   volume	= 5,

   233   pages		= "56-68"}

   235 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",

   236 title="Model Checking",publisher=MIT,year=1999}

   238 @PhdThesis{coen92,

   239   author	= {Martin D. Coen},

   240   title		= {Interactive Program Derivation},

   241   school	= {University of Cambridge},

   242   note		= {Computer Laboratory Technical Report 272},

   243   month		= nov,

   244   year		= 1992}

   246 @book{constable86,

   247   author	= {R. L. Constable and others},

   248   title		= {Implementing Mathematics with the Nuprl Proof

   249 		 Development System},

   250   publisher	= Prentice,

   251   year		= 1986}

   253 %D

   255 @Book{davey-priestley,

   256   author	= {B. A. Davey and H. A. Priestley},

   257   title		= {Introduction to Lattices and Order},

   258   publisher	= CUP,

   259   year		= 1990}

   261 @Book{devlin79,

   262   author	= {Keith J. Devlin},

   263   title		= {Fundamentals of Contemporary Set Theory},

   264   publisher	= {Springer},

   265   year		= 1979}

   267 @book{dummett,

   268   author	= {Michael Dummett},

   269   title		= {Elements of Intuitionism},

   270   year		= 1977,

   271   publisher	= {Oxford University Press}}

   273 @incollection{dybjer91,

   274   author	= {Peter Dybjer},

   275   title		= {Inductive Sets and Families in {Martin-L{\"o}f's} Type

   276 		  Theory and Their Set-Theoretic Semantics},

   277   crossref	= {huet-plotkin91},

   278   pages		= {280-306}}

   280 @Article{dyckhoff,

   281   author	= {Roy Dyckhoff},

   282   title		= {Contraction-Free Sequent Calculi for Intuitionistic Logic},

   283   journal	= JSL,

   284   year		= 1992,

   285   volume	= 57,

   286   number	= 3,

   287   pages		= {795-807}}

   289 %F

   291 @Article{IMPS,

   292   author	= {William M. Farmer and Joshua D. Guttman and F. Javier

   293 		 Thayer},

   294   title		= {{IMPS}: An Interactive Mathematical Proof System},

   295   journal	= JAR,

   296   volume	= 11,

   297   number	= 2,

   298   year		= 1993,

   299   pages		= {213-248}}

   301 @InProceedings{felty91a,

   302   Author	= {Amy Felty},

   303   Title		= {A Logic Program for Transforming Sequent Proofs to Natural

   304 		  Deduction Proofs},

   305   crossref	= {extensions91},

   306   pages		= {157-178}}

   308 @Article{fleuriot-jcm,

   309   author = 	 {Jacques Fleuriot and Lawrence C. Paulson},

   310   title = 	 {Mechanizing Nonstandard Real Analysis},

   311   journal = 	 {LMS Journal of Computation and Mathematics},

   312   year = 	 2000,

   313   volume =	 3,

   314   pages =	 {140-190},

   315   note =	 {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}

   316 }

   318 @TechReport{frost93,

   319   author	= {Jacob Frost},

   320   title		= {A Case Study of Co-induction in {Isabelle HOL}},

   321   institution	= CUCL,

   322   number	= 308,

   323   year		= 1993,

   324   month		= Aug}

   326 %revised version of frost93

   327 @TechReport{frost95,

   328   author	= {Jacob Frost},

   329   title		= {A Case Study of Co-induction in {Isabelle}},

   330   institution	= CUCL,

   331   number	= 359,

   332   year		= 1995,

   333   month		= Feb}

   335 @inproceedings{OBJ,

   336   author	= {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud

   337 		 and J. Meseguer},

   338   title		= {Principles of {OBJ2}},

   339   booktitle	= POPL,

   340   year		= 1985,

   341   pages		= {52-66}}

   343 %G

   345 @book{gallier86,

   346   author	= {J. H. Gallier},

   347   title		= {Logic for Computer Science:

   348 		Foundations of Automatic Theorem Proving},

   349   year		= 1986,

   350   publisher	= {Harper \& Row}}

   352 @Book{galton90,

   353   author	= {Antony Galton},

   354   title		= {Logic for Information Technology},

   355   publisher	= {Wiley},

   356   year		= 1990}

   358 @InProceedings{gimenez-codifying,

   359   author	= {Eduardo Gim{\'e}nez},

   360   title		= {Codifying Guarded Definitions with Recursive Schemes},

   361   crossref	= {types94},

   362   pages		= {39-59}

   363 }

   365 @book{girard89,

   366   author	= {Jean-Yves Girard},

   367   title		= {Proofs and Types},

   368   year		= 1989,

   369   publisher	= CUP,

   370   note		= {Translated by Yves LaFont and Paul Taylor}}

   372 @Book{mgordon-hol,

   373   editor	= {M. J. C. Gordon and T. F. Melham},

   374   title		= {Introduction to {HOL}: A Theorem Proving Environment for

   375 		 Higher Order Logic},

   376   publisher	= CUP,

   377   year		= 1993}

   379 @book{mgordon79,

   380   author	= {Michael J. C. Gordon and Robin Milner and Christopher P.

   381 		 Wadsworth},

   382   title		= {Edinburgh {LCF}: A Mechanised Logic of Computation},

   383   year		= 1979,

   384   publisher	= {Springer},

   385   series	= {LNCS 78}}

   387 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},

   388 title={Why we can't have {SML} style datatype declarations in {HOL}},

   389 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\

   390 IFIP TC10/WG10.2 Intl. Workshop, 1992},

   391 editor={L.J.M. Claesen and M.J.C. Gordon},

   392 publisher=NH,year=1993,pages={561--568}}

   394 @InProceedings{gunter-trees,

   395   author	= {Elsa L. Gunter},

   396   title		= {A Broader Class of Trees for Recursive Type Definitions for

   397 		  {HOL}},

   398   crossref	= {hug93},

   399   pages		= {141-154}}

   401 %H

   403 @Book{halmos60,

   404   author	= {Paul R. Halmos},

   405   title		= {Naive Set Theory},

   406   publisher	= {Van Nostrand},

   407   year		= 1960}

   409 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},

   410 title={Dynamic Logic},publisher=MIT,year=2000}

   412 @Book{hennessy90,

   413   author	= {Matthew Hennessy},

   414   title		= {The Semantics of Programming Languages: An Elementary

   415 		  Introduction Using Structural Operational Semantics},

   416   publisher	= {Wiley},

   417   year		= 1990}

   419 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},

   420 title={Introduction to Automata Theory, Languages, and Computation.},

   421 publisher={Addison-Wesley},year=1979}

   423 @Article{haskell-report,

   424   author	= {Paul Hudak and Simon Peyton Jones and Philip Wadler},

   425   title		= {Report on the Programming Language {Haskell}: A

   426 		 Non-strict, Purely Functional Language},

   427   journal	= SIGPLAN,

   428   year		= 1992,

   429   volume	= 27,

   430   number	= 5,

   431   month		= May,

   432   note		= {Version 1.2}}

   434 @Article{haskell-tutorial,

   435   author	= {Paul Hudak and Joseph H. Fasel},

   436   title		= {A Gentle Introduction to {Haskell}},

   437   journal	= SIGPLAN,

   438   year		= 1992,

   439   volume	= 27,

   440   number	= 5,

   441   month		= May}

   443 @book{Hudak-Haskell,author={Paul Hudak},

   444 title={The Haskell School of Expression},publisher=CUP,year=2000}

   446 @article{huet75,

   447   author	= {G. P. Huet},

   448   title		= {A Unification Algorithm for Typed $\lambda$-Calculus},

   449   journal	= TCS,

   450   volume	= 1,

   451   year		= 1975,

   452   pages		= {27-57}}

   454 @article{huet78,

   455   author	= {G. P. Huet and B. Lang},

   456   title		= {Proving and Applying Program Transformations Expressed with

   457 			Second-Order Patterns},

   458   journal	= acta,

   459   volume	= 11,

   460   year		= 1978,

   461   pages		= {31-55}}

   463 @inproceedings{huet88,

   464   author	= {G{\'e}rard Huet},

   465   title		= {Induction Principles Formalized in the {Calculus of

   466 		 Constructions}},

   467   booktitle	= {Programming of Future Generation Computers},

   468   editor	= {K. Fuchi and M. Nivat},

   469   year		= 1988,

   470   pages		= {205-216},

   471   publisher	= {Elsevier}}

   473 @Book{Huth-Ryan-book,

   474   author	= {Michael Huth and Mark Ryan},

   475   title		= {Logic in Computer Science. Modelling and reasoning about systems},

   476   publisher	= CUP,

   477   year		= 2000}

   479 @InProceedings{Harrison:1996:MizarHOL,

   480   author = 	 {J. Harrison},

   481   title = 	 {A {Mizar} Mode for {HOL}},

   482   pages =	 {203--220},

   483   crossref =     {tphols96}}

   485 %K

   487 @InProceedings{kammueller-locales,

   488   author = 	 {Florian Kamm{\"u}ller and Markus Wenzel and

   489                   Lawrence C. Paulson},

   490   title = 	 {Locales: A Sectioning Concept for {Isabelle}},

   491   crossref =	 {tphols99}}

   493 @book{Knuth3-75,

   494   author={Donald E. Knuth},

   495   title={The Art of Computer Programming, Volume 3: Sorting and Searching},

   496   publisher={Addison-Wesley},

   497   year=1975}

   499 @Article{korf85,

   500   author	= {R. E. Korf},

   501   title		= {Depth-First Iterative-Deepening: an Optimal Admissible

   502 		 Tree Search},

   503   journal	= AI,

   504   year		= 1985,

   505   volume	= 27,

   506   pages		= {97-109}}

   508 @Book{kunen80,

   509   author	= {Kenneth Kunen},

   510   title		= {Set Theory: An Introduction to Independence Proofs},

   511   publisher	= NH,

   512   year		= 1980}

   514 %L

   516 @InProceedings{lowe-fdr,

   517   author	= {Gavin Lowe},

   518   title		= {Breaking and Fixing the {Needham}-{Schroeder} Public-Key

   519 		  Protocol using {CSP} and {FDR}},

   520   booktitle = 	 {Tools and Algorithms for the Construction and Analysis

   521                   of Systems:  second international workshop, TACAS '96},

   522   editor =	 {T. Margaria and B. Steffen},

   523   series =	 {LNCS 1055},

   524   year =	 1996,

   525   publisher =	 {Springer},

   526   pages		= {147-166}}

   529 %M

   531 @Article{mw81,

   532   author	= {Zohar Manna and Richard Waldinger},

   533   title		= {Deductive Synthesis of the Unification Algorithm},

   534   journal	= SCP,

   535   year		= 1981,

   536   volume	= 1,

   537   number	= 1,

   538   pages		= {5-48}}

   540 @InProceedings{martin-nipkow,

   541   author	= {Ursula Martin and Tobias Nipkow},

   542   title		= {Ordered Rewriting and Confluence},

   543   crossref	= {cade10},

   544   pages		= {366-380}}

   546 @book{martinlof84,

   547   author	= {Per Martin-L{\"o}f},

   548   title		= {Intuitionistic type theory},

   549   year		= 1984,

   550   publisher	= {Bibliopolis}}

   552 @incollection{melham89,

   553   author	= {Thomas F. Melham},

   554   title		= {Automating Recursive Type Definitions in Higher Order

   555 		 Logic},

   556   pages		= {341-386},

   557   crossref	= {birtwistle89}}

   559 @Article{miller-mixed,

   560   Author	= {Dale Miller},

   561   Title		= {Unification Under a Mixed Prefix},

   562   journal	= JSC,

   563   volume	= 14,

   564   number	= 4,

   565   pages		= {321-358},

   566   Year		= 1992}

   568 @Article{milner78,

   569   author	= {Robin Milner},

   570   title		= {A Theory of Type Polymorphism in Programming},

   571   journal	= "J. Comp.\ Sys.\ Sci.",

   572   year		= 1978,

   573   volume	= 17,

   574   pages		= {348-375}}

   576 @TechReport{milner-ind,

   577   author	= {Robin Milner},

   578   title		= {How to Derive Inductions in {LCF}},

   579   institution	= Edinburgh,

   580   year		= 1980,

   581   type		= {note}}

   583 @Article{milner-coind,

   584   author	= {Robin Milner and Mads Tofte},

   585   title		= {Co-induction in Relational Semantics},

   586   journal	= TCS,

   587   year		= 1991,

   588   volume	= 87,

   589   pages		= {209-220}}

   591 @Book{milner89,

   592   author	= {Robin Milner},

   593   title		= {Communication and Concurrency},

   594   publisher	= Prentice,

   595   year		= 1989}

   597 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",

   598 title="The Definition of Standard ML",publisher=MIT,year=1990}

   600 @PhdThesis{monahan84,

   601   author	= {Brian Q. Monahan},

   602   title		= {Data Type Proofs using Edinburgh {LCF}},

   603   school	= {University of Edinburgh},

   604   year		= 1984}

   606 @article{MuellerNvOS99,

   607 author=

   608 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},

   609 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}

   611 @Manual{Muzalewski:Mizar,

   612   title = 	 {An Outline of {PC} {Mizar}},

   613   author =	 {Micha{\l} Muzalewski},

   614   organization = {Fondation of Logic, Mathematics and Informatics

   615                   --- Mizar Users Group},

   616   year =	 1993,

   617   note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}

   618 }

   620 %N

   622 @InProceedings{NaraschewskiW-TPHOLs98,

   623   author	= {Wolfgang Naraschewski and Markus Wenzel},

   624   title		=

   625 {Object-Oriented Verification based on Record Subtyping in

   626                   Higher-Order Logic},

   627   crossref      = {tphols98}}

   629 @inproceedings{nazareth-nipkow,

   630   author	= {Dieter Nazareth and Tobias Nipkow},

   631   title		= {Formal Verification of Algorithm {W}: The Monomorphic Case},

   632   crossref	= {tphols96},

   633   pages		= {331-345},

   634   year		= 1996}

   636 @Article{needham-schroeder,

   637   author =       "Roger M. Needham and Michael D. Schroeder",

   638   title =        "Using Encryption for Authentication in Large Networks

   639                  of Computers",

   640   journal =      cacm,

   641   volume =       21,

   642   number =       12,

   643   pages =        "993-999",

   644   month =        dec,

   645   year =         1978}

   647 @inproceedings{nipkow-W,

   648   author	= {Wolfgang Naraschewski and Tobias Nipkow},

   649   title		= {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},

   650   booktitle	= {Types for Proofs and Programs: Intl. Workshop TYPES '96},

   651   editor	= {E. Gim{\'e}nez and C. Paulin-Mohring},

   652   publisher	= Springer,

   653   series	= LNCS,

   654   volume	= 1512,

   655   pages		= {317-332},

   656   year		= 1998}

   658 @InCollection{nipkow-sorts93,

   659   author = 	 {T. Nipkow},

   660   title = 	 {Order-Sorted Polymorphism in {Isabelle}},

   661   booktitle = 	 {Logical Environments},

   662   publisher =	 CUP,

   663   year =	 1993,

   664   editor =	 {G. Huet and G. Plotkin},

   665   pages =	 {164--188}

   666 }

   668 @Misc{nipkow-types93,

   669   author =	 {Tobias Nipkow},

   670   title =	 {Axiomatic Type Classes (in {I}sabelle)},

   671   howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},

   672   year =	 1993

   673 }

   675 @inproceedings{Nipkow-CR,

   676   author	= {Tobias Nipkow},

   677   title		= {More {Church-Rosser} Proofs (in {Isabelle/HOL})},

   678   booktitle	= {Automated Deduction --- CADE-13},

   679   editor	= {M. McRobbie and J.K. Slaney},

   680   publisher	= Springer,

   681   series	= LNCS,

   682   volume	= 1104,

   683   pages		= {733-747},

   684   year		= 1996}

   686 % WAS Nipkow-LICS-93

   687 @InProceedings{nipkow-patterns,

   688   title		= {Functional Unification of Higher-Order Patterns},

   689   author	= {Tobias Nipkow},

   690   pages		= {64-74},

   691   crossref	= {lics8},

   692   url		= {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},

   693   keywords	= {unification}}

   695 @article{nipkow-IMP,

   696   author	= {Tobias Nipkow},

   697   title		= {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},

   698   journal	= FAC,

   699   volume	= 10,

   700   pages		= {171-186},

   701   year		= 1998}

   703 @manual{isabelle-HOL,

   704   author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},

   705   title		= {{Isabelle}'s Logics: {HOL}},

   706   institution	= {Institut f{\"u}r Informatik, Technische Universi{\"a}t

   707                   M{\"u}nchen and Computer Laboratory, University of Cambridge},

   708   note          = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}

   710 @article{nipkow-prehofer,

   711   author	= {Tobias Nipkow and Christian Prehofer},

   712   title		= {Type Reconstruction for Type Classes},

   713   journal	= JFP,

   714   volume	= 5,

   715   number	= 2,

   716   year		= 1995,

   717   pages		= {201-224}}

   719 @Article{noel,

   720   author	= {Philippe No{\"e}l},

   721   title		= {Experimenting with {Isabelle} in {ZF} Set Theory},

   722   journal	= JAR,

   723   volume	= 10,

   724   number	= 1,

   725   pages		= {15-58},

   726   year		= 1993}

   728 @book{nordstrom90,

   729   author	= {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},

   730   title		= {Programming in {Martin-L{\"o}f}'s Type Theory.  An

   731 		 Introduction},

   732   publisher	= {Oxford University Press},

   733   year		= 1990}

   735 %O

   737 @Manual{pvs-language,

   738   title		= {The {PVS} specification language},

   739   author	= {S. Owre and N. Shankar and J. M. Rushby},

   740   organization	= {Computer Science Laboratory, SRI International},

   741   address	= {Menlo Park, CA},

   742   note          = {Beta release},

   743   year		= 1993,

   744   month		= apr,

   745   url		= {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}

   747 %P

   749 % replaces paulin92

   750 @InProceedings{paulin-tlca,

   751   author	= {Christine Paulin-Mohring},

   752   title		= {Inductive Definitions in the System {Coq}: Rules and

   753 		 Properties},

   754   crossref	= {tlca93},

   755   pages		= {328-345}}

   757 @InProceedings{paulson-CADE,

   758   author	= {Lawrence C. Paulson},

   759   title		= {A Fixedpoint Approach to Implementing (Co)Inductive

   760 		  Definitions},

   761   pages		= {148-161},

   762   crossref	= {cade12}}

   764 @InProceedings{paulson-COLOG,

   765   author	= {Lawrence C. Paulson},

   766   title		= {A Formulation of the Simple Theory of Types (for

   767 		 {Isabelle})},

   768   pages		= {246-274},

   769   crossref	= {colog88},

   770   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}

   772 @Article{paulson-coind,

   773   author	= {Lawrence C. Paulson},

   774   title		= {Mechanizing Coinduction and Corecursion in Higher-Order

   775 		  Logic},

   776   journal	= JLC,

   777   year		= 1997,

   778   volume	= 7,

   779   number	= 2,

   780   month		= mar,

   781   pages		= {175-204}}

   783 @manual{isabelle-ref,

   784   author	= {Lawrence C. Paulson},

   785   title		= {The {Isabelle} Reference Manual},

   786   institution	= CUCL,

   787   note          = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}

   789 @manual{isabelle-ZF,

   790   author	= {Lawrence C. Paulson},

   791   title		= {{Isabelle}'s Logics: {FOL} and {ZF}},

   792   institution	= CUCL,

   793   note          = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}

   795 @article{paulson-found,

   796   author	= {Lawrence C. Paulson},

   797   title		= {The Foundation of a Generic Theorem Prover},

   798   journal	= JAR,

   799   volume	= 5,

   800   number	= 3,

   801   pages		= {363-397},

   802   year		= 1989,

   803   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}

   805 %replaces paulson-final

   806 @Article{paulson-mscs,

   807   author	= {Lawrence C. Paulson},

   808   title = 	 {Final Coalgebras as Greatest Fixed Points

   809                   in {ZF} Set Theory},

   810   journal	= {Mathematical Structures in Computer Science},

   811   year		= 1999,

   812   volume	= 9,

   813   note		= {in press}}

   815 @InCollection{paulson-generic,

   816   author	= {Lawrence C. Paulson},

   817   title		= {Generic Automatic Proof Tools},

   818   crossref	= {wos-fest},

   819   chapter	= 3}

   821 @Article{paulson-gr,

   822   author	= {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},

   823   title		= {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of

   824 		  Choice},

   825   journal	= JAR,

   826   year		= 1996,

   827   volume	= 17,

   828   number	= 3,

   829   month		= dec,

   830   pages		= {291-323}}

   832 @InCollection{paulson-handbook,

   833   author	= {Lawrence C. Paulson},

   834   title		= {Designing a Theorem Prover},

   835   crossref	= {handbk-lics2},

   836   pages		= {415-475}}

   838 @Book{paulson-isa-book,

   839   author	= {Lawrence C. Paulson},

   840   title		= {Isabelle: A Generic Theorem Prover},

   841   publisher	= {Springer},

   842   year		= 1994,

   843   note		= {LNCS 828}}

   845 @InCollection{paulson-markt,

   846   author	= {Lawrence C. Paulson},

   847   title		= {Tool Support for Logics of Programs},

   848   booktitle	= {Mathematical Methods in Program Development:

   849                   Summer School Marktoberdorf 1996},

   850   publisher	= {Springer},

   851   pages		= {461-498},

   852   year		= {Published 1997},

   853   editor	= {Manfred Broy},

   854   series	= {NATO ASI Series F}}

   856 %replaces Paulson-ML and paulson91

   857 @book{paulson-ml2,

   858   author	= {Lawrence C. Paulson},

   859   title		= {{ML} for the Working Programmer},

   860   year		= 1996,

   861   edition	= {2nd},

   862   publisher	= CUP}

   864 @article{paulson-natural,

   865   author	= {Lawrence C. Paulson},

   866   title		= {Natural Deduction as Higher-order Resolution},

   867   journal	= JLP,

   868   volume	= 3,

   869   pages		= {237-258},

   870   year		= 1986,

   871   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}

   873 @Article{paulson-set-I,

   874   author	= {Lawrence C. Paulson},

   875   title		= {Set Theory for Verification: {I}.  {From}

   876 		 Foundations to Functions},

   877   journal	= JAR,

   878   volume	= 11,

   879   number	= 3,

   880   pages		= {353-389},

   881   year		= 1993,

   882   url		= {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}

   884 @Article{paulson-set-II,

   885   author	= {Lawrence C. Paulson},

   886   title		= {Set Theory for Verification: {II}.  {Induction} and

   887 		 Recursion},

   888   journal	= JAR,

   889   volume	= 15,

   890   number	= 2,

   891   pages		= {167-215},

   892   year		= 1995,

   893   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}

   895 @article{paulson85,

   896   author	= {Lawrence C. Paulson},

   897   title		= {Verifying the Unification Algorithm in {LCF}},

   898   journal	= SCP,

   899   volume	= 5,

   900   pages		= {143-170},

   901   year		= 1985}

   903 %replaces Paulson-LCF

   904 @book{paulson87,

   905   author	= {Lawrence C. Paulson},

   906   title		= {Logic and Computation: Interactive proof with Cambridge

   907 		 LCF},

   908   year		= 1987,

   909   publisher	= CUP}

   911 @incollection{paulson700,

   912   author	= {Lawrence C. Paulson},

   913   title		= {{Isabelle}: The Next 700 Theorem Provers},

   914   crossref	= {odifreddi90},

   915   pages		= {361-386},

   916   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}

   918 % replaces paulson-ns and paulson-security

   919 @Article{paulson-jcs,

   920   author	= {Lawrence C. Paulson},

   921   title		= {The Inductive Approach to Verifying Cryptographic Protocols},

   922   journal	= JCS,

   923   year		= 1998,

   924   volume	= 6,

   925   pages		= {85-128}}

   927 @Article{paulson-tls,

   928   author = 	 {Lawrence C. Paulson},

   929   title = 	 {Inductive Analysis of the {Internet} Protocol {TLS}},

   930   journal = 	 TISSEC,

   931   month =        aug,

   932   year = 	 1999,

   933   volume	= 2,

   934   number        = 3,

   935   pages		= {332-351}}

   937 @Article{paulson-yahalom,

   938   author = 	 {Lawrence C. Paulson},

   939   title = 	 {Relations Between Secrets:

   940                   Two Formal Analyses of the {Yahalom} Protocol},

   941   journal = 	 JCS,

   942   note =	 {in press}}

   944 @article{pelletier86,

   945   author	= {F. J. Pelletier},

   946   title		= {Seventy-five Problems for Testing Automatic Theorem

   947 		 Provers},

   948   journal	= JAR,

   949   volume	= 2,

   950   pages		= {191-216},

   951   year		= 1986,

   952   note		= {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}

   954 @Article{pitts94,

   955   author	= {Andrew M. Pitts},

   956   title		= {A Co-induction Principle for Recursively Defined Domains},

   957   journal	= TCS,

   958   volume	= 124,

   959   pages		= {195-219},

   960   year		= 1994}

   962 @Article{plaisted90,

   963   author	= {David A. Plaisted},

   964   title		= {A Sequent-Style Model Elimination Strategy and a Positive

   965 		 Refinement},

   966   journal	= JAR,

   967   year		= 1990,

   968   volume	= 6,

   969   number	= 4,

   970   pages		= {389-402}}

   972 %Q

   974 @Article{quaife92,

   975   author	= {Art Quaife},

   976   title		= {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set

   977 		 Theory},

   978   journal	= JAR,

   979   year		= 1992,

   980   volume	= 8,

   981   number	= 1,

   982   pages		= {91-147}}

   984 %R

   986 @TechReport{rasmussen95,

   987   author	= {Ole Rasmussen},

   988   title		= {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting

   989 		  Experiment},

   990   institution	= {Computer Laboratory, University of Cambridge},

   991   year		= 1995,

   992   number	= 364,

   993   month		= may,

   994   url		= {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}

   996 @Book{reeves90,

   997   author	= {Steve Reeves and Michael Clarke},

   998   title		= {Logic for Computer Science},

   999   publisher	= {Addison-Wesley},

  1000   year		= 1990}

  1002 @book{Rosen-DMA,author={Kenneth H. Rosen},

  1003 title={Discrete Mathematics and Its Applications},

  1004 publisher={McGraw-Hill},year=1998}

  1006 @InProceedings{Rudnicki:1992:MizarOverview,

  1007   author = 	 {P. Rudnicki},

  1008   title = 	 {An Overview of the {MIZAR} Project},

  1009   booktitle = 	 {1992 Workshop on Types for Proofs and Programs},

  1010   year =	 1992,

  1011   organization = {Chalmers University of Technology},

  1012   publisher =	 {Bastad}

  1013 }

  1015 %S

  1017 @inproceedings{saaltink-fme,

  1018   author	= {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and

  1019 		 Dan Craigen and Irwin Meisels},

  1020   title		= {An {EVES} Data Abstraction Example},

  1021   pages		= {578-596},

  1022   crossref	= {fme93}}

  1024 @inproceedings{slind-tfl,

  1025   author	= {Konrad Slind},

  1026   title		= {Function Definition in Higher Order Logic},

  1027   booktitle	= {Theorem Proving in Higher Order Logics},

  1028   editor	= {J. von Wright and J. Grundy and J. Harrison},

  1029   publisher	= Springer,

  1030   series	= LNCS,

  1031   volume	= 1125,

  1032   pages		= {381-397},

  1033   year		= 1996}

  1035 @book{suppes72,

  1036   author	= {Patrick Suppes},

  1037   title		= {Axiomatic Set Theory},

  1038   year		= 1972,

  1039   publisher	= {Dover}}

  1041 @InCollection{szasz93,

  1042   author	= {Nora Szasz},

  1043   title		= {A Machine Checked Proof that {Ackermann's} Function is not

  1044 		  Primitive Recursive},

  1045   crossref	= {huet-plotkin93},

  1046   pages		= {317-338}}

  1048 @TechReport{Syme:1997:DECLARE,

  1049   author = 	 {D. Syme},

  1050   title = 	 {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},

  1051   institution =  {University of Cambridge Computer Laboratory},

  1052   year = 	 1997,

  1053   number =	 416

  1054 }

  1056 @PhdThesis{Syme:1998:thesis,

  1057   author = 	 {D. Syme},

  1058   title = 	 {Declarative Theorem Proving for Operational Semantics},

  1059   school = 	 {University of Cambridge},

  1060   year = 	 1998,

  1061   note =	 {Submitted}

  1062 }

  1064 @InProceedings{Syme:1999:TPHOL,

  1065   author = 	 {D. Syme},

  1066   title = 	 {Three Tactic Theorem Proving},

  1067   crossref =     {tphols99}}

  1069 %T

  1071 @book{takeuti87,

  1072   author	= {G. Takeuti},

  1073   title		= {Proof Theory},

  1074   year		= 1987,

  1075   publisher	= NH,

  1076   edition	= {2nd}}

  1078 @Book{thompson91,

  1079   author	= {Simon Thompson},

  1080   title		= {Type Theory and Functional Programming},

  1081   publisher	= {Addison-Wesley},

  1082   year		= 1991}

  1084 @book{Thompson-Haskell,author={Simon Thompson},

  1085 title={Haskell: The Craft of Functional Programming},

  1086 publisher={Addison-Wesley},year=1999}

  1088 @Unpublished{Trybulec:1993:MizarFeatures,

  1089   author = 	 {A. Trybulec},

  1090   title = 	 {Some Features of the {Mizar} Language},

  1091   note = 	 {Presented at a workshop in Turin, Italy},

  1092   year =	 1993

  1093 }

  1095 %V

  1097 @Unpublished{voelker94,

  1098   author	= {Norbert V{\"o}lker},

  1099   title		= {The Verification of a Timer Program using {Isabelle/HOL}},

  1100   url		= {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},

  1101   year		= 1994,

  1102   month		= aug}

  1104 %W

  1106 @Misc{x-symbol,

  1107   author =	 {Christoph Wedler},

  1108   title =	 {Emacs package ``{X-Symbol}''},

  1109   note =	 {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}

  1110 }

  1112 @manual{isabelle-sys,

  1113   author	= {Markus Wenzel and Stefan Berghofer},

  1114   title		= {The {Isabelle} System Manual},

  1115   institution	= {TU Munich},

  1116   note          = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}

  1118 @manual{isabelle-isar-ref,

  1119   author	= {Markus Wenzel},

  1120   title		= {The {Isabelle/Isar} Reference Manual},

  1121   institution	= {TU Munich},

  1122   note          = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}

  1124 @manual{isabelle-axclass,

  1125   author	= {Markus Wenzel},

  1126   title		= {Using Axiomatic Type Classes in {I}sabelle},

  1127   institution	= {TU Munich},

  1128   year          = 2000,

  1129   note          = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}

  1132 @InProceedings{Wenzel:1999:TPHOL,

  1133   author = 	 {Markus Wenzel},

  1134   title = 	 {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},

  1135   crossref =     {tphols99}}

  1137 @InProceedings{Wenzel:1997:TPHOL,

  1138   author = 	 {Markus Wenzel},

  1139   title = 	 {Type Classes and Overloading in Higher-Order Logic},

  1140   crossref =     {tphols97}}

  1142 @phdthesis{Wenzel-PhD,author={Markus Wenzel},title={Isabelle/Isar ---

  1143 a versatile environment for human-readable formal proof documents},

  1144 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},year=2002}

  1147 @book{principia,

  1148   author	= {A. N. Whitehead and B. Russell},

  1149   title		= {Principia Mathematica},

  1150   year		= 1962,

  1151   publisher	= CUP,

  1152   note		= {Paperback edition to *56,

  1153   abridged from the 2nd edition (1927)}}

  1155 @Misc{Wiedijk:1999:Mizar,

  1156   author =	 {Freek Wiedijk},

  1157   title =	 {Mizar: An Impression},

  1158   howpublished = {Unpublished paper},

  1159   year =         1999,

  1160   note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}

  1161 }

  1163 @Misc{Wiedijk:2000:MV,

  1164   author =	 {Freek Wiedijk},

  1165   title =	 {The Mathematical Vernacular},

  1166   howpublished = {Unpublished paper},

  1167   year =         2000,

  1168   note =	 {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}

  1169 }

  1171 @book{winskel93,

  1172   author	= {Glynn Winskel},

  1173   title		= {The Formal Semantics of Programming Languages},

  1174   publisher	= MIT,year=1993}

  1176 @InCollection{wos-bledsoe,

  1177   author	= {Larry Wos},

  1178   title		= {Automated Reasoning and {Bledsoe's} Dream for the Field},

  1179   crossref	= {bledsoe-fest},

  1180   pages		= {297-342}}

  1182 @InProceedings{Zammit:1999:TPHOL,

  1183   author = 	 {Vincent Zammit},

  1184   title = 	 {On the Implementation of an Extensible Declarative Proof Language},

  1185   crossref =     {tphols99}}

  1187 %Z

  1190 % CROSS REFERENCES

  1192 @book{handbk-lics2,

  1193   editor	= {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},

  1194   title		= {Handbook of Logic in Computer Science},

  1195   booktitle	= {Handbook of Logic in Computer Science},

  1196   publisher	= {Oxford University Press},

  1197   year		= 1992,

  1198   volume	= 2}

  1200 @book{types93,

  1201   editor	= {Henk Barendregt and Tobias Nipkow},

  1202   title		= TYPES # {: International Workshop {TYPES '93}},

  1203   booktitle	= TYPES # {: International Workshop {TYPES '93}},

  1204   year		= {published 1994},

  1205   publisher	= {Springer},

  1206   series	= {LNCS 806}}

  1208 @book{barwise-handbk,

  1209   editor	= {J. Barwise},

  1210   title		= {Handbook of Mathematical Logic},

  1211   booktitle	= {Handbook of Mathematical Logic},

  1212   year		= 1977,

  1213   publisher	= NH}

  1215 @Proceedings{tlca93,

  1216   title		= {Typed Lambda Calculi and Applications},

  1217   booktitle	= {Typed Lambda Calculi and Applications},

  1218   editor	= {M. Bezem and J.F. Groote},

  1219   year		= 1993,

  1220   publisher	= {Springer},

  1221   series	= {LNCS 664}}

  1223 @book{birtwistle89,

  1224   editor	= {Graham Birtwistle and P. A. Subrahmanyam},

  1225   title		= {Current Trends in Hardware Verification and Automated

  1226 		 Theorem Proving},

  1227   booktitle	= {Current Trends in Hardware Verification and Automated

  1228 		 Theorem Proving},

  1229   publisher	= {Springer},

  1230   year		= 1989}

  1232 @book{bledsoe-fest,

  1233   title		= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},

  1234   booktitle	= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},

  1235   publisher	= {Kluwer Academic Publishers},

  1236   year		= 1991,

  1237   editor	= {Robert S. Boyer}}

  1239 @Proceedings{cade12,

  1240   editor	= {Alan Bundy},

  1241   title		= {Automated Deduction --- {CADE}-12

  1242 		  International Conference},

  1243   booktitle	= {Automated Deduction --- {CADE}-12

  1244 		  International Conference},

  1245   year		= 1994,

  1246   series	= {LNAI 814},

  1247   publisher	= {Springer}}

  1249 @book{types94,

  1250   editor	= {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},

  1251   title		= TYPES # {: International Workshop {TYPES '94}},

  1252   booktitle	= TYPES # {: International Workshop {TYPES '94}},

  1253   year		= 1995,

  1254   publisher	= {Springer},

  1255   series	= {LNCS 996}}

  1257 @book{huet-plotkin91,

  1258   editor	= {{G{\'e}rard} Huet and Gordon Plotkin},

  1259   title		= {Logical Frameworks},

  1260   booktitle	= {Logical Frameworks},

  1261   publisher	= CUP,

  1262   year		= 1991}

  1264 @book{huet-plotkin93,

  1265   editor	= {{G{\'e}rard} Huet and Gordon Plotkin},

  1266   title		= {Logical Environments},

  1267   booktitle	= {Logical Environments},

  1268   publisher	= CUP,

  1269   year		= 1993}

  1271 @Proceedings{hug93,

  1272   editor	= {J. Joyce and C. Seger},

  1273   title		= {Higher Order Logic Theorem Proving and Its

  1274 		  Applications: HUG '93},

  1275   booktitle	= {Higher Order Logic Theorem Proving and Its

  1276 		  Applications: HUG '93},

  1277   year		= {Published 1994},

  1278   publisher	= {Springer},

  1279   series	= {LNCS 780}}

  1281 @proceedings{colog88,

  1282   editor	= {P. Martin-L{\"o}f and G. Mints},

  1283   title		= {COLOG-88: International Conference on Computer Logic},

  1284   booktitle	= {COLOG-88: International Conference on Computer Logic},

  1285   year		= {Published 1990},

  1286   publisher	= {Springer},

  1287   organization	= {Estonian Academy of Sciences},

  1288   address	= {Tallinn},

  1289   series	= {LNCS 417}}

  1291 @book{odifreddi90,

  1292   editor	= {P. Odifreddi},

  1293   title		= {Logic and Computer Science},

  1294   booktitle	= {Logic and Computer Science},

  1295   publisher	= {Academic Press},

  1296   year		= 1990}

  1298 @proceedings{extensions91,

  1299   editor	= {Peter Schroeder-Heister},

  1300   title		= {Extensions of Logic Programming},

  1301   booktitle	= {Extensions of Logic Programming},

  1302   year		= 1991,

  1303   series	= {LNAI 475},

  1304   publisher	= {Springer}}

  1306 @proceedings{cade10,

  1307   editor	= {Mark E. Stickel},

  1308   title		= {10th } # CADE,

  1309   booktitle	= {10th } # CADE,

  1310   year		= 1990,

  1311   publisher	= {Springer},

  1312   series	= {LNAI 449}}

  1314 @Proceedings{lics8,

  1315   editor	= {M. Vardi},

  1316   title		= {Eighth Annual Symposium on Logic in Computer Science},

  1317   booktitle	= {Eighth Annual Symposium on Logic in Computer Science},

  1318   publisher	= IEEE,

  1319   year		= 1993}

  1321 @book{wos-fest,

  1322   title		= {Automated Reasoning and its Applications:

  1323 			Essays in Honor of {Larry Wos}},

  1324   booktitle	= {Automated Reasoning and its Applications:

  1325 			Essays in Honor of {Larry Wos}},

  1326   publisher	= {MIT Press},

  1327   year		= 1997,

  1328   editor	= {Robert Veroff}}

  1330 @proceedings{fme93,

  1331   editor	= {J. C. P. Woodcock and P. G. Larsen},

  1332   title		= {FME '93: Industrial-Strength Formal Methods},

  1333   booktitle	= {FME '93: Industrial-Strength Formal Methods},

  1334   year		= 1993,

  1335   publisher	= {Springer},

  1336   series	= {LNCS 670}}

  1338 @Proceedings{tphols96,

  1339   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},

  1340   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},

  1341   editor	= {J. von Wright and J. Grundy and J. Harrison},

  1342   series	= {LNCS 1125},

  1343   year		= 1996}

  1345 @Proceedings{tphols97,

  1346   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},

  1347   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},

  1348   editor	= {Elsa L. Gunter and Amy Felty},

  1349   series	= {LNCS 1275},

  1350   year		= 1997}

  1352 @Proceedings{tphols98,

  1353   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},

  1354   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},

  1355   editor	= {Jim Grundy and Malcom Newey},

  1356   series	= {LNCS 1479},

  1357   year		= 1998}

  1359 @Proceedings{tphols99,

  1360   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},

  1361   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},

  1362   editor	= {Bertot, Y. and Dowek, G. and Hirschowitz, A. and

  1363                   Paulin, C. and Thery, L.},

  1364   series	= {LNCS 1690},

  1365   year		= 1999}

  1367 @PROCEEDINGS{tphols2000,

  1368   editor          = "J. Harrison and M. Aagaard",

  1369   booktitle       = "Theorem Proving in Higher Order Logics:

  1370                      13th International Conference, TPHOLs 2000",

  1371   series          = "Lecture Notes in Computer Science",

  1372   volume          = 1869,

  1373   year            = 2000,

  1374   publisher       = "Springer-Verlag"}

author	wenzelm
	Tue, 11 Dec 2001 16:00:26 +0100
changeset 12466	5f4182667032
parent 12331	d40cc6e7bfd8
child 12612	2a64142500f6
permissions	-rw-r--r--