wneuper/isa: doc-src/manual.bib@a8cb33f6cf9c

     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{SIGPLAN="{SIGPLAN} Notices"}

    32 %conferences

    33 @string{CADE="International Conference on Automated Deduction"}

    34 @string{POPL="Symposium on Principles of Programming Languages"}

    35 @string{TYPES="Types for Proofs and Programs"}

    38 %A

    40 @incollection{abramsky90,

    41   author	= {Samson Abramsky},

    42   title		= {The Lazy Lambda Calculus},

    43   pages		= {65-116},

    44   editor	= {David A. Turner},

    45   booktitle	= {Research Topics in Functional Programming},

    46   publisher	= {Addison-Wesley},

    47   year		= 1990}

    49 @Unpublished{abrial93,

    50   author	= {J. R. Abrial and G. Laffitte},

    51   title		= {Towards the Mechanization of the Proofs of some Classical

    52 		  Theorems of Set Theory},

    53   note		= {preprint},

    54   year		= 1993,

    55   month		= Feb}

    57 @incollection{aczel77,

    58   author	= {Peter Aczel},

    59   title		= {An Introduction to Inductive Definitions},

    60   pages		= {739-782},

    61   crossref	= {barwise-handbk}}

    63 @Book{aczel88,

    64   author	= {Peter Aczel},

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

    66   publisher	= {CSLI},

    67   year		= 1988}

    69 @InProceedings{alf,

    70   author	= {Lena Magnusson and Bengt {Nordstr\"{o}m}},

    71   title		= {The {ALF} Proof Editor and Its Proof Engine},

    72   crossref	= {types93},

    73   pages		= {213-237}}

    75 @book{andrews86,

    76   author	= "Peter Andrews",

    77   title		= "An Introduction to Mathematical Logic and Type Theory: to Truth

    78 through Proof",

    79   publisher	= AP,

    80   series	= "Computer Science and Applied Mathematics",

    81   year		= 1986}

    83 @InProceedings{Aspinall:2000:eProof,

    84   author = 	 {David Aspinall},

    85   title = 	 {Protocols for Interactive {e-Proof}},

    86   booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs)},

    87   year =	 2000,

    88   note =	 {Unpublished work-in-progress paper,

    89                   \url{http://www.proofgeneral.org/~da/drafts/eproof.ps.gz}}

    90 }

    91 @InProceedings{Aspinall:TACAS:2000,

    92   author = 	 {David Aspinall},

    93   title = 	 {{P}roof {G}eneral: A Generic Tool for Proof Development},

    94   booktitle = 	 {Tools and Algorithms for the Construction and Analysis of

    95                   Systems (TACAS)},

    96   year =	 2000,

    97   publisher	= Springer,

    98   series	= LNCS,

    99   volume	= 1785,

   100   pages = "38--42"

   101 }

   103 @Misc{isamode,

   104   author =	 {David Aspinall},

   105   title =	 {Isamode --- {U}sing {I}sabelle with {E}macs},

   106   note =	 {\url{http://www.proofgeneral.org/~da/Isamode/}}

   107 }

   109 @Misc{proofgeneral,

   110   author =	 {David Aspinall},

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

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

   113 }

   115 %B

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

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

   120 @incollection{basin91,

   121   author	= {David Basin and Matt Kaufmann},

   122   title		= {The {Boyer-Moore} Prover and {Nuprl}: An Experimental

   123 		   Comparison},

   124   crossref	= {huet-plotkin91},

   125   pages		= {89-119}}

   127 @InProceedings{Bauer-Wenzel:2000:HB,

   128   author = 	 {Gertrud Bauer and Markus Wenzel},

   129   title = 	 {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in

   130       {I}sabelle/{I}sar},

   131   booktitle = 	 {Types for Proofs and Programs: TYPES'99},

   132   editor =       {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m

   133                   and Jan Smith},

   134   series =	 {LNCS},

   135   year =	 2000

   136 }

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

   139   author = 	 {Stefan Berghofer and Markus Wenzel},

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

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

   142   crossref =     {tphols99}}

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

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

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

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

   149 publisher=PH,year=1998}

   151 @Article{boyer86,

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

   153 		   Overbeek and Mark Stickel and Lawrence Wos},

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

   155 		   Axioms},

   156   journal	= JAR,

   157   year		= 1986,

   158   volume	= 2,

   159   number	= 3,

   160   pages		= {287-327}}

   162 @book{bm79,

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

   164   title		= {A Computational Logic},

   165   publisher	= {Academic Press},

   166   year		= 1979}

   168 @book{bm88book,

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

   170   title		= {A Computational Logic Handbook},

   171   publisher	= {Academic Press},

   172   year		= 1988}

   174 @Article{debruijn72,

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

   176   title		= {Lambda Calculus Notation with Nameless Dummies,

   177 	a Tool for Automatic Formula Manipulation,

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

   179   journal	= {Indag. Math.},

   180   volume	= 34,

   181   pages		= {381-392},

   182   year		= 1972}

   184 %C

   186 @TechReport{camilleri92,

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

   188   title		= {Reasoning with Inductively Defined Relations in the

   189 		 {HOL} Theorem Prover},

   190   institution	= CUCL,

   191   year		= 1992,

   192   number	= 265,

   193   month		= Aug}

   195 @Book{charniak80,

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

   197   title		= {Artificial Intelligence Programming},

   198   publisher	= {Lawrence Erlbaum Associates},

   199   year		= 1980}

   201 @article{church40,

   202   author	= "Alonzo Church",

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

   204   journal	= JSL,

   205   year		= 1940,

   206   volume	= 5,

   207   pages		= "56-68"}

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

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

   212 @PhdThesis{coen92,

   213   author	= {Martin D. Coen},

   214   title		= {Interactive Program Derivation},

   215   school	= {University of Cambridge},

   216   note		= {Computer Laboratory Technical Report 272},

   217   month		= nov,

   218   year		= 1992}

   220 @book{constable86,

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

   222   title		= {Implementing Mathematics with the Nuprl Proof

   223 		 Development System},

   224   publisher	= Prentice,

   225   year		= 1986}

   227 %D

   229 @Book{davey-priestley,

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

   231   title		= {Introduction to Lattices and Order},

   232   publisher	= CUP,

   233   year		= 1990}

   235 @Book{devlin79,

   236   author	= {Keith J. Devlin},

   237   title		= {Fundamentals of Contemporary Set Theory},

   238   publisher	= {Springer},

   239   year		= 1979}

   241 @book{dummett,

   242   author	= {Michael Dummett},

   243   title		= {Elements of Intuitionism},

   244   year		= 1977,

   245   publisher	= {Oxford University Press}}

   247 @incollection{dybjer91,

   248   author	= {Peter Dybjer},

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

   250 		  Theory and Their Set-Theoretic Semantics},

   251   crossref	= {huet-plotkin91},

   252   pages		= {280-306}}

   254 @Article{dyckhoff,

   255   author	= {Roy Dyckhoff},

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

   257   journal	= JSL,

   258   year		= 1992,

   259   volume	= 57,

   260   number	= 3,

   261   pages		= {795-807}}

   263 %F

   265 @Article{IMPS,

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

   267 		 Thayer},

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

   269   journal	= JAR,

   270   volume	= 11,

   271   number	= 2,

   272   year		= 1993,

   273   pages		= {213-248}}

   275 @InProceedings{felty91a,

   276   Author	= {Amy Felty},

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

   278 		  Deduction Proofs},

   279   crossref	= {extensions91},

   280   pages		= {157-178}}

   282 @Article{fleuriot-jcm,

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

   284   title = 	 {Mechanizing Nonstandard Real Analysis},

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

   286   year = 	 2000,

   287   volume =	 3,

   288   pages =	 {140-190},

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

   290 }

   292 @TechReport{frost93,

   293   author	= {Jacob Frost},

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

   295   institution	= CUCL,

   296   number	= 308,

   297   year		= 1993,

   298   month		= Aug}

   300 %revised version of frost93

   301 @TechReport{frost95,

   302   author	= {Jacob Frost},

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

   304   institution	= CUCL,

   305   number	= 359,

   306   year		= 1995,

   307   month		= Feb}

   309 @inproceedings{OBJ,

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

   311 		 and J. Meseguer},

   312   title		= {Principles of {OBJ2}},

   313   booktitle	= POPL,

   314   year		= 1985,

   315   pages		= {52-66}}

   317 %G

   319 @book{gallier86,

   320   author	= {J. H. Gallier},

   321   title		= {Logic for Computer Science:

   322 		Foundations of Automatic Theorem Proving},

   323   year		= 1986,

   324   publisher	= {Harper \& Row}}

   326 @Book{galton90,

   327   author	= {Antony Galton},

   328   title		= {Logic for Information Technology},

   329   publisher	= {Wiley},

   330   year		= 1990}

   332 @InProceedings{gimenez-codifying,

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

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

   335   crossref	= {types94},

   336   pages		= {39-59}

   337 }

   339 @book{girard89,

   340   author	= {Jean-Yves Girard},

   341   title		= {Proofs and Types},

   342   year		= 1989,

   343   publisher	= CUP,

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

   346 @Book{mgordon-hol,

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

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

   349 		 Higher Order Logic},

   350   publisher	= CUP,

   351   year		= 1993}

   353 @book{mgordon79,

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

   355 		 Wadsworth},

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

   357   year		= 1979,

   358   publisher	= {Springer},

   359   series	= {LNCS 78}}

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

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

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

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

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

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

   368 @InProceedings{gunter-trees,

   369   author	= {Elsa L. Gunter},

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

   371 		  {HOL}},

   372   crossref	= {hug93},

   373   pages		= {141-154}}

   375 %H

   377 @Book{halmos60,

   378   author	= {Paul R. Halmos},

   379   title		= {Naive Set Theory},

   380   publisher	= {Van Nostrand},

   381   year		= 1960}

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

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

   386 @Book{hennessy90,

   387   author	= {Matthew Hennessy},

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

   389 		  Introduction Using Structural Operational Semantics},

   390   publisher	= {Wiley},

   391   year		= 1990}

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

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

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

   397 @Article{haskell-report,

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

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

   400 		 Non-strict, Purely Functional Language},

   401   journal	= SIGPLAN,

   402   year		= 1992,

   403   volume	= 27,

   404   number	= 5,

   405   month		= May,

   406   note		= {Version 1.2}}

   408 @Article{haskell-tutorial,

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

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

   411   journal	= SIGPLAN,

   412   year		= 1992,

   413   volume	= 27,

   414   number	= 5,

   415   month		= May}

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

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

   420 @article{huet75,

   421   author	= {G. P. Huet},

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

   423   journal	= TCS,

   424   volume	= 1,

   425   year		= 1975,

   426   pages		= {27-57}}

   428 @article{huet78,

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

   430   title		= {Proving and Applying Program Transformations Expressed with

   431 			Second-Order Patterns},

   432   journal	= acta,

   433   volume	= 11,

   434   year		= 1978,

   435   pages		= {31-55}}

   437 @inproceedings{huet88,

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

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

   440 		 Constructions}},

   441   booktitle	= {Programming of Future Generation Computers},

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

   443   year		= 1988,

   444   pages		= {205-216},

   445   publisher	= {Elsevier}}

   447 @Book{Huth-Ryan-book,

   448   author	= {Michael Huth and Mark Ryan},

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

   450   publisher	= CUP,

   451   year		= 2000}

   453 @InProceedings{Harrison:1996:MizarHOL,

   454   author = 	 {J. Harrison},

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

   456   pages =	 {203--220},

   457   crossref =     {tphols96}}

   459 %K

   461 @InProceedings{kammueller-locales,

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

   463                   Lawrence C. Paulson},

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

   465   crossref =	 {tphols99}}

   467 @book{Knuth3-75,

   468   author={Donald E. Knuth},

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

   470   publisher={Addison-Wesley},

   471   year=1975}

   473 @Article{korf85,

   474   author	= {R. E. Korf},

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

   476 		 Tree Search},

   477   journal	= AI,

   478   year		= 1985,

   479   volume	= 27,

   480   pages		= {97-109}}

   482 @Book{kunen80,

   483   author	= {Kenneth Kunen},

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

   485   publisher	= NH,

   486   year		= 1980}

   488 %M

   490 @Article{mw81,

   491   author	= {Zohar Manna and Richard Waldinger},

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

   493   journal	= SCP,

   494   year		= 1981,

   495   volume	= 1,

   496   number	= 1,

   497   pages		= {5-48}}

   499 @InProceedings{martin-nipkow,

   500   author	= {Ursula Martin and Tobias Nipkow},

   501   title		= {Ordered Rewriting and Confluence},

   502   crossref	= {cade10},

   503   pages		= {366-380}}

   505 @book{martinlof84,

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

   507   title		= {Intuitionistic type theory},

   508   year		= 1984,

   509   publisher	= {Bibliopolis}}

   511 @incollection{melham89,

   512   author	= {Thomas F. Melham},

   513   title		= {Automating Recursive Type Definitions in Higher Order

   514 		 Logic},

   515   pages		= {341-386},

   516   crossref	= {birtwistle89}}

   518 @Article{miller-mixed,

   519   Author	= {Dale Miller},

   520   Title		= {Unification Under a Mixed Prefix},

   521   journal	= JSC,

   522   volume	= 14,

   523   number	= 4,

   524   pages		= {321-358},

   525   Year		= 1992}

   527 @Article{milner78,

   528   author	= {Robin Milner},

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

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

   531   year		= 1978,

   532   volume	= 17,

   533   pages		= {348-375}}

   535 @TechReport{milner-ind,

   536   author	= {Robin Milner},

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

   538   institution	= Edinburgh,

   539   year		= 1980,

   540   type		= {note}}

   542 @Article{milner-coind,

   543   author	= {Robin Milner and Mads Tofte},

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

   545   journal	= TCS,

   546   year		= 1991,

   547   volume	= 87,

   548   pages		= {209-220}}

   550 @Book{milner89,

   551   author	= {Robin Milner},

   552   title		= {Communication and Concurrency},

   553   publisher	= Prentice,

   554   year		= 1989}

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

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

   559 @PhdThesis{monahan84,

   560   author	= {Brian Q. Monahan},

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

   562   school	= {University of Edinburgh},

   563   year		= 1984}

   565 @article{MuellerNvOS99,

   566 author=

   567 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oskar Slotosch},

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

   570 @Manual{Muzalewski:Mizar,

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

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

   573   organization = {Fondation of Logic, Mathematics and Informatics

   574                   --- Mizar Users Group},

   575   year =	 1993,

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

   577 }

   579 %N

   581 @InProceedings{NaraschewskiW-TPHOLs98,

   582   author	= {Wolfgang Naraschewski and Markus Wenzel},

   583   title		=

   584 {Object-Oriented Verification based on Record Subtyping in

   585                   Higher-Order Logic},

   586   crossref      = {tphols98}}

   588 @inproceedings{nazareth-nipkow,

   589   author	= {Dieter Nazareth and Tobias Nipkow},

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

   591   crossref	= {tphols96},

   592   pages		= {331-345},

   593   year		= 1996}

   595 @inproceedings{nipkow-W,

   596   author	= {Wolfgang Naraschewski and Tobias Nipkow},

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

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

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

   600   publisher	= Springer,

   601   series	= LNCS,

   602   volume	= 1512,

   603   pages		= {317-332},

   604   year		= 1998}

   606 @InCollection{nipkow-sorts93,

   607   author = 	 {T. Nipkow},

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

   609   booktitle = 	 {Logical Environments},

   610   publisher =	 CUP,

   611   year =	 1993,

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

   613   pages =	 {164--188}

   614 }

   616 @Misc{nipkow-types93,

   617   author =	 {Tobias Nipkow},

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

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

   620   year =	 1993

   621 }

   623 @inproceedings{Nipkow-CR,

   624   author	= {Tobias Nipkow},

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

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

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

   628   publisher	= Springer,

   629   series	= LNCS,

   630   volume	= 1104,

   631   pages		= {733-747},

   632   year		= 1996}

   634 % WAS Nipkow-LICS-93

   635 @InProceedings{nipkow-patterns,

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

   637   author	= {Tobias Nipkow},

   638   pages		= {64-74},

   639   crossref	= {lics8},

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

   641   keywords	= {unification}}

   643 @article{nipkow-IMP,

   644   author	= {Tobias Nipkow},

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

   646   journal	= FAC,

   647   volume	= 10,

   648   pages		= {171-186},

   649   year		= 1998}

   651 @manual{isabelle-HOL,

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

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

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

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

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

   658 @article{nipkow-prehofer,

   659   author	= {Tobias Nipkow and Christian Prehofer},

   660   title		= {Type Reconstruction for Type Classes},

   661   journal	= JFP,

   662   volume	= 5,

   663   number	= 2,

   664   year		= 1995,

   665   pages		= {201-224}}

   667 @Article{noel,

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

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

   670   journal	= JAR,

   671   volume	= 10,

   672   number	= 1,

   673   pages		= {15-58},

   674   year		= 1993}

   676 @book{nordstrom90,

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

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

   679 		 Introduction},

   680   publisher	= {Oxford University Press},

   681   year		= 1990}

   683 %O

   685 @Manual{pvs-language,

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

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

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

   689   address	= {Menlo Park, CA},

   690   note          = {Beta release},

   691   year		= 1993,

   692   month		= apr,

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

   695 %P

   697 % replaces paulin92

   698 @InProceedings{paulin-tlca,

   699   author	= {Christine Paulin-Mohring},

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

   701 		 Properties},

   702   crossref	= {tlca93},

   703   pages		= {328-345}}

   705 @InProceedings{paulson-CADE,

   706   author	= {Lawrence C. Paulson},

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

   708 		  Definitions},

   709   pages		= {148-161},

   710   crossref	= {cade12}}

   712 @InProceedings{paulson-COLOG,

   713   author	= {Lawrence C. Paulson},

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

   715 		 {Isabelle})},

   716   pages		= {246-274},

   717   crossref	= {colog88},

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

   720 @Article{paulson-coind,

   721   author	= {Lawrence C. Paulson},

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

   723 		  Logic},

   724   journal	= JLC,

   725   year		= 1997,

   726   volume	= 7,

   727   number	= 2,

   728   month		= mar,

   729   pages		= {175-204}}

   731 @manual{isabelle-ref,

   732   author	= {Lawrence C. Paulson},

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

   734   institution	= CUCL,

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

   737 @manual{isabelle-ZF,

   738   author	= {Lawrence C. Paulson},

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

   740   institution	= CUCL,

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

   743 @article{paulson-found,

   744   author	= {Lawrence C. Paulson},

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

   746   journal	= JAR,

   747   volume	= 5,

   748   number	= 3,

   749   pages		= {363-397},

   750   year		= 1989,

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

   753 %replaces paulson-final

   754 @Article{paulson-mscs,

   755   author	= {Lawrence C. Paulson},

   756   title = 	 {Final Coalgebras as Greatest Fixed Points

   757                   in {ZF} Set Theory},

   758   journal	= {Mathematical Structures in Computer Science},

   759   year		= 1999,

   760   volume	= 9,

   761   note		= {in press}}

   763 @InCollection{paulson-generic,

   764   author	= {Lawrence C. Paulson},

   765   title		= {Generic Automatic Proof Tools},

   766   crossref	= {wos-fest},

   767   chapter	= 3}

   769 @Article{paulson-gr,

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

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

   772 		  Choice},

   773   journal	= JAR,

   774   year		= 1996,

   775   volume	= 17,

   776   number	= 3,

   777   month		= dec,

   778   pages		= {291-323}}

   780 @InCollection{paulson-handbook,

   781   author	= {Lawrence C. Paulson},

   782   title		= {Designing a Theorem Prover},

   783   crossref	= {handbk-lics2},

   784   pages		= {415-475}}

   786 @Book{paulson-isa-book,

   787   author	= {Lawrence C. Paulson},

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

   789   publisher	= {Springer},

   790   year		= 1994,

   791   note		= {LNCS 828}}

   793 @InCollection{paulson-markt,

   794   author	= {Lawrence C. Paulson},

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

   796   booktitle	= {Mathematical Methods in Program Development:

   797                   Summer School Marktoberdorf 1996},

   798   publisher	= {Springer},

   799   pages		= {461-498},

   800   year		= {Published 1997},

   801   editor	= {Manfred Broy},

   802   series	= {NATO ASI Series F}}

   804 %replaces Paulson-ML and paulson91

   805 @book{paulson-ml2,

   806   author	= {Lawrence C. Paulson},

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

   808   year		= 1996,

   809   edition	= {2nd},

   810   publisher	= CUP}

   812 @article{paulson-natural,

   813   author	= {Lawrence C. Paulson},

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

   815   journal	= JLP,

   816   volume	= 3,

   817   pages		= {237-258},

   818   year		= 1986,

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

   821 @Article{paulson-set-I,

   822   author	= {Lawrence C. Paulson},

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

   824 		 Foundations to Functions},

   825   journal	= JAR,

   826   volume	= 11,

   827   number	= 3,

   828   pages		= {353-389},

   829   year		= 1993,

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

   832 @Article{paulson-set-II,

   833   author	= {Lawrence C. Paulson},

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

   835 		 Recursion},

   836   journal	= JAR,

   837   volume	= 15,

   838   number	= 2,

   839   pages		= {167-215},

   840   year		= 1995,

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

   843 @article{paulson85,

   844   author	= {Lawrence C. Paulson},

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

   846   journal	= SCP,

   847   volume	= 5,

   848   pages		= {143-170},

   849   year		= 1985}

   851 %replqces Paulson-LCF

   852 @book{paulson87,

   853   author	= {Lawrence C. Paulson},

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

   855 		 LCF},

   856   year		= 1987,

   857   publisher	= CUP}

   859 @incollection{paulson700,

   860   author	= {Lawrence C. Paulson},

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

   862   crossref	= {odifreddi90},

   863   pages		= {361-386},

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

   866 % replaces paulson-ns and paulson-security

   867 @Article{paulson-jcs,

   868   author	= {Lawrence C. Paulson},

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

   870   journal	= JCS,

   871   year		= 1998,

   872   volume	= 6,

   873   pages		= {85-128}}

   875 @article{pelletier86,

   876   author	= {F. J. Pelletier},

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

   878 		 Provers},

   879   journal	= JAR,

   880   volume	= 2,

   881   pages		= {191-216},

   882   year		= 1986,

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

   885 @Article{pitts94,

   886   author	= {Andrew M. Pitts},

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

   888   journal	= TCS,

   889   volume	= 124,

   890   pages		= {195-219},

   891   year		= 1994}

   893 @Article{plaisted90,

   894   author	= {David A. Plaisted},

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

   896 		 Refinement},

   897   journal	= JAR,

   898   year		= 1990,

   899   volume	= 6,

   900   number	= 4,

   901   pages		= {389-402}}

   903 %Q

   905 @Article{quaife92,

   906   author	= {Art Quaife},

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

   908 		 Theory},

   909   journal	= JAR,

   910   year		= 1992,

   911   volume	= 8,

   912   number	= 1,

   913   pages		= {91-147}}

   915 %R

   917 @TechReport{rasmussen95,

   918   author	= {Ole Rasmussen},

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

   920 		  Experiment},

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

   922   year		= 1995,

   923   number	= 364,

   924   month		= may,

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

   927 @Book{reeves90,

   928   author	= {Steve Reeves and Michael Clarke},

   929   title		= {Logic for Computer Science},

   930   publisher	= {Addison-Wesley},

   931   year		= 1990}

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

   934 title={Discrete Mathematics and Its Applications},

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

   937 @InProceedings{Rudnicki:1992:MizarOverview,

   938   author = 	 {P. Rudnicki},

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

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

   941   year =	 1992,

   942   organization = {Chalmers University of Technology},

   943   publisher =	 {Bastad}

   944 }

   946 %S

   948 @inproceedings{saaltink-fme,

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

   950 		 Dan Craigen and Irwin Meisels},

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

   952   pages		= {578-596},

   953   crossref	= {fme93}}

   955 @inproceedings{slind-tfl,

   956   author	= {Konrad Slind},

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

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

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

   960   publisher	= Springer,

   961   series	= LNCS,

   962   volume	= 1125,

   963   pages		= {381-397},

   964   year		= 1996}

   966 @book{suppes72,

   967   author	= {Patrick Suppes},

   968   title		= {Axiomatic Set Theory},

   969   year		= 1972,

   970   publisher	= {Dover}}

   972 @InCollection{szasz93,

   973   author	= {Nora Szasz},

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

   975 		  Primitive Recursive},

   976   crossref	= {huet-plotkin93},

   977   pages		= {317-338}}

   979 @TechReport{Syme:1997:DECLARE,

   980   author = 	 {D. Syme},

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

   982   institution =  {University of Cambridge Computer Laboratory},

   983   year = 	 1997,

   984   number =	 416

   985 }

   987 @PhdThesis{Syme:1998:thesis,

   988   author = 	 {D. Syme},

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

   990   school = 	 {University of Cambridge},

   991   year = 	 1998,

   992   note =	 {Submitted}

   993 }

   995 @InProceedings{Syme:1999:TPHOL,

   996   author = 	 {D. Syme},

   997   title = 	 {Three Tactic Theorem Proving},

   998   crossref =     {tphols99}}

  1000 %T

  1002 @book{takeuti87,

  1003   author	= {G. Takeuti},

  1004   title		= {Proof Theory},

  1005   year		= 1987,

  1006   publisher	= NH,

  1007   edition	= {2nd}}

  1009 @Book{thompson91,

  1010   author	= {Simon Thompson},

  1011   title		= {Type Theory and Functional Programming},

  1012   publisher	= {Addison-Wesley},

  1013   year		= 1991}

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

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

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

  1019 @Unpublished{Trybulec:1993:MizarFeatures,

  1020   author = 	 {A. Trybulec},

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

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

  1023   year =	 1993

  1024 }

  1026 %V

  1028 @Unpublished{voelker94,

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

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

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

  1032   year		= 1994,

  1033   month		= aug}

  1035 %W

  1037 @Misc{x-symbol,

  1038   author =	 {Christoph Wedler},

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

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

  1041 }

  1043 @manual{isabelle-sys,

  1044   author	= {Markus Wenzel and Stefan Berghofer},

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

  1046   institution	= {TU Munich},

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

  1049 @manual{isabelle-isar-ref,

  1050   author	= {Markus Wenzel},

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

  1052   institution	= {TU Munich},

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

  1055 @manual{isabelle-axclass,

  1056   author	= {Markus Wenzel},

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

  1058   institution	= {TU Munich},

  1059   year          = 2000,

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

  1063 @InProceedings{Wenzel:1999:TPHOL,

  1064   author = 	 {Markus Wenzel},

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

  1066   crossref =     {tphols99}}

  1068 @InProceedings{Wenzel:1997:TPHOL,

  1069   author = 	 {Markus Wenzel},

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

  1071   crossref =     {tphols97}}

  1075 @book{principia,

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

  1077   title		= {Principia Mathematica},

  1078   year		= 1962,

  1079   publisher	= CUP,

  1080   note		= {Paperback edition to *56,

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

  1083 @Misc{Wiedijk:1999:Mizar,

  1084   author =	 {Freek Wiedijk},

  1085   title =	 {Mizar: An Impression},

  1086   howpublished = {Unpublished paper},

  1087   year =         1999,

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

  1089 }

  1091 @Misc{Wiedijk:2000:MV,

  1092   author =	 {Freek Wiedijk},

  1093   title =	 {The Mathematical Vernacular},

  1094   howpublished = {Unpublished paper},

  1095   year =         2000,

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

  1097 }

  1099 @book{winskel93,

  1100   author	= {Glynn Winskel},

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

  1102   publisher	= MIT,year=1993}

  1104 @InCollection{wos-bledsoe,

  1105   author	= {Larry Wos},

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

  1107   crossref	= {bledsoe-fest},

  1108   pages		= {297-342}}

  1110 @InProceedings{Zammit:1999:TPHOL,

  1111   author = 	 {Vincent Zammit},

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

  1113   crossref =     {tphols99}}

  1115 %Z

  1118 % CROSS REFERENCES

  1120 @book{handbk-lics2,

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

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

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

  1124   publisher	= {Oxford University Press},

  1125   year		= 1992,

  1126   volume	= 2}

  1128 @book{types93,

  1129   editor	= {Henk Barendregt and Tobias Nipkow},

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

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

  1132   year		= {published 1994},

  1133   publisher	= {Springer},

  1134   series	= {LNCS 806}}

  1136 @book{barwise-handbk,

  1137   editor	= {J. Barwise},

  1138   title		= {Handbook of Mathematical Logic},

  1139   booktitle	= {Handbook of Mathematical Logic},

  1140   year		= 1977,

  1141   publisher	= NH}

  1143 @Proceedings{tlca93,

  1144   title		= {Typed Lambda Calculi and Applications},

  1145   booktitle	= {Typed Lambda Calculi and Applications},

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

  1147   year		= 1993,

  1148   publisher	= {Springer},

  1149   series	= {LNCS 664}}

  1151 @book{birtwistle89,

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

  1153   title		= {Current Trends in Hardware Verification and Automated

  1154 		 Theorem Proving},

  1155   booktitle	= {Current Trends in Hardware Verification and Automated

  1156 		 Theorem Proving},

  1157   publisher	= {Springer},

  1158   year		= 1989}

  1160 @book{bledsoe-fest,

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

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

  1163   publisher	= {Kluwer Academic Publishers},

  1164   year		= 1991,

  1165   editor	= {Robert S. Boyer}}

  1167 @Proceedings{cade12,

  1168   editor	= {Alan Bundy},

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

  1170 		  International Conference},

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

  1172 		  International Conference},

  1173   year		= 1994,

  1174   series	= {LNAI 814},

  1175   publisher	= {Springer}}

  1177 @book{types94,

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

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

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

  1181   year		= 1995,

  1182   publisher	= {Springer},

  1183   series	= {LNCS 996}}

  1185 @book{huet-plotkin91,

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

  1187   title		= {Logical Frameworks},

  1188   booktitle	= {Logical Frameworks},

  1189   publisher	= CUP,

  1190   year		= 1991}

  1192 @book{huet-plotkin93,

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

  1194   title		= {Logical Environments},

  1195   booktitle	= {Logical Environments},

  1196   publisher	= CUP,

  1197   year		= 1993}

  1199 @Proceedings{hug93,

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

  1201   title		= {Higher Order Logic Theorem Proving and Its

  1202 		  Applications: HUG '93},

  1203   booktitle	= {Higher Order Logic Theorem Proving and Its

  1204 		  Applications: HUG '93},

  1205   year		= {Published 1994},

  1206   publisher	= {Springer},

  1207   series	= {LNCS 780}}

  1209 @proceedings{colog88,

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

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

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

  1213   year		= {Published 1990},

  1214   publisher	= {Springer},

  1215   organization	= {Estonian Academy of Sciences},

  1216   address	= {Tallinn},

  1217   series	= {LNCS 417}}

  1219 @book{odifreddi90,

  1220   editor	= {P. Odifreddi},

  1221   title		= {Logic and Computer Science},

  1222   booktitle	= {Logic and Computer Science},

  1223   publisher	= {Academic Press},

  1224   year		= 1990}

  1226 @proceedings{extensions91,

  1227   editor	= {Peter Schroeder-Heister},

  1228   title		= {Extensions of Logic Programming},

  1229   booktitle	= {Extensions of Logic Programming},

  1230   year		= 1991,

  1231   series	= {LNAI 475},

  1232   publisher	= {Springer}}

  1234 @proceedings{cade10,

  1235   editor	= {Mark E. Stickel},

  1236   title		= {10th } # CADE,

  1237   booktitle	= {10th } # CADE,

  1238   year		= 1990,

  1239   publisher	= {Springer},

  1240   series	= {LNAI 449}}

  1242 @Proceedings{lics8,

  1243   editor	= {M. Vardi},

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

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

  1246   publisher	= IEEE,

  1247   year		= 1993}

  1249 @book{wos-fest,

  1250   title		= {Automated Reasoning and its Applications:

  1251 			Essays in Honor of {Larry Wos}},

  1252   booktitle	= {Automated Reasoning and its Applications:

  1253 			Essays in Honor of {Larry Wos}},

  1254   publisher	= {MIT Press},

  1255   year		= 1997,

  1256   editor	= {Robert Veroff}}

  1258 @proceedings{fme93,

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

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

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

  1262   year		= 1993,

  1263   publisher	= {Springer},

  1264   series	= {LNCS 670}}

  1266 @Proceedings{tphols96,

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

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

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

  1270   series	= {LNCS 1125},

  1271   year		= 1996}

  1273 @Proceedings{tphols97,

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

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

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

  1277   series	= {LNCS 1275},

  1278   year		= 1997}

  1280 @Proceedings{tphols98,

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

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

  1283   editor	= {Jim Grundy and Malcom Newey},

  1284   series	= {LNCS 1479},

  1285   year		= 1998}

  1287 @Proceedings{tphols99,

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

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

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

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

  1292   series	= {LNCS 1690},

  1293   year		= 1999}

author	nipkow
	Thu, 15 Mar 2001 13:57:10 +0100
changeset 11209	a8cb33f6cf9c
parent 11207	08188224c24e
child 11246	64d0bcccb03a
permissions	-rw-r--r--