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",
200 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
201 title="Model Checking",publisher=MIT,year=1999}
204 author = {Martin D. Coen},
205 title = {Interactive Program Derivation},
206 school = {University of Cambridge},
207 note = {Computer Laboratory Technical Report 272},
212 author = {R. L. Constable and others},
213 title = {Implementing Mathematics with the Nuprl Proof
215 publisher = Prentice,
220 @Book{davey-priestley,
221 author = {B. A. Davey and H. A. Priestley},
222 title = {Introduction to Lattices and Order},
227 author = {Keith J. Devlin},
228 title = {Fundamentals of Contemporary Set Theory},
229 publisher = {Springer},
233 author = {Michael Dummett},
234 title = {Elements of Intuitionism},
236 publisher = {Oxford University Press}}
238 @incollection{dybjer91,
239 author = {Peter Dybjer},
240 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
241 Theory and Their Set-Theoretic Semantics},
242 crossref = {huet-plotkin91},
246 author = {Roy Dyckhoff},
247 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
257 author = {William M. Farmer and Joshua D. Guttman and F. Javier
259 title = {{IMPS}: An Interactive Mathematical Proof System},
266 @InProceedings{felty91a,
267 Author = {Amy Felty},
268 Title = {A Logic Program for Transforming Sequent Proofs to Natural
270 crossref = {extensions91},
274 author = {Jacob Frost},
275 title = {A Case Study of Co-induction in {Isabelle HOL}},
281 %revised version of frost93
283 author = {Jacob Frost},
284 title = {A Case Study of Co-induction in {Isabelle}},
291 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
293 title = {Principles of {OBJ2}},
301 author = {J. H. Gallier},
302 title = {Logic for Computer Science:
303 Foundations of Automatic Theorem Proving},
305 publisher = {Harper \& Row}}
308 author = {Antony Galton},
309 title = {Logic for Information Technology},
313 @InProceedings{gimenez-codifying,
314 author = {Eduardo Gim{\'e}nez},
315 title = {Codifying Guarded Definitions with Recursive Schemes},
316 crossref = {types94},
321 author = {Jean-Yves Girard},
322 title = {Proofs and Types},
325 note = {Translated by Yves LaFont and Paul Taylor}}
328 author = {M. J. C. Gordon and T. F. Melham},
329 title = {Introduction to {HOL}: A Theorem Proving Environment for
335 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
337 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
339 publisher = {Springer},
342 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
343 title={Why we can't have {SML} style datatype declarations in {HOL}},
344 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
345 IFIP TC10/WG10.2 Intl. Workshop, 1992},
346 editor={L.J.M. Claesen and M.J.C. Gordon},
347 publisher=NH,year=1993,pages={561--568}}
349 @InProceedings{gunter-trees,
350 author = {Elsa L. Gunter},
351 title = {A Broader Class of Trees for Recursive Type Definitions for
359 author = {Paul R. Halmos},
360 title = {Naive Set Theory},
361 publisher = {Van Nostrand},
365 author = {Matthew Hennessy},
366 title = {The Semantics of Programming Languages: An Elementary
367 Introduction Using Structural Operational Semantics},
371 @Article{haskell-report,
372 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
373 title = {Report on the Programming Language {Haskell}: A
374 Non-strict, Purely Functional Language},
380 note = {Version 1.2}}
382 @Article{haskell-tutorial,
383 author = {Paul Hudak and Joseph H. Fasel},
384 title = {A Gentle Introduction to {Haskell}},
392 author = {G. P. Huet},
393 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
400 author = {G. P. Huet and B. Lang},
401 title = {Proving and Applying Program Transformations Expressed with
402 Second-Order Patterns},
408 @inproceedings{huet88,
409 author = {G{\'e}rard Huet},
410 title = {Induction Principles Formalized in the {Calculus of
412 booktitle = {Programming of Future Generation Computers},
413 editor = {K. Fuchi and M. Nivat},
416 publisher = {Elsevier}}
418 @Book{Huth-Ryan-book,
419 author = {Michael Huth and Mark Ryan},
420 title = {Logic in Computer Science. Modelling and reasoning about systems},
424 @InProceedings{Harrison:1996:MizarHOL,
425 author = {J. Harrison},
426 title = {A {Mizar} Mode for {HOL}},
428 crossref = {tphols96}}
432 @InProceedings{kammueller-locales,
433 author = {Florian Kamm{\"u}ller and Markus Wenzel and
434 Lawrence C. Paulson},
435 title = {Locales: A Sectioning Concept for {Isabelle}},
436 crossref = {tphols99}}
439 author={Donald E. Knuth},
440 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
441 publisher={Addison-Wesley},
445 author = {R. E. Korf},
446 title = {Depth-First Iterative-Deepening: an Optimal Admissible
454 author = {Kenneth Kunen},
455 title = {Set Theory: An Introduction to Independence Proofs},
462 author = {Zohar Manna and Richard Waldinger},
463 title = {Deductive Synthesis of the Unification Algorithm},
470 @InProceedings{martin-nipkow,
471 author = {Ursula Martin and Tobias Nipkow},
472 title = {Ordered Rewriting and Confluence},
477 author = {Per Martin-L{\"o}f},
478 title = {Intuitionistic type theory},
480 publisher = {Bibliopolis}}
482 @incollection{melham89,
483 author = {Thomas F. Melham},
484 title = {Automating Recursive Type Definitions in Higher Order
487 crossref = {birtwistle89}}
489 @Article{miller-mixed,
490 Author = {Dale Miller},
491 Title = {Unification Under a Mixed Prefix},
499 author = {Robin Milner},
500 title = {A Theory of Type Polymorphism in Programming},
501 journal = "J. Comp.\ Sys.\ Sci.",
506 @TechReport{milner-ind,
507 author = {Robin Milner},
508 title = {How to Derive Inductions in {LCF}},
509 institution = Edinburgh,
513 @Article{milner-coind,
514 author = {Robin Milner and Mads Tofte},
515 title = {Co-induction in Relational Semantics},
522 author = {Robin Milner},
523 title = {Communication and Concurrency},
524 publisher = Prentice,
527 @PhdThesis{monahan84,
528 author = {Brian Q. Monahan},
529 title = {Data Type Proofs using Edinburgh {LCF}},
530 school = {University of Edinburgh},
533 @article{MuellerNvOS99,
535 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
536 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
538 @Manual{Muzalewski:Mizar,
539 title = {An Outline of {PC} {Mizar}},
540 author = {Micha{\l} Muzalewski},
541 organization = {Fondation of Logic, Mathematics and Informatics
542 --- Mizar Users Group},
544 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
549 @InProceedings{NaraschewskiW-TPHOLs98,
550 author = {Wolfgang Naraschewski and Markus Wenzel},
552 {Object-Oriented Verification based on Record Subtyping in
554 crossref = {tphols98}}
556 @inproceedings{nazareth-nipkow,
557 author = {Dieter Nazareth and Tobias Nipkow},
558 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
559 crossref = {tphols96},
563 @inproceedings{nipkow-W,
564 author = {Wolfgang Naraschewski and Tobias Nipkow},
565 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
566 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
567 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
568 publisher = Springer,
574 @InCollection{nipkow-sorts93,
575 author = {T. Nipkow},
576 title = {Order-Sorted Polymorphism in {Isabelle}},
577 booktitle = {Logical Environments},
580 editor = {G. Huet and G. Plotkin},
584 @Misc{nipkow-types93,
585 author = {Tobias Nipkow},
586 title = {Axiomatic Type Classes (in {I}sabelle)},
587 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
591 @inproceedings{Nipkow-CR,
592 author = {Tobias Nipkow},
593 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
594 booktitle = {Automated Deduction --- CADE-13},
595 editor = {M. McRobbie and J.K. Slaney},
596 publisher = Springer,
603 @InProceedings{nipkow-patterns,
604 title = {Functional Unification of Higher-Order Patterns},
605 author = {Tobias Nipkow},
608 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
609 keywords = {unification}}
612 author = {Tobias Nipkow},
613 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
619 @manual{isabelle-HOL,
620 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
621 title = {{Isabelle}'s Logics: {HOL}},
622 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
623 M{\"u}nchen and Computer Laboratory, University of Cambridge},
624 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
626 @article{nipkow-prehofer,
627 author = {Tobias Nipkow and Christian Prehofer},
628 title = {Type Reconstruction for Type Classes},
636 author = {Philippe No{\"e}l},
637 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
645 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
646 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
648 publisher = {Oxford University Press},
653 @Manual{pvs-language,
654 title = {The {PVS} specification language},
655 author = {S. Owre and N. Shankar and J. M. Rushby},
656 organization = {Computer Science Laboratory, SRI International},
657 address = {Menlo Park, CA},
658 note = {Beta release},
661 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
666 @InProceedings{paulin-tlca,
667 author = {Christine Paulin-Mohring},
668 title = {Inductive Definitions in the System {Coq}: Rules and
673 @InProceedings{paulson-CADE,
674 author = {Lawrence C. Paulson},
675 title = {A Fixedpoint Approach to Implementing (Co)Inductive
680 @InProceedings{paulson-COLOG,
681 author = {Lawrence C. Paulson},
682 title = {A Formulation of the Simple Theory of Types (for
685 crossref = {colog88},
686 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
688 @Article{paulson-coind,
689 author = {Lawrence C. Paulson},
690 title = {Mechanizing Coinduction and Corecursion in Higher-Order
699 @manual{isabelle-ref,
700 author = {Lawrence C. Paulson},
701 title = {The {Isabelle} Reference Manual},
703 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
706 author = {Lawrence C. Paulson},
707 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
709 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
711 @article{paulson-found,
712 author = {Lawrence C. Paulson},
713 title = {The Foundation of a Generic Theorem Prover},
719 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
721 %replaces paulson-final
722 @Article{paulson-mscs,
723 author = {Lawrence C. Paulson},
724 title = {Final Coalgebras as Greatest Fixed Points
726 journal = {Mathematical Structures in Computer Science},
731 @InCollection{paulson-generic,
732 author = {Lawrence C. Paulson},
733 title = {Generic Automatic Proof Tools},
734 crossref = {wos-fest},
738 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
739 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
748 @InCollection{paulson-handbook,
749 author = {Lawrence C. Paulson},
750 title = {Designing a Theorem Prover},
751 crossref = {handbk-lics2},
754 @Book{paulson-isa-book,
755 author = {Lawrence C. Paulson},
756 title = {Isabelle: A Generic Theorem Prover},
757 publisher = {Springer},
761 @InCollection{paulson-markt,
762 author = {Lawrence C. Paulson},
763 title = {Tool Support for Logics of Programs},
764 booktitle = {Mathematical Methods in Program Development:
765 Summer School Marktoberdorf 1996},
766 publisher = {Springer},
768 year = {Published 1997},
769 editor = {Manfred Broy},
770 series = {NATO ASI Series F}}
772 %replaces Paulson-ML and paulson91
774 author = {Lawrence C. Paulson},
775 title = {{ML} for the Working Programmer},
780 @article{paulson-natural,
781 author = {Lawrence C. Paulson},
782 title = {Natural Deduction as Higher-order Resolution},
787 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
789 @Article{paulson-set-I,
790 author = {Lawrence C. Paulson},
791 title = {Set Theory for Verification: {I}. {From}
792 Foundations to Functions},
798 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
800 @Article{paulson-set-II,
801 author = {Lawrence C. Paulson},
802 title = {Set Theory for Verification: {II}. {Induction} and
809 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
812 author = {Lawrence C. Paulson},
813 title = {Verifying the Unification Algorithm in {LCF}},
819 %replqces Paulson-LCF
821 author = {Lawrence C. Paulson},
822 title = {Logic and Computation: Interactive proof with Cambridge
827 @incollection{paulson700,
828 author = {Lawrence C. Paulson},
829 title = {{Isabelle}: The Next 700 Theorem Provers},
830 crossref = {odifreddi90},
832 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
834 % replaces paulson-ns and paulson-security
835 @Article{paulson-jcs,
836 author = {Lawrence C. Paulson},
837 title = {The Inductive Approach to Verifying Cryptographic Protocols},
843 @article{pelletier86,
844 author = {F. J. Pelletier},
845 title = {Seventy-five Problems for Testing Automatic Theorem
851 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
854 author = {Andrew M. Pitts},
855 title = {A Co-induction Principle for Recursively Defined Domains},
862 author = {David A. Plaisted},
863 title = {A Sequent-Style Model Elimination Strategy and a Positive
874 author = {Art Quaife},
875 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
885 @TechReport{rasmussen95,
886 author = {Ole Rasmussen},
887 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
889 institution = {Computer Laboratory, University of Cambridge},
893 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
896 author = {Steve Reeves and Michael Clarke},
897 title = {Logic for Computer Science},
898 publisher = {Addison-Wesley},
901 @InProceedings{Rudnicki:1992:MizarOverview,
902 author = {P. Rudnicki},
903 title = {An Overview of the {MIZAR} Project},
904 booktitle = {1992 Workshop on Types for Proofs and Programs},
906 organization = {Chalmers University of Technology},
912 @inproceedings{saaltink-fme,
913 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
914 Dan Craigen and Irwin Meisels},
915 title = {An {EVES} Data Abstraction Example},
919 @inproceedings{slind-tfl,
920 author = {Konrad Slind},
921 title = {Function Definition in Higher Order Logic},
922 booktitle = {Theorem Proving in Higher Order Logics},
923 editor = {J. von Wright and J. Grundy and J. Harrison},
924 publisher = Springer,
931 author = {Patrick Suppes},
932 title = {Axiomatic Set Theory},
936 @InCollection{szasz93,
937 author = {Nora Szasz},
938 title = {A Machine Checked Proof that {Ackermann's} Function is not
939 Primitive Recursive},
940 crossref = {huet-plotkin93},
943 @TechReport{Syme:1997:DECLARE,
945 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
946 institution = {University of Cambridge Computer Laboratory},
951 @PhdThesis{Syme:1998:thesis,
953 title = {Declarative Theorem Proving for Operational Semantics},
954 school = {University of Cambridge},
959 @InProceedings{Syme:1999:TPHOL,
961 title = {Three Tactic Theorem Proving},
962 crossref = {tphols99}}
967 author = {G. Takeuti},
968 title = {Proof Theory},
974 author = {Simon Thompson},
975 title = {Type Theory and Functional Programming},
976 publisher = {Addison-Wesley},
979 @Unpublished{Trybulec:1993:MizarFeatures,
980 author = {A. Trybulec},
981 title = {Some Features of the {Mizar} Language},
982 note = {Presented at a workshop in Turin, Italy},
988 @Unpublished{voelker94,
989 author = {Norbert V{\"o}lker},
990 title = {The Verification of a Timer Program using {Isabelle/HOL}},
991 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
998 author = {Christoph Wedler},
999 title = {Emacs package ``{X-Symbol}''},
1000 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1003 @manual{isabelle-sys,
1004 author = {Markus Wenzel and Stefan Berghofer},
1005 title = {The {Isabelle} System Manual},
1006 institution = {TU Munich},
1007 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1009 @manual{isabelle-isar-ref,
1010 author = {Markus Wenzel},
1011 title = {The {Isabelle/Isar} Reference Manual},
1012 institution = {TU Munich},
1013 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1015 @manual{isabelle-axclass,
1016 author = {Markus Wenzel},
1017 title = {Using Axiomatic Type Classes in {I}sabelle},
1018 institution = {TU Munich},
1020 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1023 @InProceedings{Wenzel:1999:TPHOL,
1024 author = {Markus Wenzel},
1025 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1026 crossref = {tphols99}}
1028 @InProceedings{Wenzel:1997:TPHOL,
1029 author = {Markus Wenzel},
1030 title = {Type Classes and Overloading in Higher-Order Logic},
1031 crossref = {tphols97}}
1036 author = {A. N. Whitehead and B. Russell},
1037 title = {Principia Mathematica},
1040 note = {Paperback edition to *56,
1041 abridged from the 2nd edition (1927)}}
1043 @Misc{Wiedijk:1999:Mizar,
1044 author = {Freek Wiedijk},
1045 title = {Mizar: An Impression},
1046 howpublished = {Unpublished paper},
1048 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1051 @Misc{Wiedijk:2000:MV,
1052 author = {Freek Wiedijk},
1053 title = {The Mathematical Vernacular},
1054 howpublished = {Unpublished paper},
1056 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1060 author = {Glynn Winskel},
1061 title = {The Formal Semantics of Programming Languages},
1062 publisher = MIT,year=1993}
1064 @InCollection{wos-bledsoe,
1065 author = {Larry Wos},
1066 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1067 crossref = {bledsoe-fest},
1070 @InProceedings{Zammit:1999:TPHOL,
1071 author = {Vincent Zammit},
1072 title = {On the Implementation of an Extensible Declarative Proof Language},
1073 crossref = {tphols99}}
1081 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1082 title = {Handbook of Logic in Computer Science},
1083 booktitle = {Handbook of Logic in Computer Science},
1084 publisher = {Oxford University Press},
1089 editor = {Henk Barendregt and Tobias Nipkow},
1090 title = TYPES # {: International Workshop {TYPES '93}},
1091 booktitle = TYPES # {: International Workshop {TYPES '93}},
1092 year = {published 1994},
1093 publisher = {Springer},
1094 series = {LNCS 806}}
1096 @book{barwise-handbk,
1097 editor = {J. Barwise},
1098 title = {Handbook of Mathematical Logic},
1099 booktitle = {Handbook of Mathematical Logic},
1103 @Proceedings{tlca93,
1104 title = {Typed Lambda Calculi and Applications},
1105 booktitle = {Typed Lambda Calculi and Applications},
1106 editor = {M. Bezem and J.F. Groote},
1108 publisher = {Springer},
1109 series = {LNCS 664}}
1112 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1113 title = {Current Trends in Hardware Verification and Automated
1115 booktitle = {Current Trends in Hardware Verification and Automated
1117 publisher = {Springer},
1121 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1122 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1123 publisher = {Kluwer Academic Publishers},
1125 editor = {Robert S. Boyer}}
1127 @Proceedings{cade12,
1128 editor = {Alan Bundy},
1129 title = {Automated Deduction --- {CADE}-12
1130 International Conference},
1131 booktitle = {Automated Deduction --- {CADE}-12
1132 International Conference},
1134 series = {LNAI 814},
1135 publisher = {Springer}}
1138 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1139 title = TYPES # {: International Workshop {TYPES '94}},
1140 booktitle = TYPES # {: International Workshop {TYPES '94}},
1142 publisher = {Springer},
1143 series = {LNCS 996}}
1145 @book{huet-plotkin91,
1146 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1147 title = {Logical Frameworks},
1148 booktitle = {Logical Frameworks},
1152 @book{huet-plotkin93,
1153 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1154 title = {Logical Environments},
1155 booktitle = {Logical Environments},
1160 editor = {J. Joyce and C. Seger},
1161 title = {Higher Order Logic Theorem Proving and Its
1162 Applications: HUG '93},
1163 booktitle = {Higher Order Logic Theorem Proving and Its
1164 Applications: HUG '93},
1165 year = {Published 1994},
1166 publisher = {Springer},
1167 series = {LNCS 780}}
1169 @proceedings{colog88,
1170 editor = {P. Martin-L{\"o}f and G. Mints},
1171 title = {COLOG-88: International Conference on Computer Logic},
1172 booktitle = {COLOG-88: International Conference on Computer Logic},
1173 year = {Published 1990},
1174 publisher = {Springer},
1175 organization = {Estonian Academy of Sciences},
1176 address = {Tallinn},
1177 series = {LNCS 417}}
1180 editor = {P. Odifreddi},
1181 title = {Logic and Computer Science},
1182 booktitle = {Logic and Computer Science},
1183 publisher = {Academic Press},
1186 @proceedings{extensions91,
1187 editor = {Peter Schroeder-Heister},
1188 title = {Extensions of Logic Programming},
1189 booktitle = {Extensions of Logic Programming},
1191 series = {LNAI 475},
1192 publisher = {Springer}}
1194 @proceedings{cade10,
1195 editor = {Mark E. Stickel},
1196 title = {10th } # CADE,
1197 booktitle = {10th } # CADE,
1199 publisher = {Springer},
1200 series = {LNAI 449}}
1203 editor = {M. Vardi},
1204 title = {Eighth Annual Symposium on Logic in Computer Science},
1205 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1210 title = {Automated Reasoning and its Applications:
1211 Essays in Honor of {Larry Wos}},
1212 booktitle = {Automated Reasoning and its Applications:
1213 Essays in Honor of {Larry Wos}},
1214 publisher = {MIT Press},
1216 editor = {Robert Veroff}}
1219 editor = {J. C. P. Woodcock and P. G. Larsen},
1220 title = {FME '93: Industrial-Strength Formal Methods},
1221 booktitle = {FME '93: Industrial-Strength Formal Methods},
1223 publisher = {Springer},
1224 series = {LNCS 670}}
1226 @Proceedings{tphols96,
1227 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1228 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1229 editor = {J. von Wright and J. Grundy and J. Harrison},
1230 series = {LNCS 1125},
1233 @Proceedings{tphols97,
1234 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1235 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1236 editor = {Elsa L. Gunter and Amy Felty},
1237 series = {LNCS 1275},
1240 @Proceedings{tphols98,
1241 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1242 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1243 editor = {Jim Grundy and Malcom Newey},
1244 series = {LNCS 1479},
1247 @Proceedings{tphols99,
1248 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1249 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1250 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1251 Paulin, C. and Thery, L.},
1252 series = {LNCS 1690},