wneuper/isa: doc-src/manual.bib@708bd83745c5

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

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

    37 %A

    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}

    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}

    56 @incollection{aczel77,

    57   author	= {Peter Aczel},

    58   title		= {An Introduction to Inductive Definitions},

    59   pages		= {739-782},

    60   crossref	= {barwise-handbk}}

    62 @Book{aczel88,

    63   author	= {Peter Aczel},

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

    65   publisher	= {CSLI},

    66   year		= 1988}

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

    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}

    82 @Misc{isamode,

    83   author =	 {David Aspinall},

    84   title =	 {Isamode},

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

    86 }

    88 @Misc{proofgeneral,

    89   author =	 {David Aspinall and others},

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

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

    92 }

    94 %B

    96 @incollection{basin91,

    97   author	= {David Basin and Matt Kaufmann},

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

    99 		   Comparison},

   100   crossref	= {huet-plotkin91},

   101   pages		= {89-119}}

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

   105   author = 	 {Stefan Berghofer and Markus Wenzel},

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

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

   108   crossref =     {tphols99}}

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

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

   113 @Article{boyer86,

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

   115 		   Overbeek and Mark Stickel and Lawrence Wos},

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

   117 		   Axioms},

   118   journal	= JAR,

   119   year		= 1986,

   120   volume	= 2,

   121   number	= 3,

   122   pages		= {287-327}}

   124 @book{bm79,

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

   126   title		= {A Computational Logic},

   127   publisher	= {Academic Press},

   128   year		= 1979}

   130 @book{bm88book,

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

   132   title		= {A Computational Logic Handbook},

   133   publisher	= {Academic Press},

   134   year		= 1988}

   136 @Article{debruijn72,

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

   138   title		= {Lambda Calculus Notation with Nameless Dummies,

   139 	a Tool for Automatic Formula Manipulation,

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

   141   journal	= {Indag. Math.},

   142   volume	= 34,

   143   pages		= {381-392},

   144   year		= 1972}

   146 %C

   148 @TechReport{camilleri92,

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

   150   title		= {Reasoning with Inductively Defined Relations in the

   151 		 {HOL} Theorem Prover},

   152   institution	= CUCL,

   153   year		= 1992,

   154   number	= 265,

   155   month		= Aug}

   157 @Book{charniak80,

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

   159   title		= {Artificial Intelligence Programming},

   160   publisher	= {Lawrence Erlbaum Associates},

   161   year		= 1980}

   163 @article{church40,

   164   author	= "Alonzo Church",

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

   166   journal	= JSL,

   167   year		= 1940,

   168   volume	= 5,

   169   pages		= "56-68"}

   171 @PhdThesis{coen92,

   172   author	= {Martin D. Coen},

   173   title		= {Interactive Program Derivation},

   174   school	= {University of Cambridge},

   175   note		= {Computer Laboratory Technical Report 272},

   176   month		= nov,

   177   year		= 1992}

   179 @book{constable86,

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

   181   title		= {Implementing Mathematics with the Nuprl Proof

   182 		 Development System},

   183   publisher	= Prentice,

   184   year		= 1986}

   186 %D

   188 @Book{davey-priestley,

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

   190   title		= {Introduction to Lattices and Order},

   191   publisher	= CUP,

   192   year		= 1990}

   194 @Book{devlin79,

   195   author	= {Keith J. Devlin},

   196   title		= {Fundamentals of Contemporary Set Theory},

   197   publisher	= {Springer},

   198   year		= 1979}

   200 @book{dummett,

   201   author	= {Michael Dummett},

   202   title		= {Elements of Intuitionism},

   203   year		= 1977,

   204   publisher	= {Oxford University Press}}

   206 @incollection{dybjer91,

   207   author	= {Peter Dybjer},

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

   209 		  Theory and Their Set-Theoretic Semantics},

   210   crossref	= {huet-plotkin91},

   211   pages		= {280-306}}

   213 @Article{dyckhoff,

   214   author	= {Roy Dyckhoff},

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

   216   journal	= JSL,

   217   year		= 1992,

   218   volume	= 57,

   219   number	= 3,

   220   pages		= {795-807}}

   222 %F

   224 @Article{IMPS,

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

   226 		 Thayer},

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

   228   journal	= JAR,

   229   volume	= 11,

   230   number	= 2,

   231   year		= 1993,

   232   pages		= {213-248}}

   234 @InProceedings{felty91a,

   235   Author	= {Amy Felty},

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

   237 		  Deduction Proofs},

   238   crossref	= {extensions91},

   239   pages		= {157-178}}

   241 @TechReport{frost93,

   242   author	= {Jacob Frost},

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

   244   institution	= CUCL,

   245   number	= 308,

   246   year		= 1993,

   247   month		= Aug}

   249 %revised version of frost93

   250 @TechReport{frost95,

   251   author	= {Jacob Frost},

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

   253   institution	= CUCL,

   254   number	= 359,

   255   year		= 1995,

   256   month		= Feb}

   258 @inproceedings{OBJ,

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

   260 		 and J. Meseguer},

   261   title		= {Principles of {OBJ2}},

   262   booktitle	= POPL,

   263   year		= 1985,

   264   pages		= {52-66}}

   266 %G

   268 @book{gallier86,

   269   author	= {J. H. Gallier},

   270   title		= {Logic for Computer Science:

   271 		Foundations of Automatic Theorem Proving},

   272   year		= 1986,

   273   publisher	= {Harper \& Row}}

   275 @Book{galton90,

   276   author	= {Antony Galton},

   277   title		= {Logic for Information Technology},

   278   publisher	= {Wiley},

   279   year		= 1990}

   281 @InProceedings{gimenez-codifying,

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

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

   284   crossref	= {types94},

   285   pages		= {39-59}

   286 }

   288 @Book{mgordon-hol,

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

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

   291 		 Higher Order Logic},

   292   publisher	= CUP,

   293   year		= 1993}

   295 @book{mgordon79,

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

   297 		 Wadsworth},

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

   299   year		= 1979,

   300   publisher	= {Springer},

   301   series	= {LNCS 78}}

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

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

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

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

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

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

   310 @InProceedings{gunter-trees,

   311   author	= {Elsa L. Gunter},

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

   313 		  {HOL}},

   314   crossref	= {hug93},

   315   pages		= {141-154}}

   317 %H

   319 @Book{halmos60,

   320   author	= {Paul R. Halmos},

   321   title		= {Naive Set Theory},

   322   publisher	= {Van Nostrand},

   323   year		= 1960}

   325 @Book{hennessy90,

   326   author	= {Matthew Hennessy},

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

   328 		  Introduction Using Structural Operational Semantics},

   329   publisher	= {Wiley},

   330   year		= 1990}

   332 @Article{haskell-report,

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

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

   335 		 Non-strict, Purely Functional Language},

   336   journal	= SIGPLAN,

   337   year		= 1992,

   338   volume	= 27,

   339   number	= 5,

   340   month		= May,

   341   note		= {Version 1.2}}

   343 @Article{haskell-tutorial,

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

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

   346   journal	= SIGPLAN,

   347   year		= 1992,

   348   volume	= 27,

   349   number	= 5,

   350   month		= May}

   352 @article{huet75,

   353   author	= {G. P. Huet},

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

   355   journal	= TCS,

   356   volume	= 1,

   357   year		= 1975,

   358   pages		= {27-57}}

   360 @article{huet78,

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

   362   title		= {Proving and Applying Program Transformations Expressed with

   363 			Second-Order Patterns},

   364   journal	= acta,

   365   volume	= 11,

   366   year		= 1978,

   367   pages		= {31-55}}

   369 @inproceedings{huet88,

   370   author	= {G\'erard Huet},

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

   372 		 Constructions}},

   373   booktitle	= {Programming of Future Generation Computers},

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

   375   year		= 1988,

   376   pages		= {205-216},

   377   publisher	= {Elsevier}}

   379 @InProceedings{Harrison:1996:MizarHOL,

   380   author = 	 {J. Harrison},

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

   382   pages =	 {203--220},

   383   crossref =     {tphols96}}

   385 %K

   387 @InProceedings{kammueller-locales,

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

   389                   Lawrence C. Paulson},

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

   391   crossref =	 {tphols99}}

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

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

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

   397 @Book{kunen80,

   398   author	= {Kenneth Kunen},

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

   400   publisher	= NH,

   401   year		= 1980}

   403 %M

   405 @Article{mw81,

   406   author	= {Zohar Manna and Richard Waldinger},

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

   408   journal	= SCP,

   409   year		= 1981,

   410   volume	= 1,

   411   number	= 1,

   412   pages		= {5-48}}

   414 @InProceedings{martin-nipkow,

   415   author	= {Ursula Martin and Tobias Nipkow},

   416   title		= {Ordered Rewriting and Confluence},

   417   crossref	= {cade10},

   418   pages		= {366-380}}

   420 @book{martinlof84,

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

   422   title		= {Intuitionistic type theory},

   423   year		= 1984,

   424   publisher	= {Bibliopolis}}

   426 @incollection{melham89,

   427   author	= {Thomas F. Melham},

   428   title		= {Automating Recursive Type Definitions in Higher Order

   429 		 Logic},

   430   pages		= {341-386},

   431   crossref	= {birtwistle89}}

   433 @Article{miller-mixed,

   434   Author	= {Dale Miller},

   435   Title		= {Unification Under a Mixed Prefix},

   436   journal	= JSC,

   437   volume	= 14,

   438   number	= 4,

   439   pages		= {321-358},

   440   Year		= 1992}

   442 @Article{milner78,

   443   author	= {Robin Milner},

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

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

   446   year		= 1978,

   447   volume	= 17,

   448   pages		= {348-375}}

   450 @TechReport{milner-ind,

   451   author	= {Robin Milner},

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

   453   institution	= Edinburgh,

   454   year		= 1980,

   455   type		= {note}}

   457 @Article{milner-coind,

   458   author	= {Robin Milner and Mads Tofte},

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

   460   journal	= TCS,

   461   year		= 1991,

   462   volume	= 87,

   463   pages		= {209-220}}

   465 @Book{milner89,

   466   author	= {Robin Milner},

   467   title		= {Communication and Concurrency},

   468   publisher	= Prentice,

   469   year		= 1989}

   471 @PhdThesis{monahan84,

   472   author	= {Brian Q. Monahan},

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

   474   school	= {University of Edinburgh},

   475   year		= 1984}

   477 @article{MuellerNvOS99,

   478 author=

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

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

   482 %N

   484 @InProceedings{NaraschewskiW-TPHOLs98,

   485   author	= {Wolfgang Naraschewski and Markus Wenzel},

   486   title		=

   487 {Object-Oriented Verification based on Record Subtyping in

   488                   Higher-Order Logic},

   489   crossref      = {tphols98}}

   491 @inproceedings{nazareth-nipkow,

   492   author	= {Dieter Nazareth and Tobias Nipkow},

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

   494   crossref	= {tphols96},

   495   pages		= {331-345},

   496   year		= 1996}

   498 @inproceedings{nipkow-W,

   499   author	= {Wolfgang Naraschewski and Tobias Nipkow},

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

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

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

   503   publisher	= Springer,

   504   series	= LNCS,

   505   volume	= 1512,

   506   pages		= {317-332},

   507   year		= 1998}

   509 @inproceedings{Nipkow-CR,

   510   author	= {Tobias Nipkow},

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

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

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

   514   publisher	= Springer,

   515   series	= LNCS,

   516   volume	= 1104,

   517   pages		= {733-747},

   518   year		= 1996}

   520 % WAS Nipkow-LICS-93

   521 @InProceedings{nipkow-patterns,

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

   523   author	= {Tobias Nipkow},

   524   pages		= {64-74},

   525   crossref	= {lics8},

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

   527   keywords	= {unification}}

   529 @article{nipkow-IMP,

   530   author	= {Tobias Nipkow},

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

   532   journal	= FAC,

   533   volume	= 10,

   534   pages		= {171-186},

   535   year		= 1998}

   537 @manual{isabelle-HOL,

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

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

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

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

   543 @article{nipkow-prehofer,

   544   author	= {Tobias Nipkow and Christian Prehofer},

   545   title		= {Type Reconstruction for Type Classes},

   546   journal	= JFP,

   547   volume	= 5,

   548   number	= 2,

   549   year		= 1995,

   550   pages		= {201-224}}

   552 @Article{noel,

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

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

   555   journal	= JAR,

   556   volume	= 10,

   557   number	= 1,

   558   pages		= {15-58},

   559   year		= 1993}

   561 @book{nordstrom90,

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

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

   564 		 Introduction},

   565   publisher	= {Oxford University Press},

   566   year		= 1990}

   568 %O

   570 @Manual{pvs-language,

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

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

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

   574   address	= {Menlo Park, CA},

   575   note          = {Beta release},

   576   year		= 1993,

   577   month		= apr,

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

   580 %P

   582 % replaces paulin92

   583 @InProceedings{paulin-tlca,

   584   author	= {Christine Paulin-Mohring},

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

   586 		 Properties},

   587   crossref	= {tlca93},

   588   pages		= {328-345}}

   590 @InProceedings{paulson-CADE,

   591   author	= {Lawrence C. Paulson},

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

   593 		  Definitions},

   594   pages		= {148-161},

   595   crossref	= {cade12}}

   597 @InProceedings{paulson-COLOG,

   598   author	= {Lawrence C. Paulson},

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

   600 		 {Isabelle})},

   601   pages		= {246-274},

   602   crossref	= {colog88},

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

   605 @Article{paulson-coind,

   606   author	= {Lawrence C. Paulson},

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

   608 		  Logic},

   609   journal	= JLC,

   610   year		= 1997,

   611   volume	= 7,

   612   number	= 2,

   613   month		= mar,

   614   pages		= {175-204}}

   616 @manual{isabelle-ref,

   617   author	= {Lawrence C. Paulson},

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

   619   institution	= CUCL}

   621 @manual{isabelle-sys,

   622   author	= {Markus Wenzel and Stefan Berghofer},

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

   624   institution	= CUCL}

   626 @manual{isabelle-ZF,

   627   author	= {Lawrence C. Paulson},

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

   629   institution	= CUCL}

   631 @article{paulson-found,

   632   author	= {Lawrence C. Paulson},

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

   634   journal	= JAR,

   635   volume	= 5,

   636   number	= 3,

   637   pages		= {363-397},

   638   year		= 1989,

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

   641 %replaces paulson-final

   642 @Article{paulson-mscs,

   643   author	= {Lawrence C. Paulson},

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

   645   journal	= {Mathematical Structures in Computer Science},

   646   year		= 1999,

   647   volume	= 9,

   648   note		= {in press}}

   650 @InCollection{paulson-generic,

   651   author	= {Lawrence C. Paulson},

   652   title		= {Generic Automatic Proof Tools},

   653   crossref	= {wos-fest},

   654   chapter	= 3}

   656 @Article{paulson-gr,

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

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

   659 		  Choice},

   660   journal	= JAR,

   661   year		= 1996,

   662   volume	= 17,

   663   number	= 3,

   664   month		= dec,

   665   pages		= {291-323}}

   667 @InCollection{paulson-handbook,

   668   author	= {Lawrence C. Paulson},

   669   title		= {Designing a Theorem Prover},

   670   crossref	= {handbk-lics2},

   671   pages		= {415-475}}

   673 @Book{paulson-isa-book,

   674   author	= {Lawrence C. Paulson},

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

   676   publisher	= {Springer},

   677   year		= 1994,

   678   note		= {LNCS 828}}

   680 @InCollection{paulson-markt,

   681   author	= {Lawrence C. Paulson},

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

   683   booktitle	= {Mathematical Methods in Program Development:

   684                   Summer School Marktoberdorf 1996},

   685   publisher	= {Springer},

   686   pages		= {461-498},

   687   year		= {Published 1997},

   688   editor	= {Manfred Broy},

   689   series	= {NATO ASI Series F}}

   691 %replaces Paulson-ML and paulson91

   692 @book{paulson-ml2,

   693   author	= {Lawrence C. Paulson},

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

   695   year		= 1996,

   696   edition	= {2nd},

   697   publisher	= CUP}

   699 @article{paulson-natural,

   700   author	= {Lawrence C. Paulson},

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

   702   journal	= JLP,

   703   volume	= 3,

   704   pages		= {237-258},

   705   year		= 1986,

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

   708 @Article{paulson-set-I,

   709   author	= {Lawrence C. Paulson},

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

   711 		 Foundations to Functions},

   712   journal	= JAR,

   713   volume	= 11,

   714   number	= 3,

   715   pages		= {353-389},

   716   year		= 1993,

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

   719 @Article{paulson-set-II,

   720   author	= {Lawrence C. Paulson},

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

   722 		 Recursion},

   723   journal	= JAR,

   724   volume	= 15,

   725   number	= 2,

   726   pages		= {167-215},

   727   year		= 1995,

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

   730 @article{paulson85,

   731   author	= {Lawrence C. Paulson},

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

   733   journal	= SCP,

   734   volume	= 5,

   735   pages		= {143-170},

   736   year		= 1985}

   738 %replqces Paulson-LCF

   739 @book{paulson87,

   740   author	= {Lawrence C. Paulson},

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

   742 		 LCF},

   743   year		= 1987,

   744   publisher	= CUP}

   746 @incollection{paulson700,

   747   author	= {Lawrence C. Paulson},

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

   749   crossref	= {odifreddi90},

   750   pages		= {361-386},

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

   753 % replaces paulson-ns and paulson-security

   754 @Article{paulson-jcs,

   755   author	= {Lawrence C. Paulson},

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

   757   journal	= JCS,

   758   year		= 1998,

   759   volume	= 6,

   760   pages		= {85-128}}

   762 @article{pelletier86,

   763   author	= {F. J. Pelletier},

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

   765 		 Provers},

   766   journal	= JAR,

   767   volume	= 2,

   768   pages		= {191-216},

   769   year		= 1986,

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

   772 @Article{pitts94,

   773   author	= {Andrew M. Pitts},

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

   775   journal	= TCS,

   776   volume	= 124,

   777   pages		= {195-219},

   778   year		= 1994}

   780 @Article{plaisted90,

   781   author	= {David A. Plaisted},

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

   783 		 Refinement},

   784   journal	= JAR,

   785   year		= 1990,

   786   volume	= 6,

   787   number	= 4,

   788   pages		= {389-402}}

   790 %Q

   792 @Article{quaife92,

   793   author	= {Art Quaife},

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

   795 		 Theory},

   796   journal	= JAR,

   797   year		= 1992,

   798   volume	= 8,

   799   number	= 1,

   800   pages		= {91-147}}

   802 %R

   804 @TechReport{rasmussen95,

   805   author	= {Ole Rasmussen},

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

   807 		  Experiment},

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

   809   year		= 1995,

   810   number	= 364,

   811   month		= may,

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

   814 @Book{reeves90,

   815   author	= {Steve Reeves and Michael Clarke},

   816   title		= {Logic for Computer Science},

   817   publisher	= {Addison-Wesley},

   818   year		= 1990}

   820 @InProceedings{Rudnicki:1992:MizarOverview,

   821   author = 	 {P. Rudnicki},

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

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

   824   year =	 1992,

   825   organization = {Chalmers University of Technology},

   826   publisher =	 {Bastad}

   827 }

   829 %S

   831 @inproceedings{saaltink-fme,

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

   833 		 Dan Craigen and Irwin Meisels},

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

   835   pages		= {578-596},

   836   crossref	= {fme93}}

   838 @inproceedings{slind-tfl,

   839   author	= {Konrad Slind},

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

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

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

   843   publisher	= Springer,

   844   series	= LNCS,

   845   volume	= 1125,

   846   pages		= {381-397},

   847   year		= 1996}

   849 @book{suppes72,

   850   author	= {Patrick Suppes},

   851   title		= {Axiomatic Set Theory},

   852   year		= 1972,

   853   publisher	= {Dover}}

   855 @InCollection{szasz93,

   856   author	= {Nora Szasz},

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

   858 		  Primitive Recursive},

   859   crossref	= {huet-plotkin93},

   860   pages		= {317-338}}

   862 @TechReport{Syme:1997:DECLARE,

   863   author = 	 {D. Syme},

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

   865   institution =  {University of Cambridge Computer Laboratory},

   866   year = 	 1997,

   867   number =	 416

   868 }

   870 @PhdThesis{Syme:1998:thesis,

   871   author = 	 {D. Syme},

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

   873   school = 	 {University of Cambridge},

   874   year = 	 1998,

   875   note =	 {Submitted}

   876 }

   878 @InProceedings{Syme:1999:TPHOL,

   879   author = 	 {D. Syme},

   880   title = 	 {Three Tactic Theorem Proving},

   881   crossref =     {tphols99}}

   883 %T

   885 @book{takeuti87,

   886   author	= {G. Takeuti},

   887   title		= {Proof Theory},

   888   year		= 1987,

   889   publisher	= NH,

   890   edition	= {2nd}}

   892 @Book{thompson91,

   893   author	= {Simon Thompson},

   894   title		= {Type Theory and Functional Programming},

   895   publisher	= {Addison-Wesley},

   896   year		= 1991}

   898 @Unpublished{Trybulec:1993:MizarFeatures,

   899   author = 	 {A. Trybulec},

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

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

   902   year =	 1993

   903 }

   905 %V

   907 @Unpublished{voelker94,

   908   author	= {Norbert V\"olker},

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

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

   911   year		= 1994,

   912   month		= aug}

   914 %W

   916 @InProceedings{Wenzel:1999:TPHOL,

   917   author = 	 {Markus Wenzel},

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

   919   crossref =     {tphols99}}

   921 @InProceedings{Wenzel:1997:TPHOL,

   922   author = 	 {Markus Wenzel},

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

   924   crossref =     {tphols97}}

   928 @book{principia,

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

   930   title		= {Principia Mathematica},

   931   year		= 1962,

   932   publisher	= CUP,

   933   note		= {Paperback edition to *56,

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

   936 @book{winskel93,

   937   author	= {Glynn Winskel},

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

   939   publisher	= MIT,year=1993}

   941 @InCollection{wos-bledsoe,

   942   author	= {Larry Wos},

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

   944   crossref	= {bledsoe-fest},

   945   pages		= {297-342}}

   948 % CROSS REFERENCES

   950 @book{handbk-lics2,

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

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

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

   954   publisher	= {Oxford University Press},

   955   year		= 1992,

   956   volume	= 2}

   958 @book{types93,

   959   editor	= {Henk Barendregt and Tobias Nipkow},

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

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

   962   year		= {published 1994},

   963   publisher	= {Springer},

   964   series	= {LNCS 806}}

   966 @book{barwise-handbk,

   967   editor	= {J. Barwise},

   968   title		= {Handbook of Mathematical Logic},

   969   booktitle	= {Handbook of Mathematical Logic},

   970   year		= 1977,

   971   publisher	= NH}

   973 @Proceedings{tlca93,

   974   title		= {Typed Lambda Calculi and Applications},

   975   booktitle	= {Typed Lambda Calculi and Applications},

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

   977   year		= 1993,

   978   publisher	= {Springer},

   979   series	= {LNCS 664}}

   981 @book{birtwistle89,

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

   983   title		= {Current Trends in Hardware Verification and Automated

   984 		 Theorem Proving},

   985   booktitle	= {Current Trends in Hardware Verification and Automated

   986 		 Theorem Proving},

   987   publisher	= {Springer},

   988   year		= 1989}

   990 @book{bledsoe-fest,

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

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

   993   publisher	= {Kluwer Academic Publishers},

   994   year		= 1991,

   995   editor	= {Robert S. Boyer}}

   997 @Proceedings{cade12,

   998   editor	= {Alan Bundy},

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

  1000 		  International Conference},

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

  1002 		  International Conference},

  1003   year		= 1994,

  1004   series	= {LNAI 814},

  1005   publisher	= {Springer}}

  1007 @book{types94,

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

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

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

  1011   year		= 1995,

  1012   publisher	= {Springer},

  1013   series	= {LNCS 996}}

  1015 @book{huet-plotkin91,

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

  1017   title		= {Logical Frameworks},

  1018   booktitle	= {Logical Frameworks},

  1019   publisher	= CUP,

  1020   year		= 1991}

  1022 @book{huet-plotkin93,

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

  1024   title		= {Logical Environments},

  1025   booktitle	= {Logical Environments},

  1026   publisher	= CUP,

  1027   year		= 1993}

  1029 @Proceedings{hug93,

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

  1031   title		= {Higher Order Logic Theorem Proving and Its

  1032 		  Applications: HUG '93},

  1033   booktitle	= {Higher Order Logic Theorem Proving and Its

  1034 		  Applications: HUG '93},

  1035   year		= {Published 1994},

  1036   publisher	= {Springer},

  1037   series	= {LNCS 780}}

  1039 @proceedings{colog88,

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

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

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

  1043   year		= {Published 1990},

  1044   publisher	= {Springer},

  1045   organization	= {Estonian Academy of Sciences},

  1046   address	= {Tallinn},

  1047   series	= {LNCS 417}}

  1049 @book{odifreddi90,

  1050   editor	= {P. Odifreddi},

  1051   title		= {Logic and Computer Science},

  1052   booktitle	= {Logic and Computer Science},

  1053   publisher	= {Academic Press},

  1054   year		= 1990}

  1056 @proceedings{extensions91,

  1057   editor	= {Peter Schroeder-Heister},

  1058   title		= {Extensions of Logic Programming},

  1059   booktitle	= {Extensions of Logic Programming},

  1060   year		= 1991,

  1061   series	= {LNAI 475},

  1062   publisher	= {Springer}}

  1064 @proceedings{cade10,

  1065   editor	= {Mark E. Stickel},

  1066   title		= {10th } # CADE,

  1067   booktitle	= {10th } # CADE,

  1068   year		= 1990,

  1069   publisher	= {Springer},

  1070   series	= {LNAI 449}}

  1072 @Proceedings{lics8,

  1073   editor	= {M. Vardi},

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

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

  1076   publisher	= IEEE,

  1077   year		= 1993}

  1079 @book{wos-fest,

  1080   title		= {Automated Reasoning and its Applications:

  1081 			Essays in Honor of {Larry Wos}},

  1082   booktitle	= {Automated Reasoning and its Applications:

  1083 			Essays in Honor of {Larry Wos}},

  1084   publisher	= {MIT Press},

  1085   year		= 1997,

  1086   editor	= {Robert Veroff}}

  1088 @proceedings{fme93,

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

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

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

  1092   year		= 1993,

  1093   publisher	= {Springer},

  1094   series	= {LNCS 670}}

  1096 @Proceedings{tphols96,

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

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

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

  1100   series	= {LNCS 1125},

  1101   year		= 1996}

  1103 @Proceedings{tphols97,

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

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

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

  1107   series	= {LNCS 1275},

  1108   year		= 1997}

  1110 @Proceedings{tphols98,

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

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

  1113   editor	= {Jim Grundy and Malcom Newey},

  1114   series	= {LNCS 1479},

  1115   year		= 1998}

  1117 @Proceedings{tphols99,

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

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

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

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

  1122   series	= {LNCS 1690},

  1123   year		= 1999}

author	wenzelm
	Wed, 25 Aug 1999 18:53:49 +0200
changeset 7350	708bd83745c5
parent 7298	e49024d43c10
child 7858	2cd88d1eec0c
permissions	-rw-r--r--