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 @InProceedings{gimenez-codifying,
384 author = {Eduardo Gim{\'e}nez},
385 title = {Codifying Guarded Definitions with Recursive Schemes},
386 crossref = {types94},
391 author = {Jean-Yves Girard},
392 title = {Proofs and Types},
395 note = {Translated by Yves LaFont and Paul Taylor}}
398 editor = {M. J. C. Gordon and T. F. Melham},
399 title = {Introduction to {HOL}: A Theorem Proving Environment for
405 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
407 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
409 publisher = {Springer},
412 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
413 title={Why we can't have {SML} style datatype declarations in {HOL}},
414 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
415 IFIP TC10/WG10.2 Intl. Workshop, 1992},
416 editor={L.J.M. Claesen and M.J.C. Gordon},
417 publisher=NH,year=1993,pages={561--568}}
419 @InProceedings{gunter-trees,
420 author = {Elsa L. Gunter},
421 title = {A Broader Class of Trees for Recursive Type Definitions for
429 author = {Paul R. Halmos},
430 title = {Naive Set Theory},
431 publisher = {Van Nostrand},
434 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
435 title={Dynamic Logic},publisher=MIT,year=2000}
438 author = {Matthew Hennessy},
439 title = {The Semantics of Programming Languages: An Elementary
440 Introduction Using Structural Operational Semantics},
444 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
445 title={Introduction to Automata Theory, Languages, and Computation.},
446 publisher={Addison-Wesley},year=1979}
448 @Article{haskell-report,
449 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
450 title = {Report on the Programming Language {Haskell}: A
451 Non-strict, Purely Functional Language},
457 note = {Version 1.2}}
459 @Article{haskell-tutorial,
460 author = {Paul Hudak and Joseph H. Fasel},
461 title = {A Gentle Introduction to {Haskell}},
468 @book{Hudak-Haskell,author={Paul Hudak},
469 title={The Haskell School of Expression},publisher=CUP,year=2000}
472 author = {G. P. Huet},
473 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
480 author = {G. P. Huet and B. Lang},
481 title = {Proving and Applying Program Transformations Expressed with
482 Second-Order Patterns},
488 @inproceedings{huet88,
489 author = {G{\'e}rard Huet},
490 title = {Induction Principles Formalized in the {Calculus of
492 booktitle = {Programming of Future Generation Computers},
493 editor = {K. Fuchi and M. Nivat},
496 publisher = {Elsevier}}
498 @Book{Huth-Ryan-book,
499 author = {Michael Huth and Mark Ryan},
500 title = {Logic in Computer Science. Modelling and reasoning about systems},
504 @InProceedings{Harrison:1996:MizarHOL,
505 author = {J. Harrison},
506 title = {A {Mizar} Mode for {HOL}},
508 crossref = {tphols96}}
512 @InProceedings{kammueller-locales,
513 author = {Florian Kamm{\"u}ller and Markus Wenzel and
514 Lawrence C. Paulson},
515 title = {Locales: A Sectioning Concept for {Isabelle}},
516 crossref = {tphols99}}
519 author={Donald E. Knuth},
520 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
521 publisher={Addison-Wesley},
525 author = {R. E. Korf},
526 title = {Depth-First Iterative-Deepening: an Optimal Admissible
534 author = {Kenneth Kunen},
535 title = {Set Theory: An Introduction to Independence Proofs},
541 @InProceedings{lowe-fdr,
542 author = {Gavin Lowe},
543 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
544 Protocol using {CSP} and {FDR}},
545 booktitle = {Tools and Algorithms for the Construction and Analysis
546 of Systems: second international workshop, TACAS '96},
547 editor = {T. Margaria and B. Steffen},
548 series = {LNCS 1055},
550 publisher = {Springer},
557 author = {Zohar Manna and Richard Waldinger},
558 title = {Deductive Synthesis of the Unification Algorithm},
565 @InProceedings{martin-nipkow,
566 author = {Ursula Martin and Tobias Nipkow},
567 title = {Ordered Rewriting and Confluence},
572 author = {Per Martin-L{\"o}f},
573 title = {Intuitionistic type theory},
575 publisher = {Bibliopolis}}
577 @incollection{melham89,
578 author = {Thomas F. Melham},
579 title = {Automating Recursive Type Definitions in Higher Order
582 crossref = {birtwistle89}}
584 @Article{miller-mixed,
585 Author = {Dale Miller},
586 Title = {Unification Under a Mixed Prefix},
594 author = {Robin Milner},
595 title = {A Theory of Type Polymorphism in Programming},
596 journal = "J. Comp.\ Sys.\ Sci.",
601 @TechReport{milner-ind,
602 author = {Robin Milner},
603 title = {How to Derive Inductions in {LCF}},
604 institution = Edinburgh,
608 @Article{milner-coind,
609 author = {Robin Milner and Mads Tofte},
610 title = {Co-induction in Relational Semantics},
617 author = {Robin Milner},
618 title = {Communication and Concurrency},
619 publisher = Prentice,
622 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
623 title="The Definition of Standard ML",publisher=MIT,year=1990}
625 @PhdThesis{monahan84,
626 author = {Brian Q. Monahan},
627 title = {Data Type Proofs using Edinburgh {LCF}},
628 school = {University of Edinburgh},
631 @article{MuellerNvOS99,
633 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
634 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
636 @Manual{Muzalewski:Mizar,
637 title = {An Outline of {PC} {Mizar}},
638 author = {Micha{\l} Muzalewski},
639 organization = {Fondation of Logic, Mathematics and Informatics
640 --- Mizar Users Group},
642 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
647 @InProceedings{NaraschewskiW-TPHOLs98,
648 author = {Wolfgang Naraschewski and Markus Wenzel},
650 {Object-Oriented Verification based on Record Subtyping in
652 crossref = {tphols98}}
654 @inproceedings{nazareth-nipkow,
655 author = {Dieter Nazareth and Tobias Nipkow},
656 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
657 crossref = {tphols96},
661 @Article{needham-schroeder,
662 author = "Roger M. Needham and Michael D. Schroeder",
663 title = "Using Encryption for Authentication in Large Networks
672 @inproceedings{nipkow-W,
673 author = {Wolfgang Naraschewski and Tobias Nipkow},
674 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
675 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
676 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
677 publisher = Springer,
683 @InCollection{nipkow-sorts93,
684 author = {T. Nipkow},
685 title = {Order-Sorted Polymorphism in {Isabelle}},
686 booktitle = {Logical Environments},
689 editor = {G. Huet and G. Plotkin},
693 @Misc{nipkow-types93,
694 author = {Tobias Nipkow},
695 title = {Axiomatic Type Classes (in {I}sabelle)},
696 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
700 @inproceedings{Nipkow-CR,
701 author = {Tobias Nipkow},
702 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
703 booktitle = {Automated Deduction --- CADE-13},
704 editor = {M. McRobbie and J.K. Slaney},
705 publisher = Springer,
712 @InProceedings{nipkow-patterns,
713 title = {Functional Unification of Higher-Order Patterns},
714 author = {Tobias Nipkow},
717 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
718 keywords = {unification}}
721 author = {Tobias Nipkow},
722 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
728 @inproceedings{Nipkow-TYPES02,
729 author = {Tobias Nipkow},
730 title = {{Structured Proofs in Isar/HOL}},
731 booktitle = {Types for Proofs and Programs (TYPES 2002)},
732 editor = {H. Geuvers and F. Wiedijk},
734 publisher = Springer,
739 @manual{isabelle-HOL,
740 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
741 title = {{Isabelle}'s Logics: {HOL}},
742 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
743 M{\"u}nchen and Computer Laboratory, University of Cambridge},
744 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
746 @article{nipkow-prehofer,
747 author = {Tobias Nipkow and Christian Prehofer},
748 title = {Type Reconstruction for Type Classes},
756 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
757 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
758 publisher = {Springer},
760 note = {LNCS Tutorial 2283}}
763 author = {Philippe No{\"e}l},
764 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
772 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
773 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
775 publisher = {Oxford University Press},
780 @Manual{pvs-language,
781 title = {The {PVS} specification language},
782 author = {S. Owre and N. Shankar and J. M. Rushby},
783 organization = {Computer Science Laboratory, SRI International},
784 address = {Menlo Park, CA},
785 note = {Beta release},
788 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
793 @InProceedings{paulin-tlca,
794 author = {Christine Paulin-Mohring},
795 title = {Inductive Definitions in the System {Coq}: Rules and
800 @InProceedings{paulson-CADE,
801 author = {Lawrence C. Paulson},
802 title = {A Fixedpoint Approach to Implementing (Co)Inductive
807 @InProceedings{paulson-COLOG,
808 author = {Lawrence C. Paulson},
809 title = {A Formulation of the Simple Theory of Types (for
812 crossref = {colog88},
813 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
815 @Article{paulson-coind,
816 author = {Lawrence C. Paulson},
817 title = {Mechanizing Coinduction and Corecursion in Higher-Order
826 @manual{isabelle-intro,
827 author = {Lawrence C. Paulson},
828 title = {Introduction to {Isabelle}},
830 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
832 @manual{isabelle-logics,
833 author = {Lawrence C. Paulson},
834 title = {{Isabelle's} Logics},
836 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
838 @manual{isabelle-ref,
839 author = {Lawrence C. Paulson},
840 title = {The {Isabelle} Reference Manual},
842 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
845 author = {Lawrence C. Paulson},
846 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
848 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
850 @article{paulson-found,
851 author = {Lawrence C. Paulson},
852 title = {The Foundation of a Generic Theorem Prover},
858 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
860 %replaces paulson-final
861 @Article{paulson-mscs,
862 author = {Lawrence C. Paulson},
863 title = {Final Coalgebras as Greatest Fixed Points
865 journal = {Mathematical Structures in Computer Science},
870 @InCollection{paulson-generic,
871 author = {Lawrence C. Paulson},
872 title = {Generic Automatic Proof Tools},
873 crossref = {wos-fest},
877 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
878 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
887 @InCollection{paulson-fixedpt-milner,
888 author = {Lawrence C. Paulson},
889 title = {A Fixedpoint Approach to (Co)inductive and
890 (Co)datatype Definitions},
892 crossref = {milner-fest}}
895 title = {Proof, Language, and Interaction:
896 Essays in Honor of {Robin Milner}},
897 booktitle = {Proof, Language, and Interaction:
898 Essays in Honor of {Robin Milner}},
899 publisher = {MIT Press},
901 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
903 @InCollection{paulson-handbook,
904 author = {Lawrence C. Paulson},
905 title = {Designing a Theorem Prover},
906 crossref = {handbk-lics2},
909 @Book{paulson-isa-book,
910 author = {Lawrence C. Paulson},
911 title = {Isabelle: A Generic Theorem Prover},
912 publisher = {Springer},
916 @Book{isabelle-hol-book,
917 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
918 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
919 publisher = {Springer},
923 @InCollection{paulson-markt,
924 author = {Lawrence C. Paulson},
925 title = {Tool Support for Logics of Programs},
926 booktitle = {Mathematical Methods in Program Development:
927 Summer School Marktoberdorf 1996},
928 publisher = {Springer},
930 year = {Published 1997},
931 editor = {Manfred Broy},
932 series = {NATO ASI Series F}}
934 %replaces Paulson-ML and paulson91
936 author = {Lawrence C. Paulson},
937 title = {{ML} for the Working Programmer},
942 @article{paulson-natural,
943 author = {Lawrence C. Paulson},
944 title = {Natural Deduction as Higher-order Resolution},
949 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
951 @Article{paulson-set-I,
952 author = {Lawrence C. Paulson},
953 title = {Set Theory for Verification: {I}. {From}
954 Foundations to Functions},
960 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
962 @Article{paulson-set-II,
963 author = {Lawrence C. Paulson},
964 title = {Set Theory for Verification: {II}. {Induction} and
971 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
974 author = {Lawrence C. Paulson},
975 title = {Verifying the Unification Algorithm in {LCF}},
981 %replaces Paulson-LCF
983 author = {Lawrence C. Paulson},
984 title = {Logic and Computation: Interactive proof with Cambridge
989 @incollection{paulson700,
990 author = {Lawrence C. Paulson},
991 title = {{Isabelle}: The Next 700 Theorem Provers},
992 crossref = {odifreddi90},
994 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
996 % replaces paulson-ns and paulson-security
997 @Article{paulson-jcs,
998 author = {Lawrence C. Paulson},
999 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1005 @Article{paulson-tls,
1006 author = {Lawrence C. Paulson},
1007 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1015 @Article{paulson-yahalom,
1016 author = {Lawrence C. Paulson},
1017 title = {Relations Between Secrets:
1018 Two Formal Analyses of the {Yahalom} Protocol},
1022 @article{pelletier86,
1023 author = {F. J. Pelletier},
1024 title = {Seventy-five Problems for Testing Automatic Theorem
1030 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1033 author = {Andrew M. Pitts},
1034 title = {A Co-induction Principle for Recursively Defined Domains},
1040 @Article{plaisted90,
1041 author = {David A. Plaisted},
1042 title = {A Sequent-Style Model Elimination Strategy and a Positive
1053 author = {Art Quaife},
1054 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1064 @TechReport{rasmussen95,
1065 author = {Ole Rasmussen},
1066 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1068 institution = {Computer Laboratory, University of Cambridge},
1072 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1075 author = {Steve Reeves and Michael Clarke},
1076 title = {Logic for Computer Science},
1077 publisher = {Addison-Wesley},
1080 @book{Rosen-DMA,author={Kenneth H. Rosen},
1081 title={Discrete Mathematics and Its Applications},
1082 publisher={McGraw-Hill},year=1998}
1084 @InProceedings{Rudnicki:1992:MizarOverview,
1085 author = {P. Rudnicki},
1086 title = {An Overview of the {MIZAR} Project},
1087 booktitle = {1992 Workshop on Types for Proofs and Programs},
1089 organization = {Chalmers University of Technology},
1090 publisher = {Bastad}
1095 @inproceedings{saaltink-fme,
1096 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1097 Dan Craigen and Irwin Meisels},
1098 title = {An {EVES} Data Abstraction Example},
1102 @inproceedings{slind-tfl,
1103 author = {Konrad Slind},
1104 title = {Function Definition in Higher Order Logic},
1105 booktitle = {Theorem Proving in Higher Order Logics},
1106 editor = {J. von Wright and J. Grundy and J. Harrison},
1107 publisher = Springer,
1114 author = {Patrick Suppes},
1115 title = {Axiomatic Set Theory},
1117 publisher = {Dover}}
1119 @InCollection{szasz93,
1120 author = {Nora Szasz},
1121 title = {A Machine Checked Proof that {Ackermann's} Function is not
1122 Primitive Recursive},
1123 crossref = {huet-plotkin93},
1126 @TechReport{Syme:1997:DECLARE,
1128 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1129 institution = {University of Cambridge Computer Laboratory},
1134 @PhdThesis{Syme:1998:thesis,
1136 title = {Declarative Theorem Proving for Operational Semantics},
1137 school = {University of Cambridge},
1142 @InProceedings{Syme:1999:TPHOL,
1144 title = {Three Tactic Theorem Proving},
1145 crossref = {tphols99}}
1150 author = {G. Takeuti},
1151 title = {Proof Theory},
1157 author = {Simon Thompson},
1158 title = {Type Theory and Functional Programming},
1159 publisher = {Addison-Wesley},
1162 @book{Thompson-Haskell,author={Simon Thompson},
1163 title={Haskell: The Craft of Functional Programming},
1164 publisher={Addison-Wesley},year=1999}
1166 @Unpublished{Trybulec:1993:MizarFeatures,
1167 author = {A. Trybulec},
1168 title = {Some Features of the {Mizar} Language},
1169 note = {Presented at a workshop in Turin, Italy},
1175 @Unpublished{voelker94,
1176 author = {Norbert V{\"o}lker},
1177 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1178 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1185 author = {Christoph Wedler},
1186 title = {Emacs package ``{X-Symbol}''},
1187 note = {\url{http://x-symbol.sourceforge.net}}
1190 @manual{isabelle-sys,
1191 author = {Markus Wenzel and Stefan Berghofer},
1192 title = {The {Isabelle} System Manual},
1193 institution = {TU Munich},
1194 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1196 @manual{isabelle-isar-ref,
1197 author = {Markus Wenzel},
1198 title = {The {Isabelle/Isar} Reference Manual},
1199 institution = {TU Munich},
1200 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1202 @manual{isabelle-axclass,
1203 author = {Markus Wenzel},
1204 title = {Using Axiomatic Type Classes in {I}sabelle},
1205 institution = {TU Munich},
1207 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1210 @InProceedings{Wenzel:1999:TPHOL,
1211 author = {Markus Wenzel},
1212 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1213 crossref = {tphols99}}
1215 @InProceedings{Wenzel:1997:TPHOL,
1216 author = {Markus Wenzel},
1217 title = {Type Classes and Overloading in Higher-Order Logic},
1218 crossref = {tphols97}}
1220 @phdthesis{Wenzel-PhD,
1221 author={Markus Wenzel},
1222 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1223 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1225 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1228 author = {A. N. Whitehead and B. Russell},
1229 title = {Principia Mathematica},
1232 note = {Paperback edition to *56,
1233 abridged from the 2nd edition (1927)}}
1235 @Misc{Wiedijk:1999:Mizar,
1236 author = {Freek Wiedijk},
1237 title = {Mizar: An Impression},
1238 howpublished = {Unpublished paper},
1240 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1243 @Misc{Wiedijk:2000:MV,
1244 author = {Freek Wiedijk},
1245 title = {The Mathematical Vernacular},
1246 howpublished = {Unpublished paper},
1248 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1252 author = {Glynn Winskel},
1253 title = {The Formal Semantics of Programming Languages},
1254 publisher = MIT,year=1993}
1256 @InCollection{wos-bledsoe,
1257 author = {Larry Wos},
1258 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1259 crossref = {bledsoe-fest},
1262 @InProceedings{Zammit:1999:TPHOL,
1263 author = {Vincent Zammit},
1264 title = {On the Implementation of an Extensible Declarative Proof Language},
1265 crossref = {tphols99}}
1273 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1274 title = {Handbook of Logic in Computer Science},
1275 booktitle = {Handbook of Logic in Computer Science},
1276 publisher = {Oxford University Press},
1281 editor = {Henk Barendregt and Tobias Nipkow},
1282 title = TYPES # {: International Workshop {TYPES '93}},
1283 booktitle = TYPES # {: International Workshop {TYPES '93}},
1284 year = {published 1994},
1285 publisher = {Springer},
1286 series = {LNCS 806}}
1288 @book{barwise-handbk,
1289 editor = {J. Barwise},
1290 title = {Handbook of Mathematical Logic},
1291 booktitle = {Handbook of Mathematical Logic},
1295 @Proceedings{tlca93,
1296 title = {Typed Lambda Calculi and Applications},
1297 booktitle = {Typed Lambda Calculi and Applications},
1298 editor = {M. Bezem and J.F. Groote},
1300 publisher = {Springer},
1301 series = {LNCS 664}}
1304 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1305 title = {Current Trends in Hardware Verification and Automated
1307 booktitle = {Current Trends in Hardware Verification and Automated
1309 publisher = {Springer},
1313 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1314 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1315 publisher = {Kluwer Academic Publishers},
1317 editor = {Robert S. Boyer}}
1319 @Proceedings{cade12,
1320 editor = {Alan Bundy},
1321 title = {Automated Deduction --- {CADE}-12
1322 International Conference},
1323 booktitle = {Automated Deduction --- {CADE}-12
1324 International Conference},
1326 series = {LNAI 814},
1327 publisher = {Springer}}
1330 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1331 title = TYPES # {: International Workshop {TYPES '94}},
1332 booktitle = TYPES # {: International Workshop {TYPES '94}},
1334 publisher = {Springer},
1335 series = {LNCS 996}}
1337 @book{huet-plotkin91,
1338 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1339 title = {Logical Frameworks},
1340 booktitle = {Logical Frameworks},
1344 @book{huet-plotkin93,
1345 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1346 title = {Logical Environments},
1347 booktitle = {Logical Environments},
1352 editor = {J. Joyce and C. Seger},
1353 title = {Higher Order Logic Theorem Proving and Its
1354 Applications: HUG '93},
1355 booktitle = {Higher Order Logic Theorem Proving and Its
1356 Applications: HUG '93},
1357 year = {Published 1994},
1358 publisher = {Springer},
1359 series = {LNCS 780}}
1361 @proceedings{colog88,
1362 editor = {P. Martin-L{\"o}f and G. Mints},
1363 title = {COLOG-88: International Conference on Computer Logic},
1364 booktitle = {COLOG-88: International Conference on Computer Logic},
1365 year = {Published 1990},
1366 publisher = {Springer},
1367 organization = {Estonian Academy of Sciences},
1368 address = {Tallinn},
1369 series = {LNCS 417}}
1372 editor = {P. Odifreddi},
1373 title = {Logic and Computer Science},
1374 booktitle = {Logic and Computer Science},
1375 publisher = {Academic Press},
1378 @proceedings{extensions91,
1379 editor = {Peter Schroeder-Heister},
1380 title = {Extensions of Logic Programming},
1381 booktitle = {Extensions of Logic Programming},
1383 series = {LNAI 475},
1384 publisher = {Springer}}
1386 @proceedings{cade10,
1387 editor = {Mark E. Stickel},
1388 title = {10th } # CADE,
1389 booktitle = {10th } # CADE,
1391 publisher = {Springer},
1392 series = {LNAI 449}}
1395 editor = {M. Vardi},
1396 title = {Eighth Annual Symposium on Logic in Computer Science},
1397 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1402 title = {Automated Reasoning and its Applications:
1403 Essays in Honor of {Larry Wos}},
1404 booktitle = {Automated Reasoning and its Applications:
1405 Essays in Honor of {Larry Wos}},
1406 publisher = {MIT Press},
1408 editor = {Robert Veroff}}
1411 editor = {J. C. P. Woodcock and P. G. Larsen},
1412 title = {FME '93: Industrial-Strength Formal Methods},
1413 booktitle = {FME '93: Industrial-Strength Formal Methods},
1415 publisher = Springer,
1419 @Proceedings{tphols96,
1420 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1421 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1422 editor = {J. von Wright and J. Grundy and J. Harrison},
1423 publisher = Springer,
1428 @Proceedings{tphols97,
1429 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1430 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1431 editor = {Elsa L. Gunter and Amy Felty},
1432 publisher = Springer,
1437 @Proceedings{tphols98,
1438 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1439 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1440 editor = {Jim Grundy and Malcom Newey},
1441 publisher = Springer,
1446 @Proceedings{tphols99,
1447 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1448 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1449 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1450 Paulin, C. and Thery, L.},
1451 publisher = Springer,
1456 @Proceedings{tphols2000,
1457 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1458 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1459 editor = {J. Harrison and M. Aagaard},
1460 publisher = Springer,
1465 @Proceedings{tphols2001,
1466 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1467 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1468 editor = {R. J. Boulton and P. B. Jackson},
1469 publisher = Springer,