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="Lecture Notes in Computer Science"}
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="Computer Laboratory, University of Cambridge"}
18 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}
21 @string{AI="Artificial Intelligence"}
22 @string{FAC="Formal Aspects of Computing"}
23 @string{JAR="Journal of Automated Reasoning"}
24 @string{JCS="Journal of Computer Security"}
25 @string{JFP="Journal of Functional Programming"}
26 @string{JLC="Journal of Logic and Computation"}
27 @string{JLP="Journal of Logic Programming"}
28 @string{JSC="Journal of Symbolic Computation"}
29 @string{JSL="Journal of Symbolic 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 = {Tools and Algorithms for the Construction and Analysis of
104 author = {David Aspinall},
105 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
106 note = {\url{http://www.proofgeneral.org/~da/Isamode/}}
110 author = {David Aspinall},
111 title = {{P}roof {G}eneral},
112 note = {\url{http://www.proofgeneral.org}}
117 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
118 title="Term Rewriting and All That",publisher=CUP,year=1998}
120 @incollection{basin91,
121 author = {David Basin and Matt Kaufmann},
122 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
124 crossref = {huet-plotkin91},
127 @InProceedings{Bauer-Wenzel:2000:HB,
128 author = {Gertrud Bauer and Markus Wenzel},
129 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
131 booktitle = {Types for Proofs and Programs: TYPES'99},
132 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
138 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
139 author = {Stefan Berghofer and Markus Wenzel},
140 title = {Inductive datatypes in {HOL} --- lessons learned in
141 {F}ormal-{L}ogic {E}ngineering},
142 crossref = {tphols99}}
144 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
145 title="Introduction to Functional Programming",publisher=PH,year=1988}
148 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
149 Overbeek and Mark Stickel and Lawrence Wos},
150 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
159 author = {Robert S. Boyer and J Strother Moore},
160 title = {A Computational Logic},
161 publisher = {Academic Press},
165 author = {Robert S. Boyer and J Strother Moore},
166 title = {A Computational Logic Handbook},
167 publisher = {Academic Press},
171 author = {N. G. de Bruijn},
172 title = {Lambda Calculus Notation with Nameless Dummies,
173 a Tool for Automatic Formula Manipulation,
174 with Application to the {Church-Rosser Theorem}},
175 journal = {Indag. Math.},
182 @TechReport{camilleri92,
183 author = {J. Camilleri and T. F. Melham},
184 title = {Reasoning with Inductively Defined Relations in the
185 {HOL} Theorem Prover},
192 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
193 title = {Artificial Intelligence Programming},
194 publisher = {Lawrence Erlbaum Associates},
198 author = "Alonzo Church",
199 title = "A Formulation of the Simple Theory of Types",
205 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
206 title="Model Checking",publisher=MIT,year=1999}
209 author = {Martin D. Coen},
210 title = {Interactive Program Derivation},
211 school = {University of Cambridge},
212 note = {Computer Laboratory Technical Report 272},
217 author = {R. L. Constable and others},
218 title = {Implementing Mathematics with the Nuprl Proof
220 publisher = Prentice,
225 @Book{davey-priestley,
226 author = {B. A. Davey and H. A. Priestley},
227 title = {Introduction to Lattices and Order},
232 author = {Keith J. Devlin},
233 title = {Fundamentals of Contemporary Set Theory},
234 publisher = {Springer},
238 author = {Michael Dummett},
239 title = {Elements of Intuitionism},
241 publisher = {Oxford University Press}}
243 @incollection{dybjer91,
244 author = {Peter Dybjer},
245 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
246 Theory and Their Set-Theoretic Semantics},
247 crossref = {huet-plotkin91},
251 author = {Roy Dyckhoff},
252 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
262 author = {William M. Farmer and Joshua D. Guttman and F. Javier
264 title = {{IMPS}: An Interactive Mathematical Proof System},
271 @InProceedings{felty91a,
272 Author = {Amy Felty},
273 Title = {A Logic Program for Transforming Sequent Proofs to Natural
275 crossref = {extensions91},
278 @Article{fleuriot-jcm,
279 author = {Jacques Fleuriot and Lawrence C. Paulson},
280 title = {Mechanizing Nonstandard Real Analysis},
281 journal = {LMS Journal of Computation and Mathematics},
285 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
289 author = {Jacob Frost},
290 title = {A Case Study of Co-induction in {Isabelle HOL}},
296 %revised version of frost93
298 author = {Jacob Frost},
299 title = {A Case Study of Co-induction in {Isabelle}},
306 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
308 title = {Principles of {OBJ2}},
316 author = {J. H. Gallier},
317 title = {Logic for Computer Science:
318 Foundations of Automatic Theorem Proving},
320 publisher = {Harper \& Row}}
323 author = {Antony Galton},
324 title = {Logic for Information Technology},
328 @InProceedings{gimenez-codifying,
329 author = {Eduardo Gim{\'e}nez},
330 title = {Codifying Guarded Definitions with Recursive Schemes},
331 crossref = {types94},
336 author = {Jean-Yves Girard},
337 title = {Proofs and Types},
340 note = {Translated by Yves LaFont and Paul Taylor}}
343 editor = {M. J. C. Gordon and T. F. Melham},
344 title = {Introduction to {HOL}: A Theorem Proving Environment for
350 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
352 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
354 publisher = {Springer},
357 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
358 title={Why we can't have {SML} style datatype declarations in {HOL}},
359 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
360 IFIP TC10/WG10.2 Intl. Workshop, 1992},
361 editor={L.J.M. Claesen and M.J.C. Gordon},
362 publisher=NH,year=1993,pages={561--568}}
364 @InProceedings{gunter-trees,
365 author = {Elsa L. Gunter},
366 title = {A Broader Class of Trees for Recursive Type Definitions for
374 author = {Paul R. Halmos},
375 title = {Naive Set Theory},
376 publisher = {Van Nostrand},
380 author = {Matthew Hennessy},
381 title = {The Semantics of Programming Languages: An Elementary
382 Introduction Using Structural Operational Semantics},
386 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
387 title={Introduction to Automata Theory, Languages, and Computation.},
388 publisher={Addison-Wesley},year=1979}
390 @Article{haskell-report,
391 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
392 title = {Report on the Programming Language {Haskell}: A
393 Non-strict, Purely Functional Language},
399 note = {Version 1.2}}
401 @Article{haskell-tutorial,
402 author = {Paul Hudak and Joseph H. Fasel},
403 title = {A Gentle Introduction to {Haskell}},
411 author = {G. P. Huet},
412 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
419 author = {G. P. Huet and B. Lang},
420 title = {Proving and Applying Program Transformations Expressed with
421 Second-Order Patterns},
427 @inproceedings{huet88,
428 author = {G{\'e}rard Huet},
429 title = {Induction Principles Formalized in the {Calculus of
431 booktitle = {Programming of Future Generation Computers},
432 editor = {K. Fuchi and M. Nivat},
435 publisher = {Elsevier}}
437 @Book{Huth-Ryan-book,
438 author = {Michael Huth and Mark Ryan},
439 title = {Logic in Computer Science. Modelling and reasoning about systems},
443 @InProceedings{Harrison:1996:MizarHOL,
444 author = {J. Harrison},
445 title = {A {Mizar} Mode for {HOL}},
447 crossref = {tphols96}}
451 @InProceedings{kammueller-locales,
452 author = {Florian Kamm{\"u}ller and Markus Wenzel and
453 Lawrence C. Paulson},
454 title = {Locales: A Sectioning Concept for {Isabelle}},
455 crossref = {tphols99}}
458 author={Donald E. Knuth},
459 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
460 publisher={Addison-Wesley},
464 author = {R. E. Korf},
465 title = {Depth-First Iterative-Deepening: an Optimal Admissible
473 author = {Kenneth Kunen},
474 title = {Set Theory: An Introduction to Independence Proofs},
481 author = {Zohar Manna and Richard Waldinger},
482 title = {Deductive Synthesis of the Unification Algorithm},
489 @InProceedings{martin-nipkow,
490 author = {Ursula Martin and Tobias Nipkow},
491 title = {Ordered Rewriting and Confluence},
496 author = {Per Martin-L{\"o}f},
497 title = {Intuitionistic type theory},
499 publisher = {Bibliopolis}}
501 @incollection{melham89,
502 author = {Thomas F. Melham},
503 title = {Automating Recursive Type Definitions in Higher Order
506 crossref = {birtwistle89}}
508 @Article{miller-mixed,
509 Author = {Dale Miller},
510 Title = {Unification Under a Mixed Prefix},
518 author = {Robin Milner},
519 title = {A Theory of Type Polymorphism in Programming},
520 journal = "J. Comp.\ Sys.\ Sci.",
525 @TechReport{milner-ind,
526 author = {Robin Milner},
527 title = {How to Derive Inductions in {LCF}},
528 institution = Edinburgh,
532 @Article{milner-coind,
533 author = {Robin Milner and Mads Tofte},
534 title = {Co-induction in Relational Semantics},
541 author = {Robin Milner},
542 title = {Communication and Concurrency},
543 publisher = Prentice,
546 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
547 title="The Definition of Standard ML",publisher=MIT,year=1990}
549 @PhdThesis{monahan84,
550 author = {Brian Q. Monahan},
551 title = {Data Type Proofs using Edinburgh {LCF}},
552 school = {University of Edinburgh},
555 @article{MuellerNvOS99,
557 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oskar Slotosch},
558 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
560 @Manual{Muzalewski:Mizar,
561 title = {An Outline of {PC} {Mizar}},
562 author = {Micha{\l} Muzalewski},
563 organization = {Fondation of Logic, Mathematics and Informatics
564 --- Mizar Users Group},
566 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
571 @InProceedings{NaraschewskiW-TPHOLs98,
572 author = {Wolfgang Naraschewski and Markus Wenzel},
574 {Object-Oriented Verification based on Record Subtyping in
576 crossref = {tphols98}}
578 @inproceedings{nazareth-nipkow,
579 author = {Dieter Nazareth and Tobias Nipkow},
580 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
581 crossref = {tphols96},
585 @inproceedings{nipkow-W,
586 author = {Wolfgang Naraschewski and Tobias Nipkow},
587 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
588 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
589 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
590 publisher = Springer,
596 @InCollection{nipkow-sorts93,
597 author = {T. Nipkow},
598 title = {Order-Sorted Polymorphism in {Isabelle}},
599 booktitle = {Logical Environments},
602 editor = {G. Huet and G. Plotkin},
606 @Misc{nipkow-types93,
607 author = {Tobias Nipkow},
608 title = {Axiomatic Type Classes (in {I}sabelle)},
609 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
613 @inproceedings{Nipkow-CR,
614 author = {Tobias Nipkow},
615 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
616 booktitle = {Automated Deduction --- CADE-13},
617 editor = {M. McRobbie and J.K. Slaney},
618 publisher = Springer,
625 @InProceedings{nipkow-patterns,
626 title = {Functional Unification of Higher-Order Patterns},
627 author = {Tobias Nipkow},
630 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
631 keywords = {unification}}
634 author = {Tobias Nipkow},
635 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
641 @manual{isabelle-HOL,
642 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
643 title = {{Isabelle}'s Logics: {HOL}},
644 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
645 M{\"u}nchen and Computer Laboratory, University of Cambridge},
646 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
648 @article{nipkow-prehofer,
649 author = {Tobias Nipkow and Christian Prehofer},
650 title = {Type Reconstruction for Type Classes},
658 author = {Philippe No{\"e}l},
659 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
667 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
668 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
670 publisher = {Oxford University Press},
675 @Manual{pvs-language,
676 title = {The {PVS} specification language},
677 author = {S. Owre and N. Shankar and J. M. Rushby},
678 organization = {Computer Science Laboratory, SRI International},
679 address = {Menlo Park, CA},
680 note = {Beta release},
683 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
688 @InProceedings{paulin-tlca,
689 author = {Christine Paulin-Mohring},
690 title = {Inductive Definitions in the System {Coq}: Rules and
695 @InProceedings{paulson-CADE,
696 author = {Lawrence C. Paulson},
697 title = {A Fixedpoint Approach to Implementing (Co)Inductive
702 @InProceedings{paulson-COLOG,
703 author = {Lawrence C. Paulson},
704 title = {A Formulation of the Simple Theory of Types (for
707 crossref = {colog88},
708 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
710 @Article{paulson-coind,
711 author = {Lawrence C. Paulson},
712 title = {Mechanizing Coinduction and Corecursion in Higher-Order
721 @manual{isabelle-ref,
722 author = {Lawrence C. Paulson},
723 title = {The {Isabelle} Reference Manual},
725 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
728 author = {Lawrence C. Paulson},
729 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
731 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
733 @article{paulson-found,
734 author = {Lawrence C. Paulson},
735 title = {The Foundation of a Generic Theorem Prover},
741 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
743 %replaces paulson-final
744 @Article{paulson-mscs,
745 author = {Lawrence C. Paulson},
746 title = {Final Coalgebras as Greatest Fixed Points
748 journal = {Mathematical Structures in Computer Science},
753 @InCollection{paulson-generic,
754 author = {Lawrence C. Paulson},
755 title = {Generic Automatic Proof Tools},
756 crossref = {wos-fest},
760 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
761 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
770 @InCollection{paulson-handbook,
771 author = {Lawrence C. Paulson},
772 title = {Designing a Theorem Prover},
773 crossref = {handbk-lics2},
776 @Book{paulson-isa-book,
777 author = {Lawrence C. Paulson},
778 title = {Isabelle: A Generic Theorem Prover},
779 publisher = {Springer},
783 @InCollection{paulson-markt,
784 author = {Lawrence C. Paulson},
785 title = {Tool Support for Logics of Programs},
786 booktitle = {Mathematical Methods in Program Development:
787 Summer School Marktoberdorf 1996},
788 publisher = {Springer},
790 year = {Published 1997},
791 editor = {Manfred Broy},
792 series = {NATO ASI Series F}}
794 %replaces Paulson-ML and paulson91
796 author = {Lawrence C. Paulson},
797 title = {{ML} for the Working Programmer},
802 @article{paulson-natural,
803 author = {Lawrence C. Paulson},
804 title = {Natural Deduction as Higher-order Resolution},
809 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
811 @Article{paulson-set-I,
812 author = {Lawrence C. Paulson},
813 title = {Set Theory for Verification: {I}. {From}
814 Foundations to Functions},
820 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
822 @Article{paulson-set-II,
823 author = {Lawrence C. Paulson},
824 title = {Set Theory for Verification: {II}. {Induction} and
831 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
834 author = {Lawrence C. Paulson},
835 title = {Verifying the Unification Algorithm in {LCF}},
841 %replqces Paulson-LCF
843 author = {Lawrence C. Paulson},
844 title = {Logic and Computation: Interactive proof with Cambridge
849 @incollection{paulson700,
850 author = {Lawrence C. Paulson},
851 title = {{Isabelle}: The Next 700 Theorem Provers},
852 crossref = {odifreddi90},
854 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
856 % replaces paulson-ns and paulson-security
857 @Article{paulson-jcs,
858 author = {Lawrence C. Paulson},
859 title = {The Inductive Approach to Verifying Cryptographic Protocols},
865 @article{pelletier86,
866 author = {F. J. Pelletier},
867 title = {Seventy-five Problems for Testing Automatic Theorem
873 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
876 author = {Andrew M. Pitts},
877 title = {A Co-induction Principle for Recursively Defined Domains},
884 author = {David A. Plaisted},
885 title = {A Sequent-Style Model Elimination Strategy and a Positive
896 author = {Art Quaife},
897 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
907 @TechReport{rasmussen95,
908 author = {Ole Rasmussen},
909 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
911 institution = {Computer Laboratory, University of Cambridge},
915 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
918 author = {Steve Reeves and Michael Clarke},
919 title = {Logic for Computer Science},
920 publisher = {Addison-Wesley},
923 @InProceedings{Rudnicki:1992:MizarOverview,
924 author = {P. Rudnicki},
925 title = {An Overview of the {MIZAR} Project},
926 booktitle = {1992 Workshop on Types for Proofs and Programs},
928 organization = {Chalmers University of Technology},
934 @inproceedings{saaltink-fme,
935 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
936 Dan Craigen and Irwin Meisels},
937 title = {An {EVES} Data Abstraction Example},
941 @inproceedings{slind-tfl,
942 author = {Konrad Slind},
943 title = {Function Definition in Higher Order Logic},
944 booktitle = {Theorem Proving in Higher Order Logics},
945 editor = {J. von Wright and J. Grundy and J. Harrison},
946 publisher = Springer,
953 author = {Patrick Suppes},
954 title = {Axiomatic Set Theory},
958 @InCollection{szasz93,
959 author = {Nora Szasz},
960 title = {A Machine Checked Proof that {Ackermann's} Function is not
961 Primitive Recursive},
962 crossref = {huet-plotkin93},
965 @TechReport{Syme:1997:DECLARE,
967 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
968 institution = {University of Cambridge Computer Laboratory},
973 @PhdThesis{Syme:1998:thesis,
975 title = {Declarative Theorem Proving for Operational Semantics},
976 school = {University of Cambridge},
981 @InProceedings{Syme:1999:TPHOL,
983 title = {Three Tactic Theorem Proving},
984 crossref = {tphols99}}
989 author = {G. Takeuti},
990 title = {Proof Theory},
996 author = {Simon Thompson},
997 title = {Type Theory and Functional Programming},
998 publisher = {Addison-Wesley},
1001 @Unpublished{Trybulec:1993:MizarFeatures,
1002 author = {A. Trybulec},
1003 title = {Some Features of the {Mizar} Language},
1004 note = {Presented at a workshop in Turin, Italy},
1010 @Unpublished{voelker94,
1011 author = {Norbert V{\"o}lker},
1012 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1013 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1020 author = {Christoph Wedler},
1021 title = {Emacs package ``{X-Symbol}''},
1022 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1025 @manual{isabelle-sys,
1026 author = {Markus Wenzel and Stefan Berghofer},
1027 title = {The {Isabelle} System Manual},
1028 institution = {TU Munich},
1029 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1031 @manual{isabelle-isar-ref,
1032 author = {Markus Wenzel},
1033 title = {The {Isabelle/Isar} Reference Manual},
1034 institution = {TU Munich},
1035 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1037 @manual{isabelle-axclass,
1038 author = {Markus Wenzel},
1039 title = {Using Axiomatic Type Classes in {I}sabelle},
1040 institution = {TU Munich},
1042 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1045 @InProceedings{Wenzel:1999:TPHOL,
1046 author = {Markus Wenzel},
1047 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1048 crossref = {tphols99}}
1050 @InProceedings{Wenzel:1997:TPHOL,
1051 author = {Markus Wenzel},
1052 title = {Type Classes and Overloading in Higher-Order Logic},
1053 crossref = {tphols97}}
1058 author = {A. N. Whitehead and B. Russell},
1059 title = {Principia Mathematica},
1062 note = {Paperback edition to *56,
1063 abridged from the 2nd edition (1927)}}
1065 @Misc{Wiedijk:1999:Mizar,
1066 author = {Freek Wiedijk},
1067 title = {Mizar: An Impression},
1068 howpublished = {Unpublished paper},
1070 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1073 @Misc{Wiedijk:2000:MV,
1074 author = {Freek Wiedijk},
1075 title = {The Mathematical Vernacular},
1076 howpublished = {Unpublished paper},
1078 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1082 author = {Glynn Winskel},
1083 title = {The Formal Semantics of Programming Languages},
1084 publisher = MIT,year=1993}
1086 @InCollection{wos-bledsoe,
1087 author = {Larry Wos},
1088 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1089 crossref = {bledsoe-fest},
1092 @InProceedings{Zammit:1999:TPHOL,
1093 author = {Vincent Zammit},
1094 title = {On the Implementation of an Extensible Declarative Proof Language},
1095 crossref = {tphols99}}
1103 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1104 title = {Handbook of Logic in Computer Science},
1105 booktitle = {Handbook of Logic in Computer Science},
1106 publisher = {Oxford University Press},
1111 editor = {Henk Barendregt and Tobias Nipkow},
1112 title = TYPES # {: International Workshop {TYPES '93}},
1113 booktitle = TYPES # {: International Workshop {TYPES '93}},
1114 year = {published 1994},
1115 publisher = {Springer},
1116 series = {LNCS 806}}
1118 @book{barwise-handbk,
1119 editor = {J. Barwise},
1120 title = {Handbook of Mathematical Logic},
1121 booktitle = {Handbook of Mathematical Logic},
1125 @Proceedings{tlca93,
1126 title = {Typed Lambda Calculi and Applications},
1127 booktitle = {Typed Lambda Calculi and Applications},
1128 editor = {M. Bezem and J.F. Groote},
1130 publisher = {Springer},
1131 series = {LNCS 664}}
1134 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1135 title = {Current Trends in Hardware Verification and Automated
1137 booktitle = {Current Trends in Hardware Verification and Automated
1139 publisher = {Springer},
1143 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1144 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1145 publisher = {Kluwer Academic Publishers},
1147 editor = {Robert S. Boyer}}
1149 @Proceedings{cade12,
1150 editor = {Alan Bundy},
1151 title = {Automated Deduction --- {CADE}-12
1152 International Conference},
1153 booktitle = {Automated Deduction --- {CADE}-12
1154 International Conference},
1156 series = {LNAI 814},
1157 publisher = {Springer}}
1160 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1161 title = TYPES # {: International Workshop {TYPES '94}},
1162 booktitle = TYPES # {: International Workshop {TYPES '94}},
1164 publisher = {Springer},
1165 series = {LNCS 996}}
1167 @book{huet-plotkin91,
1168 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1169 title = {Logical Frameworks},
1170 booktitle = {Logical Frameworks},
1174 @book{huet-plotkin93,
1175 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1176 title = {Logical Environments},
1177 booktitle = {Logical Environments},
1182 editor = {J. Joyce and C. Seger},
1183 title = {Higher Order Logic Theorem Proving and Its
1184 Applications: HUG '93},
1185 booktitle = {Higher Order Logic Theorem Proving and Its
1186 Applications: HUG '93},
1187 year = {Published 1994},
1188 publisher = {Springer},
1189 series = {LNCS 780}}
1191 @proceedings{colog88,
1192 editor = {P. Martin-L{\"o}f and G. Mints},
1193 title = {COLOG-88: International Conference on Computer Logic},
1194 booktitle = {COLOG-88: International Conference on Computer Logic},
1195 year = {Published 1990},
1196 publisher = {Springer},
1197 organization = {Estonian Academy of Sciences},
1198 address = {Tallinn},
1199 series = {LNCS 417}}
1202 editor = {P. Odifreddi},
1203 title = {Logic and Computer Science},
1204 booktitle = {Logic and Computer Science},
1205 publisher = {Academic Press},
1208 @proceedings{extensions91,
1209 editor = {Peter Schroeder-Heister},
1210 title = {Extensions of Logic Programming},
1211 booktitle = {Extensions of Logic Programming},
1213 series = {LNAI 475},
1214 publisher = {Springer}}
1216 @proceedings{cade10,
1217 editor = {Mark E. Stickel},
1218 title = {10th } # CADE,
1219 booktitle = {10th } # CADE,
1221 publisher = {Springer},
1222 series = {LNAI 449}}
1225 editor = {M. Vardi},
1226 title = {Eighth Annual Symposium on Logic in Computer Science},
1227 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1232 title = {Automated Reasoning and its Applications:
1233 Essays in Honor of {Larry Wos}},
1234 booktitle = {Automated Reasoning and its Applications:
1235 Essays in Honor of {Larry Wos}},
1236 publisher = {MIT Press},
1238 editor = {Robert Veroff}}
1241 editor = {J. C. P. Woodcock and P. G. Larsen},
1242 title = {FME '93: Industrial-Strength Formal Methods},
1243 booktitle = {FME '93: Industrial-Strength Formal Methods},
1245 publisher = {Springer},
1246 series = {LNCS 670}}
1248 @Proceedings{tphols96,
1249 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1250 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1251 editor = {J. von Wright and J. Grundy and J. Harrison},
1252 series = {LNCS 1125},
1255 @Proceedings{tphols97,
1256 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1257 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1258 editor = {Elsa L. Gunter and Amy Felty},
1259 series = {LNCS 1275},
1262 @Proceedings{tphols98,
1263 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1264 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1265 editor = {Jim Grundy and Malcom Newey},
1266 series = {LNCS 1479},
1269 @Proceedings{tphols99,
1270 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1271 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1272 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1273 Paulin, C. and Thery, L.},
1274 series = {LNCS 1690},