doc-src/manual.bib
author haftmann
Tue Sep 22 15:39:46 2009 +0200 (2009-09-22)
changeset 32697 72e8608dce54
parent 32572 076da2bd61f4
child 33191 fe3c65d9c577
permissions -rw-r--r--
merged
     1 % BibTeX database for the Isabelle documentation
     2 
     3 %publishers
     4 @string{AP="Academic Press"}
     5 @string{CUP="Cambridge University Press"}
     6 @string{IEEE="{\sc ieee} Computer Society Press"}
     7 @string{LNCS="Lecture Notes in Computer Science"}
     8 @string{MIT="MIT Press"}
     9 @string{NH="North-Holland"}
    10 @string{Prentice="Prentice-Hall"}
    11 @string{PH="Prentice-Hall"}
    12 @string{Springer="Springer-Verlag"}
    13 
    14 %institutions
    15 @string{CUCL="Computer Laboratory, University of Cambridge"}
    16 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}
    17 @string{TUM="Department of Informatics, Technical University of Munich"}
    18 
    19 %journals
    20 @string{AI="Artificial Intelligence"}
    21 @string{FAC="Formal Aspects of Computing"}
    22 @string{JAR="Journal of Automated Reasoning"}
    23 @string{JCS="Journal of Computer Security"}
    24 @string{JFP="Journal of Functional Programming"}
    25 @string{JLC="Journal of Logic and Computation"}
    26 @string{JLP="Journal of Logic Programming"}
    27 @string{JSC="Journal of Symbolic Computation"}
    28 @string{JSL="Journal of Symbolic Logic"}
    29 @string{PROYAL="Proceedings of the Royal Society of London"}
    30 @string{SIGPLAN="{SIGPLAN} Notices"}
    31 @string{TISSEC="ACM Transactions on Information and System Security"}
    32 
    33 %conferences
    34 @string{CADE="International Conference on Automated Deduction"}
    35 @string{POPL="Symposium on Principles of Programming Languages"}
    36 @string{TYPES="Types for Proofs and Programs"}
    37 
    38 
    39 %A
    40 
    41 @incollection{abramsky90,
    42   author	= {Samson Abramsky},
    43   title		= {The Lazy Lambda Calculus},
    44   pages		= {65-116},
    45   editor	= {David A. Turner},
    46   booktitle	= {Research Topics in Functional Programming},
    47   publisher	= {Addison-Wesley},
    48   year		= 1990}
    49 
    50 @Unpublished{abrial93,
    51   author	= {J. R. Abrial and G. Laffitte},
    52   title		= {Towards the Mechanization of the Proofs of some Classical
    53 		  Theorems of Set Theory},
    54   note		= {preprint},
    55   year		= 1993,
    56   month		= Feb}
    57 
    58 @incollection{aczel77,
    59   author	= {Peter Aczel},
    60   title		= {An Introduction to Inductive Definitions},
    61   pages		= {739-782},
    62   crossref	= {barwise-handbk}}
    63 
    64 @Book{aczel88,
    65   author	= {Peter Aczel},
    66   title		= {Non-Well-Founded Sets},
    67   publisher	= {CSLI},
    68   year		= 1988}
    69 
    70 @InProceedings{alf,
    71   author	= {Lena Magnusson and Bengt {Nordstr\"{o}m}},
    72   title		= {The {ALF} Proof Editor and Its Proof Engine},
    73   crossref	= {types93},
    74   pages		= {213-237}}
    75 
    76 @book{andrews86,
    77   author	= "Peter Andrews",
    78   title		= "An Introduction to Mathematical Logic and Type Theory: to Truth
    79 through Proof",
    80   publisher	= AP,
    81   series	= "Computer Science and Applied Mathematics",
    82   year		= 1986}
    83 
    84 @InProceedings{Aspinall:2000:eProof,
    85   author = 	 {David Aspinall},
    86   title = 	 {Protocols for Interactive {e-Proof}},
    87   booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs)},
    88   year =	 2000,
    89   note =	 {Unpublished work-in-progress paper,
    90                   \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
    91 }
    92 
    93 @InProceedings{Aspinall:TACAS:2000,
    94   author = 	 {David Aspinall},
    95   title = 	 {{P}roof {G}eneral: A Generic Tool for Proof Development},
    96   booktitle = 	 {Tools and Algorithms for the Construction and Analysis of
    97                   Systems (TACAS)},
    98   year =	 2000,
    99   publisher	= Springer,
   100   series	= LNCS,
   101   volume	= 1785,
   102   pages = "38--42"
   103 }
   104 
   105 @Misc{isamode,
   106   author =	 {David Aspinall},
   107   title =	 {Isamode --- {U}sing {I}sabelle with {E}macs},
   108   note =	 {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
   109 }
   110 
   111 @Misc{proofgeneral,
   112   author =	 {David Aspinall},
   113   title =	 {{P}roof {G}eneral},
   114   note =	 {\url{http://proofgeneral.inf.ed.ac.uk/}}
   115 }
   116 
   117 %B
   118 
   119 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
   120 title="Term Rewriting and All That",publisher=CUP,year=1998}
   121 
   122 @InCollection{Barendregt-Geuvers:2001,
   123   author = 	 {H. Barendregt and H. Geuvers},
   124   title = 	 {Proof Assistants using Dependent Type Systems},
   125   booktitle = 	 {Handbook of Automated Reasoning},
   126   publisher =	 {Elsevier},
   127   year =	 2001,
   128   editor =	 {A. Robinson and A. Voronkov}
   129 }
   130 
   131 @incollection{basin91,
   132   author	= {David Basin and Matt Kaufmann},
   133   title		= {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
   134 		   Comparison}, 
   135   crossref	= {huet-plotkin91},
   136   pages		= {89-119}}
   137 
   138 @Unpublished{HOL-Library,
   139   author =       {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
   140                   Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
   141                   Markus Wenzel},
   142   title =        {The Supplemental {Isabelle/HOL} Library},
   143   note =         {Part of the Isabelle distribution,
   144                   \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
   145   year =         2002
   146 }
   147 
   148 @InProceedings{Bauer-Wenzel:2000:HB,
   149   author = 	 {Gertrud Bauer and Markus Wenzel},
   150   title = 	 {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
   151       {I}sabelle/{I}sar},
   152   booktitle = 	 {Types for Proofs and Programs: TYPES'99},
   153   editor =       {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
   154                   and Jan Smith},
   155   series =	 {LNCS},
   156   year =	 2000
   157 }
   158 
   159 @InProceedings{Bauer-Wenzel:2001,
   160   author =       {Gertrud Bauer and Markus Wenzel},
   161   title =        {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
   162   crossref =     {tphols2001}}
   163 
   164 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
   165   crossref        = "tphols2000",
   166   title           = "Proof terms for simply typed higher order logic",
   167   author          = "Stefan Berghofer and Tobias Nipkow",
   168   pages           = "38--52"}
   169 
   170 @InProceedings{Berghofer-Nipkow:2002,
   171   author =       {Stefan Berghofer and Tobias Nipkow},
   172   title =        {Executing Higher Order Logic},
   173   booktitle =    {Types for Proofs and Programs: TYPES'2000},
   174   editor =       {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
   175   series =       LNCS,
   176   publisher =    Springer,
   177   volume =       2277,
   178   year =         2002}
   179 
   180 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
   181   author = 	 {Stefan Berghofer and Markus Wenzel},
   182   title = 	 {Inductive datatypes in {HOL} --- lessons learned in
   183                   {F}ormal-{L}ogic {E}ngineering},
   184   crossref =     {tphols99}}
   185 
   186 
   187 @InProceedings{Bezem-Coquand:2005,
   188   author = 	 {M.A. Bezem and T. Coquand},
   189   title = 	 {Automating {Coherent Logic}},
   190   booktitle = {LPAR-12},
   191   editor = 	 {G. Sutcliffe and A. Voronkov},
   192   volume = 	 3835,
   193   series = 	 LNCS,
   194   publisher = Springer}
   195 
   196 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
   197 title="Introduction to Functional Programming",publisher=PH,year=1988}
   198 
   199 @book{Bird-Haskell,author="Richard Bird",
   200 title="Introduction to Functional Programming using Haskell",
   201 publisher=PH,year=1998}
   202 
   203 @Article{boyer86,
   204   author	= {Robert Boyer and Ewing Lusk and William McCune and Ross
   205 		   Overbeek and Mark Stickel and Lawrence Wos},
   206   title		= {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
   207 		   Axioms},
   208   journal	= JAR,
   209   year		= 1986,
   210   volume	= 2,
   211   number	= 3,
   212   pages		= {287-327}}
   213 
   214 @book{bm79,
   215   author	= {Robert S. Boyer and J Strother Moore},
   216   title		= {A Computational Logic},
   217   publisher	= {Academic Press},
   218   year		= 1979}
   219 
   220 @book{bm88book,
   221   author	= {Robert S. Boyer and J Strother Moore},
   222   title		= {A Computational Logic Handbook},
   223   publisher	= {Academic Press},
   224   year		= 1988}
   225 
   226 @Article{debruijn72,
   227   author	= {N. G. de Bruijn},
   228   title		= {Lambda Calculus Notation with Nameless Dummies,
   229 	a Tool for Automatic Formula Manipulation,
   230 	with Application to the {Church-Rosser Theorem}},
   231   journal	= {Indag. Math.},
   232   volume	= 34,
   233   pages		= {381-392},
   234   year		= 1972}
   235 
   236 @InProceedings{bulwahnKN07,
   237   author   = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
   238   title    = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
   239   crossref = {tphols2007},
   240   pages    = {38--53}
   241 }
   242 
   243 @InProceedings{bulwahn-et-al:2008:imperative,
   244   author   = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
   245   title    = {Imperative Functional Programming with {Isabelle/HOL}},
   246   crossref = {tphols2008},
   247 }
   248 %  pages    = {38--53}
   249 
   250 @Article{ban89,
   251   author	= {M. Burrows and M. Abadi and R. M. Needham},
   252   title		= {A Logic of Authentication},
   253   journal	= PROYAL,
   254   year		= 1989,
   255   volume	= 426,
   256   pages		= {233-271}}
   257 
   258 %C
   259 
   260 @TechReport{camilleri92,
   261   author	= {J. Camilleri and T. F. Melham},
   262   title		= {Reasoning with Inductively Defined Relations in the
   263 		 {HOL} Theorem Prover},
   264   institution	= CUCL,
   265   year		= 1992,
   266   number	= 265,
   267   month		= Aug}
   268 
   269 @Book{charniak80,
   270   author	= {E. Charniak and C. K. Riesbeck and D. V. McDermott},
   271   title		= {Artificial Intelligence Programming},
   272   publisher	= {Lawrence Erlbaum Associates},
   273   year		= 1980}
   274 
   275 @article{church40,
   276   author	= "Alonzo Church",
   277   title		= "A Formulation of the Simple Theory of Types",
   278   journal	= JSL,
   279   year		= 1940,
   280   volume	= 5,
   281   pages		= "56-68"}
   282 
   283 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
   284 title="Model Checking",publisher=MIT,year=1999}
   285 
   286 @PhdThesis{coen92,
   287   author	= {Martin D. Coen},
   288   title		= {Interactive Program Derivation},
   289   school	= {University of Cambridge},
   290   note		= {Computer Laboratory Technical Report 272},
   291   month		= nov,
   292   year		= 1992}
   293 
   294 @book{constable86,
   295   author	= {R. L. Constable and others},
   296   title		= {Implementing Mathematics with the Nuprl Proof
   297 		 Development System}, 
   298   publisher	= Prentice,
   299   year		= 1986}
   300 
   301 %D
   302 
   303 @Book{davey-priestley,
   304   author	= {B. A. Davey and H. A. Priestley},
   305   title		= {Introduction to Lattices and Order},
   306   publisher	= CUP,
   307   year		= 1990}
   308 
   309 @Book{devlin79,
   310   author	= {Keith J. Devlin},
   311   title		= {Fundamentals of Contemporary Set Theory},
   312   publisher	= {Springer},
   313   year		= 1979}
   314 
   315 @book{dummett,
   316   author	= {Michael Dummett},
   317   title		= {Elements of Intuitionism},
   318   year		= 1977,
   319   publisher	= {Oxford University Press}}
   320 
   321 @incollection{dybjer91,
   322   author	= {Peter Dybjer},
   323   title		= {Inductive Sets and Families in {Martin-L{\"o}f's} Type
   324 		  Theory and Their Set-Theoretic Semantics}, 
   325   crossref	= {huet-plotkin91},
   326   pages		= {280-306}}
   327 
   328 @Article{dyckhoff,
   329   author	= {Roy Dyckhoff},
   330   title		= {Contraction-Free Sequent Calculi for Intuitionistic Logic},
   331   journal	= JSL,
   332   year		= 1992,
   333   volume	= 57,
   334   number	= 3,
   335   pages		= {795-807}}
   336 
   337 %F
   338 
   339 @Article{IMPS,
   340   author	= {William M. Farmer and Joshua D. Guttman and F. Javier
   341 		 Thayer},
   342   title		= {{IMPS}: An Interactive Mathematical Proof System},
   343   journal	= JAR,
   344   volume	= 11,
   345   number	= 2,
   346   year		= 1993,
   347   pages		= {213-248}}
   348 
   349 @InProceedings{felty91a,
   350   Author	= {Amy Felty},
   351   Title		= {A Logic Program for Transforming Sequent Proofs to Natural
   352 		  Deduction Proofs}, 
   353   crossref	= {extensions91},
   354   pages		= {157-178}}
   355 
   356 @Article{fleuriot-jcm,
   357   author = 	 {Jacques Fleuriot and Lawrence C. Paulson},
   358   title = 	 {Mechanizing Nonstandard Real Analysis},
   359   journal = 	 {LMS Journal of Computation and Mathematics},
   360   year = 	 2000,
   361   volume =	 3,
   362   pages =	 {140-190},
   363   note =	 {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
   364 }
   365 
   366 @TechReport{frost93,
   367   author	= {Jacob Frost},
   368   title		= {A Case Study of Co-induction in {Isabelle HOL}},
   369   institution	= CUCL,
   370   number	= 308,
   371   year		= 1993,
   372   month		= Aug}
   373 
   374 %revised version of frost93
   375 @TechReport{frost95,
   376   author	= {Jacob Frost},
   377   title		= {A Case Study of Co-induction in {Isabelle}},
   378   institution	= CUCL,
   379   number	= 359,
   380   year		= 1995,
   381   month		= Feb}
   382 
   383 @inproceedings{OBJ,
   384   author	= {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
   385 		 and J. Meseguer}, 
   386   title		= {Principles of {OBJ2}},
   387   booktitle	= POPL, 
   388   year		= 1985,
   389   pages		= {52-66}}
   390 
   391 %G
   392 
   393 @book{gallier86,
   394   author	= {J. H. Gallier},
   395   title		= {Logic for Computer Science: 
   396 		Foundations of Automatic Theorem Proving},
   397   year		= 1986,
   398   publisher	= {Harper \& Row}}
   399 
   400 @Book{galton90,
   401   author	= {Antony Galton},
   402   title		= {Logic for Information Technology},
   403   publisher	= {Wiley},
   404   year		= 1990}
   405 
   406 @Article{Gentzen:1935,
   407   author =       {G. Gentzen},
   408   title =        {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
   409   journal =      {Math. Zeitschrift},
   410   year =         1935
   411 }
   412 
   413 @InProceedings{gimenez-codifying,
   414   author	= {Eduardo Gim{\'e}nez},
   415   title		= {Codifying Guarded Definitions with Recursive Schemes},
   416   crossref	= {types94},
   417   pages		= {39-59}
   418 }
   419 
   420 @book{girard89,
   421   author	= {Jean-Yves Girard},
   422   title		= {Proofs and Types},
   423   year		= 1989,
   424   publisher	= CUP, 
   425   note		= {Translated by Yves LaFont and Paul Taylor}}
   426 
   427 @Book{mgordon-hol,
   428   editor	= {M. J. C. Gordon and T. F. Melham},
   429   title		= {Introduction to {HOL}: A Theorem Proving Environment for
   430 		 Higher Order Logic},
   431   publisher	= CUP,
   432   year		= 1993}
   433 
   434 @book{mgordon79,
   435   author	= {Michael J. C. Gordon and Robin Milner and Christopher P.
   436 		 Wadsworth},
   437   title		= {Edinburgh {LCF}: A Mechanised Logic of Computation},
   438   year		= 1979,
   439   publisher	= {Springer},
   440   series	= {LNCS 78}}
   441 
   442 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
   443 title={Why we can't have {SML} style datatype declarations in {HOL}},
   444 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
   445 IFIP TC10/WG10.2 Intl. Workshop, 1992},
   446 editor={L.J.M. Claesen and M.J.C. Gordon},
   447 publisher=NH,year=1993,pages={561--568}}
   448 
   449 @InProceedings{gunter-trees,
   450   author	= {Elsa L. Gunter},
   451   title		= {A Broader Class of Trees for Recursive Type Definitions for
   452 		  {HOL}},
   453   crossref	= {hug93},
   454   pages		= {141-154}}
   455 
   456 %H
   457 
   458 @InProceedings{Haftmann-Wenzel:2006:classes,
   459   author        = {Florian Haftmann and Makarius Wenzel},
   460   title         = {Constructive Type Classes in {Isabelle}},
   461   editor        = {T. Altenkirch and C. McBride},
   462   booktitle     = {Types for Proofs and Programs, TYPES 2006},
   463   publisher     = {Springer},
   464   series        = {LNCS},
   465   volume        = {4502},
   466   year          = {2007}
   467 }
   468 
   469 @TechReport{Haftmann-Nipkow:2007:codegen,
   470   author        = {Florian Haftmann and Tobias Nipkow},
   471   title         = {A Code Generator Framework for {Isabelle/HOL}},
   472   editor        = {Klaus Schneider and Jens Brandt},
   473   booktitle     = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
   474   month         = {08},
   475   year          = {2007},
   476   institution   = {Department of Computer Science, University of Kaiserslautern},
   477   number        = {364/07}
   478 }
   479 
   480 @InProceedings{Haftmann-Wenzel:2009,
   481   author        = {Florian Haftmann and Makarius Wenzel},
   482   title         = {Local theory specifications in {Isabelle/Isar}},
   483   editor        = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
   484   booktitle     = {Types for Proofs and Programs, TYPES 2008},
   485   publisher     = {Springer},
   486   series        = {LNCS},
   487   volume        = {5497},
   488   year          = {2009}
   489 }
   490 
   491 @manual{isabelle-classes,
   492   author        = {Florian Haftmann},
   493   title         = {Haskell-style type classes with {Isabelle}/{Isar}},
   494   institution   = TUM,
   495   note          = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
   496 }
   497 
   498 @manual{isabelle-codegen,
   499   author        = {Florian Haftmann},
   500   title         = {Code generation from Isabelle theories},
   501   institution   = TUM,
   502   note          = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
   503 }
   504 
   505 @Book{halmos60,
   506   author	= {Paul R. Halmos},
   507   title		= {Naive Set Theory},
   508   publisher	= {Van Nostrand},
   509   year		= 1960}
   510 
   511 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
   512 title={Dynamic Logic},publisher=MIT,year=2000}
   513 
   514 @Book{hennessy90,
   515   author	= {Matthew Hennessy},
   516   title		= {The Semantics of Programming Languages: An Elementary
   517 		  Introduction Using Structural Operational Semantics},
   518   publisher	= {Wiley},
   519   year		= 1990}
   520 
   521 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
   522 title={Introduction to Automata Theory, Languages, and Computation.},
   523 publisher={Addison-Wesley},year=1979}
   524 
   525 @Article{haskell-report,
   526   author	= {Paul Hudak and Simon Peyton Jones and Philip Wadler},
   527   title		= {Report on the Programming Language {Haskell}: A
   528 		 Non-strict, Purely Functional Language},
   529   journal	= SIGPLAN,
   530   year		= 1992,
   531   volume	= 27,
   532   number	= 5,
   533   month		= May,
   534   note		= {Version 1.2}}
   535 
   536 @Article{haskell-tutorial,
   537   author	= {Paul Hudak and Joseph H. Fasel},
   538   title		= {A Gentle Introduction to {Haskell}},
   539   journal	= SIGPLAN,
   540   year		= 1992,
   541   volume	= 27,
   542   number	= 5,
   543   month		= May}
   544 
   545 @book{Hudak-Haskell,author={Paul Hudak},
   546 title={The Haskell School of Expression},publisher=CUP,year=2000}
   547 
   548 @article{huet75,
   549   author	= {G. P. Huet},
   550   title		= {A Unification Algorithm for Typed $\lambda$-Calculus},
   551   journal	= TCS,
   552   volume	= 1,
   553   year		= 1975,
   554   pages		= {27-57}}
   555 
   556 @article{huet78,
   557   author	= {G. P. Huet and B. Lang},
   558   title		= {Proving and Applying Program Transformations Expressed with 
   559 			Second-Order Patterns},
   560   journal	= acta,
   561   volume	= 11,
   562   year		= 1978, 
   563   pages		= {31-55}}
   564 
   565 @inproceedings{huet88,
   566   author	= {G{\'e}rard Huet},
   567   title		= {Induction Principles Formalized in the {Calculus of
   568 		 Constructions}}, 
   569   booktitle	= {Programming of Future Generation Computers},
   570   editor	= {K. Fuchi and M. Nivat},
   571   year		= 1988,
   572   pages		= {205-216}, 
   573   publisher	= {Elsevier}}
   574 
   575 @Book{Huth-Ryan-book,
   576   author	= {Michael Huth and Mark Ryan},
   577   title		= {Logic in Computer Science. Modelling and reasoning about systems},
   578   publisher	= CUP,
   579   year		= 2000}
   580 
   581 @InProceedings{Harrison:1996:MizarHOL,
   582   author = 	 {J. Harrison},
   583   title = 	 {A {Mizar} Mode for {HOL}},
   584   pages =	 {203--220},
   585   crossref =     {tphols96}}
   586 
   587 %J
   588 
   589 @article{haskell-revised-report,
   590   author =  {Simon {Peyton Jones} and others},
   591   title =   {The {Haskell} 98 Language and Libraries: The Revised Report},
   592   journal = {Journal of Functional Programming},
   593   volume =  13,
   594   number =  1,
   595   pages =   {0--255},
   596   month =   {Jan},
   597   year =    2003,
   598   note =    {\url{http://www.haskell.org/definition/}}}
   599 
   600 %K
   601 
   602 @InProceedings{kammueller-locales,
   603   author = 	 {Florian Kamm{\"u}ller and Markus Wenzel and 
   604                   Lawrence C. Paulson},
   605   title = 	 {Locales: A Sectioning Concept for {Isabelle}},
   606   crossref =	 {tphols99}}
   607 
   608 @book{Knuth3-75,
   609   author={Donald E. Knuth},
   610   title={The Art of Computer Programming, Volume 3: Sorting and Searching},
   611   publisher={Addison-Wesley},
   612   year=1975}
   613 
   614 @Article{korf85,
   615   author	= {R. E. Korf},
   616   title		= {Depth-First Iterative-Deepening: an Optimal Admissible
   617 		 Tree Search},
   618   journal	= AI,
   619   year		= 1985,
   620   volume	= 27,
   621   pages		= {97-109}}
   622 
   623 @InProceedings{krauss2006,
   624   author   =  {Alexander Krauss},
   625   title    =  {Partial Recursive Functions in {Higher-Order Logic}},
   626   crossref =  {ijcar2006},
   627   pages =     {589--603}}
   628 
   629 @manual{isabelle-function,
   630   author        = {Alexander Krauss},
   631   title         = {Defining Recursive Functions in {Isabelle/HOL}},
   632   institution   = TUM,
   633   note          = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
   634 }
   635 
   636 @Book{kunen80,
   637   author	= {Kenneth Kunen},
   638   title		= {Set Theory: An Introduction to Independence Proofs},
   639   publisher	= NH,
   640   year		= 1980}
   641 
   642 %L
   643 
   644 @manual{OCaml,
   645   author =  {Xavier Leroy and others},
   646   title =   {The Objective Caml system -- Documentation and user's manual},
   647   note =    {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
   648 
   649 @InProceedings{lowe-fdr,
   650   author	= {Gavin Lowe},
   651   title		= {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
   652 		  Protocol using {CSP} and {FDR}},
   653   booktitle = 	 {Tools and Algorithms for the Construction and Analysis 
   654                   of Systems:  second international workshop, TACAS '96},
   655   editor =	 {T. Margaria and B. Steffen},
   656   series =	 {LNCS 1055},
   657   year =	 1996,
   658   publisher =	 {Springer},
   659   pages		= {147-166}}
   660 
   661 %M
   662 
   663 @Article{mw81,
   664   author	= {Zohar Manna and Richard Waldinger},
   665   title		= {Deductive Synthesis of the Unification Algorithm},
   666   journal	= SCP,
   667   year		= 1981,
   668   volume	= 1,
   669   number	= 1,
   670   pages		= {5-48}}
   671 
   672 @InProceedings{martin-nipkow,
   673   author	= {Ursula Martin and Tobias Nipkow},
   674   title		= {Ordered Rewriting and Confluence},
   675   crossref	= {cade10},
   676   pages		= {366-380}}
   677 
   678 @book{martinlof84,
   679   author	= {Per Martin-L{\"o}f},
   680   title		= {Intuitionistic type theory},
   681   year		= 1984,
   682   publisher	= {Bibliopolis}}
   683 
   684 @incollection{melham89,
   685   author	= {Thomas F. Melham},
   686   title		= {Automating Recursive Type Definitions in Higher Order
   687 		 Logic}, 
   688   pages		= {341-386},
   689   crossref	= {birtwistle89}}
   690 
   691 @Article{Miller:1991,
   692   author = 	 {Dale Miller},
   693   title = 	 {A Logic Programming Language with Lambda-Abstraction, Function Variables,
   694     and Simple Unification},
   695   journal = 	 {Journal of Logic and Computation},
   696   year = 	 1991,
   697   volume =	 1,
   698   number =	 4
   699 }
   700 
   701 @Article{miller-mixed,
   702   Author	= {Dale Miller},
   703   Title		= {Unification Under a Mixed Prefix},
   704   journal	= JSC,
   705   volume	= 14,
   706   number	= 4,
   707   pages		= {321-358},
   708   Year		= 1992}
   709 
   710 @Article{milner78,
   711   author	= {Robin Milner},
   712   title		= {A Theory of Type Polymorphism in Programming},
   713   journal	= "J. Comp.\ Sys.\ Sci.",
   714   year		= 1978,
   715   volume	= 17,
   716   pages		= {348-375}}
   717 
   718 @TechReport{milner-ind,
   719   author	= {Robin Milner},
   720   title		= {How to Derive Inductions in {LCF}},
   721   institution	= Edinburgh,
   722   year		= 1980,
   723   type		= {note}}
   724 
   725 @Article{milner-coind,
   726   author	= {Robin Milner and Mads Tofte},
   727   title		= {Co-induction in Relational Semantics},
   728   journal	= TCS,
   729   year		= 1991,
   730   volume	= 87,
   731   pages		= {209-220}}
   732 
   733 @Book{milner89,
   734   author	= {Robin Milner},
   735   title		= {Communication and Concurrency},
   736   publisher	= Prentice,
   737   year		= 1989}
   738 
   739 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
   740 title="The Definition of Standard ML",publisher=MIT,year=1990}
   741 
   742 @PhdThesis{monahan84,
   743   author	= {Brian Q. Monahan},
   744   title		= {Data Type Proofs using Edinburgh {LCF}},
   745   school	= {University of Edinburgh},
   746   year		= 1984}
   747 
   748 @article{MuellerNvOS99,
   749 author=
   750 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
   751 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
   752 
   753 @Manual{Muzalewski:Mizar,
   754   title = 	 {An Outline of {PC} {Mizar}},
   755   author =	 {Micha{\l} Muzalewski},
   756   organization = {Fondation of Logic, Mathematics and Informatics
   757                   --- Mizar Users Group},
   758   year =	 1993,
   759   note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
   760 }
   761 
   762 %N
   763 
   764 @InProceedings{NaraschewskiW-TPHOLs98,
   765   author	= {Wolfgang Naraschewski and Markus Wenzel},
   766   title		= 
   767 {Object-Oriented Verification based on Record Subtyping in
   768                   Higher-Order Logic},
   769   crossref      = {tphols98}}
   770 
   771 @inproceedings{nazareth-nipkow,
   772   author	= {Dieter Nazareth and Tobias Nipkow},
   773   title		= {Formal Verification of Algorithm {W}: The Monomorphic Case},
   774   crossref	= {tphols96},
   775   pages		= {331-345},
   776   year		= 1996}
   777 
   778 @Article{needham-schroeder,
   779   author =       "Roger M. Needham and Michael D. Schroeder",
   780   title =        "Using Encryption for Authentication in Large Networks
   781                  of Computers",
   782   journal =      cacm,
   783   volume =       21,
   784   number =       12,
   785   pages =        "993-999",
   786   month =        dec,
   787   year =         1978}
   788 
   789 @inproceedings{nipkow-W,
   790   author	= {Wolfgang Naraschewski and Tobias Nipkow},
   791   title		= {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
   792   booktitle	= {Types for Proofs and Programs: Intl. Workshop TYPES '96},
   793   editor	= {E. Gim{\'e}nez and C. Paulin-Mohring},
   794   publisher	= Springer,
   795   series	= LNCS,
   796   volume	= 1512,
   797   pages		= {317-332},
   798   year		= 1998}
   799 
   800 @InCollection{nipkow-sorts93,
   801   author = 	 {T. Nipkow},
   802   title = 	 {Order-Sorted Polymorphism in {Isabelle}},
   803   booktitle = 	 {Logical Environments},
   804   publisher =	 CUP,
   805   year =	 1993,
   806   editor =	 {G. Huet and G. Plotkin},
   807   pages =	 {164--188}
   808 }
   809 
   810 @Misc{nipkow-types93,
   811   author =	 {Tobias Nipkow},
   812   title =	 {Axiomatic Type Classes (in {I}sabelle)},
   813   howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
   814   year =	 1993
   815 }
   816 
   817 @inproceedings{Nipkow-CR,
   818   author	= {Tobias Nipkow},
   819   title		= {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
   820   booktitle	= {Automated Deduction --- CADE-13},
   821   editor	= {M. McRobbie and J.K. Slaney},
   822   publisher	= Springer,
   823   series	= LNCS,
   824   volume	= 1104,
   825   pages		= {733-747},
   826   year		= 1996}
   827 
   828 % WAS Nipkow-LICS-93
   829 @InProceedings{nipkow-patterns,
   830   title		= {Functional Unification of Higher-Order Patterns},
   831   author	= {Tobias Nipkow},
   832   pages		= {64-74},
   833   crossref	= {lics8},
   834   url		= {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
   835   keywords	= {unification}}
   836 
   837 @article{nipkow-IMP,
   838   author	= {Tobias Nipkow},
   839   title		= {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
   840   journal	= FAC,
   841   volume	= 10,
   842   pages		= {171-186},
   843   year		= 1998}
   844 
   845 @inproceedings{Nipkow-TYPES02,
   846   author        = {Tobias Nipkow},
   847   title         = {{Structured Proofs in Isar/HOL}},
   848   booktitle     = {Types for Proofs and Programs (TYPES 2002)},
   849   editor        = {H. Geuvers and F. Wiedijk},
   850   year          = 2003,
   851   publisher     = Springer,
   852   series        = LNCS,
   853   volume        = 2646,
   854   pages         = {259-278}}
   855 
   856 @manual{isabelle-HOL,
   857   author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
   858   title		= {{Isabelle}'s Logics: {HOL}},
   859   institution	= {Institut f{\"u}r Informatik, Technische Universi{\"a}t
   860                   M{\"u}nchen and Computer Laboratory, University of Cambridge},
   861   note          = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
   862 
   863 @article{nipkow-prehofer,
   864   author	= {Tobias Nipkow and Christian Prehofer},
   865   title		= {Type Reconstruction for Type Classes},
   866   journal	= JFP,
   867   volume	= 5,
   868   number	= 2,
   869   year		= 1995,
   870   pages		= {201-224}}
   871 
   872 @InProceedings{Nipkow-Prehofer:1993,
   873   author =       {T. Nipkow and C. Prehofer},
   874   title =        {Type checking type classes},
   875   booktitle =    {ACM Symp.\ Principles of Programming Languages},
   876   year =         1993
   877 }
   878 
   879 @Book{isa-tutorial,
   880   author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
   881   title		= {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
   882   publisher	= {Springer},
   883   year		= 2002,
   884   note		= {LNCS Tutorial 2283}}
   885 
   886 @Article{noel,
   887   author	= {Philippe No{\"e}l},
   888   title		= {Experimenting with {Isabelle} in {ZF} Set Theory},
   889   journal	= JAR,
   890   volume	= 10,
   891   number	= 1,
   892   pages		= {15-58},
   893   year		= 1993}
   894 
   895 @book{nordstrom90,
   896   author	= {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
   897   title		= {Programming in {Martin-L{\"o}f}'s Type Theory.  An
   898 		 Introduction}, 
   899   publisher	= {Oxford University Press}, 
   900   year		= 1990}
   901 
   902 %O
   903 
   904 @Manual{pvs-language,
   905   title		= {The {PVS} specification language},
   906   author	= {S. Owre and N. Shankar and J. M. Rushby},
   907   organization	= {Computer Science Laboratory, SRI International},
   908   address	= {Menlo Park, CA},
   909   note          = {Beta release},
   910   year		= 1993,
   911   month		= apr,
   912   url		= {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
   913 
   914 %P
   915 
   916 % replaces paulin92
   917 @InProceedings{paulin-tlca,
   918   author	= {Christine Paulin-Mohring},
   919   title		= {Inductive Definitions in the System {Coq}: Rules and
   920 		 Properties},
   921   crossref	= {tlca93},
   922   pages		= {328-345}}
   923 
   924 @InProceedings{paulson-CADE,
   925   author	= {Lawrence C. Paulson},
   926   title		= {A Fixedpoint Approach to Implementing (Co)Inductive
   927 		  Definitions},
   928   pages		= {148-161},
   929   crossref	= {cade12}}
   930 
   931 @InProceedings{paulson-COLOG,
   932   author	= {Lawrence C. Paulson},
   933   title		= {A Formulation of the Simple Theory of Types (for
   934 		 {Isabelle})}, 
   935   pages		= {246-274},
   936   crossref	= {colog88},
   937   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
   938 
   939 @Article{paulson-coind,
   940   author	= {Lawrence C. Paulson},
   941   title		= {Mechanizing Coinduction and Corecursion in Higher-Order
   942 		  Logic},
   943   journal	= JLC,
   944   year		= 1997,
   945   volume	= 7,
   946   number	= 2,
   947   month		= mar,
   948   pages		= {175-204}}
   949 
   950 @manual{isabelle-intro,
   951   author	= {Lawrence C. Paulson},
   952   title		= {Introduction to {Isabelle}},
   953   institution	= CUCL,
   954   note          = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
   955 
   956 @manual{isabelle-logics,
   957   author	= {Lawrence C. Paulson},
   958   title		= {{Isabelle's} Logics},
   959   institution	= CUCL,
   960   note          = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
   961 
   962 @manual{isabelle-ref,
   963   author	= {Lawrence C. Paulson},
   964   title		= {The {Isabelle} Reference Manual},
   965   institution	= CUCL,
   966   note          = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
   967 
   968 @manual{isabelle-ZF,
   969   author	= {Lawrence C. Paulson},
   970   title		= {{Isabelle}'s Logics: {FOL} and {ZF}},
   971   institution	= CUCL,
   972   note          = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
   973 
   974 @article{paulson-found,
   975   author	= {Lawrence C. Paulson},
   976   title		= {The Foundation of a Generic Theorem Prover},
   977   journal	= JAR,
   978   volume	= 5,
   979   number	= 3,
   980   pages		= {363-397},
   981   year		= 1989,
   982   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
   983 
   984 %replaces paulson-final
   985 @Article{paulson-mscs,
   986   author	= {Lawrence C. Paulson},
   987   title = 	 {Final Coalgebras as Greatest Fixed Points 
   988                   in {ZF} Set Theory},
   989   journal	= {Mathematical Structures in Computer Science},
   990   year		= 1999,
   991   volume	= 9,
   992   number = 5,
   993   pages = {545-567}}
   994 
   995 @InCollection{paulson-generic,
   996   author	= {Lawrence C. Paulson},
   997   title		= {Generic Automatic Proof Tools},
   998   crossref	= {wos-fest},
   999   chapter	= 3}
  1000 
  1001 @Article{paulson-gr,
  1002   author	= {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
  1003   title		= {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
  1004 		  Choice},
  1005   journal	= JAR,
  1006   year		= 1996,
  1007   volume	= 17,
  1008   number	= 3,
  1009   month		= dec,
  1010   pages		= {291-323}}
  1011 
  1012 @InCollection{paulson-fixedpt-milner,
  1013   author	= {Lawrence C. Paulson},
  1014   title		= {A Fixedpoint Approach to (Co)inductive and
  1015                   (Co)datatype Definitions},
  1016   pages		= {187-211},
  1017   crossref	= {milner-fest}}
  1018 
  1019 @book{milner-fest,
  1020   title		= {Proof, Language, and Interaction: 
  1021                    Essays in Honor of {Robin Milner}},
  1022   booktitle	= {Proof, Language, and Interaction: 
  1023                    Essays in Honor of {Robin Milner}},
  1024   publisher	= {MIT Press},
  1025   year		= 2000,
  1026   editor	= {Gordon Plotkin and Colin Stirling and Mads Tofte}}
  1027 
  1028 @InCollection{paulson-handbook,
  1029   author	= {Lawrence C. Paulson},
  1030   title		= {Designing a Theorem Prover},
  1031   crossref	= {handbk-lics2},
  1032   pages		= {415-475}}
  1033 
  1034 @Book{paulson-isa-book,
  1035   author	= {Lawrence C. Paulson},
  1036   title		= {Isabelle: A Generic Theorem Prover},
  1037   publisher	= {Springer},
  1038   year		= 1994,
  1039   note		= {LNCS 828}}
  1040 
  1041 @Book{isabelle-hol-book,
  1042   author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
  1043   title		= {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
  1044   publisher	= {Springer},
  1045   year		= 2002,
  1046   note		= {LNCS 2283}}
  1047 
  1048 @InCollection{paulson-markt,
  1049   author	= {Lawrence C. Paulson},
  1050   title		= {Tool Support for Logics of Programs},
  1051   booktitle	= {Mathematical Methods in Program Development:
  1052                   Summer School Marktoberdorf 1996},
  1053   publisher	= {Springer},
  1054   pages		= {461-498},
  1055   year		= {Published 1997},
  1056   editor	= {Manfred Broy},
  1057   series	= {NATO ASI Series F}}
  1058 
  1059 %replaces Paulson-ML and paulson91
  1060 @book{paulson-ml2,
  1061   author	= {Lawrence C. Paulson},
  1062   title		= {{ML} for the Working Programmer},
  1063   year		= 1996,
  1064   edition	= {2nd},
  1065   publisher	= CUP}
  1066 
  1067 @article{paulson-natural,
  1068   author	= {Lawrence C. Paulson},
  1069   title		= {Natural Deduction as Higher-order Resolution},
  1070   journal	= JLP,
  1071   volume	= 3,
  1072   pages		= {237-258},
  1073   year		= 1986,
  1074   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
  1075 
  1076 @Article{paulson-set-I,
  1077   author	= {Lawrence C. Paulson},
  1078   title		= {Set Theory for Verification: {I}.  {From}
  1079 		 Foundations to Functions},
  1080   journal	= JAR,
  1081   volume	= 11,
  1082   number	= 3,
  1083   pages		= {353-389},
  1084   year		= 1993,
  1085   url		= {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
  1086 
  1087 @Article{paulson-set-II,
  1088   author	= {Lawrence C. Paulson},
  1089   title		= {Set Theory for Verification: {II}.  {Induction} and
  1090 		 Recursion},
  1091   journal	= JAR,
  1092   volume	= 15,
  1093   number	= 2,
  1094   pages		= {167-215},
  1095   year		= 1995,
  1096   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
  1097 
  1098 @article{paulson85,
  1099   author	= {Lawrence C. Paulson},
  1100   title		= {Verifying the Unification Algorithm in {LCF}},
  1101   journal	= SCP,
  1102   volume	= 5,
  1103   pages		= {143-170},
  1104   year		= 1985}
  1105 
  1106 %replaces Paulson-LCF
  1107 @book{paulson87,
  1108   author	= {Lawrence C. Paulson},
  1109   title		= {Logic and Computation: Interactive proof with Cambridge
  1110 		 LCF}, 
  1111   year		= 1987,
  1112   publisher	= CUP}
  1113 
  1114 @incollection{paulson700,
  1115   author	= {Lawrence C. Paulson},
  1116   title		= {{Isabelle}: The Next 700 Theorem Provers},
  1117   crossref	= {odifreddi90},
  1118   pages		= {361-386},
  1119   url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
  1120 
  1121 % replaces paulson-ns and paulson-security
  1122 @Article{paulson-jcs,
  1123   author	= {Lawrence C. Paulson},
  1124   title		= {The Inductive Approach to Verifying Cryptographic Protocols},
  1125   journal	= JCS,
  1126   year		= 1998,
  1127   volume	= 6,
  1128   pages		= {85-128}}
  1129 
  1130 @Article{paulson-tls,
  1131   author = 	 {Lawrence C. Paulson},
  1132   title = 	 {Inductive Analysis of the {Internet} Protocol {TLS}},
  1133   journal = 	 TISSEC,
  1134   month =        aug,
  1135   year = 	 1999,
  1136   volume	= 2,
  1137   number        = 3,
  1138   pages		= {332-351}}
  1139 
  1140 @Article{paulson-yahalom,
  1141   author = 	 {Lawrence C. Paulson},
  1142   title = 	 {Relations Between Secrets:
  1143                   Two Formal Analyses of the {Yahalom} Protocol},
  1144   journal = 	 JCS,
  1145   volume = 9,
  1146   number = 3,
  1147   pages = {197-216},
  1148   year = 2001}}
  1149 
  1150 @article{pelletier86,
  1151   author	= {F. J. Pelletier},
  1152   title		= {Seventy-five Problems for Testing Automatic Theorem
  1153 		 Provers}, 
  1154   journal	= JAR,
  1155   volume	= 2,
  1156   pages		= {191-216},
  1157   year		= 1986,
  1158   note		= {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
  1159 
  1160 @Article{pitts94,  
  1161   author	= {Andrew M. Pitts},
  1162   title		= {A Co-induction Principle for Recursively Defined Domains},
  1163   journal	= TCS,
  1164   volume	= 124, 
  1165   pages		= {195-219},
  1166   year		= 1994} 
  1167 
  1168 @Article{plaisted90,
  1169   author	= {David A. Plaisted},
  1170   title		= {A Sequent-Style Model Elimination Strategy and a Positive
  1171 		 Refinement},
  1172   journal	= JAR,
  1173   year		= 1990,
  1174   volume	= 6,
  1175   number	= 4,
  1176   pages		= {389-402}}
  1177 
  1178 %Q
  1179 
  1180 @Article{quaife92,
  1181   author	= {Art Quaife},
  1182   title		= {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
  1183 		 Theory},
  1184   journal	= JAR,
  1185   year		= 1992,
  1186   volume	= 8,
  1187   number	= 1,
  1188   pages		= {91-147}}
  1189 
  1190 %R
  1191 
  1192 @TechReport{rasmussen95,
  1193   author	= {Ole Rasmussen},
  1194   title		= {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
  1195 		  Experiment},
  1196   institution	= {Computer Laboratory, University of Cambridge},
  1197   year		= 1995,
  1198   number	= 364,
  1199   month		= may,
  1200   url		= {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
  1201 
  1202 @Book{reeves90,
  1203   author	= {Steve Reeves and Michael Clarke},
  1204   title		= {Logic for Computer Science},
  1205   publisher	= {Addison-Wesley},
  1206   year		= 1990}
  1207 
  1208 @book{Rosen-DMA,author={Kenneth H. Rosen},
  1209 title={Discrete Mathematics and Its Applications},
  1210 publisher={McGraw-Hill},year=1998}
  1211 
  1212 @InProceedings{Rudnicki:1992:MizarOverview,
  1213   author = 	 {P. Rudnicki},
  1214   title = 	 {An Overview of the {MIZAR} Project},
  1215   booktitle = 	 {1992 Workshop on Types for Proofs and Programs},
  1216   year =	 1992,
  1217   organization = {Chalmers University of Technology},
  1218   publisher =	 {Bastad}
  1219 }
  1220 
  1221 %S
  1222 
  1223 @inproceedings{saaltink-fme,
  1224   author	= {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
  1225 		 Dan Craigen and Irwin Meisels},
  1226   title		= {An {EVES} Data Abstraction Example}, 
  1227   pages		= {578-596},
  1228   crossref	= {fme93}}
  1229 
  1230 @Article{Schroeder-Heister:1984,
  1231   author =       {Peter Schroeder-Heister},
  1232   title =        {A Natural Extension of Natural Deduction},
  1233   journal =      {Journal of Symbolic Logic},
  1234   year =         1984,
  1235   volume =       49,
  1236   number =       4
  1237 }
  1238 
  1239 @inproceedings{slind-tfl,
  1240   author	= {Konrad Slind},
  1241   title		= {Function Definition in Higher Order Logic},
  1242   crossref  = {tphols96},
  1243   pages		= {381-397}}
  1244 
  1245 @book{suppes72,
  1246   author	= {Patrick Suppes},
  1247   title		= {Axiomatic Set Theory},
  1248   year		= 1972,
  1249   publisher	= {Dover}}
  1250 
  1251 @InCollection{szasz93,
  1252   author	= {Nora Szasz},
  1253   title		= {A Machine Checked Proof that {Ackermann's} Function is not
  1254 		  Primitive Recursive},
  1255   crossref	= {huet-plotkin93},
  1256   pages		= {317-338}}
  1257 
  1258 @TechReport{Syme:1997:DECLARE,
  1259   author = 	 {D. Syme},
  1260   title = 	 {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
  1261   institution =  {University of Cambridge Computer Laboratory},
  1262   year = 	 1997,
  1263   number =	 416
  1264 }
  1265 
  1266 @PhdThesis{Syme:1998:thesis,
  1267   author = 	 {D. Syme},
  1268   title = 	 {Declarative Theorem Proving for Operational Semantics},
  1269   school = 	 {University of Cambridge},
  1270   year = 	 1998,
  1271   note =	 {Submitted}
  1272 }
  1273 
  1274 @InProceedings{Syme:1999:TPHOL,
  1275   author = 	 {D. Syme},
  1276   title = 	 {Three Tactic Theorem Proving},
  1277   crossref =     {tphols99}}
  1278 
  1279 %T
  1280 
  1281 @book{takeuti87,
  1282   author	= {G. Takeuti},
  1283   title		= {Proof Theory},
  1284   year		= 1987,
  1285   publisher	= NH,
  1286   edition	= {2nd}}
  1287 
  1288 @Book{thompson91,
  1289   author	= {Simon Thompson},
  1290   title		= {Type Theory and Functional Programming},
  1291   publisher	= {Addison-Wesley},
  1292   year		= 1991}
  1293 
  1294 @book{Thompson-Haskell,author={Simon Thompson},
  1295 title={Haskell: The Craft of Functional Programming},
  1296 publisher={Addison-Wesley},year=1999}
  1297 
  1298 @Unpublished{Trybulec:1993:MizarFeatures,
  1299   author = 	 {A. Trybulec},
  1300   title = 	 {Some Features of the {Mizar} Language},
  1301   note = 	 {Presented at a workshop in Turin, Italy},
  1302   year =	 1993
  1303 }
  1304 
  1305 %V
  1306 
  1307 @Unpublished{voelker94,
  1308   author	= {Norbert V{\"o}lker},
  1309   title		= {The Verification of a Timer Program using {Isabelle/HOL}},
  1310   url		= {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
  1311   year		= 1994,
  1312   month		= aug}
  1313 
  1314 %W
  1315 
  1316 @inproceedings{wadler89how,
  1317   author        = {P. Wadler and S. Blott},
  1318   title         = {How to make ad-hoc polymorphism less ad-hoc},
  1319   booktitle     = {ACM Symp.\ Principles of Programming Languages},
  1320   year          = 1989
  1321 }
  1322 
  1323 @Misc{x-symbol,
  1324   author =	 {Christoph Wedler},
  1325   title =	 {Emacs package ``{X-Symbol}''},
  1326   note =	 {\url{http://x-symbol.sourceforge.net}}
  1327 }
  1328 
  1329 @manual{isabelle-sys,
  1330   author	= {Markus Wenzel and Stefan Berghofer},
  1331   title		= {The {Isabelle} System Manual},
  1332   institution	= {TU Munich},
  1333   note          = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
  1334 
  1335 @manual{isabelle-isar-ref,
  1336   author	= {Makarius Wenzel},
  1337   title		= {The {Isabelle/Isar} Reference Manual},
  1338   institution	= {TU Munich},
  1339   note          = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
  1340 
  1341 @manual{isabelle-implementation,
  1342   author	= {Makarius Wenzel},
  1343   title		= {The {Isabelle/Isar} Implementation},
  1344   institution	= {TU Munich},
  1345   note          = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
  1346 
  1347 @InProceedings{Wenzel:1999:TPHOL,
  1348   author = 	 {Markus Wenzel},
  1349   title = 	 {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
  1350   crossref =     {tphols99}}
  1351 
  1352 @InProceedings{Wenzel:1997:TPHOL,
  1353   author = 	 {Markus Wenzel},
  1354   title = 	 {Type Classes and Overloading in Higher-Order Logic},
  1355   crossref =     {tphols97}}
  1356 
  1357 @phdthesis{Wenzel-PhD,
  1358   author={Markus Wenzel},
  1359     title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
  1360   school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
  1361   year=2002,
  1362   note =	 {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
  1363 
  1364 @Article{Wenzel-Wiedijk:2002,
  1365   author = 	 {Freek Wiedijk and Markus Wenzel},
  1366   title = 	 {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
  1367   journal = 	 {Journal of Automated Reasoning},
  1368   year = 	 2002,
  1369   volume =	 29,
  1370   number =	 {3-4}
  1371 }
  1372 
  1373 @InCollection{Wenzel-Paulson:2006,
  1374   author = 	 {Markus Wenzel and Lawrence C. Paulson},
  1375   title = 	 {{Isabelle/Isar}},
  1376   booktitle = 	 {The Seventeen Provers of the World},
  1377   year =	 2006,
  1378   editor =	 {F. Wiedijk},
  1379   series =	 {LNAI 3600}
  1380 }
  1381 
  1382 @InCollection{Wenzel:2006:Festschrift,
  1383   author = 	 {Makarius Wenzel},
  1384   title = 	 {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
  1385   booktitle = 	 {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
  1386   publisher =	 {University of Bia{\l}ystok},
  1387   year =	 2007,
  1388   editor =	 {R. Matuszewski and A. Zalewska},
  1389   volume =	 {10(23)},
  1390   series =	 {Studies in Logic, Grammar, and Rhetoric},
  1391   note =         {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
  1392 }
  1393 
  1394 @book{principia,
  1395   author	= {A. N. Whitehead and B. Russell},
  1396   title		= {Principia Mathematica},
  1397   year		= 1962,
  1398   publisher	= CUP, 
  1399   note		= {Paperback edition to *56,
  1400   abridged from the 2nd edition (1927)}}
  1401 
  1402 @Misc{Wiedijk:1999:Mizar,
  1403   author =	 {Freek Wiedijk},
  1404   title =	 {Mizar: An Impression},
  1405   howpublished = {Unpublished paper},
  1406   year =         1999,
  1407   note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
  1408 }
  1409 
  1410 @Misc{Wiedijk:2000:MV,
  1411   author =	 {Freek Wiedijk},
  1412   title =	 {The Mathematical Vernacular},
  1413   howpublished = {Unpublished paper},
  1414   year =         2000,
  1415   note =	 {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
  1416 }
  1417 
  1418 @book{winskel93,
  1419   author	= {Glynn Winskel},
  1420   title		= {The Formal Semantics of Programming Languages},
  1421   publisher	= MIT,year=1993}
  1422 
  1423 @InCollection{wos-bledsoe,
  1424   author	= {Larry Wos},
  1425   title		= {Automated Reasoning and {Bledsoe's} Dream for the Field},
  1426   crossref	= {bledsoe-fest},
  1427   pages		= {297-342}}
  1428 
  1429 @InProceedings{Zammit:1999:TPHOL,
  1430   author = 	 {Vincent Zammit},
  1431   title = 	 {On the Implementation of an Extensible Declarative Proof Language},
  1432   crossref =     {tphols99}}
  1433 
  1434 %Z
  1435 
  1436 
  1437 % CROSS REFERENCES
  1438 
  1439 @book{handbk-lics2,
  1440   editor	= {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
  1441   title		= {Handbook of Logic in Computer Science},
  1442   booktitle	= {Handbook of Logic in Computer Science},
  1443   publisher	= {Oxford University Press},
  1444   year		= 1992,
  1445   volume	= 2}
  1446 
  1447 @book{types93,
  1448   editor	= {Henk Barendregt and Tobias Nipkow},
  1449   title		= TYPES # {: International Workshop {TYPES '93}},
  1450   booktitle	= TYPES # {: International Workshop {TYPES '93}},
  1451   year		= {published 1994},
  1452   publisher	= {Springer},
  1453   series	= {LNCS 806}}
  1454 
  1455 @book{barwise-handbk,
  1456   editor	= {J. Barwise},
  1457   title		= {Handbook of Mathematical Logic},
  1458   booktitle	= {Handbook of Mathematical Logic},
  1459   year		= 1977,
  1460   publisher	= NH}
  1461 
  1462 @Proceedings{tlca93,
  1463   title		= {Typed Lambda Calculi and Applications},
  1464   booktitle	= {Typed Lambda Calculi and Applications},
  1465   editor	= {M. Bezem and J.F. Groote},
  1466   year		= 1993,
  1467   publisher	= {Springer},
  1468   series	= {LNCS 664}}
  1469 
  1470 @book{birtwistle89,
  1471   editor	= {Graham Birtwistle and P. A. Subrahmanyam},
  1472   title		= {Current Trends in Hardware Verification and Automated
  1473 		 Theorem Proving}, 
  1474   booktitle	= {Current Trends in Hardware Verification and Automated
  1475 		 Theorem Proving}, 
  1476   publisher	= {Springer},
  1477   year		= 1989}
  1478 
  1479 @book{bledsoe-fest,
  1480   title		= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
  1481   booktitle	= {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
  1482   publisher	= {Kluwer Academic Publishers},
  1483   year		= 1991,
  1484   editor	= {Robert S. Boyer}}
  1485 
  1486 @Proceedings{cade12,
  1487   editor	= {Alan Bundy},
  1488   title		= {Automated Deduction --- {CADE}-12 
  1489 		  International Conference},
  1490   booktitle	= {Automated Deduction --- {CADE}-12 
  1491 		  International Conference},
  1492   year		= 1994,
  1493   series	= {LNAI 814},
  1494   publisher	= {Springer}}
  1495 
  1496 @book{types94,
  1497   editor	= {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
  1498   title		= TYPES # {: International Workshop {TYPES '94}},
  1499   booktitle	= TYPES # {: International Workshop {TYPES '94}},
  1500   year		= 1995,
  1501   publisher	= {Springer},
  1502   series	= {LNCS 996}}
  1503 
  1504 @book{huet-plotkin91,
  1505   editor	= {{G{\'e}rard} Huet and Gordon Plotkin},
  1506   title		= {Logical Frameworks},
  1507   booktitle	= {Logical Frameworks},
  1508   publisher	= CUP,
  1509   year		= 1991}
  1510 
  1511 @book{huet-plotkin93,
  1512   editor	= {{G{\'e}rard} Huet and Gordon Plotkin},
  1513   title		= {Logical Environments},
  1514   booktitle	= {Logical Environments},
  1515   publisher	= CUP,
  1516   year		= 1993}
  1517 
  1518 @Proceedings{hug93,
  1519   editor	= {J. Joyce and C. Seger},
  1520   title		= {Higher Order Logic Theorem Proving and Its
  1521 		  Applications: HUG '93},
  1522   booktitle	= {Higher Order Logic Theorem Proving and Its
  1523 		  Applications: HUG '93},
  1524   year		= {Published 1994},
  1525   publisher	= {Springer},
  1526   series	= {LNCS 780}}
  1527 
  1528 @proceedings{colog88,
  1529   editor	= {P. Martin-L{\"o}f and G. Mints},
  1530   title		= {COLOG-88: International Conference on Computer Logic},
  1531   booktitle	= {COLOG-88: International Conference on Computer Logic},
  1532   year		= {Published 1990},
  1533   publisher	= {Springer},
  1534   organization	= {Estonian Academy of Sciences},
  1535   address	= {Tallinn},
  1536   series	= {LNCS 417}}
  1537 
  1538 @book{odifreddi90,
  1539   editor	= {P. Odifreddi},
  1540   title		= {Logic and Computer Science},
  1541   booktitle	= {Logic and Computer Science},
  1542   publisher	= {Academic Press},
  1543   year		= 1990}
  1544 
  1545 @proceedings{extensions91,
  1546   editor	= {Peter Schroeder-Heister},
  1547   title		= {Extensions of Logic Programming},
  1548   booktitle	= {Extensions of Logic Programming},
  1549   year		= 1991,
  1550   series	= {LNAI 475}, 
  1551   publisher	= {Springer}}
  1552 
  1553 @proceedings{cade10,
  1554   editor	= {Mark E. Stickel},
  1555   title		= {10th } # CADE,
  1556   booktitle	= {10th } # CADE,
  1557   year		= 1990,
  1558   publisher	= {Springer},
  1559   series	= {LNAI 449}}
  1560 
  1561 @Proceedings{lics8,
  1562   editor	= {M. Vardi},
  1563   title		= {Eighth Annual Symposium on Logic in Computer Science},
  1564   booktitle	= {Eighth Annual Symposium on Logic in Computer Science},
  1565   publisher	= IEEE,
  1566   year		= 1993}
  1567 
  1568 @book{wos-fest,
  1569   title		= {Automated Reasoning and its Applications: 
  1570 			Essays in Honor of {Larry Wos}},
  1571   booktitle	= {Automated Reasoning and its Applications: 
  1572 			Essays in Honor of {Larry Wos}},
  1573   publisher	= {MIT Press},
  1574   year		= 1997,
  1575   editor	= {Robert Veroff}}
  1576 
  1577 @proceedings{fme93,
  1578   editor	= {J. C. P. Woodcock and P. G. Larsen},
  1579   title		= {FME '93: Industrial-Strength Formal Methods},
  1580   booktitle	= {FME '93: Industrial-Strength Formal Methods},
  1581   year		= 1993,
  1582   publisher	= Springer,
  1583   series	= LNCS,
  1584   volume        = 670}
  1585 
  1586 @Proceedings{tphols96,
  1587   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
  1588   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
  1589   editor	= {J. von Wright and J. Grundy and J. Harrison},
  1590   publisher     = Springer,
  1591   series	= LNCS,
  1592   volume        = 1125,
  1593   year		= 1996}
  1594 
  1595 @Proceedings{tphols97,
  1596   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
  1597   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
  1598   editor	= {Elsa L. Gunter and Amy Felty},
  1599   publisher     = Springer,
  1600   series	= LNCS,
  1601   volume        = 1275,
  1602   year		= 1997}
  1603 
  1604 @Proceedings{tphols98,
  1605   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
  1606   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
  1607   editor	= {Jim Grundy and Malcom Newey},
  1608   publisher     = Springer,
  1609   series	= LNCS,
  1610   volume        = 1479,
  1611   year		= 1998}
  1612 
  1613 @Proceedings{tphols99,
  1614   title		= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
  1615   booktitle	= {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
  1616   editor	= {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
  1617                   Paulin, C. and Thery, L.},
  1618   publisher     = Springer,
  1619   series	= LNCS,
  1620   volume        = 1690,
  1621   year		= 1999}
  1622 
  1623 @Proceedings{tphols2000,
  1624   title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
  1625   booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
  1626   editor        = {J. Harrison and M. Aagaard},
  1627   publisher     = Springer,
  1628   series        = LNCS,
  1629   volume        = 1869,
  1630   year          = 2000}
  1631 
  1632 @Proceedings{tphols2001,
  1633   title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
  1634   booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
  1635   editor        = {R. J. Boulton and P. B. Jackson},
  1636   publisher     = Springer,
  1637   series        = LNCS,
  1638   volume        = 2152,
  1639   year          = 2001}
  1640 
  1641 @Proceedings{ijcar2006,
  1642   title         = {Automated Reasoning: {IJCAR} 2006},
  1643   booktitle     = {Automated Reasoning: {IJCAR} 2006},
  1644   editor        = {U. Furbach and N. Shankar},
  1645   publisher     = Springer,
  1646   series        = LNCS,
  1647   volume        = 4130,
  1648   year          = 2006}
  1649 
  1650 @Proceedings{tphols2007,
  1651   title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
  1652   booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
  1653   editor        = {K. Schneider and J. Brandt},
  1654   publisher     = Springer,
  1655   series        = LNCS,
  1656   volume        = 4732,
  1657   year          = 2007}
  1658 
  1659 @Proceedings{tphols2008,
  1660   title         = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
  1661   booktitle     = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
  1662   publisher     = Springer,
  1663   series        = LNCS,
  1664   year          = 2008}
  1665 %  editor        =
  1666 %  volume        = 4732,
  1667 
  1668 @unpublished{classes_modules,
  1669   title         = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
  1670   author        = {Stefan Wehr et. al.}
  1671 }