1 % BibTeX database for the Isabelle documentation
3 % Lawrence C Paulson $Id$
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"}
17 @string{CUCL="Comp. Lab., Univ. Camb."}
18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"}
21 @string{AI="Artificial Intelligence"}
22 @string{FAC="Formal Aspects Comput."}
23 @string{JAR="J. Auto. Reas."}
24 @string{JCS="J. Comput. Secur."}
25 @string{JFP="J. Func. Prog."}
26 @string{JLC="J. Logic and Comput."}
27 @string{JLP="J. Logic Prog."}
28 @string{JSC="J. Symb. Comput."}
29 @string{JSL="J. Symb. Logic"}
30 @string{SIGPLAN="{SIGPLAN} Notices"}
33 @string{CADE="International Conference on Automated Deduction"}
34 @string{POPL="Symposium on Principles of Programming Languages"}
35 @string{TYPES="Types for Proofs and Programs"}
40 @incollection{abramsky90,
41 author = {Samson Abramsky},
42 title = {The Lazy Lambda Calculus},
44 editor = {David A. Turner},
45 booktitle = {Research Topics in Functional Programming},
46 publisher = {Addison-Wesley},
49 @Unpublished{abrial93,
50 author = {J. R. Abrial and G. Laffitte},
51 title = {Towards the Mechanization of the Proofs of some Classical
52 Theorems of Set Theory},
57 @incollection{aczel77,
58 author = {Peter Aczel},
59 title = {An Introduction to Inductive Definitions},
61 crossref = {barwise-handbk}}
64 author = {Peter Aczel},
65 title = {Non-Well-Founded Sets},
70 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
71 title = {The {ALF} Proof Editor and Its Proof Engine},
76 author = "Peter Andrews",
77 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
80 series = "Computer Science and Applied Mathematics",
83 @InProceedings{Aspinall:2000:eProof,
84 author = {David Aspinall},
85 title = {Protocols for Interactive {e-Proof}},
86 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
88 note = {Unpublished work-in-progress paper,
89 \url{http://zermelo.dcs.ed.ac.uk/~da/drafts/eproof.ps.gz}}
91 @InProceedings{Aspinall:TACAS:2000,
92 author = {David Aspinall},
93 title = {Proof General: A Generic Tool for Proof Development},
94 booktitle = {ETAPS / TACAS},
100 author = {David Aspinall},
101 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
102 note = {\url{http://www.dcs.ed.ac.uk/home/da/Isamode/}}
106 author = {David Aspinall and others},
107 title = {{P}roof {G}eneral --- {O}rganize your proofs!},
108 note = {\url{http://www.dcs.ed.ac.uk/home/proofgen/}}
113 @incollection{basin91,
114 author = {David Basin and Matt Kaufmann},
115 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
117 crossref = {huet-plotkin91},
120 @InProceedings{Bauer-Wenzel:2000:HB,
121 author = {Gertrud Bauer and Markus Wenzel},
122 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
124 booktitle = {Types for Proofs and Programs: TYPES'99},
125 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
131 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
132 author = {Stefan Berghofer and Markus Wenzel},
133 title = {Inductive datatypes in {HOL} --- lessons learned in
134 {F}ormal-{L}ogic {E}ngineering},
135 crossref = {tphols99}}
137 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
138 title="Introduction to Functional Programming",publisher=PH,year=1988}
141 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
142 Overbeek and Mark Stickel and Lawrence Wos},
143 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
152 author = {Robert S. Boyer and J Strother Moore},
153 title = {A Computational Logic},
154 publisher = {Academic Press},
158 author = {Robert S. Boyer and J Strother Moore},
159 title = {A Computational Logic Handbook},
160 publisher = {Academic Press},
164 author = {N. G. de Bruijn},
165 title = {Lambda Calculus Notation with Nameless Dummies,
166 a Tool for Automatic Formula Manipulation,
167 with Application to the {Church-Rosser Theorem}},
168 journal = {Indag. Math.},
175 @TechReport{camilleri92,
176 author = {J. Camilleri and T. F. Melham},
177 title = {Reasoning with Inductively Defined Relations in the
178 {HOL} Theorem Prover},
185 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
186 title = {Artificial Intelligence Programming},
187 publisher = {Lawrence Erlbaum Associates},
191 author = "Alonzo Church",
192 title = "A Formulation of the Simple Theory of Types",
199 author = {Martin D. Coen},
200 title = {Interactive Program Derivation},
201 school = {University of Cambridge},
202 note = {Computer Laboratory Technical Report 272},
207 author = {R. L. Constable and others},
208 title = {Implementing Mathematics with the Nuprl Proof
210 publisher = Prentice,
215 @Book{davey-priestley,
216 author = {B. A. Davey and H. A. Priestley},
217 title = {Introduction to Lattices and Order},
222 author = {Keith J. Devlin},
223 title = {Fundamentals of Contemporary Set Theory},
224 publisher = {Springer},
228 author = {Michael Dummett},
229 title = {Elements of Intuitionism},
231 publisher = {Oxford University Press}}
233 @incollection{dybjer91,
234 author = {Peter Dybjer},
235 title = {Inductive Sets and Families in {Martin-L\"of's} Type
236 Theory and Their Set-Theoretic Semantics},
237 crossref = {huet-plotkin91},
241 author = {Roy Dyckhoff},
242 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
252 author = {William M. Farmer and Joshua D. Guttman and F. Javier
254 title = {{IMPS}: An Interactive Mathematical Proof System},
261 @InProceedings{felty91a,
262 Author = {Amy Felty},
263 Title = {A Logic Program for Transforming Sequent Proofs to Natural
265 crossref = {extensions91},
269 author = {Jacob Frost},
270 title = {A Case Study of Co-induction in {Isabelle HOL}},
276 %revised version of frost93
278 author = {Jacob Frost},
279 title = {A Case Study of Co-induction in {Isabelle}},
286 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
288 title = {Principles of {OBJ2}},
296 author = {J. H. Gallier},
297 title = {Logic for Computer Science:
298 Foundations of Automatic Theorem Proving},
300 publisher = {Harper \& Row}}
303 author = {Antony Galton},
304 title = {Logic for Information Technology},
308 @InProceedings{gimenez-codifying,
309 author = {Eduardo Gim{\'e}nez},
310 title = {Codifying Guarded Definitions with Recursive Schemes},
311 crossref = {types94},
316 author = {Jean-Yves Girard},
317 title = {Proofs and Types},
320 note = {Translated by Yves LaFont and Paul Taylor}}
323 author = {M. J. C. Gordon and T. F. Melham},
324 title = {Introduction to {HOL}: A Theorem Proving Environment for
330 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
332 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
334 publisher = {Springer},
337 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
338 title={Why we can't have {SML} style datatype declarations in {HOL}},
339 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
340 IFIP TC10/WG10.2 Intl. Workshop, 1992},
341 editor={L.J.M. Claesen and M.J.C. Gordon},
342 publisher=NH,year=1993,pages={561--568}}
344 @InProceedings{gunter-trees,
345 author = {Elsa L. Gunter},
346 title = {A Broader Class of Trees for Recursive Type Definitions for
354 author = {Paul R. Halmos},
355 title = {Naive Set Theory},
356 publisher = {Van Nostrand},
360 author = {Matthew Hennessy},
361 title = {The Semantics of Programming Languages: An Elementary
362 Introduction Using Structural Operational Semantics},
366 @Article{haskell-report,
367 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
368 title = {Report on the Programming Language {Haskell}: A
369 Non-strict, Purely Functional Language},
375 note = {Version 1.2}}
377 @Article{haskell-tutorial,
378 author = {Paul Hudak and Joseph H. Fasel},
379 title = {A Gentle Introduction to {Haskell}},
387 author = {G. P. Huet},
388 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
395 author = {G. P. Huet and B. Lang},
396 title = {Proving and Applying Program Transformations Expressed with
397 Second-Order Patterns},
403 @inproceedings{huet88,
404 author = {G\'erard Huet},
405 title = {Induction Principles Formalized in the {Calculus of
407 booktitle = {Programming of Future Generation Computers},
408 editor = {K. Fuchi and M. Nivat},
411 publisher = {Elsevier}}
413 @InProceedings{Harrison:1996:MizarHOL,
414 author = {J. Harrison},
415 title = {A {Mizar} Mode for {HOL}},
417 crossref = {tphols96}}
421 @InProceedings{kammueller-locales,
422 author = {Florian Kamm{\"u}ller and Markus Wenzel and
423 Lawrence C. Paulson},
424 title = {Locales: A Sectioning Concept for {Isabelle}},
425 crossref = {tphols99}}
428 author={Donald E. Knuth},
429 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
430 publisher={Addison-Wesley},
434 author = {R. E. Korf},
435 title = {Depth-First Iterative-Deepening: an Optimal Admissible
443 author = {Kenneth Kunen},
444 title = {Set Theory: An Introduction to Independence Proofs},
451 author = {Zohar Manna and Richard Waldinger},
452 title = {Deductive Synthesis of the Unification Algorithm},
459 @InProceedings{martin-nipkow,
460 author = {Ursula Martin and Tobias Nipkow},
461 title = {Ordered Rewriting and Confluence},
466 author = {Per Martin-L\"of},
467 title = {Intuitionistic type theory},
469 publisher = {Bibliopolis}}
471 @incollection{melham89,
472 author = {Thomas F. Melham},
473 title = {Automating Recursive Type Definitions in Higher Order
476 crossref = {birtwistle89}}
478 @Article{miller-mixed,
479 Author = {Dale Miller},
480 Title = {Unification Under a Mixed Prefix},
488 author = {Robin Milner},
489 title = {A Theory of Type Polymorphism in Programming},
490 journal = "J. Comp.\ Sys.\ Sci.",
495 @TechReport{milner-ind,
496 author = {Robin Milner},
497 title = {How to Derive Inductions in {LCF}},
498 institution = Edinburgh,
502 @Article{milner-coind,
503 author = {Robin Milner and Mads Tofte},
504 title = {Co-induction in Relational Semantics},
511 author = {Robin Milner},
512 title = {Communication and Concurrency},
513 publisher = Prentice,
516 @PhdThesis{monahan84,
517 author = {Brian Q. Monahan},
518 title = {Data Type Proofs using Edinburgh {LCF}},
519 school = {University of Edinburgh},
522 @article{MuellerNvOS99,
524 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
525 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
527 @Manual{Muzalewski:Mizar,
528 title = {An Outline of {PC} {Mizar}},
529 author = {Micha{\l} Muzalewski},
530 organization = {Fondation of Logic, Mathematics and Informatics
531 --- Mizar Users Group},
533 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
538 @InProceedings{NaraschewskiW-TPHOLs98,
539 author = {Wolfgang Naraschewski and Markus Wenzel},
541 {Object-Oriented Verification based on Record Subtyping in
543 crossref = {tphols98}}
545 @inproceedings{nazareth-nipkow,
546 author = {Dieter Nazareth and Tobias Nipkow},
547 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
548 crossref = {tphols96},
552 @inproceedings{nipkow-W,
553 author = {Wolfgang Naraschewski and Tobias Nipkow},
554 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
555 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
556 editor = {E. Gim\'enez and C. Paulin-Mohring},
557 publisher = Springer,
563 @InCollection{nipkow-sorts93,
564 author = {T. Nipkow},
565 title = {Order-Sorted Polymorphism in {Isabelle}},
566 booktitle = {Logical Environments},
569 editor = {G. Huet and G. Plotkin},
573 @Misc{nipkow-types93,
574 author = {Tobias Nipkow},
575 title = {Axiomatic Type Classes (in {I}sabelle)},
576 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
580 @inproceedings{Nipkow-CR,
581 author = {Tobias Nipkow},
582 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
583 booktitle = {Automated Deduction --- CADE-13},
584 editor = {M. McRobbie and J.K. Slaney},
585 publisher = Springer,
592 @InProceedings{nipkow-patterns,
593 title = {Functional Unification of Higher-Order Patterns},
594 author = {Tobias Nipkow},
597 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
598 keywords = {unification}}
601 author = {Tobias Nipkow},
602 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
608 @manual{isabelle-HOL,
609 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
610 title = {{Isabelle}'s Logics: {HOL}},
611 institution = {Institut f\"ur Informatik, Technische Universi\"at
612 M\"unchen and Computer Laboratory, University of Cambridge},
613 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
615 @article{nipkow-prehofer,
616 author = {Tobias Nipkow and Christian Prehofer},
617 title = {Type Reconstruction for Type Classes},
625 author = {Philippe No{\"e}l},
626 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
634 author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},
635 title = {Programming in {Martin-L\"of}'s Type Theory. An
637 publisher = {Oxford University Press},
642 @Manual{pvs-language,
643 title = {The {PVS} specification language},
644 author = {S. Owre and N. Shankar and J. M. Rushby},
645 organization = {Computer Science Laboratory, SRI International},
646 address = {Menlo Park, CA},
647 note = {Beta release},
650 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
655 @InProceedings{paulin-tlca,
656 author = {Christine Paulin-Mohring},
657 title = {Inductive Definitions in the System {Coq}: Rules and
662 @InProceedings{paulson-CADE,
663 author = {Lawrence C. Paulson},
664 title = {A Fixedpoint Approach to Implementing (Co)Inductive
669 @InProceedings{paulson-COLOG,
670 author = {Lawrence C. Paulson},
671 title = {A Formulation of the Simple Theory of Types (for
674 crossref = {colog88},
675 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
677 @Article{paulson-coind,
678 author = {Lawrence C. Paulson},
679 title = {Mechanizing Coinduction and Corecursion in Higher-Order
688 @manual{isabelle-ref,
689 author = {Lawrence C. Paulson},
690 title = {The {Isabelle} Reference Manual},
692 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
695 author = {Lawrence C. Paulson},
696 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
698 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
700 @article{paulson-found,
701 author = {Lawrence C. Paulson},
702 title = {The Foundation of a Generic Theorem Prover},
708 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
710 %replaces paulson-final
711 @Article{paulson-mscs,
712 author = {Lawrence C. Paulson},
713 title = {Final Coalgebras as Greatest Fixed Points
715 journal = {Mathematical Structures in Computer Science},
720 @InCollection{paulson-generic,
721 author = {Lawrence C. Paulson},
722 title = {Generic Automatic Proof Tools},
723 crossref = {wos-fest},
727 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
728 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
737 @InCollection{paulson-handbook,
738 author = {Lawrence C. Paulson},
739 title = {Designing a Theorem Prover},
740 crossref = {handbk-lics2},
743 @Book{paulson-isa-book,
744 author = {Lawrence C. Paulson},
745 title = {Isabelle: A Generic Theorem Prover},
746 publisher = {Springer},
750 @InCollection{paulson-markt,
751 author = {Lawrence C. Paulson},
752 title = {Tool Support for Logics of Programs},
753 booktitle = {Mathematical Methods in Program Development:
754 Summer School Marktoberdorf 1996},
755 publisher = {Springer},
757 year = {Published 1997},
758 editor = {Manfred Broy},
759 series = {NATO ASI Series F}}
761 %replaces Paulson-ML and paulson91
763 author = {Lawrence C. Paulson},
764 title = {{ML} for the Working Programmer},
769 @article{paulson-natural,
770 author = {Lawrence C. Paulson},
771 title = {Natural Deduction as Higher-order Resolution},
776 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
778 @Article{paulson-set-I,
779 author = {Lawrence C. Paulson},
780 title = {Set Theory for Verification: {I}. {From}
781 Foundations to Functions},
787 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
789 @Article{paulson-set-II,
790 author = {Lawrence C. Paulson},
791 title = {Set Theory for Verification: {II}. {Induction} and
798 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
801 author = {Lawrence C. Paulson},
802 title = {Verifying the Unification Algorithm in {LCF}},
808 %replqces Paulson-LCF
810 author = {Lawrence C. Paulson},
811 title = {Logic and Computation: Interactive proof with Cambridge
816 @incollection{paulson700,
817 author = {Lawrence C. Paulson},
818 title = {{Isabelle}: The Next 700 Theorem Provers},
819 crossref = {odifreddi90},
821 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
823 % replaces paulson-ns and paulson-security
824 @Article{paulson-jcs,
825 author = {Lawrence C. Paulson},
826 title = {The Inductive Approach to Verifying Cryptographic Protocols},
832 @article{pelletier86,
833 author = {F. J. Pelletier},
834 title = {Seventy-five Problems for Testing Automatic Theorem
840 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
843 author = {Andrew M. Pitts},
844 title = {A Co-induction Principle for Recursively Defined Domains},
851 author = {David A. Plaisted},
852 title = {A Sequent-Style Model Elimination Strategy and a Positive
863 author = {Art Quaife},
864 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
874 @TechReport{rasmussen95,
875 author = {Ole Rasmussen},
876 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
878 institution = {Computer Laboratory, University of Cambridge},
882 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
885 author = {Steve Reeves and Michael Clarke},
886 title = {Logic for Computer Science},
887 publisher = {Addison-Wesley},
890 @InProceedings{Rudnicki:1992:MizarOverview,
891 author = {P. Rudnicki},
892 title = {An Overview of the {MIZAR} Project},
893 booktitle = {1992 Workshop on Types for Proofs and Programs},
895 organization = {Chalmers University of Technology},
901 @inproceedings{saaltink-fme,
902 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
903 Dan Craigen and Irwin Meisels},
904 title = {An {EVES} Data Abstraction Example},
908 @inproceedings{slind-tfl,
909 author = {Konrad Slind},
910 title = {Function Definition in Higher Order Logic},
911 booktitle = {Theorem Proving in Higher Order Logics},
912 editor = {J. von Wright and J. Grundy and J. Harrison},
913 publisher = Springer,
920 author = {Patrick Suppes},
921 title = {Axiomatic Set Theory},
925 @InCollection{szasz93,
926 author = {Nora Szasz},
927 title = {A Machine Checked Proof that {Ackermann's} Function is not
928 Primitive Recursive},
929 crossref = {huet-plotkin93},
932 @TechReport{Syme:1997:DECLARE,
934 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
935 institution = {University of Cambridge Computer Laboratory},
940 @PhdThesis{Syme:1998:thesis,
942 title = {Declarative Theorem Proving for Operational Semantics},
943 school = {University of Cambridge},
948 @InProceedings{Syme:1999:TPHOL,
950 title = {Three Tactic Theorem Proving},
951 crossref = {tphols99}}
956 author = {G. Takeuti},
957 title = {Proof Theory},
963 author = {Simon Thompson},
964 title = {Type Theory and Functional Programming},
965 publisher = {Addison-Wesley},
968 @Unpublished{Trybulec:1993:MizarFeatures,
969 author = {A. Trybulec},
970 title = {Some Features of the {Mizar} Language},
971 note = {Presented at a workshop in Turin, Italy},
977 @Unpublished{voelker94,
978 author = {Norbert V\"olker},
979 title = {The Verification of a Timer Program using {Isabelle/HOL}},
980 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
987 author = {Christoph Wedler},
988 title = {Emacs package ``{X-Symbol}''},
989 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
992 @manual{isabelle-sys,
993 author = {Markus Wenzel and Stefan Berghofer},
994 title = {The {Isabelle} System Manual},
995 institution = {TU Munich},
996 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
998 @manual{isabelle-isar-ref,
999 author = {Markus Wenzel},
1000 title = {The {Isabelle/Isar} Reference Manual},
1001 institution = {TU Munich},
1002 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1004 @manual{isabelle-axclass,
1005 author = {Markus Wenzel},
1006 title = {Using Axiomatic Type Classes in {I}sabelle},
1007 institution = {TU Munich},
1009 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1012 @InProceedings{Wenzel:1999:TPHOL,
1013 author = {Markus Wenzel},
1014 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1015 crossref = {tphols99}}
1017 @InProceedings{Wenzel:1997:TPHOL,
1018 author = {Markus Wenzel},
1019 title = {Type Classes and Overloading in Higher-Order Logic},
1020 crossref = {tphols97}}
1025 author = {A. N. Whitehead and B. Russell},
1026 title = {Principia Mathematica},
1029 note = {Paperback edition to *56,
1030 abridged from the 2nd edition (1927)}}
1032 @Misc{Wiedijk:1999:Mizar,
1033 author = {Freek Wiedijk},
1034 title = {Mizar: An Impression},
1035 howpublished = {Unpublished paper},
1037 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1040 @Misc{Wiedijk:2000:MV,
1041 author = {Freek Wiedijk},
1042 title = {The Mathematical Vernacular},
1043 howpublished = {Unpublished paper},
1045 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1049 author = {Glynn Winskel},
1050 title = {The Formal Semantics of Programming Languages},
1051 publisher = MIT,year=1993}
1053 @InCollection{wos-bledsoe,
1054 author = {Larry Wos},
1055 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1056 crossref = {bledsoe-fest},
1059 @InProceedings{Zammit:1999:TPHOL,
1060 author = {Vincent Zammit},
1061 title = {On the Implementation of an Extensible Declarative Proof Language},
1062 crossref = {tphols99}}
1070 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1071 title = {Handbook of Logic in Computer Science},
1072 booktitle = {Handbook of Logic in Computer Science},
1073 publisher = {Oxford University Press},
1078 editor = {Henk Barendregt and Tobias Nipkow},
1079 title = TYPES # {: International Workshop {TYPES '93}},
1080 booktitle = TYPES # {: International Workshop {TYPES '93}},
1081 year = {published 1994},
1082 publisher = {Springer},
1083 series = {LNCS 806}}
1085 @book{barwise-handbk,
1086 editor = {J. Barwise},
1087 title = {Handbook of Mathematical Logic},
1088 booktitle = {Handbook of Mathematical Logic},
1092 @Proceedings{tlca93,
1093 title = {Typed Lambda Calculi and Applications},
1094 booktitle = {Typed Lambda Calculi and Applications},
1095 editor = {M. Bezem and J.F. Groote},
1097 publisher = {Springer},
1098 series = {LNCS 664}}
1101 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1102 title = {Current Trends in Hardware Verification and Automated
1104 booktitle = {Current Trends in Hardware Verification and Automated
1106 publisher = {Springer},
1110 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1111 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1112 publisher = {Kluwer Academic Publishers},
1114 editor = {Robert S. Boyer}}
1116 @Proceedings{cade12,
1117 editor = {Alan Bundy},
1118 title = {Automated Deduction --- {CADE}-12
1119 International Conference},
1120 booktitle = {Automated Deduction --- {CADE}-12
1121 International Conference},
1123 series = {LNAI 814},
1124 publisher = {Springer}}
1127 editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},
1128 title = TYPES # {: International Workshop {TYPES '94}},
1129 booktitle = TYPES # {: International Workshop {TYPES '94}},
1131 publisher = {Springer},
1132 series = {LNCS 996}}
1134 @book{huet-plotkin91,
1135 editor = {{G\'erard} Huet and Gordon Plotkin},
1136 title = {Logical Frameworks},
1137 booktitle = {Logical Frameworks},
1141 @book{huet-plotkin93,
1142 editor = {{G\'erard} Huet and Gordon Plotkin},
1143 title = {Logical Environments},
1144 booktitle = {Logical Environments},
1149 editor = {J. Joyce and C. Seger},
1150 title = {Higher Order Logic Theorem Proving and Its
1151 Applications: HUG '93},
1152 booktitle = {Higher Order Logic Theorem Proving and Its
1153 Applications: HUG '93},
1154 year = {Published 1994},
1155 publisher = {Springer},
1156 series = {LNCS 780}}
1158 @proceedings{colog88,
1159 editor = {P. Martin-L\"of and G. Mints},
1160 title = {COLOG-88: International Conference on Computer Logic},
1161 booktitle = {COLOG-88: International Conference on Computer Logic},
1162 year = {Published 1990},
1163 publisher = {Springer},
1164 organization = {Estonian Academy of Sciences},
1165 address = {Tallinn},
1166 series = {LNCS 417}}
1169 editor = {P. Odifreddi},
1170 title = {Logic and Computer Science},
1171 booktitle = {Logic and Computer Science},
1172 publisher = {Academic Press},
1175 @proceedings{extensions91,
1176 editor = {Peter Schroeder-Heister},
1177 title = {Extensions of Logic Programming},
1178 booktitle = {Extensions of Logic Programming},
1180 series = {LNAI 475},
1181 publisher = {Springer}}
1183 @proceedings{cade10,
1184 editor = {Mark E. Stickel},
1185 title = {10th } # CADE,
1186 booktitle = {10th } # CADE,
1188 publisher = {Springer},
1189 series = {LNAI 449}}
1192 editor = {M. Vardi},
1193 title = {Eighth Annual Symposium on Logic in Computer Science},
1194 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1199 title = {Automated Reasoning and its Applications:
1200 Essays in Honor of {Larry Wos}},
1201 booktitle = {Automated Reasoning and its Applications:
1202 Essays in Honor of {Larry Wos}},
1203 publisher = {MIT Press},
1205 editor = {Robert Veroff}}
1208 editor = {J. C. P. Woodcock and P. G. Larsen},
1209 title = {FME '93: Industrial-Strength Formal Methods},
1210 booktitle = {FME '93: Industrial-Strength Formal Methods},
1212 publisher = {Springer},
1213 series = {LNCS 670}}
1215 @Proceedings{tphols96,
1216 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1217 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1218 editor = {J. von Wright and J. Grundy and J. Harrison},
1219 series = {LNCS 1125},
1222 @Proceedings{tphols97,
1223 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1224 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1225 editor = {Elsa L. Gunter and Amy Felty},
1226 series = {LNCS 1275},
1229 @Proceedings{tphols98,
1230 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1231 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1232 editor = {Jim Grundy and Malcom Newey},
1233 series = {LNCS 1479},
1236 @Proceedings{tphols99,
1237 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1238 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1239 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1240 Paulin, C. and Thery, L.},
1241 series = {LNCS 1690},