Mercurial Mercurial > wneuper > isa / file revision
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
doc-src/manual.bib
author wenzelm
Mon, 10 May 1999 16:47:53 +0200
changeset 6624 e0914e542f00
parent 6619 010dfaf75064
child 6626 a92d2b6e0626
permissions -rw-r--r--
axclass;
datatype; 
     1 % BibTeX database for the Isabelle documentation

     2 %

     3 % Lawrence C Paulson $Id$

     4 

     5 %publishers

     6 @string{AP="Academic Press"}

     7 @string{CUP="Cambridge University Press"}

     8 @string{IEEE="{\sc ieee} Computer Society Press"}

     9 @string{LNCS="Lect.\ Notes in Comp.\ Sci."}

    10 @string{MIT="MIT Press"}

    11 @string{NH="North-Holland"}

    12 @string{Prentice="Prentice-Hall"}

    13 @string{PH="Prentice-Hall"}

    14 @string{Springer="Springer-Verlag"}

    15 

    16 %institutions

    17 @string{CUCL="Comp. Lab., Univ. Camb."}

    18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"}

    19 

    20 %journals

    21 @string{FAC="Formal Aspects Comput."}

    22 @string{JAR="J. Auto. Reas."}

    23 @string{JCS="J. Comput. Secur."}

    24 @string{JFP="J. Func. Prog."}

    25 @string{JLC="J. Logic and Comput."}

    26 @string{JLP="J. Logic Prog."}

    27 @string{JSC="J. Symb. Comput."}

    28 @string{JSL="J. Symb. Logic"}

    29 @string{SIGPLAN="{SIGPLAN} Notices"}

    30 

    31 %conferences

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

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

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

    35 

    36 

    37 %A

    38 

    39 @incollection{abramsky90,

    40   author	= {Samson Abramsky},

    41   title		= {The Lazy Lambda Calculus},

    42   pages		= {65-116},

    43   editor	= {David A. Turner},

    44   booktitle	= {Research Topics in Functional Programming},

    45   publisher	= {Addison-Wesley},

    46   year		= 1990}

    47 

    48 @Unpublished{abrial93,

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

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

    51 		  Theorems of Set Theory},

    52   note		= {preprint},

    53   year		= 1993,

    54   month		= Feb}

    55 

    56 @incollection{aczel77,

    57   author	= {Peter Aczel},

    58   title		= {An Introduction to Inductive Definitions},

    59   pages		= {739-782},

    60   crossref	= {barwise-handbk}}

    61 

    62 @Book{aczel88,

    63   author	= {Peter Aczel},

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

    65   publisher	= {CSLI},

    66   year		= 1988}

    67 

    68 @InProceedings{alf,

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

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

    71   crossref	= {types93},

    72   pages		= {213-237}}

    73 

    74 @book{andrews86,

    75   author	= "Peter Andrews",

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

    77 through Proof",

    78   publisher	= AP,

    79   series	= "Computer Science and Applied Mathematics",

    80   year		= 1986}

    81 

    82 %B

    83 

    84 @incollection{basin91,

    85   author	= {David Basin and Matt Kaufmann},

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

    87 		   Comparison}, 

    88   crossref	= {huet-plotkin91},

    89   pages		= {89-119}}

    90 

    91 

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

    93   author = 	 {Stefan Berghofer and Markus Wenzel},

    94   title = 	 {Inductive datatypes in HOL --- lessons learned in Formal-Logic Engineering},

    95   booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs'99)},

    96   series =	 LNCS,

    97   year =	 1999,

    98   publisher =	 Springer,

    99   note =	 {to appear}

   100 }

   101 

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

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

   104 

   105 @Article{boyer86,

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

   107 		   Overbeek and Mark Stickel and Lawrence Wos},

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

   109 		   Axioms},

   110   journal	= JAR,

   111   year		= 1986,

   112   volume	= 2,

   113   number	= 3,

   114   pages		= {287-327}}

   115 

   116 @book{bm79,

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

   118   title		= {A Computational Logic},

   119   publisher	= {Academic Press},

   120   year		= 1979}

   121 

   122 @book{bm88book,

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

   124   title		= {A Computational Logic Handbook},

   125   publisher	= {Academic Press},

   126   year		= 1988}

   127 

   128 @Article{debruijn72,

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

   130   title		= {Lambda Calculus Notation with Nameless Dummies,

   131 	a Tool for Automatic Formula Manipulation,

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

   133   journal	= {Indag. Math.},

   134   volume	= 34,

   135   pages		= {381-392},

   136   year		= 1972}

   137 

   138 %C

   139 

   140 @TechReport{camilleri92,

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

   142   title		= {Reasoning with Inductively Defined Relations in the

   143 		 {HOL} Theorem Prover},

   144   institution	= CUCL,

   145   year		= 1992,

   146   number	= 265,

   147   month		= Aug}

   148 

   149 @Book{charniak80,

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

   151   title		= {Artificial Intelligence Programming},

   152   publisher	= {Lawrence Erlbaum Associates},

   153   year		= 1980}

   154 

   155 @article{church40,

   156   author	= "Alonzo Church",

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

   158   journal	= JSL,

   159   year		= 1940,

   160   volume	= 5,

   161   pages		= "56-68"}

   162 

   163 @PhdThesis{coen92,

   164   author	= {Martin D. Coen},

   165   title		= {Interactive Program Derivation},

   166   school	= {University of Cambridge},

   167   note		= {Computer Laboratory Technical Report 272},

   168   month		= nov,

   169   year		= 1992}

   170 

   171 @book{constable86,

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

   173   title		= {Implementing Mathematics with the Nuprl Proof

   174 		 Development System}, 

   175   publisher	= Prentice,

   176   year		= 1986}

   177 

   178 %D

   179 

   180 @Book{davey&priestley,

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

   182   title		= {Introduction to Lattices and Order},

   183   publisher	= CUP,

   184   year		= 1990}

   185 

   186 @Book{devlin79,

   187   author	= {Keith J. Devlin},

   188   title		= {Fundamentals of Contemporary Set Theory},

   189   publisher	= {Springer},

   190   year		= 1979}

   191 

   192 @book{dummett,

   193   author	= {Michael Dummett},

   194   title		= {Elements of Intuitionism},

   195   year		= 1977,

   196   publisher	= {Oxford University Press}}

   197 

   198 @incollection{dybjer91,

   199   author	= {Peter Dybjer},

   200   title		= {Inductive Sets and Families in {Martin-L\"of's} Type

   201 		  Theory and Their Set-Theoretic Semantics}, 

   202   crossref	= {huet-plotkin91},

   203   pages		= {280-306}}

   204 

   205 @Article{dyckhoff,

   206   author	= {Roy Dyckhoff},

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

   208   journal	= JSL,

   209   year		= 1992,

   210   volume	= 57,

   211   number	= 3,

   212   pages		= {795-807}}

   213 

   214 %F

   215 

   216 @Article{IMPS,

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

   218 		 Thayer},

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

   220   journal	= JAR,

   221   volume	= 11,

   222   number	= 2,

   223   year		= 1993,

   224   pages		= {213-248}}

   225 

   226 @InProceedings{felty91a,

   227   Author	= {Amy Felty},

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

   229 		  Deduction Proofs}, 

   230   crossref	= {extensions91},

   231   pages		= {157-178}}

   232 

   233 @TechReport{frost93,

   234   author	= {Jacob Frost},

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

   236   institution	= CUCL,

   237   number	= 308,

   238   year		= 1993,

   239   month		= Aug}

   240 

   241 %revised version of frost93

   242 @TechReport{frost95,

   243   author	= {Jacob Frost},

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

   245   institution	= CUCL,

   246   number	= 359,

   247   year		= 1995,

   248   month		= Feb}

   249 

   250 @inproceedings{OBJ,

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

   252 		 and J. Meseguer}, 

   253   title		= {Principles of {OBJ2}},

   254   booktitle	= POPL, 

   255   year		= 1985,

   256   pages		= {52-66}}

   257 

   258 %G

   259 

   260 @book{gallier86,

   261   author	= {J. H. Gallier},

   262   title		= {Logic for Computer Science: 

   263 		Foundations of Automatic Theorem Proving},

   264   year		= 1986,

   265   publisher	= {Harper \& Row}}

   266 

   267 @Book{galton90,

   268   author	= {Antony Galton},

   269   title		= {Logic for Information Technology},

   270   publisher	= {Wiley},

   271   year		= 1990}

   272 

   273 @InProceedings{gimenez-codifying,

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

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

   276   crossref	= {types94},

   277   pages		= {39-59}

   278 }

   279 

   280 @Book{mgordon-hol,

   281   author	= {M. J. C. Gordon and T. F. Melham},

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

   283 		 Higher Order Logic},

   284   publisher	= CUP,

   285   year		= 1993}

   286 

   287 @book{mgordon79,

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

   289 		 Wadsworth},

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

   291   year		= 1979,

   292   publisher	= {Springer},

   293   series	= {LNCS 78}}

   294 

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

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

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

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

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

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

   301 

   302 @InProceedings{gunter-trees,

   303   author	= {Elsa L. Gunter},

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

   305 		  {HOL}},

   306   crossref	= {hug93},

   307   pages		= {141-154}}

   308 

   309 %H

   310 

   311 @Book{halmos60,

   312   author	= {Paul R. Halmos},

   313   title		= {Naive Set Theory},

   314   publisher	= {Van Nostrand},

   315   year		= 1960}

   316 

   317 @Book{hennessy90,

   318   author	= {Matthew Hennessy},

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

   320 		  Introduction Using Structural Operational Semantics},

   321   publisher	= {Wiley},

   322   year		= 1990}

   323 

   324 @Article{haskell-report,

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

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

   327 		 Non-strict, Purely Functional Language},

   328   journal	= SIGPLAN,

   329   year		= 1992,

   330   volume	= 27,

   331   number	= 5,

   332   month		= May,

   333   note		= {Version 1.2}}

   334 

   335 @Article{haskell-tutorial,

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

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

   338   journal	= SIGPLAN,

   339   year		= 1992,

   340   volume	= 27,

   341   number	= 5,

   342   month		= May}

   343 

   344 @article{huet75,

   345   author	= {G. P. Huet},

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

   347   journal	= TCS,

   348   volume	= 1,

   349   year		= 1975,

   350   pages		= {27-57}}

   351 

   352 @article{huet78,

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

   354   title		= {Proving and Applying Program Transformations Expressed with 

   355 			Second-Order Patterns},

   356   journal	= acta,

   357   volume	= 11,

   358   year		= 1978, 

   359   pages		= {31-55}}

   360 

   361 @inproceedings{huet88,

   362   author	= {G\'erard Huet},

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

   364 		 Constructions}}, 

   365   booktitle	= {Programming of Future Generation Computers},

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

   367   year		= 1988,

   368   pages		= {205-216}, 

   369   publisher	= {Elsevier}}

   370 

   371 %K

   372 

   373 @book{Knuth3-75,author={Donald E. Knuth},

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

   375 publisher={Addison-Wesley},year=1975}

   376 

   377 @Book{kunen80,

   378   author	= {Kenneth Kunen},

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

   380   publisher	= NH,

   381   year		= 1980}

   382 

   383 %M

   384 

   385 @Article{mw81,

   386   author	= {Zohar Manna and Richard Waldinger},

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

   388   journal	= SCP,

   389   year		= 1981,

   390   volume	= 1,

   391   number	= 1,

   392   pages		= {5-48}}

   393 

   394 @InProceedings{martin-nipkow,

   395   author	= {Ursula Martin and Tobias Nipkow},

   396   title		= {Ordered Rewriting and Confluence},

   397   crossref	= {cade10},

   398   pages		= {366-380}}

   399 

   400 @book{martinlof84,

   401   author	= {Per Martin-L\"of},

   402   title		= {Intuitionistic type theory},

   403   year		= 1984,

   404   publisher	= {Bibliopolis}}

   405 

   406 @incollection{melham89,

   407   author	= {Thomas F. Melham},

   408   title		= {Automating Recursive Type Definitions in Higher Order

   409 		 Logic}, 

   410   pages		= {341-386},

   411   crossref	= {birtwistle89}}

   412 

   413 @Article{miller-mixed,

   414   Author	= {Dale Miller},

   415   Title		= {Unification Under a Mixed Prefix},

   416   journal	= JSC,

   417   volume	= 14,

   418   number	= 4,

   419   pages		= {321-358},

   420   Year		= 1992}

   421 

   422 @Article{milner78,

   423   author	= {Robin Milner},

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

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

   426   year		= 1978,

   427   volume	= 17,

   428   pages		= {348-375}}

   429 

   430 @TechReport{milner-ind,

   431   author	= {Robin Milner},

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

   433   institution	= Edinburgh,

   434   year		= 1980,

   435   type		= {note}}

   436 

   437 @Article{milner-coind,

   438   author	= {Robin Milner and Mads Tofte},

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

   440   journal	= TCS,

   441   year		= 1991,

   442   volume	= 87,

   443   pages		= {209-220}}

   444 

   445 @Book{milner89,

   446   author	= {Robin Milner},

   447   title		= {Communication and Concurrency},

   448   publisher	= Prentice,

   449   year		= 1989}

   450 

   451 @PhdThesis{monahan84,

   452   author	= {Brian Q. Monahan},

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

   454   school	= {University of Edinburgh},

   455   year		= 1984}

   456 

   457 @article{MuellerNvOS99,

   458 author=

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

   460 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}

   461 

   462 %N

   463 

   464 @InProceedings{NaraschewskiW-TPHOLs98,

   465   author	= {Wolfgang Naraschewski and Markus Wenzel},

   466   title		= 

   467 {Object-Oriented Verification based on Record Subtyping in Higher-Order Logic},

   468   booktitle	= {Theorem Proving in Higher Order Logics (TPHOLs'98)},

   469   publisher	= Springer,

   470   volume	= 1479,

   471   series	= LNCS,

   472   year		= 1998}

   473 

   474 @inproceedings{nazareth-nipkow,

   475   author	= {Dieter Nazareth and Tobias Nipkow},

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

   477   crossref	= {tphols96},

   478   pages		= {331-345},

   479   year		= 1996}

   480 

   481 @inproceedings{nipkow-W,

   482   author	= {Wolfgang Naraschewski and Tobias Nipkow},

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

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

   485   editor	= {E. Gim\'enez and C. Paulin-Mohring},

   486   publisher	= Springer,

   487   series	= LNCS,

   488   volume	= 1512,

   489   pages		= {317-332},

   490   year		= 1998}

   491 

   492 @inproceedings{Nipkow-CR,

   493   author	= {Tobias Nipkow},

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

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

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

   497   publisher	= Springer,

   498   series	= LNCS,

   499   volume	= 1104,

   500   pages		= {733-747},

   501   year		= 1996}

   502 

   503 % WAS Nipkow-LICS-93

   504 @InProceedings{nipkow-patterns,

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

   506   author	= {Tobias Nipkow},

   507   pages		= {64-74},

   508   crossref	= {lics8},

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

   510   keywords	= {unification}}

   511 

   512 @article{nipkow-IMP,

   513   author	= {Tobias Nipkow},

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

   515   journal	= FAC,

   516   volume	= 10,

   517   pages		= {171-186},

   518   year		= 1998}

   519 

   520 @manual{isabelle-HOL,

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

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

   523   institution	= {Institut f\"ur Informatik, Technische Universi\"at

   524                   M\"unchen and Computer Laboratory, University of Cambridge}}

   525 

   526 @article{nipkow-prehofer,

   527   author	= {Tobias Nipkow and Christian Prehofer},

   528   title		= {Type Reconstruction for Type Classes},

   529   journal	= JFP,

   530   volume	= 5,

   531   number	= 2,

   532   year		= 1995,

   533   pages		= {201-224}}

   534 

   535 @Article{noel,

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

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

   538   journal	= JAR,

   539   volume	= 10,

   540   number	= 1,

   541   pages		= {15-58},

   542   year		= 1993}

   543 

   544 @book{nordstrom90,

   545   author	= {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},

   546   title		= {Programming in {Martin-L\"of}'s Type Theory.  An

   547 		 Introduction}, 

   548   publisher	= {Oxford University Press}, 

   549   year		= 1990}

   550 

   551 %O

   552 

   553 @Manual{pvs-language,

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

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

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

   557   address	= {Menlo Park, CA},

   558   note		= {Beta release},

   559   year		= 1993,

   560   month		= apr,

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

   562 

   563 %P

   564 

   565 % replaces paulin92

   566 @InProceedings{paulin-tlca,

   567   author	= {Christine Paulin-Mohring},

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

   569 		 Properties},

   570   crossref	= {tlca93},

   571   pages		= {328-345}}

   572 

   573 @InProceedings{paulson-CADE,

   574   author	= {Lawrence C. Paulson},

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

   576 		  Definitions},

   577   pages		= {148-161},

   578   crossref	= {cade12}}

   579 

   580 @InProceedings{paulson-COLOG,

   581   author	= {Lawrence C. Paulson},

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

   583 		 {Isabelle})}, 

   584   pages		= {246-274},

   585   crossref	= {colog88},

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

   587 

   588 @Article{paulson-coind,

   589   author	= {Lawrence C. Paulson},

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

   591 		  Logic},

   592   journal	= JLC,

   593   year		= 1997,

   594   volume	= 7,

   595   number	= 2,

   596   month		= mar,

   597   pages		= {175-204}}

   598 

   599 @manual{isabelle-ref,

   600   author	= {Lawrence C. Paulson},

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

   602   institution	= CUCL}

   603 

   604 @manual{isabelle-ZF,

   605   author	= {Lawrence C. Paulson},

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

   607   institution	= CUCL}

   608 

   609 @article{paulson-found,

   610   author	= {Lawrence C. Paulson},

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

   612   journal	= JAR,

   613   volume	= 5,

   614   number	= 3,

   615   pages		= {363-397},

   616   year		= 1989,

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

   618 

   619 %replaces paulson-final

   620 @Article{paulson-mscs,

   621   author	= {Lawrence C. Paulson},

   622   title		= {Final Coalgebras as Greatest Fixed Points in ZF Set Theory},

   623   journal	= {Mathematical Structures in Computer Science},

   624   year		= 1999,

   625   volume	= 9,

   626   note		= {in press}}

   627 

   628 @InCollection{paulson-generic,

   629   author	= {Lawrence C. Paulson},

   630   title		= {Generic Automatic Proof Tools},

   631   crossref	= {wos-fest},

   632   chapter	= 3}

   633 

   634 @Article{paulson-gr,

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

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

   637 		  Choice},

   638   journal	= JAR,

   639   year		= 1996,

   640   volume	= 17,

   641   number	= 3,

   642   month		= dec,

   643   pages		= {291-323}}

   644 

   645 @InCollection{paulson-handbook,

   646   author	= {Lawrence C. Paulson},

   647   title		= {Designing a Theorem Prover},

   648   crossref	= {handbk-lics2},

   649   pages		= {415-475}}

   650 

   651 @Book{paulson-isa-book,

   652   author	= {Lawrence C. Paulson},

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

   654   publisher	= {Springer},

   655   year		= 1994,

   656   note		= {LNCS 828}}

   657 

   658 @InCollection{paulson-markt,

   659   author	= {Lawrence C. Paulson},

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

   661   booktitle	= {Mathematical Methods in Program Development:

   662                   Summer School Marktoberdorf 1996},

   663   publisher	= {Springer},

   664   pages		= {461-498},

   665   year		= {Published 1997},

   666   editor	= {Manfred Broy},

   667   series	= {NATO ASI Series F}}

   668 

   669 %replaces Paulson-ML and paulson91

   670 @book{paulson-ml2,

   671   author	= {Lawrence C. Paulson},

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

   673   year		= 1996,

   674   edition	= {2nd},

   675   publisher	= CUP}

   676 

   677 @article{paulson-natural,

   678   author	= {Lawrence C. Paulson},

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

   680   journal	= JLP,

   681   volume	= 3,

   682   pages		= {237-258},

   683   year		= 1986,

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

   685 

   686 @Article{paulson-set-I,

   687   author	= {Lawrence C. Paulson},

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

   689 		 Foundations to Functions},

   690   journal	= JAR,

   691   volume	= 11,

   692   number	= 3,

   693   pages		= {353-389},

   694   year		= 1993,

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

   696 

   697 @Article{paulson-set-II,

   698   author	= {Lawrence C. Paulson},

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

   700 		 Recursion},

   701   journal	= JAR,

   702   volume	= 15,

   703   number	= 2,

   704   pages		= {167-215},

   705   year		= 1995,

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

   707 

   708 @article{paulson85,

   709   author	= {Lawrence C. Paulson},

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

   711   journal	= SCP,

   712   volume	= 5,

   713   pages		= {143-170},

   714   year		= 1985}

   715 

   716 %replqces Paulson-LCF

   717 @book{paulson87,

   718   author	= {Lawrence C. Paulson},

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

   720 		 LCF}, 

   721   year		= 1987,

   722   publisher	= CUP}

   723 

   724 @incollection{paulson700,

   725   author	= {Lawrence C. Paulson},

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

   727   crossref	= {odifreddi90},

   728   pages		= {361-386},

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

   730 

   731 % replaces paulson-ns and paulson-security

   732 @Article{paulson-jcs,

   733   author	= {Lawrence C. Paulson},

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

   735   journal	= JCS,

   736   year		= 1998,

   737   volume	= 6,

   738   pages		= {85-128}}

   739 

   740 @article{pelletier86,

   741   author	= {F. J. Pelletier},

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

   743 		 Provers}, 

   744   journal	= JAR,

   745   volume	= 2,

   746   pages		= {191-216},

   747   year		= 1986,

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

   749 

   750 @Article{pitts94,  

   751   author	= {Andrew M. Pitts},

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

   753   journal	= TCS,

   754   volume	= 124, 

   755   pages		= {195-219},

   756   year		= 1994} 

   757 

   758 @Article{plaisted90,

   759   author	= {David A. Plaisted},

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

   761 		 Refinement},

   762   journal	= JAR,

   763   year		= 1990,

   764   volume	= 6,

   765   number	= 4,

   766   pages		= {389-402}}

   767 

   768 %Q

   769 

   770 @Article{quaife92,

   771   author	= {Art Quaife},

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

   773 		 Theory},

   774   journal	= JAR,

   775   year		= 1992,

   776   volume	= 8,

   777   number	= 1,

   778   pages		= {91-147}}

   779 

   780 %R

   781 

   782 @TechReport{rasmussen95,

   783   author	= {Ole Rasmussen},

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

   785 		  Experiment},

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

   787   year		= 1995,

   788   number	= 364,

   789   month		= may,

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

   791 

   792 @Book{reeves90,

   793   author	= {Steve Reeves and Michael Clarke},

   794   title		= {Logic for Computer Science},

   795   publisher	= {Addison-Wesley},

   796   year		= 1990}

   797 

   798 %S

   799 

   800 @inproceedings{saaltink-fme,

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

   802 		 Dan Craigen and Irwin Meisels},

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

   804   pages		= {578-596},

   805   crossref	= {fme93}}

   806 

   807 @inproceedings{slind-tfl,

   808   author	= {Konrad Slind},

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

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

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

   812   publisher	= Springer,

   813   series	= LNCS,

   814   volume	= 1125,

   815   pages		= {381-397},

   816   year		= 1996}

   817 

   818 @book{suppes72,

   819   author	= {Patrick Suppes},

   820   title		= {Axiomatic Set Theory},

   821   year		= 1972,

   822   publisher	= {Dover}}

   823 

   824 @InCollection{szasz93,

   825   author	= {Nora Szasz},

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

   827 		  Primitive Recursive},

   828   crossref	= {huet-plotkin93},

   829   pages		= {317-338}}

   830 

   831 %T

   832 

   833 @book{takeuti87,

   834   author	= {G. Takeuti},

   835   title		= {Proof Theory},

   836   year		= 1987,

   837   publisher	= NH,

   838   edition	= {2nd}}

   839 

   840 @Book{thompson91,

   841   author	= {Simon Thompson},

   842   title		= {Type Theory and Functional Programming},

   843   publisher	= {Addison-Wesley},

   844   year		= 1991}

   845 

   846 %V

   847 

   848 @Unpublished{voelker94,

   849   author	= {Norbert V\"olker},

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

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

   852   year		= 1994,

   853   month		= aug}

   854 

   855 %W

   856 

   857 

   858 @InProceedings{Wenzel:1997:TPHOL,

   859   author = 	 {Markus Wenzel},

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

   861   booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs'97)},

   862   year =	 1997,

   863   series =	 LNCS,

   864   volume =       1275,

   865   publisher =	 Springer

   866 }

   867 

   868 @book{principia,

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

   870   title		= {Principia Mathematica},

   871   year		= 1962,

   872   publisher	= CUP, 

   873   note		= {Paperback edition to *56,

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

   875 

   876 @book{winskel93,

   877   author	= {Glynn Winskel},

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

   879   publisher	= MIT,year=1993}

   880 

   881 @InCollection{wos-bledsoe,

   882   author	= {Larry Wos},

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

   884   crossref	= {bledsoe-fest},

   885   pages		= {297-342}}

   886 

   887 

   888 % CROSS REFERENCES

   889 

   890 @book{handbk-lics2,

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

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

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

   894   publisher	= {Oxford University Press},

   895   year		= 1992,

   896   volume	= 2}

   897 

   898 @book{types93,

   899   editor	= {Henk Barendregt and Tobias Nipkow},

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

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

   902   year		= {published 1994},

   903   publisher	= {Springer},

   904   series	= {LNCS 806}}

   905 

   906 @book{barwise-handbk,

   907   editor	= {J. Barwise},

   908   title		= {Handbook of Mathematical Logic},

   909   booktitle	= {Handbook of Mathematical Logic},

   910   year		= 1977,

   911   publisher	= NH}

   912 

   913 @Proceedings{tlca93,

   914   title		= {Typed Lambda Calculi and Applications},

   915   booktitle	= {Typed Lambda Calculi and Applications},

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

   917   year		= 1993,

   918   publisher	= {Springer},

   919   series	= {LNCS 664}}

   920 

   921 @book{birtwistle89,

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

   923   title		= {Current Trends in Hardware Verification and Automated

   924 		 Theorem Proving}, 

   925   booktitle	= {Current Trends in Hardware Verification and Automated

   926 		 Theorem Proving}, 

   927   publisher	= {Springer},

   928   year		= 1989}

   929 

   930 @book{bledsoe-fest,

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

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

   933   publisher	= {Kluwer Academic Publishers},

   934   year		= 1991,

   935   editor	= {Robert S. Boyer}}

   936 

   937 @Proceedings{cade12,

   938   editor	= {Alan Bundy},

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

   940 		  International Conference},

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

   942 		  International Conference},

   943   year		= 1994,

   944   series	= {LNAI 814},

   945   publisher	= {Springer}}

   946 

   947 @book{types94,

   948   editor	= {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},

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

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

   951   year		= 1995,

   952   publisher	= {Springer},

   953   series	= {LNCS 996}}

   954 

   955 @book{huet-plotkin91,

   956   editor	= {{G\'erard} Huet and Gordon Plotkin},

   957   title		= {Logical Frameworks},

   958   booktitle	= {Logical Frameworks},

   959   publisher	= CUP,

   960   year		= 1991}

   961 

   962 @book{huet-plotkin93,

   963   editor	= {{G\'erard} Huet and Gordon Plotkin},

   964   title		= {Logical Environments},

   965   booktitle	= {Logical Environments},

   966   publisher	= CUP,

   967   year		= 1993}

   968 

   969 @Proceedings{hug93,

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

   971   title		= {Higher Order Logic Theorem Proving and Its

   972 		  Applications: HUG '93},

   973   booktitle	= {Higher Order Logic Theorem Proving and Its

   974 		  Applications: HUG '93},

   975   year		= {Published 1994},

   976   publisher	= {Springer},

   977   series	= {LNCS 780}}

   978 

   979 @proceedings{colog88,

   980   editor	= {P. Martin-L\"of and G. Mints},

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

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

   983   year		= {Published 1990},

   984   publisher	= {Springer},

   985   organization	= {Estonian Academy of Sciences},

   986   address	= {Tallinn},

   987   series	= {LNCS 417}}

   988 

   989 @book{odifreddi90,

   990   editor	= {P. Odifreddi},

   991   title		= {Logic and Computer Science},

   992   booktitle	= {Logic and Computer Science},

   993   publisher	= {Academic Press},

   994   year		= 1990}

   995 

   996 @proceedings{extensions91,

   997   editor	= {Peter Schroeder-Heister},

   998   title		= {Extensions of Logic Programming},

   999   booktitle	= {Extensions of Logic Programming},

  1000   year		= 1991,

  1001   series	= {LNAI 475}, 

  1002   publisher	= {Springer}}

  1003 

  1004 @proceedings{cade10,

  1005   editor	= {Mark E. Stickel},

  1006   title		= {10th } # CADE,

  1007   booktitle	= {10th } # CADE,

  1008   year		= 1990,

  1009   publisher	= {Springer},

  1010   series	= {LNAI 449}}

  1011 

  1012 @Proceedings{lics8,

  1013   editor	= {M. Vardi},

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

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

  1016   publisher	= IEEE,

  1017   year		= 1993}

  1018 

  1019 @book{wos-fest,

  1020   title		= {Automated Reasoning and its Applications: 

  1021 			Essays in Honor of {Larry Wos}},

  1022   booktitle	= {Automated Reasoning and its Applications: 

  1023 			Essays in Honor of {Larry Wos}},

  1024   publisher	= {MIT Press},

  1025   year		= 1997,

  1026   editor	= {Robert Veroff}}

  1027 

  1028 @proceedings{fme93,

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

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

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

  1032   year		= 1993,

  1033   publisher	= {Springer},

  1034   series	= {LNCS 670}}

  1035 

  1036 @Proceedings{tphols96,

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

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

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

  1040   series	= {LNCS 1125},

  1041   year		= 1996}
wneuper/isa