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{PROYAL="Proceedings of the Royal Society of London"}
31 @string{SIGPLAN="{SIGPLAN} Notices"}
32 @string{TISSEC="ACM Transactions on Information and System Security"}
35 @string{CADE="International Conference on Automated Deduction"}
36 @string{POPL="Symposium on Principles of Programming Languages"}
37 @string{TYPES="Types for Proofs and Programs"}
42 @incollection{abramsky90,
43 author = {Samson Abramsky},
44 title = {The Lazy Lambda Calculus},
46 editor = {David A. Turner},
47 booktitle = {Research Topics in Functional Programming},
48 publisher = {Addison-Wesley},
51 @Unpublished{abrial93,
52 author = {J. R. Abrial and G. Laffitte},
53 title = {Towards the Mechanization of the Proofs of some Classical
54 Theorems of Set Theory},
59 @incollection{aczel77,
60 author = {Peter Aczel},
61 title = {An Introduction to Inductive Definitions},
63 crossref = {barwise-handbk}}
66 author = {Peter Aczel},
67 title = {Non-Well-Founded Sets},
72 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
73 title = {The {ALF} Proof Editor and Its Proof Engine},
78 author = "Peter Andrews",
79 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
82 series = "Computer Science and Applied Mathematics",
85 @InProceedings{Aspinall:2000:eProof,
86 author = {David Aspinall},
87 title = {Protocols for Interactive {e-Proof}},
88 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
90 note = {Unpublished work-in-progress paper,
91 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
94 @InProceedings{Aspinall:TACAS:2000,
95 author = {David Aspinall},
96 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
97 booktitle = {Tools and Algorithms for the Construction and Analysis of
100 publisher = Springer,
107 author = {David Aspinall},
108 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
109 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
113 author = {David Aspinall},
114 title = {{P}roof {G}eneral},
115 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
120 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
121 title="Term Rewriting and All That",publisher=CUP,year=1998}
123 @InCollection{Barendregt-Geuvers:2001,
124 author = {H. Barendregt and H. Geuvers},
125 title = {Proof Assistants using Dependent Type Systems},
126 booktitle = {Handbook of Automated Reasoning},
127 publisher = {Elsevier},
129 editor = {A. Robinson and A. Voronkov}
132 @incollection{basin91,
133 author = {David Basin and Matt Kaufmann},
134 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
136 crossref = {huet-plotkin91},
139 @Unpublished{HOL-Library,
140 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
141 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
143 title = {The Supplemental {Isabelle/HOL} Library},
144 note = {Part of the Isabelle distribution,
145 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
149 @InProceedings{Bauer-Wenzel:2000:HB,
150 author = {Gertrud Bauer and Markus Wenzel},
151 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
153 booktitle = {Types for Proofs and Programs: TYPES'99},
154 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
160 @InProceedings{Bauer-Wenzel:2001,
161 author = {Gertrud Bauer and Markus Wenzel},
162 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
163 crossref = {tphols2001}}
165 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
166 crossref = "tphols2000",
167 title = "Proof terms for simply typed higher order logic",
168 author = "Stefan Berghofer and Tobias Nipkow",
171 @InProceedings{Berghofer-Nipkow:2002,
172 author = {Stefan Berghofer and Tobias Nipkow},
173 title = {Executing Higher Order Logic},
174 booktitle = {Types for Proofs and Programs: TYPES'2000},
175 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
177 publisher = Springer,
181 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
182 author = {Stefan Berghofer and Markus Wenzel},
183 title = {Inductive datatypes in {HOL} --- lessons learned in
184 {F}ormal-{L}ogic {E}ngineering},
185 crossref = {tphols99}}
187 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
188 title="Introduction to Functional Programming",publisher=PH,year=1988}
190 @book{Bird-Haskell,author="Richard Bird",
191 title="Introduction to Functional Programming using Haskell",
192 publisher=PH,year=1998}
195 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
196 Overbeek and Mark Stickel and Lawrence Wos},
197 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
206 author = {Robert S. Boyer and J Strother Moore},
207 title = {A Computational Logic},
208 publisher = {Academic Press},
212 author = {Robert S. Boyer and J Strother Moore},
213 title = {A Computational Logic Handbook},
214 publisher = {Academic Press},
218 author = {N. G. de Bruijn},
219 title = {Lambda Calculus Notation with Nameless Dummies,
220 a Tool for Automatic Formula Manipulation,
221 with Application to the {Church-Rosser Theorem}},
222 journal = {Indag. Math.},
228 author = {M. Burrows and M. Abadi and R. M. Needham},
229 title = {A Logic of Authentication},
237 @TechReport{camilleri92,
238 author = {J. Camilleri and T. F. Melham},
239 title = {Reasoning with Inductively Defined Relations in the
240 {HOL} Theorem Prover},
247 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
248 title = {Artificial Intelligence Programming},
249 publisher = {Lawrence Erlbaum Associates},
253 author = "Alonzo Church",
254 title = "A Formulation of the Simple Theory of Types",
260 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
261 title="Model Checking",publisher=MIT,year=1999}
264 author = {Martin D. Coen},
265 title = {Interactive Program Derivation},
266 school = {University of Cambridge},
267 note = {Computer Laboratory Technical Report 272},
272 author = {R. L. Constable and others},
273 title = {Implementing Mathematics with the Nuprl Proof
275 publisher = Prentice,
280 @Book{davey-priestley,
281 author = {B. A. Davey and H. A. Priestley},
282 title = {Introduction to Lattices and Order},
287 author = {Keith J. Devlin},
288 title = {Fundamentals of Contemporary Set Theory},
289 publisher = {Springer},
293 author = {Michael Dummett},
294 title = {Elements of Intuitionism},
296 publisher = {Oxford University Press}}
298 @incollection{dybjer91,
299 author = {Peter Dybjer},
300 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
301 Theory and Their Set-Theoretic Semantics},
302 crossref = {huet-plotkin91},
306 author = {Roy Dyckhoff},
307 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
317 author = {William M. Farmer and Joshua D. Guttman and F. Javier
319 title = {{IMPS}: An Interactive Mathematical Proof System},
326 @InProceedings{felty91a,
327 Author = {Amy Felty},
328 Title = {A Logic Program for Transforming Sequent Proofs to Natural
330 crossref = {extensions91},
333 @Article{fleuriot-jcm,
334 author = {Jacques Fleuriot and Lawrence C. Paulson},
335 title = {Mechanizing Nonstandard Real Analysis},
336 journal = {LMS Journal of Computation and Mathematics},
340 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
344 author = {Jacob Frost},
345 title = {A Case Study of Co-induction in {Isabelle HOL}},
351 %revised version of frost93
353 author = {Jacob Frost},
354 title = {A Case Study of Co-induction in {Isabelle}},
361 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
363 title = {Principles of {OBJ2}},
371 author = {J. H. Gallier},
372 title = {Logic for Computer Science:
373 Foundations of Automatic Theorem Proving},
375 publisher = {Harper \& Row}}
378 author = {Antony Galton},
379 title = {Logic for Information Technology},
383 @Article{Gentzen:1935,
384 author = {G. Gentzen},
385 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
386 journal = {Math. Zeitschrift},
390 @InProceedings{gimenez-codifying,
391 author = {Eduardo Gim{\'e}nez},
392 title = {Codifying Guarded Definitions with Recursive Schemes},
393 crossref = {types94},
398 author = {Jean-Yves Girard},
399 title = {Proofs and Types},
402 note = {Translated by Yves LaFont and Paul Taylor}}
405 editor = {M. J. C. Gordon and T. F. Melham},
406 title = {Introduction to {HOL}: A Theorem Proving Environment for
412 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
414 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
416 publisher = {Springer},
419 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
420 title={Why we can't have {SML} style datatype declarations in {HOL}},
421 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
422 IFIP TC10/WG10.2 Intl. Workshop, 1992},
423 editor={L.J.M. Claesen and M.J.C. Gordon},
424 publisher=NH,year=1993,pages={561--568}}
426 @InProceedings{gunter-trees,
427 author = {Elsa L. Gunter},
428 title = {A Broader Class of Trees for Recursive Type Definitions for
436 author = {Paul R. Halmos},
437 title = {Naive Set Theory},
438 publisher = {Van Nostrand},
441 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
442 title={Dynamic Logic},publisher=MIT,year=2000}
445 author = {Matthew Hennessy},
446 title = {The Semantics of Programming Languages: An Elementary
447 Introduction Using Structural Operational Semantics},
451 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
452 title={Introduction to Automata Theory, Languages, and Computation.},
453 publisher={Addison-Wesley},year=1979}
455 @Article{haskell-report,
456 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
457 title = {Report on the Programming Language {Haskell}: A
458 Non-strict, Purely Functional Language},
464 note = {Version 1.2}}
466 @Article{haskell-tutorial,
467 author = {Paul Hudak and Joseph H. Fasel},
468 title = {A Gentle Introduction to {Haskell}},
475 @book{Hudak-Haskell,author={Paul Hudak},
476 title={The Haskell School of Expression},publisher=CUP,year=2000}
479 author = {G. P. Huet},
480 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
487 author = {G. P. Huet and B. Lang},
488 title = {Proving and Applying Program Transformations Expressed with
489 Second-Order Patterns},
495 @inproceedings{huet88,
496 author = {G{\'e}rard Huet},
497 title = {Induction Principles Formalized in the {Calculus of
499 booktitle = {Programming of Future Generation Computers},
500 editor = {K. Fuchi and M. Nivat},
503 publisher = {Elsevier}}
505 @Book{Huth-Ryan-book,
506 author = {Michael Huth and Mark Ryan},
507 title = {Logic in Computer Science. Modelling and reasoning about systems},
511 @InProceedings{Harrison:1996:MizarHOL,
512 author = {J. Harrison},
513 title = {A {Mizar} Mode for {HOL}},
515 crossref = {tphols96}}
519 @InProceedings{kammueller-locales,
520 author = {Florian Kamm{\"u}ller and Markus Wenzel and
521 Lawrence C. Paulson},
522 title = {Locales: A Sectioning Concept for {Isabelle}},
523 crossref = {tphols99}}
526 author={Donald E. Knuth},
527 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
528 publisher={Addison-Wesley},
532 author = {R. E. Korf},
533 title = {Depth-First Iterative-Deepening: an Optimal Admissible
541 author = {Kenneth Kunen},
542 title = {Set Theory: An Introduction to Independence Proofs},
548 @InProceedings{lowe-fdr,
549 author = {Gavin Lowe},
550 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
551 Protocol using {CSP} and {FDR}},
552 booktitle = {Tools and Algorithms for the Construction and Analysis
553 of Systems: second international workshop, TACAS '96},
554 editor = {T. Margaria and B. Steffen},
555 series = {LNCS 1055},
557 publisher = {Springer},
564 author = {Zohar Manna and Richard Waldinger},
565 title = {Deductive Synthesis of the Unification Algorithm},
572 @InProceedings{martin-nipkow,
573 author = {Ursula Martin and Tobias Nipkow},
574 title = {Ordered Rewriting and Confluence},
579 author = {Per Martin-L{\"o}f},
580 title = {Intuitionistic type theory},
582 publisher = {Bibliopolis}}
584 @incollection{melham89,
585 author = {Thomas F. Melham},
586 title = {Automating Recursive Type Definitions in Higher Order
589 crossref = {birtwistle89}}
591 @Article{miller-mixed,
592 Author = {Dale Miller},
593 Title = {Unification Under a Mixed Prefix},
601 author = {Robin Milner},
602 title = {A Theory of Type Polymorphism in Programming},
603 journal = "J. Comp.\ Sys.\ Sci.",
608 @TechReport{milner-ind,
609 author = {Robin Milner},
610 title = {How to Derive Inductions in {LCF}},
611 institution = Edinburgh,
615 @Article{milner-coind,
616 author = {Robin Milner and Mads Tofte},
617 title = {Co-induction in Relational Semantics},
624 author = {Robin Milner},
625 title = {Communication and Concurrency},
626 publisher = Prentice,
629 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
630 title="The Definition of Standard ML",publisher=MIT,year=1990}
632 @PhdThesis{monahan84,
633 author = {Brian Q. Monahan},
634 title = {Data Type Proofs using Edinburgh {LCF}},
635 school = {University of Edinburgh},
638 @article{MuellerNvOS99,
640 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
641 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
643 @Manual{Muzalewski:Mizar,
644 title = {An Outline of {PC} {Mizar}},
645 author = {Micha{\l} Muzalewski},
646 organization = {Fondation of Logic, Mathematics and Informatics
647 --- Mizar Users Group},
649 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
654 @InProceedings{NaraschewskiW-TPHOLs98,
655 author = {Wolfgang Naraschewski and Markus Wenzel},
657 {Object-Oriented Verification based on Record Subtyping in
659 crossref = {tphols98}}
661 @inproceedings{nazareth-nipkow,
662 author = {Dieter Nazareth and Tobias Nipkow},
663 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
664 crossref = {tphols96},
668 @Article{needham-schroeder,
669 author = "Roger M. Needham and Michael D. Schroeder",
670 title = "Using Encryption for Authentication in Large Networks
679 @inproceedings{nipkow-W,
680 author = {Wolfgang Naraschewski and Tobias Nipkow},
681 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
682 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
683 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
684 publisher = Springer,
690 @InCollection{nipkow-sorts93,
691 author = {T. Nipkow},
692 title = {Order-Sorted Polymorphism in {Isabelle}},
693 booktitle = {Logical Environments},
696 editor = {G. Huet and G. Plotkin},
700 @Misc{nipkow-types93,
701 author = {Tobias Nipkow},
702 title = {Axiomatic Type Classes (in {I}sabelle)},
703 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
707 @inproceedings{Nipkow-CR,
708 author = {Tobias Nipkow},
709 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
710 booktitle = {Automated Deduction --- CADE-13},
711 editor = {M. McRobbie and J.K. Slaney},
712 publisher = Springer,
719 @InProceedings{nipkow-patterns,
720 title = {Functional Unification of Higher-Order Patterns},
721 author = {Tobias Nipkow},
724 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
725 keywords = {unification}}
728 author = {Tobias Nipkow},
729 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
735 @inproceedings{Nipkow-TYPES02,
736 author = {Tobias Nipkow},
737 title = {{Structured Proofs in Isar/HOL}},
738 booktitle = {Types for Proofs and Programs (TYPES 2002)},
739 editor = {H. Geuvers and F. Wiedijk},
741 publisher = Springer,
746 @manual{isabelle-HOL,
747 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
748 title = {{Isabelle}'s Logics: {HOL}},
749 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
750 M{\"u}nchen and Computer Laboratory, University of Cambridge},
751 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
753 @article{nipkow-prehofer,
754 author = {Tobias Nipkow and Christian Prehofer},
755 title = {Type Reconstruction for Type Classes},
763 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
764 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
765 publisher = {Springer},
767 note = {LNCS Tutorial 2283}}
770 author = {Philippe No{\"e}l},
771 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
779 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
780 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
782 publisher = {Oxford University Press},
787 @Manual{pvs-language,
788 title = {The {PVS} specification language},
789 author = {S. Owre and N. Shankar and J. M. Rushby},
790 organization = {Computer Science Laboratory, SRI International},
791 address = {Menlo Park, CA},
792 note = {Beta release},
795 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
800 @InProceedings{paulin-tlca,
801 author = {Christine Paulin-Mohring},
802 title = {Inductive Definitions in the System {Coq}: Rules and
807 @InProceedings{paulson-CADE,
808 author = {Lawrence C. Paulson},
809 title = {A Fixedpoint Approach to Implementing (Co)Inductive
814 @InProceedings{paulson-COLOG,
815 author = {Lawrence C. Paulson},
816 title = {A Formulation of the Simple Theory of Types (for
819 crossref = {colog88},
820 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
822 @Article{paulson-coind,
823 author = {Lawrence C. Paulson},
824 title = {Mechanizing Coinduction and Corecursion in Higher-Order
833 @manual{isabelle-intro,
834 author = {Lawrence C. Paulson},
835 title = {Introduction to {Isabelle}},
837 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
839 @manual{isabelle-logics,
840 author = {Lawrence C. Paulson},
841 title = {{Isabelle's} Logics},
843 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
845 @manual{isabelle-ref,
846 author = {Lawrence C. Paulson},
847 title = {The {Isabelle} Reference Manual},
849 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
852 author = {Lawrence C. Paulson},
853 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
855 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
857 @article{paulson-found,
858 author = {Lawrence C. Paulson},
859 title = {The Foundation of a Generic Theorem Prover},
865 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
867 %replaces paulson-final
868 @Article{paulson-mscs,
869 author = {Lawrence C. Paulson},
870 title = {Final Coalgebras as Greatest Fixed Points
872 journal = {Mathematical Structures in Computer Science},
877 @InCollection{paulson-generic,
878 author = {Lawrence C. Paulson},
879 title = {Generic Automatic Proof Tools},
880 crossref = {wos-fest},
884 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
885 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
894 @InCollection{paulson-fixedpt-milner,
895 author = {Lawrence C. Paulson},
896 title = {A Fixedpoint Approach to (Co)inductive and
897 (Co)datatype Definitions},
899 crossref = {milner-fest}}
902 title = {Proof, Language, and Interaction:
903 Essays in Honor of {Robin Milner}},
904 booktitle = {Proof, Language, and Interaction:
905 Essays in Honor of {Robin Milner}},
906 publisher = {MIT Press},
908 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
910 @InCollection{paulson-handbook,
911 author = {Lawrence C. Paulson},
912 title = {Designing a Theorem Prover},
913 crossref = {handbk-lics2},
916 @Book{paulson-isa-book,
917 author = {Lawrence C. Paulson},
918 title = {Isabelle: A Generic Theorem Prover},
919 publisher = {Springer},
923 @Book{isabelle-hol-book,
924 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
925 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
926 publisher = {Springer},
930 @InCollection{paulson-markt,
931 author = {Lawrence C. Paulson},
932 title = {Tool Support for Logics of Programs},
933 booktitle = {Mathematical Methods in Program Development:
934 Summer School Marktoberdorf 1996},
935 publisher = {Springer},
937 year = {Published 1997},
938 editor = {Manfred Broy},
939 series = {NATO ASI Series F}}
941 %replaces Paulson-ML and paulson91
943 author = {Lawrence C. Paulson},
944 title = {{ML} for the Working Programmer},
949 @article{paulson-natural,
950 author = {Lawrence C. Paulson},
951 title = {Natural Deduction as Higher-order Resolution},
956 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
958 @Article{paulson-set-I,
959 author = {Lawrence C. Paulson},
960 title = {Set Theory for Verification: {I}. {From}
961 Foundations to Functions},
967 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
969 @Article{paulson-set-II,
970 author = {Lawrence C. Paulson},
971 title = {Set Theory for Verification: {II}. {Induction} and
978 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
981 author = {Lawrence C. Paulson},
982 title = {Verifying the Unification Algorithm in {LCF}},
988 %replaces Paulson-LCF
990 author = {Lawrence C. Paulson},
991 title = {Logic and Computation: Interactive proof with Cambridge
996 @incollection{paulson700,
997 author = {Lawrence C. Paulson},
998 title = {{Isabelle}: The Next 700 Theorem Provers},
999 crossref = {odifreddi90},
1001 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1003 % replaces paulson-ns and paulson-security
1004 @Article{paulson-jcs,
1005 author = {Lawrence C. Paulson},
1006 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1012 @Article{paulson-tls,
1013 author = {Lawrence C. Paulson},
1014 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1022 @Article{paulson-yahalom,
1023 author = {Lawrence C. Paulson},
1024 title = {Relations Between Secrets:
1025 Two Formal Analyses of the {Yahalom} Protocol},
1029 @article{pelletier86,
1030 author = {F. J. Pelletier},
1031 title = {Seventy-five Problems for Testing Automatic Theorem
1037 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1040 author = {Andrew M. Pitts},
1041 title = {A Co-induction Principle for Recursively Defined Domains},
1047 @Article{plaisted90,
1048 author = {David A. Plaisted},
1049 title = {A Sequent-Style Model Elimination Strategy and a Positive
1060 author = {Art Quaife},
1061 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1071 @TechReport{rasmussen95,
1072 author = {Ole Rasmussen},
1073 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1075 institution = {Computer Laboratory, University of Cambridge},
1079 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1082 author = {Steve Reeves and Michael Clarke},
1083 title = {Logic for Computer Science},
1084 publisher = {Addison-Wesley},
1087 @book{Rosen-DMA,author={Kenneth H. Rosen},
1088 title={Discrete Mathematics and Its Applications},
1089 publisher={McGraw-Hill},year=1998}
1091 @InProceedings{Rudnicki:1992:MizarOverview,
1092 author = {P. Rudnicki},
1093 title = {An Overview of the {MIZAR} Project},
1094 booktitle = {1992 Workshop on Types for Proofs and Programs},
1096 organization = {Chalmers University of Technology},
1097 publisher = {Bastad}
1102 @inproceedings{saaltink-fme,
1103 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1104 Dan Craigen and Irwin Meisels},
1105 title = {An {EVES} Data Abstraction Example},
1109 @inproceedings{slind-tfl,
1110 author = {Konrad Slind},
1111 title = {Function Definition in Higher Order Logic},
1112 booktitle = {Theorem Proving in Higher Order Logics},
1113 editor = {J. von Wright and J. Grundy and J. Harrison},
1114 publisher = Springer,
1121 author = {Patrick Suppes},
1122 title = {Axiomatic Set Theory},
1124 publisher = {Dover}}
1126 @InCollection{szasz93,
1127 author = {Nora Szasz},
1128 title = {A Machine Checked Proof that {Ackermann's} Function is not
1129 Primitive Recursive},
1130 crossref = {huet-plotkin93},
1133 @TechReport{Syme:1997:DECLARE,
1135 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1136 institution = {University of Cambridge Computer Laboratory},
1141 @PhdThesis{Syme:1998:thesis,
1143 title = {Declarative Theorem Proving for Operational Semantics},
1144 school = {University of Cambridge},
1149 @InProceedings{Syme:1999:TPHOL,
1151 title = {Three Tactic Theorem Proving},
1152 crossref = {tphols99}}
1157 author = {G. Takeuti},
1158 title = {Proof Theory},
1164 author = {Simon Thompson},
1165 title = {Type Theory and Functional Programming},
1166 publisher = {Addison-Wesley},
1169 @book{Thompson-Haskell,author={Simon Thompson},
1170 title={Haskell: The Craft of Functional Programming},
1171 publisher={Addison-Wesley},year=1999}
1173 @Unpublished{Trybulec:1993:MizarFeatures,
1174 author = {A. Trybulec},
1175 title = {Some Features of the {Mizar} Language},
1176 note = {Presented at a workshop in Turin, Italy},
1182 @Unpublished{voelker94,
1183 author = {Norbert V{\"o}lker},
1184 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1185 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1192 author = {Christoph Wedler},
1193 title = {Emacs package ``{X-Symbol}''},
1194 note = {\url{http://x-symbol.sourceforge.net}}
1197 @manual{isabelle-sys,
1198 author = {Markus Wenzel and Stefan Berghofer},
1199 title = {The {Isabelle} System Manual},
1200 institution = {TU Munich},
1201 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1203 @manual{isabelle-isar-ref,
1204 author = {Markus Wenzel},
1205 title = {The {Isabelle/Isar} Reference Manual},
1206 institution = {TU Munich},
1207 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1209 @manual{isabelle-axclass,
1210 author = {Markus Wenzel},
1211 title = {Using Axiomatic Type Classes in {I}sabelle},
1212 institution = {TU Munich},
1214 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1217 @InProceedings{Wenzel:1999:TPHOL,
1218 author = {Markus Wenzel},
1219 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1220 crossref = {tphols99}}
1222 @InProceedings{Wenzel:1997:TPHOL,
1223 author = {Markus Wenzel},
1224 title = {Type Classes and Overloading in Higher-Order Logic},
1225 crossref = {tphols97}}
1227 @phdthesis{Wenzel-PhD,
1228 author={Markus Wenzel},
1229 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1230 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1232 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1235 author = {A. N. Whitehead and B. Russell},
1236 title = {Principia Mathematica},
1239 note = {Paperback edition to *56,
1240 abridged from the 2nd edition (1927)}}
1242 @Misc{Wiedijk:1999:Mizar,
1243 author = {Freek Wiedijk},
1244 title = {Mizar: An Impression},
1245 howpublished = {Unpublished paper},
1247 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1250 @Misc{Wiedijk:2000:MV,
1251 author = {Freek Wiedijk},
1252 title = {The Mathematical Vernacular},
1253 howpublished = {Unpublished paper},
1255 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1259 author = {Glynn Winskel},
1260 title = {The Formal Semantics of Programming Languages},
1261 publisher = MIT,year=1993}
1263 @InCollection{wos-bledsoe,
1264 author = {Larry Wos},
1265 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1266 crossref = {bledsoe-fest},
1269 @InProceedings{Zammit:1999:TPHOL,
1270 author = {Vincent Zammit},
1271 title = {On the Implementation of an Extensible Declarative Proof Language},
1272 crossref = {tphols99}}
1280 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1281 title = {Handbook of Logic in Computer Science},
1282 booktitle = {Handbook of Logic in Computer Science},
1283 publisher = {Oxford University Press},
1288 editor = {Henk Barendregt and Tobias Nipkow},
1289 title = TYPES # {: International Workshop {TYPES '93}},
1290 booktitle = TYPES # {: International Workshop {TYPES '93}},
1291 year = {published 1994},
1292 publisher = {Springer},
1293 series = {LNCS 806}}
1295 @book{barwise-handbk,
1296 editor = {J. Barwise},
1297 title = {Handbook of Mathematical Logic},
1298 booktitle = {Handbook of Mathematical Logic},
1302 @Proceedings{tlca93,
1303 title = {Typed Lambda Calculi and Applications},
1304 booktitle = {Typed Lambda Calculi and Applications},
1305 editor = {M. Bezem and J.F. Groote},
1307 publisher = {Springer},
1308 series = {LNCS 664}}
1311 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1312 title = {Current Trends in Hardware Verification and Automated
1314 booktitle = {Current Trends in Hardware Verification and Automated
1316 publisher = {Springer},
1320 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1321 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1322 publisher = {Kluwer Academic Publishers},
1324 editor = {Robert S. Boyer}}
1326 @Proceedings{cade12,
1327 editor = {Alan Bundy},
1328 title = {Automated Deduction --- {CADE}-12
1329 International Conference},
1330 booktitle = {Automated Deduction --- {CADE}-12
1331 International Conference},
1333 series = {LNAI 814},
1334 publisher = {Springer}}
1337 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1338 title = TYPES # {: International Workshop {TYPES '94}},
1339 booktitle = TYPES # {: International Workshop {TYPES '94}},
1341 publisher = {Springer},
1342 series = {LNCS 996}}
1344 @book{huet-plotkin91,
1345 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1346 title = {Logical Frameworks},
1347 booktitle = {Logical Frameworks},
1351 @book{huet-plotkin93,
1352 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1353 title = {Logical Environments},
1354 booktitle = {Logical Environments},
1359 editor = {J. Joyce and C. Seger},
1360 title = {Higher Order Logic Theorem Proving and Its
1361 Applications: HUG '93},
1362 booktitle = {Higher Order Logic Theorem Proving and Its
1363 Applications: HUG '93},
1364 year = {Published 1994},
1365 publisher = {Springer},
1366 series = {LNCS 780}}
1368 @proceedings{colog88,
1369 editor = {P. Martin-L{\"o}f and G. Mints},
1370 title = {COLOG-88: International Conference on Computer Logic},
1371 booktitle = {COLOG-88: International Conference on Computer Logic},
1372 year = {Published 1990},
1373 publisher = {Springer},
1374 organization = {Estonian Academy of Sciences},
1375 address = {Tallinn},
1376 series = {LNCS 417}}
1379 editor = {P. Odifreddi},
1380 title = {Logic and Computer Science},
1381 booktitle = {Logic and Computer Science},
1382 publisher = {Academic Press},
1385 @proceedings{extensions91,
1386 editor = {Peter Schroeder-Heister},
1387 title = {Extensions of Logic Programming},
1388 booktitle = {Extensions of Logic Programming},
1390 series = {LNAI 475},
1391 publisher = {Springer}}
1393 @proceedings{cade10,
1394 editor = {Mark E. Stickel},
1395 title = {10th } # CADE,
1396 booktitle = {10th } # CADE,
1398 publisher = {Springer},
1399 series = {LNAI 449}}
1402 editor = {M. Vardi},
1403 title = {Eighth Annual Symposium on Logic in Computer Science},
1404 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1409 title = {Automated Reasoning and its Applications:
1410 Essays in Honor of {Larry Wos}},
1411 booktitle = {Automated Reasoning and its Applications:
1412 Essays in Honor of {Larry Wos}},
1413 publisher = {MIT Press},
1415 editor = {Robert Veroff}}
1418 editor = {J. C. P. Woodcock and P. G. Larsen},
1419 title = {FME '93: Industrial-Strength Formal Methods},
1420 booktitle = {FME '93: Industrial-Strength Formal Methods},
1422 publisher = Springer,
1426 @Proceedings{tphols96,
1427 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1428 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1429 editor = {J. von Wright and J. Grundy and J. Harrison},
1430 publisher = Springer,
1435 @Proceedings{tphols97,
1436 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1437 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1438 editor = {Elsa L. Gunter and Amy Felty},
1439 publisher = Springer,
1444 @Proceedings{tphols98,
1445 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1446 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1447 editor = {Jim Grundy and Malcom Newey},
1448 publisher = Springer,
1453 @Proceedings{tphols99,
1454 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1455 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1456 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1457 Paulin, C. and Thery, L.},
1458 publisher = Springer,
1463 @Proceedings{tphols2000,
1464 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1465 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1466 editor = {J. Harrison and M. Aagaard},
1467 publisher = Springer,
1472 @Proceedings{tphols2001,
1473 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1474 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1475 editor = {R. J. Boulton and P. B. Jackson},
1476 publisher = Springer,