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://www.proofgeneral.org/~da/drafts/eproof.ps.gz}}
91 @InProceedings{Aspinall:TACAS:2000,
92 author = {David Aspinall},
93 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
94 booktitle = {ETAPS / TACAS},
99 author = {David Aspinall},
100 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
101 note = {\url{http://www.proofgeneral.org/~da/Isamode/}}
105 author = {David Aspinall and others},
106 title = {{P}roof {G}eneral --- {O}rganize your proofs!},
107 note = {\url{http://www.proofgeneral.org}}
112 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
113 title="Term Rewriting and All That",publisher=CUP,year=1998}
115 @incollection{basin91,
116 author = {David Basin and Matt Kaufmann},
117 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
119 crossref = {huet-plotkin91},
122 @InProceedings{Bauer-Wenzel:2000:HB,
123 author = {Gertrud Bauer and Markus Wenzel},
124 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
126 booktitle = {Types for Proofs and Programs: TYPES'99},
127 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
133 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
134 author = {Stefan Berghofer and Markus Wenzel},
135 title = {Inductive datatypes in {HOL} --- lessons learned in
136 {F}ormal-{L}ogic {E}ngineering},
137 crossref = {tphols99}}
139 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
140 title="Introduction to Functional Programming",publisher=PH,year=1988}
143 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
144 Overbeek and Mark Stickel and Lawrence Wos},
145 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
154 author = {Robert S. Boyer and J Strother Moore},
155 title = {A Computational Logic},
156 publisher = {Academic Press},
160 author = {Robert S. Boyer and J Strother Moore},
161 title = {A Computational Logic Handbook},
162 publisher = {Academic Press},
166 author = {N. G. de Bruijn},
167 title = {Lambda Calculus Notation with Nameless Dummies,
168 a Tool for Automatic Formula Manipulation,
169 with Application to the {Church-Rosser Theorem}},
170 journal = {Indag. Math.},
177 @TechReport{camilleri92,
178 author = {J. Camilleri and T. F. Melham},
179 title = {Reasoning with Inductively Defined Relations in the
180 {HOL} Theorem Prover},
187 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
188 title = {Artificial Intelligence Programming},
189 publisher = {Lawrence Erlbaum Associates},
193 author = "Alonzo Church",
194 title = "A Formulation of the Simple Theory of Types",
201 author = {Martin D. Coen},
202 title = {Interactive Program Derivation},
203 school = {University of Cambridge},
204 note = {Computer Laboratory Technical Report 272},
209 author = {R. L. Constable and others},
210 title = {Implementing Mathematics with the Nuprl Proof
212 publisher = Prentice,
217 @Book{davey-priestley,
218 author = {B. A. Davey and H. A. Priestley},
219 title = {Introduction to Lattices and Order},
224 author = {Keith J. Devlin},
225 title = {Fundamentals of Contemporary Set Theory},
226 publisher = {Springer},
230 author = {Michael Dummett},
231 title = {Elements of Intuitionism},
233 publisher = {Oxford University Press}}
235 @incollection{dybjer91,
236 author = {Peter Dybjer},
237 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
238 Theory and Their Set-Theoretic Semantics},
239 crossref = {huet-plotkin91},
243 author = {Roy Dyckhoff},
244 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
254 author = {William M. Farmer and Joshua D. Guttman and F. Javier
256 title = {{IMPS}: An Interactive Mathematical Proof System},
263 @InProceedings{felty91a,
264 Author = {Amy Felty},
265 Title = {A Logic Program for Transforming Sequent Proofs to Natural
267 crossref = {extensions91},
271 author = {Jacob Frost},
272 title = {A Case Study of Co-induction in {Isabelle HOL}},
278 %revised version of frost93
280 author = {Jacob Frost},
281 title = {A Case Study of Co-induction in {Isabelle}},
288 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
290 title = {Principles of {OBJ2}},
298 author = {J. H. Gallier},
299 title = {Logic for Computer Science:
300 Foundations of Automatic Theorem Proving},
302 publisher = {Harper \& Row}}
305 author = {Antony Galton},
306 title = {Logic for Information Technology},
310 @InProceedings{gimenez-codifying,
311 author = {Eduardo Gim{\'e}nez},
312 title = {Codifying Guarded Definitions with Recursive Schemes},
313 crossref = {types94},
318 author = {Jean-Yves Girard},
319 title = {Proofs and Types},
322 note = {Translated by Yves LaFont and Paul Taylor}}
325 author = {M. J. C. Gordon and T. F. Melham},
326 title = {Introduction to {HOL}: A Theorem Proving Environment for
332 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
334 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
336 publisher = {Springer},
339 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
340 title={Why we can't have {SML} style datatype declarations in {HOL}},
341 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
342 IFIP TC10/WG10.2 Intl. Workshop, 1992},
343 editor={L.J.M. Claesen and M.J.C. Gordon},
344 publisher=NH,year=1993,pages={561--568}}
346 @InProceedings{gunter-trees,
347 author = {Elsa L. Gunter},
348 title = {A Broader Class of Trees for Recursive Type Definitions for
356 author = {Paul R. Halmos},
357 title = {Naive Set Theory},
358 publisher = {Van Nostrand},
362 author = {Matthew Hennessy},
363 title = {The Semantics of Programming Languages: An Elementary
364 Introduction Using Structural Operational Semantics},
368 @Article{haskell-report,
369 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
370 title = {Report on the Programming Language {Haskell}: A
371 Non-strict, Purely Functional Language},
377 note = {Version 1.2}}
379 @Article{haskell-tutorial,
380 author = {Paul Hudak and Joseph H. Fasel},
381 title = {A Gentle Introduction to {Haskell}},
389 author = {G. P. Huet},
390 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
397 author = {G. P. Huet and B. Lang},
398 title = {Proving and Applying Program Transformations Expressed with
399 Second-Order Patterns},
405 @inproceedings{huet88,
406 author = {G{\'e}rard Huet},
407 title = {Induction Principles Formalized in the {Calculus of
409 booktitle = {Programming of Future Generation Computers},
410 editor = {K. Fuchi and M. Nivat},
413 publisher = {Elsevier}}
415 @Book{Huth-Ryan-book,
416 author = {Michael Huth and Mark Ryan},
417 title = {Logic in Computer Science. Modelling and reasoning about systems},
421 @InProceedings{Harrison:1996:MizarHOL,
422 author = {J. Harrison},
423 title = {A {Mizar} Mode for {HOL}},
425 crossref = {tphols96}}
429 @InProceedings{kammueller-locales,
430 author = {Florian Kamm{\"u}ller and Markus Wenzel and
431 Lawrence C. Paulson},
432 title = {Locales: A Sectioning Concept for {Isabelle}},
433 crossref = {tphols99}}
436 author={Donald E. Knuth},
437 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
438 publisher={Addison-Wesley},
442 author = {R. E. Korf},
443 title = {Depth-First Iterative-Deepening: an Optimal Admissible
451 author = {Kenneth Kunen},
452 title = {Set Theory: An Introduction to Independence Proofs},
459 author = {Zohar Manna and Richard Waldinger},
460 title = {Deductive Synthesis of the Unification Algorithm},
467 @InProceedings{martin-nipkow,
468 author = {Ursula Martin and Tobias Nipkow},
469 title = {Ordered Rewriting and Confluence},
474 author = {Per Martin-L{\"o}f},
475 title = {Intuitionistic type theory},
477 publisher = {Bibliopolis}}
479 @incollection{melham89,
480 author = {Thomas F. Melham},
481 title = {Automating Recursive Type Definitions in Higher Order
484 crossref = {birtwistle89}}
486 @Article{miller-mixed,
487 Author = {Dale Miller},
488 Title = {Unification Under a Mixed Prefix},
496 author = {Robin Milner},
497 title = {A Theory of Type Polymorphism in Programming},
498 journal = "J. Comp.\ Sys.\ Sci.",
503 @TechReport{milner-ind,
504 author = {Robin Milner},
505 title = {How to Derive Inductions in {LCF}},
506 institution = Edinburgh,
510 @Article{milner-coind,
511 author = {Robin Milner and Mads Tofte},
512 title = {Co-induction in Relational Semantics},
519 author = {Robin Milner},
520 title = {Communication and Concurrency},
521 publisher = Prentice,
524 @PhdThesis{monahan84,
525 author = {Brian Q. Monahan},
526 title = {Data Type Proofs using Edinburgh {LCF}},
527 school = {University of Edinburgh},
530 @article{MuellerNvOS99,
532 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
533 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
535 @Manual{Muzalewski:Mizar,
536 title = {An Outline of {PC} {Mizar}},
537 author = {Micha{\l} Muzalewski},
538 organization = {Fondation of Logic, Mathematics and Informatics
539 --- Mizar Users Group},
541 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
546 @InProceedings{NaraschewskiW-TPHOLs98,
547 author = {Wolfgang Naraschewski and Markus Wenzel},
549 {Object-Oriented Verification based on Record Subtyping in
551 crossref = {tphols98}}
553 @inproceedings{nazareth-nipkow,
554 author = {Dieter Nazareth and Tobias Nipkow},
555 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
556 crossref = {tphols96},
560 @inproceedings{nipkow-W,
561 author = {Wolfgang Naraschewski and Tobias Nipkow},
562 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
563 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
564 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
565 publisher = Springer,
571 @InCollection{nipkow-sorts93,
572 author = {T. Nipkow},
573 title = {Order-Sorted Polymorphism in {Isabelle}},
574 booktitle = {Logical Environments},
577 editor = {G. Huet and G. Plotkin},
581 @Misc{nipkow-types93,
582 author = {Tobias Nipkow},
583 title = {Axiomatic Type Classes (in {I}sabelle)},
584 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
588 @inproceedings{Nipkow-CR,
589 author = {Tobias Nipkow},
590 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
591 booktitle = {Automated Deduction --- CADE-13},
592 editor = {M. McRobbie and J.K. Slaney},
593 publisher = Springer,
600 @InProceedings{nipkow-patterns,
601 title = {Functional Unification of Higher-Order Patterns},
602 author = {Tobias Nipkow},
605 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
606 keywords = {unification}}
609 author = {Tobias Nipkow},
610 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
616 @manual{isabelle-HOL,
617 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
618 title = {{Isabelle}'s Logics: {HOL}},
619 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
620 M{\"u}nchen and Computer Laboratory, University of Cambridge},
621 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
623 @article{nipkow-prehofer,
624 author = {Tobias Nipkow and Christian Prehofer},
625 title = {Type Reconstruction for Type Classes},
633 author = {Philippe No{\"e}l},
634 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
642 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
643 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
645 publisher = {Oxford University Press},
650 @Manual{pvs-language,
651 title = {The {PVS} specification language},
652 author = {S. Owre and N. Shankar and J. M. Rushby},
653 organization = {Computer Science Laboratory, SRI International},
654 address = {Menlo Park, CA},
655 note = {Beta release},
658 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
663 @InProceedings{paulin-tlca,
664 author = {Christine Paulin-Mohring},
665 title = {Inductive Definitions in the System {Coq}: Rules and
670 @InProceedings{paulson-CADE,
671 author = {Lawrence C. Paulson},
672 title = {A Fixedpoint Approach to Implementing (Co)Inductive
677 @InProceedings{paulson-COLOG,
678 author = {Lawrence C. Paulson},
679 title = {A Formulation of the Simple Theory of Types (for
682 crossref = {colog88},
683 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
685 @Article{paulson-coind,
686 author = {Lawrence C. Paulson},
687 title = {Mechanizing Coinduction and Corecursion in Higher-Order
696 @manual{isabelle-ref,
697 author = {Lawrence C. Paulson},
698 title = {The {Isabelle} Reference Manual},
700 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
703 author = {Lawrence C. Paulson},
704 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
706 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
708 @article{paulson-found,
709 author = {Lawrence C. Paulson},
710 title = {The Foundation of a Generic Theorem Prover},
716 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
718 %replaces paulson-final
719 @Article{paulson-mscs,
720 author = {Lawrence C. Paulson},
721 title = {Final Coalgebras as Greatest Fixed Points
723 journal = {Mathematical Structures in Computer Science},
728 @InCollection{paulson-generic,
729 author = {Lawrence C. Paulson},
730 title = {Generic Automatic Proof Tools},
731 crossref = {wos-fest},
735 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
736 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
745 @InCollection{paulson-handbook,
746 author = {Lawrence C. Paulson},
747 title = {Designing a Theorem Prover},
748 crossref = {handbk-lics2},
751 @Book{paulson-isa-book,
752 author = {Lawrence C. Paulson},
753 title = {Isabelle: A Generic Theorem Prover},
754 publisher = {Springer},
758 @InCollection{paulson-markt,
759 author = {Lawrence C. Paulson},
760 title = {Tool Support for Logics of Programs},
761 booktitle = {Mathematical Methods in Program Development:
762 Summer School Marktoberdorf 1996},
763 publisher = {Springer},
765 year = {Published 1997},
766 editor = {Manfred Broy},
767 series = {NATO ASI Series F}}
769 %replaces Paulson-ML and paulson91
771 author = {Lawrence C. Paulson},
772 title = {{ML} for the Working Programmer},
777 @article{paulson-natural,
778 author = {Lawrence C. Paulson},
779 title = {Natural Deduction as Higher-order Resolution},
784 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
786 @Article{paulson-set-I,
787 author = {Lawrence C. Paulson},
788 title = {Set Theory for Verification: {I}. {From}
789 Foundations to Functions},
795 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
797 @Article{paulson-set-II,
798 author = {Lawrence C. Paulson},
799 title = {Set Theory for Verification: {II}. {Induction} and
806 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
809 author = {Lawrence C. Paulson},
810 title = {Verifying the Unification Algorithm in {LCF}},
816 %replqces Paulson-LCF
818 author = {Lawrence C. Paulson},
819 title = {Logic and Computation: Interactive proof with Cambridge
824 @incollection{paulson700,
825 author = {Lawrence C. Paulson},
826 title = {{Isabelle}: The Next 700 Theorem Provers},
827 crossref = {odifreddi90},
829 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
831 % replaces paulson-ns and paulson-security
832 @Article{paulson-jcs,
833 author = {Lawrence C. Paulson},
834 title = {The Inductive Approach to Verifying Cryptographic Protocols},
840 @article{pelletier86,
841 author = {F. J. Pelletier},
842 title = {Seventy-five Problems for Testing Automatic Theorem
848 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
851 author = {Andrew M. Pitts},
852 title = {A Co-induction Principle for Recursively Defined Domains},
859 author = {David A. Plaisted},
860 title = {A Sequent-Style Model Elimination Strategy and a Positive
871 author = {Art Quaife},
872 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
882 @TechReport{rasmussen95,
883 author = {Ole Rasmussen},
884 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
886 institution = {Computer Laboratory, University of Cambridge},
890 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
893 author = {Steve Reeves and Michael Clarke},
894 title = {Logic for Computer Science},
895 publisher = {Addison-Wesley},
898 @InProceedings{Rudnicki:1992:MizarOverview,
899 author = {P. Rudnicki},
900 title = {An Overview of the {MIZAR} Project},
901 booktitle = {1992 Workshop on Types for Proofs and Programs},
903 organization = {Chalmers University of Technology},
909 @inproceedings{saaltink-fme,
910 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
911 Dan Craigen and Irwin Meisels},
912 title = {An {EVES} Data Abstraction Example},
916 @inproceedings{slind-tfl,
917 author = {Konrad Slind},
918 title = {Function Definition in Higher Order Logic},
919 booktitle = {Theorem Proving in Higher Order Logics},
920 editor = {J. von Wright and J. Grundy and J. Harrison},
921 publisher = Springer,
928 author = {Patrick Suppes},
929 title = {Axiomatic Set Theory},
933 @InCollection{szasz93,
934 author = {Nora Szasz},
935 title = {A Machine Checked Proof that {Ackermann's} Function is not
936 Primitive Recursive},
937 crossref = {huet-plotkin93},
940 @TechReport{Syme:1997:DECLARE,
942 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
943 institution = {University of Cambridge Computer Laboratory},
948 @PhdThesis{Syme:1998:thesis,
950 title = {Declarative Theorem Proving for Operational Semantics},
951 school = {University of Cambridge},
956 @InProceedings{Syme:1999:TPHOL,
958 title = {Three Tactic Theorem Proving},
959 crossref = {tphols99}}
964 author = {G. Takeuti},
965 title = {Proof Theory},
971 author = {Simon Thompson},
972 title = {Type Theory and Functional Programming},
973 publisher = {Addison-Wesley},
976 @Unpublished{Trybulec:1993:MizarFeatures,
977 author = {A. Trybulec},
978 title = {Some Features of the {Mizar} Language},
979 note = {Presented at a workshop in Turin, Italy},
985 @Unpublished{voelker94,
986 author = {Norbert V{\"o}lker},
987 title = {The Verification of a Timer Program using {Isabelle/HOL}},
988 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
995 author = {Christoph Wedler},
996 title = {Emacs package ``{X-Symbol}''},
997 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1000 @manual{isabelle-sys,
1001 author = {Markus Wenzel and Stefan Berghofer},
1002 title = {The {Isabelle} System Manual},
1003 institution = {TU Munich},
1004 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1006 @manual{isabelle-isar-ref,
1007 author = {Markus Wenzel},
1008 title = {The {Isabelle/Isar} Reference Manual},
1009 institution = {TU Munich},
1010 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1012 @manual{isabelle-axclass,
1013 author = {Markus Wenzel},
1014 title = {Using Axiomatic Type Classes in {I}sabelle},
1015 institution = {TU Munich},
1017 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1020 @InProceedings{Wenzel:1999:TPHOL,
1021 author = {Markus Wenzel},
1022 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1023 crossref = {tphols99}}
1025 @InProceedings{Wenzel:1997:TPHOL,
1026 author = {Markus Wenzel},
1027 title = {Type Classes and Overloading in Higher-Order Logic},
1028 crossref = {tphols97}}
1033 author = {A. N. Whitehead and B. Russell},
1034 title = {Principia Mathematica},
1037 note = {Paperback edition to *56,
1038 abridged from the 2nd edition (1927)}}
1040 @Misc{Wiedijk:1999:Mizar,
1041 author = {Freek Wiedijk},
1042 title = {Mizar: An Impression},
1043 howpublished = {Unpublished paper},
1045 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1048 @Misc{Wiedijk:2000:MV,
1049 author = {Freek Wiedijk},
1050 title = {The Mathematical Vernacular},
1051 howpublished = {Unpublished paper},
1053 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1057 author = {Glynn Winskel},
1058 title = {The Formal Semantics of Programming Languages},
1059 publisher = MIT,year=1993}
1061 @InCollection{wos-bledsoe,
1062 author = {Larry Wos},
1063 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1064 crossref = {bledsoe-fest},
1067 @InProceedings{Zammit:1999:TPHOL,
1068 author = {Vincent Zammit},
1069 title = {On the Implementation of an Extensible Declarative Proof Language},
1070 crossref = {tphols99}}
1078 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1079 title = {Handbook of Logic in Computer Science},
1080 booktitle = {Handbook of Logic in Computer Science},
1081 publisher = {Oxford University Press},
1086 editor = {Henk Barendregt and Tobias Nipkow},
1087 title = TYPES # {: International Workshop {TYPES '93}},
1088 booktitle = TYPES # {: International Workshop {TYPES '93}},
1089 year = {published 1994},
1090 publisher = {Springer},
1091 series = {LNCS 806}}
1093 @book{barwise-handbk,
1094 editor = {J. Barwise},
1095 title = {Handbook of Mathematical Logic},
1096 booktitle = {Handbook of Mathematical Logic},
1100 @Proceedings{tlca93,
1101 title = {Typed Lambda Calculi and Applications},
1102 booktitle = {Typed Lambda Calculi and Applications},
1103 editor = {M. Bezem and J.F. Groote},
1105 publisher = {Springer},
1106 series = {LNCS 664}}
1109 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1110 title = {Current Trends in Hardware Verification and Automated
1112 booktitle = {Current Trends in Hardware Verification and Automated
1114 publisher = {Springer},
1118 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1119 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1120 publisher = {Kluwer Academic Publishers},
1122 editor = {Robert S. Boyer}}
1124 @Proceedings{cade12,
1125 editor = {Alan Bundy},
1126 title = {Automated Deduction --- {CADE}-12
1127 International Conference},
1128 booktitle = {Automated Deduction --- {CADE}-12
1129 International Conference},
1131 series = {LNAI 814},
1132 publisher = {Springer}}
1135 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1136 title = TYPES # {: International Workshop {TYPES '94}},
1137 booktitle = TYPES # {: International Workshop {TYPES '94}},
1139 publisher = {Springer},
1140 series = {LNCS 996}}
1142 @book{huet-plotkin91,
1143 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1144 title = {Logical Frameworks},
1145 booktitle = {Logical Frameworks},
1149 @book{huet-plotkin93,
1150 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1151 title = {Logical Environments},
1152 booktitle = {Logical Environments},
1157 editor = {J. Joyce and C. Seger},
1158 title = {Higher Order Logic Theorem Proving and Its
1159 Applications: HUG '93},
1160 booktitle = {Higher Order Logic Theorem Proving and Its
1161 Applications: HUG '93},
1162 year = {Published 1994},
1163 publisher = {Springer},
1164 series = {LNCS 780}}
1166 @proceedings{colog88,
1167 editor = {P. Martin-L{\"o}f and G. Mints},
1168 title = {COLOG-88: International Conference on Computer Logic},
1169 booktitle = {COLOG-88: International Conference on Computer Logic},
1170 year = {Published 1990},
1171 publisher = {Springer},
1172 organization = {Estonian Academy of Sciences},
1173 address = {Tallinn},
1174 series = {LNCS 417}}
1177 editor = {P. Odifreddi},
1178 title = {Logic and Computer Science},
1179 booktitle = {Logic and Computer Science},
1180 publisher = {Academic Press},
1183 @proceedings{extensions91,
1184 editor = {Peter Schroeder-Heister},
1185 title = {Extensions of Logic Programming},
1186 booktitle = {Extensions of Logic Programming},
1188 series = {LNAI 475},
1189 publisher = {Springer}}
1191 @proceedings{cade10,
1192 editor = {Mark E. Stickel},
1193 title = {10th } # CADE,
1194 booktitle = {10th } # CADE,
1196 publisher = {Springer},
1197 series = {LNAI 449}}
1200 editor = {M. Vardi},
1201 title = {Eighth Annual Symposium on Logic in Computer Science},
1202 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1207 title = {Automated Reasoning and its Applications:
1208 Essays in Honor of {Larry Wos}},
1209 booktitle = {Automated Reasoning and its Applications:
1210 Essays in Honor of {Larry Wos}},
1211 publisher = {MIT Press},
1213 editor = {Robert Veroff}}
1216 editor = {J. C. P. Woodcock and P. G. Larsen},
1217 title = {FME '93: Industrial-Strength Formal Methods},
1218 booktitle = {FME '93: Industrial-Strength Formal Methods},
1220 publisher = {Springer},
1221 series = {LNCS 670}}
1223 @Proceedings{tphols96,
1224 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1225 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1226 editor = {J. von Wright and J. Grundy and J. Harrison},
1227 series = {LNCS 1125},
1230 @Proceedings{tphols97,
1231 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1232 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1233 editor = {Elsa L. Gunter and Amy Felty},
1234 series = {LNCS 1275},
1237 @Proceedings{tphols98,
1238 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1239 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1240 editor = {Jim Grundy and Malcom Newey},
1241 series = {LNCS 1479},
1244 @Proceedings{tphols99,
1245 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1246 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1247 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1248 Paulin, C. and Thery, L.},
1249 series = {LNCS 1690},