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

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

    16 %institutions

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

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

    20 %journals

    21 @string{AI="Artificial Intelligence"}

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

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

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

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

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

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

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

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

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

    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:TACAS:2000,

    84   author = 	 {David Aspinall},

    85   title = 	 {Proof General: A Generic Tool for Proof Development},

    86   booktitle = 	 {ETAPS / TACAS},

    87   year =	 2000,

    88   note =	 {To appear}

    89 }

    91 @Misc{isamode,

    92   author =	 {David Aspinall},

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

    94   note =	 {\url{http://www.dcs.ed.ac.uk/home/da/Isamode/}}

    95 }

    97 @Misc{proofgeneral,

    98   author =	 {David Aspinall and others},

    99   title =	 {{P}roof {G}eneral --- {O}rganize your proofs!},

   100   note =	 {\url{http://www.dcs.ed.ac.uk/home/proofgen/}}

   101 }

   103 %B

   105 @incollection{basin91,

   106   author	= {David Basin and Matt Kaufmann},

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

   108 		   Comparison},

   109   crossref	= {huet-plotkin91},

   110   pages		= {89-119}}

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

   114   author = 	 {Stefan Berghofer and Markus Wenzel},

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

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

   117   crossref =     {tphols99}}

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

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

   122 @Article{boyer86,

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

   124 		   Overbeek and Mark Stickel and Lawrence Wos},

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

   126 		   Axioms},

   127   journal	= JAR,

   128   year		= 1986,

   129   volume	= 2,

   130   number	= 3,

   131   pages		= {287-327}}

   133 @book{bm79,

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

   135   title		= {A Computational Logic},

   136   publisher	= {Academic Press},

   137   year		= 1979}

   139 @book{bm88book,

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

   141   title		= {A Computational Logic Handbook},

   142   publisher	= {Academic Press},

   143   year		= 1988}

   145 @Article{debruijn72,

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

   147   title		= {Lambda Calculus Notation with Nameless Dummies,

   148 	a Tool for Automatic Formula Manipulation,

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

   150   journal	= {Indag. Math.},

   151   volume	= 34,

   152   pages		= {381-392},

   153   year		= 1972}

   155 %C

   157 @TechReport{camilleri92,

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

   159   title		= {Reasoning with Inductively Defined Relations in the

   160 		 {HOL} Theorem Prover},

   161   institution	= CUCL,

   162   year		= 1992,

   163   number	= 265,

   164   month		= Aug}

   166 @Book{charniak80,

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

   168   title		= {Artificial Intelligence Programming},

   169   publisher	= {Lawrence Erlbaum Associates},

   170   year		= 1980}

   172 @article{church40,

   173   author	= "Alonzo Church",

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

   175   journal	= JSL,

   176   year		= 1940,

   177   volume	= 5,

   178   pages		= "56-68"}

   180 @PhdThesis{coen92,

   181   author	= {Martin D. Coen},

   182   title		= {Interactive Program Derivation},

   183   school	= {University of Cambridge},

   184   note		= {Computer Laboratory Technical Report 272},

   185   month		= nov,

   186   year		= 1992}

   188 @book{constable86,

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

   190   title		= {Implementing Mathematics with the Nuprl Proof

   191 		 Development System},

   192   publisher	= Prentice,

   193   year		= 1986}

   195 %D

   197 @Book{davey-priestley,

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

   199   title		= {Introduction to Lattices and Order},

   200   publisher	= CUP,

   201   year		= 1990}

   203 @Book{devlin79,

   204   author	= {Keith J. Devlin},

   205   title		= {Fundamentals of Contemporary Set Theory},

   206   publisher	= {Springer},

   207   year		= 1979}

   209 @book{dummett,

   210   author	= {Michael Dummett},

   211   title		= {Elements of Intuitionism},

   212   year		= 1977,

   213   publisher	= {Oxford University Press}}

   215 @incollection{dybjer91,

   216   author	= {Peter Dybjer},

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

   218 		  Theory and Their Set-Theoretic Semantics},

   219   crossref	= {huet-plotkin91},

   220   pages		= {280-306}}

   222 @Article{dyckhoff,

   223   author	= {Roy Dyckhoff},

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

   225   journal	= JSL,

   226   year		= 1992,

   227   volume	= 57,

   228   number	= 3,

   229   pages		= {795-807}}

   231 %F

   233 @Article{IMPS,

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

   235 		 Thayer},

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

   237   journal	= JAR,

   238   volume	= 11,

   239   number	= 2,

   240   year		= 1993,

   241   pages		= {213-248}}

   243 @InProceedings{felty91a,

   244   Author	= {Amy Felty},

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

   246 		  Deduction Proofs},

   247   crossref	= {extensions91},

   248   pages		= {157-178}}

   250 @TechReport{frost93,

   251   author	= {Jacob Frost},

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

   253   institution	= CUCL,

   254   number	= 308,

   255   year		= 1993,

   256   month		= Aug}

   258 %revised version of frost93

   259 @TechReport{frost95,

   260   author	= {Jacob Frost},

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

   262   institution	= CUCL,

   263   number	= 359,

   264   year		= 1995,

   265   month		= Feb}

   267 @inproceedings{OBJ,

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

   269 		 and J. Meseguer},

   270   title		= {Principles of {OBJ2}},

   271   booktitle	= POPL,

   272   year		= 1985,

   273   pages		= {52-66}}

   275 %G

   277 @book{gallier86,

   278   author	= {J. H. Gallier},

   279   title		= {Logic for Computer Science:

   280 		Foundations of Automatic Theorem Proving},

   281   year		= 1986,

   282   publisher	= {Harper \& Row}}

   284 @Book{galton90,

   285   author	= {Antony Galton},

   286   title		= {Logic for Information Technology},

   287   publisher	= {Wiley},

   288   year		= 1990}

   290 @InProceedings{gimenez-codifying,

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

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

   293   crossref	= {types94},

   294   pages		= {39-59}

   295 }

   297 @Book{mgordon-hol,

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

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

   300 		 Higher Order Logic},

   301   publisher	= CUP,

   302   year		= 1993}

   304 @book{mgordon79,

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

   306 		 Wadsworth},

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

   308   year		= 1979,

   309   publisher	= {Springer},

   310   series	= {LNCS 78}}

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

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

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

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

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

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

   319 @InProceedings{gunter-trees,

   320   author	= {Elsa L. Gunter},

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

   322 		  {HOL}},

   323   crossref	= {hug93},

   324   pages		= {141-154}}

   326 %H

   328 @Book{halmos60,

   329   author	= {Paul R. Halmos},

   330   title		= {Naive Set Theory},

   331   publisher	= {Van Nostrand},

   332   year		= 1960}

   334 @Book{hennessy90,

   335   author	= {Matthew Hennessy},

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

   337 		  Introduction Using Structural Operational Semantics},

   338   publisher	= {Wiley},

   339   year		= 1990}

   341 @Article{haskell-report,

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

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

   344 		 Non-strict, Purely Functional Language},

   345   journal	= SIGPLAN,

   346   year		= 1992,

   347   volume	= 27,

   348   number	= 5,

   349   month		= May,

   350   note		= {Version 1.2}}

   352 @Article{haskell-tutorial,

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

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

   355   journal	= SIGPLAN,

   356   year		= 1992,

   357   volume	= 27,

   358   number	= 5,

   359   month		= May}

   361 @article{huet75,

   362   author	= {G. P. Huet},

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

   364   journal	= TCS,

   365   volume	= 1,

   366   year		= 1975,

   367   pages		= {27-57}}

   369 @article{huet78,

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

   371   title		= {Proving and Applying Program Transformations Expressed with

   372 			Second-Order Patterns},

   373   journal	= acta,

   374   volume	= 11,

   375   year		= 1978,

   376   pages		= {31-55}}

   378 @inproceedings{huet88,

   379   author	= {G\'erard Huet},

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

   381 		 Constructions}},

   382   booktitle	= {Programming of Future Generation Computers},

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

   384   year		= 1988,

   385   pages		= {205-216},

   386   publisher	= {Elsevier}}

   388 @InProceedings{Harrison:1996:MizarHOL,

   389   author = 	 {J. Harrison},

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

   391   pages =	 {203--220},

   392   crossref =     {tphols96}}

   394 %K

   396 @InProceedings{kammueller-locales,

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

   398                   Lawrence C. Paulson},

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

   400   crossref =	 {tphols99}}

   402 @book{Knuth3-75,

   403   author={Donald E. Knuth},

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

   405   publisher={Addison-Wesley},

   406   year=1975}

   408 @Article{korf85,

   409   author	= {R. E. Korf},

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

   411 		 Tree Search},

   412   journal	= AI,

   413   year		= 1985,

   414   volume	= 27,

   415   pages		= {97-109}}

   417 @Book{kunen80,

   418   author	= {Kenneth Kunen},

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

   420   publisher	= NH,

   421   year		= 1980}

   423 %M

   425 @Article{mw81,

   426   author	= {Zohar Manna and Richard Waldinger},

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

   428   journal	= SCP,

   429   year		= 1981,

   430   volume	= 1,

   431   number	= 1,

   432   pages		= {5-48}}

   434 @InProceedings{martin-nipkow,

   435   author	= {Ursula Martin and Tobias Nipkow},

   436   title		= {Ordered Rewriting and Confluence},

   437   crossref	= {cade10},

   438   pages		= {366-380}}

   440 @book{martinlof84,

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

   442   title		= {Intuitionistic type theory},

   443   year		= 1984,

   444   publisher	= {Bibliopolis}}

   446 @incollection{melham89,

   447   author	= {Thomas F. Melham},

   448   title		= {Automating Recursive Type Definitions in Higher Order

   449 		 Logic},

   450   pages		= {341-386},

   451   crossref	= {birtwistle89}}

   453 @Article{miller-mixed,

   454   Author	= {Dale Miller},

   455   Title		= {Unification Under a Mixed Prefix},

   456   journal	= JSC,

   457   volume	= 14,

   458   number	= 4,

   459   pages		= {321-358},

   460   Year		= 1992}

   462 @Article{milner78,

   463   author	= {Robin Milner},

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

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

   466   year		= 1978,

   467   volume	= 17,

   468   pages		= {348-375}}

   470 @TechReport{milner-ind,

   471   author	= {Robin Milner},

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

   473   institution	= Edinburgh,

   474   year		= 1980,

   475   type		= {note}}

   477 @Article{milner-coind,

   478   author	= {Robin Milner and Mads Tofte},

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

   480   journal	= TCS,

   481   year		= 1991,

   482   volume	= 87,

   483   pages		= {209-220}}

   485 @Book{milner89,

   486   author	= {Robin Milner},

   487   title		= {Communication and Concurrency},

   488   publisher	= Prentice,

   489   year		= 1989}

   491 @PhdThesis{monahan84,

   492   author	= {Brian Q. Monahan},

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

   494   school	= {University of Edinburgh},

   495   year		= 1984}

   497 @article{MuellerNvOS99,

   498 author=

   499 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},

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

   502 %N

   504 @InProceedings{NaraschewskiW-TPHOLs98,

   505   author	= {Wolfgang Naraschewski and Markus Wenzel},

   506   title		=

   507 {Object-Oriented Verification based on Record Subtyping in

   508                   Higher-Order Logic},

   509   crossref      = {tphols98}}

   511 @inproceedings{nazareth-nipkow,

   512   author	= {Dieter Nazareth and Tobias Nipkow},

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

   514   crossref	= {tphols96},

   515   pages		= {331-345},

   516   year		= 1996}

   518 @inproceedings{nipkow-W,

   519   author	= {Wolfgang Naraschewski and Tobias Nipkow},

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

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

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

   523   publisher	= Springer,

   524   series	= LNCS,

   525   volume	= 1512,

   526   pages		= {317-332},

   527   year		= 1998}

   529 @inproceedings{Nipkow-CR,

   530   author	= {Tobias Nipkow},

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

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

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

   534   publisher	= Springer,

   535   series	= LNCS,

   536   volume	= 1104,

   537   pages		= {733-747},

   538   year		= 1996}

   540 % WAS Nipkow-LICS-93

   541 @InProceedings{nipkow-patterns,

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

   543   author	= {Tobias Nipkow},

   544   pages		= {64-74},

   545   crossref	= {lics8},

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

   547   keywords	= {unification}}

   549 @article{nipkow-IMP,

   550   author	= {Tobias Nipkow},

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

   552   journal	= FAC,

   553   volume	= 10,

   554   pages		= {171-186},

   555   year		= 1998}

   557 @manual{isabelle-HOL,

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

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

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

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

   563 @article{nipkow-prehofer,

   564   author	= {Tobias Nipkow and Christian Prehofer},

   565   title		= {Type Reconstruction for Type Classes},

   566   journal	= JFP,

   567   volume	= 5,

   568   number	= 2,

   569   year		= 1995,

   570   pages		= {201-224}}

   572 @Article{noel,

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

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

   575   journal	= JAR,

   576   volume	= 10,

   577   number	= 1,

   578   pages		= {15-58},

   579   year		= 1993}

   581 @book{nordstrom90,

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

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

   584 		 Introduction},

   585   publisher	= {Oxford University Press},

   586   year		= 1990}

   588 %O

   590 @Manual{pvs-language,

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

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

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

   594   address	= {Menlo Park, CA},

   595   note          = {Beta release},

   596   year		= 1993,

   597   month		= apr,

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

   600 %P

   602 % replaces paulin92

   603 @InProceedings{paulin-tlca,

   604   author	= {Christine Paulin-Mohring},

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

   606 		 Properties},

   607   crossref	= {tlca93},

   608   pages		= {328-345}}

   610 @InProceedings{paulson-CADE,

   611   author	= {Lawrence C. Paulson},

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

   613 		  Definitions},

   614   pages		= {148-161},

   615   crossref	= {cade12}}

   617 @InProceedings{paulson-COLOG,

   618   author	= {Lawrence C. Paulson},

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

   620 		 {Isabelle})},

   621   pages		= {246-274},

   622   crossref	= {colog88},

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

   625 @Article{paulson-coind,

   626   author	= {Lawrence C. Paulson},

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

   628 		  Logic},

   629   journal	= JLC,

   630   year		= 1997,

   631   volume	= 7,

   632   number	= 2,

   633   month		= mar,

   634   pages		= {175-204}}

   636 @manual{isabelle-ref,

   637   author	= {Lawrence C. Paulson},

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

   639   institution	= CUCL}

   641 @manual{isabelle-ZF,

   642   author	= {Lawrence C. Paulson},

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

   644   institution	= CUCL}

   646 @article{paulson-found,

   647   author	= {Lawrence C. Paulson},

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

   649   journal	= JAR,

   650   volume	= 5,

   651   number	= 3,

   652   pages		= {363-397},

   653   year		= 1989,

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

   656 %replaces paulson-final

   657 @Article{paulson-mscs,

   658   author	= {Lawrence C. Paulson},

   659   title = 	 {Final Coalgebras as Greatest Fixed Points

   660                   in {ZF} Set Theory},

   661   journal	= {Mathematical Structures in Computer Science},

   662   year		= 1999,

   663   volume	= 9,

   664   note		= {in press}}

   666 @InCollection{paulson-generic,

   667   author	= {Lawrence C. Paulson},

   668   title		= {Generic Automatic Proof Tools},

   669   crossref	= {wos-fest},

   670   chapter	= 3}

   672 @Article{paulson-gr,

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

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

   675 		  Choice},

   676   journal	= JAR,

   677   year		= 1996,

   678   volume	= 17,

   679   number	= 3,

   680   month		= dec,

   681   pages		= {291-323}}

   683 @InCollection{paulson-handbook,

   684   author	= {Lawrence C. Paulson},

   685   title		= {Designing a Theorem Prover},

   686   crossref	= {handbk-lics2},

   687   pages		= {415-475}}

   689 @Book{paulson-isa-book,

   690   author	= {Lawrence C. Paulson},

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

   692   publisher	= {Springer},

   693   year		= 1994,

   694   note		= {LNCS 828}}

   696 @InCollection{paulson-markt,

   697   author	= {Lawrence C. Paulson},

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

   699   booktitle	= {Mathematical Methods in Program Development:

   700                   Summer School Marktoberdorf 1996},

   701   publisher	= {Springer},

   702   pages		= {461-498},

   703   year		= {Published 1997},

   704   editor	= {Manfred Broy},

   705   series	= {NATO ASI Series F}}

   707 %replaces Paulson-ML and paulson91

   708 @book{paulson-ml2,

   709   author	= {Lawrence C. Paulson},

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

   711   year		= 1996,

   712   edition	= {2nd},

   713   publisher	= CUP}

   715 @article{paulson-natural,

   716   author	= {Lawrence C. Paulson},

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

   718   journal	= JLP,

   719   volume	= 3,

   720   pages		= {237-258},

   721   year		= 1986,

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

   724 @Article{paulson-set-I,

   725   author	= {Lawrence C. Paulson},

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

   727 		 Foundations to Functions},

   728   journal	= JAR,

   729   volume	= 11,

   730   number	= 3,

   731   pages		= {353-389},

   732   year		= 1993,

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

   735 @Article{paulson-set-II,

   736   author	= {Lawrence C. Paulson},

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

   738 		 Recursion},

   739   journal	= JAR,

   740   volume	= 15,

   741   number	= 2,

   742   pages		= {167-215},

   743   year		= 1995,

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

   746 @article{paulson85,

   747   author	= {Lawrence C. Paulson},

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

   749   journal	= SCP,

   750   volume	= 5,

   751   pages		= {143-170},

   752   year		= 1985}

   754 %replqces Paulson-LCF

   755 @book{paulson87,

   756   author	= {Lawrence C. Paulson},

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

   758 		 LCF},

   759   year		= 1987,

   760   publisher	= CUP}

   762 @incollection{paulson700,

   763   author	= {Lawrence C. Paulson},

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

   765   crossref	= {odifreddi90},

   766   pages		= {361-386},

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

   769 % replaces paulson-ns and paulson-security

   770 @Article{paulson-jcs,

   771   author	= {Lawrence C. Paulson},

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

   773   journal	= JCS,

   774   year		= 1998,

   775   volume	= 6,

   776   pages		= {85-128}}

   778 @article{pelletier86,

   779   author	= {F. J. Pelletier},

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

   781 		 Provers},

   782   journal	= JAR,

   783   volume	= 2,

   784   pages		= {191-216},

   785   year		= 1986,

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

   788 @Article{pitts94,

   789   author	= {Andrew M. Pitts},

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

   791   journal	= TCS,

   792   volume	= 124,

   793   pages		= {195-219},

   794   year		= 1994}

   796 @Article{plaisted90,

   797   author	= {David A. Plaisted},

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

   799 		 Refinement},

   800   journal	= JAR,

   801   year		= 1990,

   802   volume	= 6,

   803   number	= 4,

   804   pages		= {389-402}}

   806 %Q

   808 @Article{quaife92,

   809   author	= {Art Quaife},

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

   811 		 Theory},

   812   journal	= JAR,

   813   year		= 1992,

   814   volume	= 8,

   815   number	= 1,

   816   pages		= {91-147}}

   818 %R

   820 @TechReport{rasmussen95,

   821   author	= {Ole Rasmussen},

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

   823 		  Experiment},

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

   825   year		= 1995,

   826   number	= 364,

   827   month		= may,

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

   830 @Book{reeves90,

   831   author	= {Steve Reeves and Michael Clarke},

   832   title		= {Logic for Computer Science},

   833   publisher	= {Addison-Wesley},

   834   year		= 1990}

   836 @InProceedings{Rudnicki:1992:MizarOverview,

   837   author = 	 {P. Rudnicki},

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

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

   840   year =	 1992,

   841   organization = {Chalmers University of Technology},

   842   publisher =	 {Bastad}

   843 }

   845 %S

   847 @inproceedings{saaltink-fme,

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

   849 		 Dan Craigen and Irwin Meisels},

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

   851   pages		= {578-596},

   852   crossref	= {fme93}}

   854 @inproceedings{slind-tfl,

   855   author	= {Konrad Slind},

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

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

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

   859   publisher	= Springer,

   860   series	= LNCS,

   861   volume	= 1125,

   862   pages		= {381-397},

   863   year		= 1996}

   865 @book{suppes72,

   866   author	= {Patrick Suppes},

   867   title		= {Axiomatic Set Theory},

   868   year		= 1972,

   869   publisher	= {Dover}}

   871 @InCollection{szasz93,

   872   author	= {Nora Szasz},

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

   874 		  Primitive Recursive},

   875   crossref	= {huet-plotkin93},

   876   pages		= {317-338}}

   878 @TechReport{Syme:1997:DECLARE,

   879   author = 	 {D. Syme},

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

   881   institution =  {University of Cambridge Computer Laboratory},

   882   year = 	 1997,

   883   number =	 416

   884 }

   886 @PhdThesis{Syme:1998:thesis,

   887   author = 	 {D. Syme},

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

   889   school = 	 {University of Cambridge},

   890   year = 	 1998,

   891   note =	 {Submitted}

   892 }

   894 @InProceedings{Syme:1999:TPHOL,

   895   author = 	 {D. Syme},

   896   title = 	 {Three Tactic Theorem Proving},

   897   crossref =     {tphols99}}

   899 %T

   901 @book{takeuti87,

   902   author	= {G. Takeuti},

   903   title		= {Proof Theory},

   904   year		= 1987,

   905   publisher	= NH,

   906   edition	= {2nd}}

   908 @Book{thompson91,

   909   author	= {Simon Thompson},

   910   title		= {Type Theory and Functional Programming},

   911   publisher	= {Addison-Wesley},

   912   year		= 1991}

   914 @Unpublished{Trybulec:1993:MizarFeatures,

   915   author = 	 {A. Trybulec},

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

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

   918   year =	 1993

   919 }

   921 %V

   923 @Unpublished{voelker94,

   924   author	= {Norbert V\"olker},

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

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

   927   year		= 1994,

   928   month		= aug}

   930 %W

   932 @Misc{x-symbol,

   933   author =	 {Christoph Wedler},

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

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

   936 }

   938 @manual{isabelle-sys,

   939   author	= {Markus Wenzel and Stefan Berghofer},

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

   941   institution	= {TU Munich}}

   943 @manual{isabelle-isar-ref,

   944   author	= {Markus Wenzel},

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

   946   institution	= {TU Munich}}

   949 @InProceedings{Wenzel:1999:TPHOL,

   950   author = 	 {Markus Wenzel},

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

   952   crossref =     {tphols99}}

   954 @InProceedings{Wenzel:1997:TPHOL,

   955   author = 	 {Markus Wenzel},

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

   957   crossref =     {tphols97}}

   961 @book{principia,

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

   963   title		= {Principia Mathematica},

   964   year		= 1962,

   965   publisher	= CUP,

   966   note		= {Paperback edition to *56,

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

   969 @book{winskel93,

   970   author	= {Glynn Winskel},

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

   972   publisher	= MIT,year=1993}

   974 @InCollection{wos-bledsoe,

   975   author	= {Larry Wos},

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

   977   crossref	= {bledsoe-fest},

   978   pages		= {297-342}}

   980 @InProceedings{Zammit:1999:TPHOL,

   981   author = 	 {Vincent Zammit},

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

   983   crossref =     {tphols99}}

   985 %Z

   988 % CROSS REFERENCES

   990 @book{handbk-lics2,

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

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

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

   994   publisher	= {Oxford University Press},

   995   year		= 1992,

   996   volume	= 2}

   998 @book{types93,

   999   editor	= {Henk Barendregt and Tobias Nipkow},

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

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

  1002   year		= {published 1994},

  1003   publisher	= {Springer},

  1004   series	= {LNCS 806}}

  1006 @book{barwise-handbk,

  1007   editor	= {J. Barwise},

  1008   title		= {Handbook of Mathematical Logic},

  1009   booktitle	= {Handbook of Mathematical Logic},

  1010   year		= 1977,

  1011   publisher	= NH}

  1013 @Proceedings{tlca93,

  1014   title		= {Typed Lambda Calculi and Applications},

  1015   booktitle	= {Typed Lambda Calculi and Applications},

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

  1017   year		= 1993,

  1018   publisher	= {Springer},

  1019   series	= {LNCS 664}}

  1021 @book{birtwistle89,

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

  1023   title		= {Current Trends in Hardware Verification and Automated

  1024 		 Theorem Proving},

  1025   booktitle	= {Current Trends in Hardware Verification and Automated

  1026 		 Theorem Proving},

  1027   publisher	= {Springer},

  1028   year		= 1989}

  1030 @book{bledsoe-fest,

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

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

  1033   publisher	= {Kluwer Academic Publishers},

  1034   year		= 1991,

  1035   editor	= {Robert S. Boyer}}

  1037 @Proceedings{cade12,

  1038   editor	= {Alan Bundy},

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

  1040 		  International Conference},

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

  1042 		  International Conference},

  1043   year		= 1994,

  1044   series	= {LNAI 814},

  1045   publisher	= {Springer}}

  1047 @book{types94,

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

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

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

  1051   year		= 1995,

  1052   publisher	= {Springer},

  1053   series	= {LNCS 996}}

  1055 @book{huet-plotkin91,

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

  1057   title		= {Logical Frameworks},

  1058   booktitle	= {Logical Frameworks},

  1059   publisher	= CUP,

  1060   year		= 1991}

  1062 @book{huet-plotkin93,

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

  1064   title		= {Logical Environments},

  1065   booktitle	= {Logical Environments},

  1066   publisher	= CUP,

  1067   year		= 1993}

  1069 @Proceedings{hug93,

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

  1071   title		= {Higher Order Logic Theorem Proving and Its

  1072 		  Applications: HUG '93},

  1073   booktitle	= {Higher Order Logic Theorem Proving and Its

  1074 		  Applications: HUG '93},

  1075   year		= {Published 1994},

  1076   publisher	= {Springer},

  1077   series	= {LNCS 780}}

  1079 @proceedings{colog88,

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

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

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

  1083   year		= {Published 1990},

  1084   publisher	= {Springer},

  1085   organization	= {Estonian Academy of Sciences},

  1086   address	= {Tallinn},

  1087   series	= {LNCS 417}}

  1089 @book{odifreddi90,

  1090   editor	= {P. Odifreddi},

  1091   title		= {Logic and Computer Science},

  1092   booktitle	= {Logic and Computer Science},

  1093   publisher	= {Academic Press},

  1094   year		= 1990}

  1096 @proceedings{extensions91,

  1097   editor	= {Peter Schroeder-Heister},

  1098   title		= {Extensions of Logic Programming},

  1099   booktitle	= {Extensions of Logic Programming},

  1100   year		= 1991,

  1101   series	= {LNAI 475},

  1102   publisher	= {Springer}}

  1104 @proceedings{cade10,

  1105   editor	= {Mark E. Stickel},

  1106   title		= {10th } # CADE,

  1107   booktitle	= {10th } # CADE,

  1108   year		= 1990,

  1109   publisher	= {Springer},

  1110   series	= {LNAI 449}}

  1112 @Proceedings{lics8,

  1113   editor	= {M. Vardi},

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

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

  1116   publisher	= IEEE,

  1117   year		= 1993}

  1119 @book{wos-fest,

  1120   title		= {Automated Reasoning and its Applications:

  1121 			Essays in Honor of {Larry Wos}},

  1122   booktitle	= {Automated Reasoning and its Applications:

  1123 			Essays in Honor of {Larry Wos}},

  1124   publisher	= {MIT Press},

  1125   year		= 1997,

  1126   editor	= {Robert Veroff}}

  1128 @proceedings{fme93,

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

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

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

  1132   year		= 1993,

  1133   publisher	= {Springer},

  1134   series	= {LNCS 670}}

  1136 @Proceedings{tphols96,

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

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

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

  1140   series	= {LNCS 1125},

  1141   year		= 1996}

  1143 @Proceedings{tphols97,

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

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

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

  1147   series	= {LNCS 1275},

  1148   year		= 1997}

  1150 @Proceedings{tphols98,

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

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

  1153   editor	= {Jim Grundy and Malcom Newey},

  1154   series	= {LNCS 1479},

  1155   year		= 1998}

  1157 @Proceedings{tphols99,

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

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

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

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

  1162   series	= {LNCS 1690},

  1163   year		= 1999}

author	wenzelm
	Fri, 17 Mar 2000 22:49:44 +0100
changeset 8505	d6e324af32d7
parent 8284	95c022a866ca
child 8892	24975b9d26ca
permissions	-rw-r--r--