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},
379 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
380 title={Dynamic Logic},publisher=MIT,year=2000}
383 author = {Matthew Hennessy},
384 title = {The Semantics of Programming Languages: An Elementary
385 Introduction Using Structural Operational Semantics},
389 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
390 title={Introduction to Automata Theory, Languages, and Computation.},
391 publisher={Addison-Wesley},year=1979}
393 @Article{haskell-report,
394 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
395 title = {Report on the Programming Language {Haskell}: A
396 Non-strict, Purely Functional Language},
402 note = {Version 1.2}}
404 @Article{haskell-tutorial,
405 author = {Paul Hudak and Joseph H. Fasel},
406 title = {A Gentle Introduction to {Haskell}},
414 author = {G. P. Huet},
415 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
422 author = {G. P. Huet and B. Lang},
423 title = {Proving and Applying Program Transformations Expressed with
424 Second-Order Patterns},
430 @inproceedings{huet88,
431 author = {G{\'e}rard Huet},
432 title = {Induction Principles Formalized in the {Calculus of
434 booktitle = {Programming of Future Generation Computers},
435 editor = {K. Fuchi and M. Nivat},
438 publisher = {Elsevier}}
440 @Book{Huth-Ryan-book,
441 author = {Michael Huth and Mark Ryan},
442 title = {Logic in Computer Science. Modelling and reasoning about systems},
446 @InProceedings{Harrison:1996:MizarHOL,
447 author = {J. Harrison},
448 title = {A {Mizar} Mode for {HOL}},
450 crossref = {tphols96}}
454 @InProceedings{kammueller-locales,
455 author = {Florian Kamm{\"u}ller and Markus Wenzel and
456 Lawrence C. Paulson},
457 title = {Locales: A Sectioning Concept for {Isabelle}},
458 crossref = {tphols99}}
461 author={Donald E. Knuth},
462 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
463 publisher={Addison-Wesley},
467 author = {R. E. Korf},
468 title = {Depth-First Iterative-Deepening: an Optimal Admissible
476 author = {Kenneth Kunen},
477 title = {Set Theory: An Introduction to Independence Proofs},
484 author = {Zohar Manna and Richard Waldinger},
485 title = {Deductive Synthesis of the Unification Algorithm},
492 @InProceedings{martin-nipkow,
493 author = {Ursula Martin and Tobias Nipkow},
494 title = {Ordered Rewriting and Confluence},
499 author = {Per Martin-L{\"o}f},
500 title = {Intuitionistic type theory},
502 publisher = {Bibliopolis}}
504 @incollection{melham89,
505 author = {Thomas F. Melham},
506 title = {Automating Recursive Type Definitions in Higher Order
509 crossref = {birtwistle89}}
511 @Article{miller-mixed,
512 Author = {Dale Miller},
513 Title = {Unification Under a Mixed Prefix},
521 author = {Robin Milner},
522 title = {A Theory of Type Polymorphism in Programming},
523 journal = "J. Comp.\ Sys.\ Sci.",
528 @TechReport{milner-ind,
529 author = {Robin Milner},
530 title = {How to Derive Inductions in {LCF}},
531 institution = Edinburgh,
535 @Article{milner-coind,
536 author = {Robin Milner and Mads Tofte},
537 title = {Co-induction in Relational Semantics},
544 author = {Robin Milner},
545 title = {Communication and Concurrency},
546 publisher = Prentice,
549 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
550 title="The Definition of Standard ML",publisher=MIT,year=1990}
552 @PhdThesis{monahan84,
553 author = {Brian Q. Monahan},
554 title = {Data Type Proofs using Edinburgh {LCF}},
555 school = {University of Edinburgh},
558 @article{MuellerNvOS99,
560 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oskar Slotosch},
561 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
563 @Manual{Muzalewski:Mizar,
564 title = {An Outline of {PC} {Mizar}},
565 author = {Micha{\l} Muzalewski},
566 organization = {Fondation of Logic, Mathematics and Informatics
567 --- Mizar Users Group},
569 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
574 @InProceedings{NaraschewskiW-TPHOLs98,
575 author = {Wolfgang Naraschewski and Markus Wenzel},
577 {Object-Oriented Verification based on Record Subtyping in
579 crossref = {tphols98}}
581 @inproceedings{nazareth-nipkow,
582 author = {Dieter Nazareth and Tobias Nipkow},
583 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
584 crossref = {tphols96},
588 @inproceedings{nipkow-W,
589 author = {Wolfgang Naraschewski and Tobias Nipkow},
590 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
591 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
592 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
593 publisher = Springer,
599 @InCollection{nipkow-sorts93,
600 author = {T. Nipkow},
601 title = {Order-Sorted Polymorphism in {Isabelle}},
602 booktitle = {Logical Environments},
605 editor = {G. Huet and G. Plotkin},
609 @Misc{nipkow-types93,
610 author = {Tobias Nipkow},
611 title = {Axiomatic Type Classes (in {I}sabelle)},
612 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
616 @inproceedings{Nipkow-CR,
617 author = {Tobias Nipkow},
618 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
619 booktitle = {Automated Deduction --- CADE-13},
620 editor = {M. McRobbie and J.K. Slaney},
621 publisher = Springer,
628 @InProceedings{nipkow-patterns,
629 title = {Functional Unification of Higher-Order Patterns},
630 author = {Tobias Nipkow},
633 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
634 keywords = {unification}}
637 author = {Tobias Nipkow},
638 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
644 @manual{isabelle-HOL,
645 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
646 title = {{Isabelle}'s Logics: {HOL}},
647 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
648 M{\"u}nchen and Computer Laboratory, University of Cambridge},
649 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
651 @article{nipkow-prehofer,
652 author = {Tobias Nipkow and Christian Prehofer},
653 title = {Type Reconstruction for Type Classes},
661 author = {Philippe No{\"e}l},
662 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
670 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
671 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
673 publisher = {Oxford University Press},
678 @Manual{pvs-language,
679 title = {The {PVS} specification language},
680 author = {S. Owre and N. Shankar and J. M. Rushby},
681 organization = {Computer Science Laboratory, SRI International},
682 address = {Menlo Park, CA},
683 note = {Beta release},
686 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
691 @InProceedings{paulin-tlca,
692 author = {Christine Paulin-Mohring},
693 title = {Inductive Definitions in the System {Coq}: Rules and
698 @InProceedings{paulson-CADE,
699 author = {Lawrence C. Paulson},
700 title = {A Fixedpoint Approach to Implementing (Co)Inductive
705 @InProceedings{paulson-COLOG,
706 author = {Lawrence C. Paulson},
707 title = {A Formulation of the Simple Theory of Types (for
710 crossref = {colog88},
711 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
713 @Article{paulson-coind,
714 author = {Lawrence C. Paulson},
715 title = {Mechanizing Coinduction and Corecursion in Higher-Order
724 @manual{isabelle-ref,
725 author = {Lawrence C. Paulson},
726 title = {The {Isabelle} Reference Manual},
728 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
731 author = {Lawrence C. Paulson},
732 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
734 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
736 @article{paulson-found,
737 author = {Lawrence C. Paulson},
738 title = {The Foundation of a Generic Theorem Prover},
744 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
746 %replaces paulson-final
747 @Article{paulson-mscs,
748 author = {Lawrence C. Paulson},
749 title = {Final Coalgebras as Greatest Fixed Points
751 journal = {Mathematical Structures in Computer Science},
756 @InCollection{paulson-generic,
757 author = {Lawrence C. Paulson},
758 title = {Generic Automatic Proof Tools},
759 crossref = {wos-fest},
763 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
764 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
773 @InCollection{paulson-handbook,
774 author = {Lawrence C. Paulson},
775 title = {Designing a Theorem Prover},
776 crossref = {handbk-lics2},
779 @Book{paulson-isa-book,
780 author = {Lawrence C. Paulson},
781 title = {Isabelle: A Generic Theorem Prover},
782 publisher = {Springer},
786 @InCollection{paulson-markt,
787 author = {Lawrence C. Paulson},
788 title = {Tool Support for Logics of Programs},
789 booktitle = {Mathematical Methods in Program Development:
790 Summer School Marktoberdorf 1996},
791 publisher = {Springer},
793 year = {Published 1997},
794 editor = {Manfred Broy},
795 series = {NATO ASI Series F}}
797 %replaces Paulson-ML and paulson91
799 author = {Lawrence C. Paulson},
800 title = {{ML} for the Working Programmer},
805 @article{paulson-natural,
806 author = {Lawrence C. Paulson},
807 title = {Natural Deduction as Higher-order Resolution},
812 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
814 @Article{paulson-set-I,
815 author = {Lawrence C. Paulson},
816 title = {Set Theory for Verification: {I}. {From}
817 Foundations to Functions},
823 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
825 @Article{paulson-set-II,
826 author = {Lawrence C. Paulson},
827 title = {Set Theory for Verification: {II}. {Induction} and
834 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
837 author = {Lawrence C. Paulson},
838 title = {Verifying the Unification Algorithm in {LCF}},
844 %replqces Paulson-LCF
846 author = {Lawrence C. Paulson},
847 title = {Logic and Computation: Interactive proof with Cambridge
852 @incollection{paulson700,
853 author = {Lawrence C. Paulson},
854 title = {{Isabelle}: The Next 700 Theorem Provers},
855 crossref = {odifreddi90},
857 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
859 % replaces paulson-ns and paulson-security
860 @Article{paulson-jcs,
861 author = {Lawrence C. Paulson},
862 title = {The Inductive Approach to Verifying Cryptographic Protocols},
868 @article{pelletier86,
869 author = {F. J. Pelletier},
870 title = {Seventy-five Problems for Testing Automatic Theorem
876 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
879 author = {Andrew M. Pitts},
880 title = {A Co-induction Principle for Recursively Defined Domains},
887 author = {David A. Plaisted},
888 title = {A Sequent-Style Model Elimination Strategy and a Positive
899 author = {Art Quaife},
900 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
910 @TechReport{rasmussen95,
911 author = {Ole Rasmussen},
912 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
914 institution = {Computer Laboratory, University of Cambridge},
918 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
921 author = {Steve Reeves and Michael Clarke},
922 title = {Logic for Computer Science},
923 publisher = {Addison-Wesley},
926 @InProceedings{Rudnicki:1992:MizarOverview,
927 author = {P. Rudnicki},
928 title = {An Overview of the {MIZAR} Project},
929 booktitle = {1992 Workshop on Types for Proofs and Programs},
931 organization = {Chalmers University of Technology},
937 @inproceedings{saaltink-fme,
938 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
939 Dan Craigen and Irwin Meisels},
940 title = {An {EVES} Data Abstraction Example},
944 @inproceedings{slind-tfl,
945 author = {Konrad Slind},
946 title = {Function Definition in Higher Order Logic},
947 booktitle = {Theorem Proving in Higher Order Logics},
948 editor = {J. von Wright and J. Grundy and J. Harrison},
949 publisher = Springer,
956 author = {Patrick Suppes},
957 title = {Axiomatic Set Theory},
961 @InCollection{szasz93,
962 author = {Nora Szasz},
963 title = {A Machine Checked Proof that {Ackermann's} Function is not
964 Primitive Recursive},
965 crossref = {huet-plotkin93},
968 @TechReport{Syme:1997:DECLARE,
970 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
971 institution = {University of Cambridge Computer Laboratory},
976 @PhdThesis{Syme:1998:thesis,
978 title = {Declarative Theorem Proving for Operational Semantics},
979 school = {University of Cambridge},
984 @InProceedings{Syme:1999:TPHOL,
986 title = {Three Tactic Theorem Proving},
987 crossref = {tphols99}}
992 author = {G. Takeuti},
993 title = {Proof Theory},
999 author = {Simon Thompson},
1000 title = {Type Theory and Functional Programming},
1001 publisher = {Addison-Wesley},
1004 @Unpublished{Trybulec:1993:MizarFeatures,
1005 author = {A. Trybulec},
1006 title = {Some Features of the {Mizar} Language},
1007 note = {Presented at a workshop in Turin, Italy},
1013 @Unpublished{voelker94,
1014 author = {Norbert V{\"o}lker},
1015 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1016 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1023 author = {Christoph Wedler},
1024 title = {Emacs package ``{X-Symbol}''},
1025 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1028 @manual{isabelle-sys,
1029 author = {Markus Wenzel and Stefan Berghofer},
1030 title = {The {Isabelle} System Manual},
1031 institution = {TU Munich},
1032 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1034 @manual{isabelle-isar-ref,
1035 author = {Markus Wenzel},
1036 title = {The {Isabelle/Isar} Reference Manual},
1037 institution = {TU Munich},
1038 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1040 @manual{isabelle-axclass,
1041 author = {Markus Wenzel},
1042 title = {Using Axiomatic Type Classes in {I}sabelle},
1043 institution = {TU Munich},
1045 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1048 @InProceedings{Wenzel:1999:TPHOL,
1049 author = {Markus Wenzel},
1050 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1051 crossref = {tphols99}}
1053 @InProceedings{Wenzel:1997:TPHOL,
1054 author = {Markus Wenzel},
1055 title = {Type Classes and Overloading in Higher-Order Logic},
1056 crossref = {tphols97}}
1061 author = {A. N. Whitehead and B. Russell},
1062 title = {Principia Mathematica},
1065 note = {Paperback edition to *56,
1066 abridged from the 2nd edition (1927)}}
1068 @Misc{Wiedijk:1999:Mizar,
1069 author = {Freek Wiedijk},
1070 title = {Mizar: An Impression},
1071 howpublished = {Unpublished paper},
1073 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1076 @Misc{Wiedijk:2000:MV,
1077 author = {Freek Wiedijk},
1078 title = {The Mathematical Vernacular},
1079 howpublished = {Unpublished paper},
1081 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1085 author = {Glynn Winskel},
1086 title = {The Formal Semantics of Programming Languages},
1087 publisher = MIT,year=1993}
1089 @InCollection{wos-bledsoe,
1090 author = {Larry Wos},
1091 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1092 crossref = {bledsoe-fest},
1095 @InProceedings{Zammit:1999:TPHOL,
1096 author = {Vincent Zammit},
1097 title = {On the Implementation of an Extensible Declarative Proof Language},
1098 crossref = {tphols99}}
1106 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1107 title = {Handbook of Logic in Computer Science},
1108 booktitle = {Handbook of Logic in Computer Science},
1109 publisher = {Oxford University Press},
1114 editor = {Henk Barendregt and Tobias Nipkow},
1115 title = TYPES # {: International Workshop {TYPES '93}},
1116 booktitle = TYPES # {: International Workshop {TYPES '93}},
1117 year = {published 1994},
1118 publisher = {Springer},
1119 series = {LNCS 806}}
1121 @book{barwise-handbk,
1122 editor = {J. Barwise},
1123 title = {Handbook of Mathematical Logic},
1124 booktitle = {Handbook of Mathematical Logic},
1128 @Proceedings{tlca93,
1129 title = {Typed Lambda Calculi and Applications},
1130 booktitle = {Typed Lambda Calculi and Applications},
1131 editor = {M. Bezem and J.F. Groote},
1133 publisher = {Springer},
1134 series = {LNCS 664}}
1137 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1138 title = {Current Trends in Hardware Verification and Automated
1140 booktitle = {Current Trends in Hardware Verification and Automated
1142 publisher = {Springer},
1146 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1147 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1148 publisher = {Kluwer Academic Publishers},
1150 editor = {Robert S. Boyer}}
1152 @Proceedings{cade12,
1153 editor = {Alan Bundy},
1154 title = {Automated Deduction --- {CADE}-12
1155 International Conference},
1156 booktitle = {Automated Deduction --- {CADE}-12
1157 International Conference},
1159 series = {LNAI 814},
1160 publisher = {Springer}}
1163 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1164 title = TYPES # {: International Workshop {TYPES '94}},
1165 booktitle = TYPES # {: International Workshop {TYPES '94}},
1167 publisher = {Springer},
1168 series = {LNCS 996}}
1170 @book{huet-plotkin91,
1171 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1172 title = {Logical Frameworks},
1173 booktitle = {Logical Frameworks},
1177 @book{huet-plotkin93,
1178 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1179 title = {Logical Environments},
1180 booktitle = {Logical Environments},
1185 editor = {J. Joyce and C. Seger},
1186 title = {Higher Order Logic Theorem Proving and Its
1187 Applications: HUG '93},
1188 booktitle = {Higher Order Logic Theorem Proving and Its
1189 Applications: HUG '93},
1190 year = {Published 1994},
1191 publisher = {Springer},
1192 series = {LNCS 780}}
1194 @proceedings{colog88,
1195 editor = {P. Martin-L{\"o}f and G. Mints},
1196 title = {COLOG-88: International Conference on Computer Logic},
1197 booktitle = {COLOG-88: International Conference on Computer Logic},
1198 year = {Published 1990},
1199 publisher = {Springer},
1200 organization = {Estonian Academy of Sciences},
1201 address = {Tallinn},
1202 series = {LNCS 417}}
1205 editor = {P. Odifreddi},
1206 title = {Logic and Computer Science},
1207 booktitle = {Logic and Computer Science},
1208 publisher = {Academic Press},
1211 @proceedings{extensions91,
1212 editor = {Peter Schroeder-Heister},
1213 title = {Extensions of Logic Programming},
1214 booktitle = {Extensions of Logic Programming},
1216 series = {LNAI 475},
1217 publisher = {Springer}}
1219 @proceedings{cade10,
1220 editor = {Mark E. Stickel},
1221 title = {10th } # CADE,
1222 booktitle = {10th } # CADE,
1224 publisher = {Springer},
1225 series = {LNAI 449}}
1228 editor = {M. Vardi},
1229 title = {Eighth Annual Symposium on Logic in Computer Science},
1230 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1235 title = {Automated Reasoning and its Applications:
1236 Essays in Honor of {Larry Wos}},
1237 booktitle = {Automated Reasoning and its Applications:
1238 Essays in Honor of {Larry Wos}},
1239 publisher = {MIT Press},
1241 editor = {Robert Veroff}}
1244 editor = {J. C. P. Woodcock and P. G. Larsen},
1245 title = {FME '93: Industrial-Strength Formal Methods},
1246 booktitle = {FME '93: Industrial-Strength Formal Methods},
1248 publisher = {Springer},
1249 series = {LNCS 670}}
1251 @Proceedings{tphols96,
1252 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1253 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1254 editor = {J. von Wright and J. Grundy and J. Harrison},
1255 series = {LNCS 1125},
1258 @Proceedings{tphols97,
1259 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1260 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1261 editor = {Elsa L. Gunter and Amy Felty},
1262 series = {LNCS 1275},
1265 @Proceedings{tphols98,
1266 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1267 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1268 editor = {Jim Grundy and Malcom Newey},
1269 series = {LNCS 1479},
1272 @Proceedings{tphols99,
1273 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1274 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1275 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1276 Paulin, C. and Thery, L.},
1277 series = {LNCS 1690},