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 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
372 title={Introduction to Automata Theory, Languages, and Computation.},
373 publisher={Addison-Wesley},year=1979}
375 @Article{haskell-report,
376 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
377 title = {Report on the Programming Language {Haskell}: A
378 Non-strict, Purely Functional Language},
384 note = {Version 1.2}}
386 @Article{haskell-tutorial,
387 author = {Paul Hudak and Joseph H. Fasel},
388 title = {A Gentle Introduction to {Haskell}},
396 author = {G. P. Huet},
397 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
404 author = {G. P. Huet and B. Lang},
405 title = {Proving and Applying Program Transformations Expressed with
406 Second-Order Patterns},
412 @inproceedings{huet88,
413 author = {G{\'e}rard Huet},
414 title = {Induction Principles Formalized in the {Calculus of
416 booktitle = {Programming of Future Generation Computers},
417 editor = {K. Fuchi and M. Nivat},
420 publisher = {Elsevier}}
422 @Book{Huth-Ryan-book,
423 author = {Michael Huth and Mark Ryan},
424 title = {Logic in Computer Science. Modelling and reasoning about systems},
428 @InProceedings{Harrison:1996:MizarHOL,
429 author = {J. Harrison},
430 title = {A {Mizar} Mode for {HOL}},
432 crossref = {tphols96}}
436 @InProceedings{kammueller-locales,
437 author = {Florian Kamm{\"u}ller and Markus Wenzel and
438 Lawrence C. Paulson},
439 title = {Locales: A Sectioning Concept for {Isabelle}},
440 crossref = {tphols99}}
443 author={Donald E. Knuth},
444 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
445 publisher={Addison-Wesley},
449 author = {R. E. Korf},
450 title = {Depth-First Iterative-Deepening: an Optimal Admissible
458 author = {Kenneth Kunen},
459 title = {Set Theory: An Introduction to Independence Proofs},
466 author = {Zohar Manna and Richard Waldinger},
467 title = {Deductive Synthesis of the Unification Algorithm},
474 @InProceedings{martin-nipkow,
475 author = {Ursula Martin and Tobias Nipkow},
476 title = {Ordered Rewriting and Confluence},
481 author = {Per Martin-L{\"o}f},
482 title = {Intuitionistic type theory},
484 publisher = {Bibliopolis}}
486 @incollection{melham89,
487 author = {Thomas F. Melham},
488 title = {Automating Recursive Type Definitions in Higher Order
491 crossref = {birtwistle89}}
493 @Article{miller-mixed,
494 Author = {Dale Miller},
495 Title = {Unification Under a Mixed Prefix},
503 author = {Robin Milner},
504 title = {A Theory of Type Polymorphism in Programming},
505 journal = "J. Comp.\ Sys.\ Sci.",
510 @TechReport{milner-ind,
511 author = {Robin Milner},
512 title = {How to Derive Inductions in {LCF}},
513 institution = Edinburgh,
517 @Article{milner-coind,
518 author = {Robin Milner and Mads Tofte},
519 title = {Co-induction in Relational Semantics},
526 author = {Robin Milner},
527 title = {Communication and Concurrency},
528 publisher = Prentice,
531 @PhdThesis{monahan84,
532 author = {Brian Q. Monahan},
533 title = {Data Type Proofs using Edinburgh {LCF}},
534 school = {University of Edinburgh},
537 @article{MuellerNvOS99,
539 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
540 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
542 @Manual{Muzalewski:Mizar,
543 title = {An Outline of {PC} {Mizar}},
544 author = {Micha{\l} Muzalewski},
545 organization = {Fondation of Logic, Mathematics and Informatics
546 --- Mizar Users Group},
548 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
553 @InProceedings{NaraschewskiW-TPHOLs98,
554 author = {Wolfgang Naraschewski and Markus Wenzel},
556 {Object-Oriented Verification based on Record Subtyping in
558 crossref = {tphols98}}
560 @inproceedings{nazareth-nipkow,
561 author = {Dieter Nazareth and Tobias Nipkow},
562 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
563 crossref = {tphols96},
567 @inproceedings{nipkow-W,
568 author = {Wolfgang Naraschewski and Tobias Nipkow},
569 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
570 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
571 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
572 publisher = Springer,
578 @InCollection{nipkow-sorts93,
579 author = {T. Nipkow},
580 title = {Order-Sorted Polymorphism in {Isabelle}},
581 booktitle = {Logical Environments},
584 editor = {G. Huet and G. Plotkin},
588 @Misc{nipkow-types93,
589 author = {Tobias Nipkow},
590 title = {Axiomatic Type Classes (in {I}sabelle)},
591 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
595 @inproceedings{Nipkow-CR,
596 author = {Tobias Nipkow},
597 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
598 booktitle = {Automated Deduction --- CADE-13},
599 editor = {M. McRobbie and J.K. Slaney},
600 publisher = Springer,
607 @InProceedings{nipkow-patterns,
608 title = {Functional Unification of Higher-Order Patterns},
609 author = {Tobias Nipkow},
612 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
613 keywords = {unification}}
616 author = {Tobias Nipkow},
617 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
623 @manual{isabelle-HOL,
624 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
625 title = {{Isabelle}'s Logics: {HOL}},
626 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
627 M{\"u}nchen and Computer Laboratory, University of Cambridge},
628 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
630 @article{nipkow-prehofer,
631 author = {Tobias Nipkow and Christian Prehofer},
632 title = {Type Reconstruction for Type Classes},
640 author = {Philippe No{\"e}l},
641 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
649 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
650 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
652 publisher = {Oxford University Press},
657 @Manual{pvs-language,
658 title = {The {PVS} specification language},
659 author = {S. Owre and N. Shankar and J. M. Rushby},
660 organization = {Computer Science Laboratory, SRI International},
661 address = {Menlo Park, CA},
662 note = {Beta release},
665 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
670 @InProceedings{paulin-tlca,
671 author = {Christine Paulin-Mohring},
672 title = {Inductive Definitions in the System {Coq}: Rules and
677 @InProceedings{paulson-CADE,
678 author = {Lawrence C. Paulson},
679 title = {A Fixedpoint Approach to Implementing (Co)Inductive
684 @InProceedings{paulson-COLOG,
685 author = {Lawrence C. Paulson},
686 title = {A Formulation of the Simple Theory of Types (for
689 crossref = {colog88},
690 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
692 @Article{paulson-coind,
693 author = {Lawrence C. Paulson},
694 title = {Mechanizing Coinduction and Corecursion in Higher-Order
703 @manual{isabelle-ref,
704 author = {Lawrence C. Paulson},
705 title = {The {Isabelle} Reference Manual},
707 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
710 author = {Lawrence C. Paulson},
711 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
713 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
715 @article{paulson-found,
716 author = {Lawrence C. Paulson},
717 title = {The Foundation of a Generic Theorem Prover},
723 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
725 %replaces paulson-final
726 @Article{paulson-mscs,
727 author = {Lawrence C. Paulson},
728 title = {Final Coalgebras as Greatest Fixed Points
730 journal = {Mathematical Structures in Computer Science},
735 @InCollection{paulson-generic,
736 author = {Lawrence C. Paulson},
737 title = {Generic Automatic Proof Tools},
738 crossref = {wos-fest},
742 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
743 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
752 @InCollection{paulson-handbook,
753 author = {Lawrence C. Paulson},
754 title = {Designing a Theorem Prover},
755 crossref = {handbk-lics2},
758 @Book{paulson-isa-book,
759 author = {Lawrence C. Paulson},
760 title = {Isabelle: A Generic Theorem Prover},
761 publisher = {Springer},
765 @InCollection{paulson-markt,
766 author = {Lawrence C. Paulson},
767 title = {Tool Support for Logics of Programs},
768 booktitle = {Mathematical Methods in Program Development:
769 Summer School Marktoberdorf 1996},
770 publisher = {Springer},
772 year = {Published 1997},
773 editor = {Manfred Broy},
774 series = {NATO ASI Series F}}
776 %replaces Paulson-ML and paulson91
778 author = {Lawrence C. Paulson},
779 title = {{ML} for the Working Programmer},
784 @article{paulson-natural,
785 author = {Lawrence C. Paulson},
786 title = {Natural Deduction as Higher-order Resolution},
791 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
793 @Article{paulson-set-I,
794 author = {Lawrence C. Paulson},
795 title = {Set Theory for Verification: {I}. {From}
796 Foundations to Functions},
802 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
804 @Article{paulson-set-II,
805 author = {Lawrence C. Paulson},
806 title = {Set Theory for Verification: {II}. {Induction} and
813 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
816 author = {Lawrence C. Paulson},
817 title = {Verifying the Unification Algorithm in {LCF}},
823 %replqces Paulson-LCF
825 author = {Lawrence C. Paulson},
826 title = {Logic and Computation: Interactive proof with Cambridge
831 @incollection{paulson700,
832 author = {Lawrence C. Paulson},
833 title = {{Isabelle}: The Next 700 Theorem Provers},
834 crossref = {odifreddi90},
836 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
838 % replaces paulson-ns and paulson-security
839 @Article{paulson-jcs,
840 author = {Lawrence C. Paulson},
841 title = {The Inductive Approach to Verifying Cryptographic Protocols},
847 @article{pelletier86,
848 author = {F. J. Pelletier},
849 title = {Seventy-five Problems for Testing Automatic Theorem
855 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
858 author = {Andrew M. Pitts},
859 title = {A Co-induction Principle for Recursively Defined Domains},
866 author = {David A. Plaisted},
867 title = {A Sequent-Style Model Elimination Strategy and a Positive
878 author = {Art Quaife},
879 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
889 @TechReport{rasmussen95,
890 author = {Ole Rasmussen},
891 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
893 institution = {Computer Laboratory, University of Cambridge},
897 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
900 author = {Steve Reeves and Michael Clarke},
901 title = {Logic for Computer Science},
902 publisher = {Addison-Wesley},
905 @InProceedings{Rudnicki:1992:MizarOverview,
906 author = {P. Rudnicki},
907 title = {An Overview of the {MIZAR} Project},
908 booktitle = {1992 Workshop on Types for Proofs and Programs},
910 organization = {Chalmers University of Technology},
916 @inproceedings{saaltink-fme,
917 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
918 Dan Craigen and Irwin Meisels},
919 title = {An {EVES} Data Abstraction Example},
923 @inproceedings{slind-tfl,
924 author = {Konrad Slind},
925 title = {Function Definition in Higher Order Logic},
926 booktitle = {Theorem Proving in Higher Order Logics},
927 editor = {J. von Wright and J. Grundy and J. Harrison},
928 publisher = Springer,
935 author = {Patrick Suppes},
936 title = {Axiomatic Set Theory},
940 @InCollection{szasz93,
941 author = {Nora Szasz},
942 title = {A Machine Checked Proof that {Ackermann's} Function is not
943 Primitive Recursive},
944 crossref = {huet-plotkin93},
947 @TechReport{Syme:1997:DECLARE,
949 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
950 institution = {University of Cambridge Computer Laboratory},
955 @PhdThesis{Syme:1998:thesis,
957 title = {Declarative Theorem Proving for Operational Semantics},
958 school = {University of Cambridge},
963 @InProceedings{Syme:1999:TPHOL,
965 title = {Three Tactic Theorem Proving},
966 crossref = {tphols99}}
971 author = {G. Takeuti},
972 title = {Proof Theory},
978 author = {Simon Thompson},
979 title = {Type Theory and Functional Programming},
980 publisher = {Addison-Wesley},
983 @Unpublished{Trybulec:1993:MizarFeatures,
984 author = {A. Trybulec},
985 title = {Some Features of the {Mizar} Language},
986 note = {Presented at a workshop in Turin, Italy},
992 @Unpublished{voelker94,
993 author = {Norbert V{\"o}lker},
994 title = {The Verification of a Timer Program using {Isabelle/HOL}},
995 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1002 author = {Christoph Wedler},
1003 title = {Emacs package ``{X-Symbol}''},
1004 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1007 @manual{isabelle-sys,
1008 author = {Markus Wenzel and Stefan Berghofer},
1009 title = {The {Isabelle} System Manual},
1010 institution = {TU Munich},
1011 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1013 @manual{isabelle-isar-ref,
1014 author = {Markus Wenzel},
1015 title = {The {Isabelle/Isar} Reference Manual},
1016 institution = {TU Munich},
1017 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1019 @manual{isabelle-axclass,
1020 author = {Markus Wenzel},
1021 title = {Using Axiomatic Type Classes in {I}sabelle},
1022 institution = {TU Munich},
1024 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1027 @InProceedings{Wenzel:1999:TPHOL,
1028 author = {Markus Wenzel},
1029 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1030 crossref = {tphols99}}
1032 @InProceedings{Wenzel:1997:TPHOL,
1033 author = {Markus Wenzel},
1034 title = {Type Classes and Overloading in Higher-Order Logic},
1035 crossref = {tphols97}}
1040 author = {A. N. Whitehead and B. Russell},
1041 title = {Principia Mathematica},
1044 note = {Paperback edition to *56,
1045 abridged from the 2nd edition (1927)}}
1047 @Misc{Wiedijk:1999:Mizar,
1048 author = {Freek Wiedijk},
1049 title = {Mizar: An Impression},
1050 howpublished = {Unpublished paper},
1052 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1055 @Misc{Wiedijk:2000:MV,
1056 author = {Freek Wiedijk},
1057 title = {The Mathematical Vernacular},
1058 howpublished = {Unpublished paper},
1060 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1064 author = {Glynn Winskel},
1065 title = {The Formal Semantics of Programming Languages},
1066 publisher = MIT,year=1993}
1068 @InCollection{wos-bledsoe,
1069 author = {Larry Wos},
1070 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1071 crossref = {bledsoe-fest},
1074 @InProceedings{Zammit:1999:TPHOL,
1075 author = {Vincent Zammit},
1076 title = {On the Implementation of an Extensible Declarative Proof Language},
1077 crossref = {tphols99}}
1085 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1086 title = {Handbook of Logic in Computer Science},
1087 booktitle = {Handbook of Logic in Computer Science},
1088 publisher = {Oxford University Press},
1093 editor = {Henk Barendregt and Tobias Nipkow},
1094 title = TYPES # {: International Workshop {TYPES '93}},
1095 booktitle = TYPES # {: International Workshop {TYPES '93}},
1096 year = {published 1994},
1097 publisher = {Springer},
1098 series = {LNCS 806}}
1100 @book{barwise-handbk,
1101 editor = {J. Barwise},
1102 title = {Handbook of Mathematical Logic},
1103 booktitle = {Handbook of Mathematical Logic},
1107 @Proceedings{tlca93,
1108 title = {Typed Lambda Calculi and Applications},
1109 booktitle = {Typed Lambda Calculi and Applications},
1110 editor = {M. Bezem and J.F. Groote},
1112 publisher = {Springer},
1113 series = {LNCS 664}}
1116 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1117 title = {Current Trends in Hardware Verification and Automated
1119 booktitle = {Current Trends in Hardware Verification and Automated
1121 publisher = {Springer},
1125 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1126 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1127 publisher = {Kluwer Academic Publishers},
1129 editor = {Robert S. Boyer}}
1131 @Proceedings{cade12,
1132 editor = {Alan Bundy},
1133 title = {Automated Deduction --- {CADE}-12
1134 International Conference},
1135 booktitle = {Automated Deduction --- {CADE}-12
1136 International Conference},
1138 series = {LNAI 814},
1139 publisher = {Springer}}
1142 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1143 title = TYPES # {: International Workshop {TYPES '94}},
1144 booktitle = TYPES # {: International Workshop {TYPES '94}},
1146 publisher = {Springer},
1147 series = {LNCS 996}}
1149 @book{huet-plotkin91,
1150 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1151 title = {Logical Frameworks},
1152 booktitle = {Logical Frameworks},
1156 @book{huet-plotkin93,
1157 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1158 title = {Logical Environments},
1159 booktitle = {Logical Environments},
1164 editor = {J. Joyce and C. Seger},
1165 title = {Higher Order Logic Theorem Proving and Its
1166 Applications: HUG '93},
1167 booktitle = {Higher Order Logic Theorem Proving and Its
1168 Applications: HUG '93},
1169 year = {Published 1994},
1170 publisher = {Springer},
1171 series = {LNCS 780}}
1173 @proceedings{colog88,
1174 editor = {P. Martin-L{\"o}f and G. Mints},
1175 title = {COLOG-88: International Conference on Computer Logic},
1176 booktitle = {COLOG-88: International Conference on Computer Logic},
1177 year = {Published 1990},
1178 publisher = {Springer},
1179 organization = {Estonian Academy of Sciences},
1180 address = {Tallinn},
1181 series = {LNCS 417}}
1184 editor = {P. Odifreddi},
1185 title = {Logic and Computer Science},
1186 booktitle = {Logic and Computer Science},
1187 publisher = {Academic Press},
1190 @proceedings{extensions91,
1191 editor = {Peter Schroeder-Heister},
1192 title = {Extensions of Logic Programming},
1193 booktitle = {Extensions of Logic Programming},
1195 series = {LNAI 475},
1196 publisher = {Springer}}
1198 @proceedings{cade10,
1199 editor = {Mark E. Stickel},
1200 title = {10th } # CADE,
1201 booktitle = {10th } # CADE,
1203 publisher = {Springer},
1204 series = {LNAI 449}}
1207 editor = {M. Vardi},
1208 title = {Eighth Annual Symposium on Logic in Computer Science},
1209 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1214 title = {Automated Reasoning and its Applications:
1215 Essays in Honor of {Larry Wos}},
1216 booktitle = {Automated Reasoning and its Applications:
1217 Essays in Honor of {Larry Wos}},
1218 publisher = {MIT Press},
1220 editor = {Robert Veroff}}
1223 editor = {J. C. P. Woodcock and P. G. Larsen},
1224 title = {FME '93: Industrial-Strength Formal Methods},
1225 booktitle = {FME '93: Industrial-Strength Formal Methods},
1227 publisher = {Springer},
1228 series = {LNCS 670}}
1230 @Proceedings{tphols96,
1231 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1232 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1233 editor = {J. von Wright and J. Grundy and J. Harrison},
1234 series = {LNCS 1125},
1237 @Proceedings{tphols97,
1238 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1239 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1240 editor = {Elsa L. Gunter and Amy Felty},
1241 series = {LNCS 1275},
1244 @Proceedings{tphols98,
1245 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1246 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1247 editor = {Jim Grundy and Malcom Newey},
1248 series = {LNCS 1479},
1251 @Proceedings{tphols99,
1252 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1253 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1254 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1255 Paulin, C. and Thery, L.},
1256 series = {LNCS 1690},