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://www.proofgeneral.org/~da/drafts/eproof.ps.gz}}
93 @InProceedings{Aspinall:TACAS:2000,
94 author = {David Aspinall},
95 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
96 booktitle = {Tools and Algorithms for the Construction and Analysis of
106 author = {David Aspinall},
107 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
108 note = {\url{http://www.proofgeneral.org/~da/Isamode/}}
112 author = {David Aspinall},
113 title = {{P}roof {G}eneral},
114 note = {\url{http://www.proofgeneral.org}}
119 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
120 title="Term Rewriting and All That",publisher=CUP,year=1998}
122 @incollection{basin91,
123 author = {David Basin and Matt Kaufmann},
124 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
126 crossref = {huet-plotkin91},
129 @Unpublished{HOL-Library,
130 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
131 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
133 title = {The Supplemental {Isabelle/HOL} Library},
134 note = {Part of the Isabelle distribution,
135 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
139 @InProceedings{Bauer-Wenzel:2000:HB,
140 author = {Gertrud Bauer and Markus Wenzel},
141 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
143 booktitle = {Types for Proofs and Programs: TYPES'99},
144 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
150 @InProceedings{Bauer-Wenzel:2001,
151 author = {Gertrud Bauer and Markus Wenzel},
152 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
153 crossref = {tphols2001}}
155 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
156 crossref = "tphols2000",
157 title = "Proof terms for simply typed higher order logic",
158 author = "Stefan Berghofer and Tobias Nipkow",
161 @InProceedings{Berghofer-Nipkow:2002,
162 author = {Stefan Berghofer and Tobias Nipkow},
163 title = {Executing Higher Order Logic},
164 booktitle = {Types for Proofs and Programs: TYPES'2000},
165 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
167 publisher = Springer,
171 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
172 author = {Stefan Berghofer and Markus Wenzel},
173 title = {Inductive datatypes in {HOL} --- lessons learned in
174 {F}ormal-{L}ogic {E}ngineering},
175 crossref = {tphols99}}
177 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
178 title="Introduction to Functional Programming",publisher=PH,year=1988}
180 @book{Bird-Haskell,author="Richard Bird",
181 title="Introduction to Functional Programming using Haskell",
182 publisher=PH,year=1998}
185 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
186 Overbeek and Mark Stickel and Lawrence Wos},
187 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
196 author = {Robert S. Boyer and J Strother Moore},
197 title = {A Computational Logic},
198 publisher = {Academic Press},
202 author = {Robert S. Boyer and J Strother Moore},
203 title = {A Computational Logic Handbook},
204 publisher = {Academic Press},
208 author = {N. G. de Bruijn},
209 title = {Lambda Calculus Notation with Nameless Dummies,
210 a Tool for Automatic Formula Manipulation,
211 with Application to the {Church-Rosser Theorem}},
212 journal = {Indag. Math.},
218 author = {M. Burrows and M. Abadi and R. M. Needham},
219 title = {A Logic of Authentication},
227 @TechReport{camilleri92,
228 author = {J. Camilleri and T. F. Melham},
229 title = {Reasoning with Inductively Defined Relations in the
230 {HOL} Theorem Prover},
237 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
238 title = {Artificial Intelligence Programming},
239 publisher = {Lawrence Erlbaum Associates},
243 author = "Alonzo Church",
244 title = "A Formulation of the Simple Theory of Types",
250 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
251 title="Model Checking",publisher=MIT,year=1999}
254 author = {Martin D. Coen},
255 title = {Interactive Program Derivation},
256 school = {University of Cambridge},
257 note = {Computer Laboratory Technical Report 272},
262 author = {R. L. Constable and others},
263 title = {Implementing Mathematics with the Nuprl Proof
265 publisher = Prentice,
270 @Book{davey-priestley,
271 author = {B. A. Davey and H. A. Priestley},
272 title = {Introduction to Lattices and Order},
277 author = {Keith J. Devlin},
278 title = {Fundamentals of Contemporary Set Theory},
279 publisher = {Springer},
283 author = {Michael Dummett},
284 title = {Elements of Intuitionism},
286 publisher = {Oxford University Press}}
288 @incollection{dybjer91,
289 author = {Peter Dybjer},
290 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
291 Theory and Their Set-Theoretic Semantics},
292 crossref = {huet-plotkin91},
296 author = {Roy Dyckhoff},
297 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
307 author = {William M. Farmer and Joshua D. Guttman and F. Javier
309 title = {{IMPS}: An Interactive Mathematical Proof System},
316 @InProceedings{felty91a,
317 Author = {Amy Felty},
318 Title = {A Logic Program for Transforming Sequent Proofs to Natural
320 crossref = {extensions91},
323 @Article{fleuriot-jcm,
324 author = {Jacques Fleuriot and Lawrence C. Paulson},
325 title = {Mechanizing Nonstandard Real Analysis},
326 journal = {LMS Journal of Computation and Mathematics},
330 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
334 author = {Jacob Frost},
335 title = {A Case Study of Co-induction in {Isabelle HOL}},
341 %revised version of frost93
343 author = {Jacob Frost},
344 title = {A Case Study of Co-induction in {Isabelle}},
351 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
353 title = {Principles of {OBJ2}},
361 author = {J. H. Gallier},
362 title = {Logic for Computer Science:
363 Foundations of Automatic Theorem Proving},
365 publisher = {Harper \& Row}}
368 author = {Antony Galton},
369 title = {Logic for Information Technology},
373 @InProceedings{gimenez-codifying,
374 author = {Eduardo Gim{\'e}nez},
375 title = {Codifying Guarded Definitions with Recursive Schemes},
376 crossref = {types94},
381 author = {Jean-Yves Girard},
382 title = {Proofs and Types},
385 note = {Translated by Yves LaFont and Paul Taylor}}
388 editor = {M. J. C. Gordon and T. F. Melham},
389 title = {Introduction to {HOL}: A Theorem Proving Environment for
395 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
397 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
399 publisher = {Springer},
402 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
403 title={Why we can't have {SML} style datatype declarations in {HOL}},
404 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
405 IFIP TC10/WG10.2 Intl. Workshop, 1992},
406 editor={L.J.M. Claesen and M.J.C. Gordon},
407 publisher=NH,year=1993,pages={561--568}}
409 @InProceedings{gunter-trees,
410 author = {Elsa L. Gunter},
411 title = {A Broader Class of Trees for Recursive Type Definitions for
419 author = {Paul R. Halmos},
420 title = {Naive Set Theory},
421 publisher = {Van Nostrand},
424 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
425 title={Dynamic Logic},publisher=MIT,year=2000}
428 author = {Matthew Hennessy},
429 title = {The Semantics of Programming Languages: An Elementary
430 Introduction Using Structural Operational Semantics},
434 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
435 title={Introduction to Automata Theory, Languages, and Computation.},
436 publisher={Addison-Wesley},year=1979}
438 @Article{haskell-report,
439 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
440 title = {Report on the Programming Language {Haskell}: A
441 Non-strict, Purely Functional Language},
447 note = {Version 1.2}}
449 @Article{haskell-tutorial,
450 author = {Paul Hudak and Joseph H. Fasel},
451 title = {A Gentle Introduction to {Haskell}},
458 @book{Hudak-Haskell,author={Paul Hudak},
459 title={The Haskell School of Expression},publisher=CUP,year=2000}
462 author = {G. P. Huet},
463 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
470 author = {G. P. Huet and B. Lang},
471 title = {Proving and Applying Program Transformations Expressed with
472 Second-Order Patterns},
478 @inproceedings{huet88,
479 author = {G{\'e}rard Huet},
480 title = {Induction Principles Formalized in the {Calculus of
482 booktitle = {Programming of Future Generation Computers},
483 editor = {K. Fuchi and M. Nivat},
486 publisher = {Elsevier}}
488 @Book{Huth-Ryan-book,
489 author = {Michael Huth and Mark Ryan},
490 title = {Logic in Computer Science. Modelling and reasoning about systems},
494 @InProceedings{Harrison:1996:MizarHOL,
495 author = {J. Harrison},
496 title = {A {Mizar} Mode for {HOL}},
498 crossref = {tphols96}}
502 @InProceedings{kammueller-locales,
503 author = {Florian Kamm{\"u}ller and Markus Wenzel and
504 Lawrence C. Paulson},
505 title = {Locales: A Sectioning Concept for {Isabelle}},
506 crossref = {tphols99}}
509 author={Donald E. Knuth},
510 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
511 publisher={Addison-Wesley},
515 author = {R. E. Korf},
516 title = {Depth-First Iterative-Deepening: an Optimal Admissible
524 author = {Kenneth Kunen},
525 title = {Set Theory: An Introduction to Independence Proofs},
531 @InProceedings{lowe-fdr,
532 author = {Gavin Lowe},
533 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
534 Protocol using {CSP} and {FDR}},
535 booktitle = {Tools and Algorithms for the Construction and Analysis
536 of Systems: second international workshop, TACAS '96},
537 editor = {T. Margaria and B. Steffen},
538 series = {LNCS 1055},
540 publisher = {Springer},
547 author = {Zohar Manna and Richard Waldinger},
548 title = {Deductive Synthesis of the Unification Algorithm},
555 @InProceedings{martin-nipkow,
556 author = {Ursula Martin and Tobias Nipkow},
557 title = {Ordered Rewriting and Confluence},
562 author = {Per Martin-L{\"o}f},
563 title = {Intuitionistic type theory},
565 publisher = {Bibliopolis}}
567 @incollection{melham89,
568 author = {Thomas F. Melham},
569 title = {Automating Recursive Type Definitions in Higher Order
572 crossref = {birtwistle89}}
574 @Article{miller-mixed,
575 Author = {Dale Miller},
576 Title = {Unification Under a Mixed Prefix},
584 author = {Robin Milner},
585 title = {A Theory of Type Polymorphism in Programming},
586 journal = "J. Comp.\ Sys.\ Sci.",
591 @TechReport{milner-ind,
592 author = {Robin Milner},
593 title = {How to Derive Inductions in {LCF}},
594 institution = Edinburgh,
598 @Article{milner-coind,
599 author = {Robin Milner and Mads Tofte},
600 title = {Co-induction in Relational Semantics},
607 author = {Robin Milner},
608 title = {Communication and Concurrency},
609 publisher = Prentice,
612 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
613 title="The Definition of Standard ML",publisher=MIT,year=1990}
615 @PhdThesis{monahan84,
616 author = {Brian Q. Monahan},
617 title = {Data Type Proofs using Edinburgh {LCF}},
618 school = {University of Edinburgh},
621 @article{MuellerNvOS99,
623 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
624 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
626 @Manual{Muzalewski:Mizar,
627 title = {An Outline of {PC} {Mizar}},
628 author = {Micha{\l} Muzalewski},
629 organization = {Fondation of Logic, Mathematics and Informatics
630 --- Mizar Users Group},
632 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
637 @InProceedings{NaraschewskiW-TPHOLs98,
638 author = {Wolfgang Naraschewski and Markus Wenzel},
640 {Object-Oriented Verification based on Record Subtyping in
642 crossref = {tphols98}}
644 @inproceedings{nazareth-nipkow,
645 author = {Dieter Nazareth and Tobias Nipkow},
646 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
647 crossref = {tphols96},
651 @Article{needham-schroeder,
652 author = "Roger M. Needham and Michael D. Schroeder",
653 title = "Using Encryption for Authentication in Large Networks
662 @inproceedings{nipkow-W,
663 author = {Wolfgang Naraschewski and Tobias Nipkow},
664 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
665 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
666 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
667 publisher = Springer,
673 @InCollection{nipkow-sorts93,
674 author = {T. Nipkow},
675 title = {Order-Sorted Polymorphism in {Isabelle}},
676 booktitle = {Logical Environments},
679 editor = {G. Huet and G. Plotkin},
683 @Misc{nipkow-types93,
684 author = {Tobias Nipkow},
685 title = {Axiomatic Type Classes (in {I}sabelle)},
686 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
690 @inproceedings{Nipkow-CR,
691 author = {Tobias Nipkow},
692 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
693 booktitle = {Automated Deduction --- CADE-13},
694 editor = {M. McRobbie and J.K. Slaney},
695 publisher = Springer,
702 @InProceedings{nipkow-patterns,
703 title = {Functional Unification of Higher-Order Patterns},
704 author = {Tobias Nipkow},
707 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
708 keywords = {unification}}
711 author = {Tobias Nipkow},
712 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
718 @manual{isabelle-HOL,
719 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
720 title = {{Isabelle}'s Logics: {HOL}},
721 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
722 M{\"u}nchen and Computer Laboratory, University of Cambridge},
723 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
725 @article{nipkow-prehofer,
726 author = {Tobias Nipkow and Christian Prehofer},
727 title = {Type Reconstruction for Type Classes},
735 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
736 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
737 publisher = {Springer},
739 note = {LNCS Tutorial 2283}}
742 author = {Philippe No{\"e}l},
743 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
751 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
752 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
754 publisher = {Oxford University Press},
759 @Manual{pvs-language,
760 title = {The {PVS} specification language},
761 author = {S. Owre and N. Shankar and J. M. Rushby},
762 organization = {Computer Science Laboratory, SRI International},
763 address = {Menlo Park, CA},
764 note = {Beta release},
767 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
772 @InProceedings{paulin-tlca,
773 author = {Christine Paulin-Mohring},
774 title = {Inductive Definitions in the System {Coq}: Rules and
779 @InProceedings{paulson-CADE,
780 author = {Lawrence C. Paulson},
781 title = {A Fixedpoint Approach to Implementing (Co)Inductive
786 @InProceedings{paulson-COLOG,
787 author = {Lawrence C. Paulson},
788 title = {A Formulation of the Simple Theory of Types (for
791 crossref = {colog88},
792 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
794 @Article{paulson-coind,
795 author = {Lawrence C. Paulson},
796 title = {Mechanizing Coinduction and Corecursion in Higher-Order
805 @manual{isabelle-intro,
806 author = {Lawrence C. Paulson},
807 title = {Introduction to {Isabelle}},
809 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
811 @manual{isabelle-logics,
812 author = {Lawrence C. Paulson},
813 title = {{Isabelle's} Logics},
815 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
817 @manual{isabelle-ref,
818 author = {Lawrence C. Paulson},
819 title = {The {Isabelle} Reference Manual},
821 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
824 author = {Lawrence C. Paulson},
825 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
827 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
829 @article{paulson-found,
830 author = {Lawrence C. Paulson},
831 title = {The Foundation of a Generic Theorem Prover},
837 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
839 %replaces paulson-final
840 @Article{paulson-mscs,
841 author = {Lawrence C. Paulson},
842 title = {Final Coalgebras as Greatest Fixed Points
844 journal = {Mathematical Structures in Computer Science},
849 @InCollection{paulson-generic,
850 author = {Lawrence C. Paulson},
851 title = {Generic Automatic Proof Tools},
852 crossref = {wos-fest},
856 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
857 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
866 @InCollection{paulson-handbook,
867 author = {Lawrence C. Paulson},
868 title = {Designing a Theorem Prover},
869 crossref = {handbk-lics2},
872 @Book{paulson-isa-book,
873 author = {Lawrence C. Paulson},
874 title = {Isabelle: A Generic Theorem Prover},
875 publisher = {Springer},
879 @Book{isabelle-hol-book,
880 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
881 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
882 publisher = {Springer},
886 @InCollection{paulson-markt,
887 author = {Lawrence C. Paulson},
888 title = {Tool Support for Logics of Programs},
889 booktitle = {Mathematical Methods in Program Development:
890 Summer School Marktoberdorf 1996},
891 publisher = {Springer},
893 year = {Published 1997},
894 editor = {Manfred Broy},
895 series = {NATO ASI Series F}}
897 %replaces Paulson-ML and paulson91
899 author = {Lawrence C. Paulson},
900 title = {{ML} for the Working Programmer},
905 @article{paulson-natural,
906 author = {Lawrence C. Paulson},
907 title = {Natural Deduction as Higher-order Resolution},
912 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
914 @Article{paulson-set-I,
915 author = {Lawrence C. Paulson},
916 title = {Set Theory for Verification: {I}. {From}
917 Foundations to Functions},
923 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
925 @Article{paulson-set-II,
926 author = {Lawrence C. Paulson},
927 title = {Set Theory for Verification: {II}. {Induction} and
934 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
937 author = {Lawrence C. Paulson},
938 title = {Verifying the Unification Algorithm in {LCF}},
944 %replaces Paulson-LCF
946 author = {Lawrence C. Paulson},
947 title = {Logic and Computation: Interactive proof with Cambridge
952 @incollection{paulson700,
953 author = {Lawrence C. Paulson},
954 title = {{Isabelle}: The Next 700 Theorem Provers},
955 crossref = {odifreddi90},
957 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
959 % replaces paulson-ns and paulson-security
960 @Article{paulson-jcs,
961 author = {Lawrence C. Paulson},
962 title = {The Inductive Approach to Verifying Cryptographic Protocols},
968 @Article{paulson-tls,
969 author = {Lawrence C. Paulson},
970 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
978 @Article{paulson-yahalom,
979 author = {Lawrence C. Paulson},
980 title = {Relations Between Secrets:
981 Two Formal Analyses of the {Yahalom} Protocol},
985 @article{pelletier86,
986 author = {F. J. Pelletier},
987 title = {Seventy-five Problems for Testing Automatic Theorem
993 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
996 author = {Andrew M. Pitts},
997 title = {A Co-induction Principle for Recursively Defined Domains},
1003 @Article{plaisted90,
1004 author = {David A. Plaisted},
1005 title = {A Sequent-Style Model Elimination Strategy and a Positive
1016 author = {Art Quaife},
1017 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1027 @TechReport{rasmussen95,
1028 author = {Ole Rasmussen},
1029 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1031 institution = {Computer Laboratory, University of Cambridge},
1035 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1038 author = {Steve Reeves and Michael Clarke},
1039 title = {Logic for Computer Science},
1040 publisher = {Addison-Wesley},
1043 @book{Rosen-DMA,author={Kenneth H. Rosen},
1044 title={Discrete Mathematics and Its Applications},
1045 publisher={McGraw-Hill},year=1998}
1047 @InProceedings{Rudnicki:1992:MizarOverview,
1048 author = {P. Rudnicki},
1049 title = {An Overview of the {MIZAR} Project},
1050 booktitle = {1992 Workshop on Types for Proofs and Programs},
1052 organization = {Chalmers University of Technology},
1053 publisher = {Bastad}
1058 @inproceedings{saaltink-fme,
1059 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1060 Dan Craigen and Irwin Meisels},
1061 title = {An {EVES} Data Abstraction Example},
1065 @inproceedings{slind-tfl,
1066 author = {Konrad Slind},
1067 title = {Function Definition in Higher Order Logic},
1068 booktitle = {Theorem Proving in Higher Order Logics},
1069 editor = {J. von Wright and J. Grundy and J. Harrison},
1070 publisher = Springer,
1077 author = {Patrick Suppes},
1078 title = {Axiomatic Set Theory},
1080 publisher = {Dover}}
1082 @InCollection{szasz93,
1083 author = {Nora Szasz},
1084 title = {A Machine Checked Proof that {Ackermann's} Function is not
1085 Primitive Recursive},
1086 crossref = {huet-plotkin93},
1089 @TechReport{Syme:1997:DECLARE,
1091 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1092 institution = {University of Cambridge Computer Laboratory},
1097 @PhdThesis{Syme:1998:thesis,
1099 title = {Declarative Theorem Proving for Operational Semantics},
1100 school = {University of Cambridge},
1105 @InProceedings{Syme:1999:TPHOL,
1107 title = {Three Tactic Theorem Proving},
1108 crossref = {tphols99}}
1113 author = {G. Takeuti},
1114 title = {Proof Theory},
1120 author = {Simon Thompson},
1121 title = {Type Theory and Functional Programming},
1122 publisher = {Addison-Wesley},
1125 @book{Thompson-Haskell,author={Simon Thompson},
1126 title={Haskell: The Craft of Functional Programming},
1127 publisher={Addison-Wesley},year=1999}
1129 @Unpublished{Trybulec:1993:MizarFeatures,
1130 author = {A. Trybulec},
1131 title = {Some Features of the {Mizar} Language},
1132 note = {Presented at a workshop in Turin, Italy},
1138 @Unpublished{voelker94,
1139 author = {Norbert V{\"o}lker},
1140 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1141 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1148 author = {Christoph Wedler},
1149 title = {Emacs package ``{X-Symbol}''},
1150 note = {\url{http://x-symbol.sourceforge.net}}
1153 @manual{isabelle-sys,
1154 author = {Markus Wenzel and Stefan Berghofer},
1155 title = {The {Isabelle} System Manual},
1156 institution = {TU Munich},
1157 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1159 @manual{isabelle-isar-ref,
1160 author = {Markus Wenzel},
1161 title = {The {Isabelle/Isar} Reference Manual},
1162 institution = {TU Munich},
1163 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1165 @manual{isabelle-axclass,
1166 author = {Markus Wenzel},
1167 title = {Using Axiomatic Type Classes in {I}sabelle},
1168 institution = {TU Munich},
1170 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1173 @InProceedings{Wenzel:1999:TPHOL,
1174 author = {Markus Wenzel},
1175 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1176 crossref = {tphols99}}
1178 @InProceedings{Wenzel:1997:TPHOL,
1179 author = {Markus Wenzel},
1180 title = {Type Classes and Overloading in Higher-Order Logic},
1181 crossref = {tphols97}}
1183 @phdthesis{Wenzel-PhD,
1184 author={Markus Wenzel},
1185 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1186 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1188 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1191 author = {A. N. Whitehead and B. Russell},
1192 title = {Principia Mathematica},
1195 note = {Paperback edition to *56,
1196 abridged from the 2nd edition (1927)}}
1198 @Misc{Wiedijk:1999:Mizar,
1199 author = {Freek Wiedijk},
1200 title = {Mizar: An Impression},
1201 howpublished = {Unpublished paper},
1203 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1206 @Misc{Wiedijk:2000:MV,
1207 author = {Freek Wiedijk},
1208 title = {The Mathematical Vernacular},
1209 howpublished = {Unpublished paper},
1211 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1215 author = {Glynn Winskel},
1216 title = {The Formal Semantics of Programming Languages},
1217 publisher = MIT,year=1993}
1219 @InCollection{wos-bledsoe,
1220 author = {Larry Wos},
1221 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1222 crossref = {bledsoe-fest},
1225 @InProceedings{Zammit:1999:TPHOL,
1226 author = {Vincent Zammit},
1227 title = {On the Implementation of an Extensible Declarative Proof Language},
1228 crossref = {tphols99}}
1236 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1237 title = {Handbook of Logic in Computer Science},
1238 booktitle = {Handbook of Logic in Computer Science},
1239 publisher = {Oxford University Press},
1244 editor = {Henk Barendregt and Tobias Nipkow},
1245 title = TYPES # {: International Workshop {TYPES '93}},
1246 booktitle = TYPES # {: International Workshop {TYPES '93}},
1247 year = {published 1994},
1248 publisher = {Springer},
1249 series = {LNCS 806}}
1251 @book{barwise-handbk,
1252 editor = {J. Barwise},
1253 title = {Handbook of Mathematical Logic},
1254 booktitle = {Handbook of Mathematical Logic},
1258 @Proceedings{tlca93,
1259 title = {Typed Lambda Calculi and Applications},
1260 booktitle = {Typed Lambda Calculi and Applications},
1261 editor = {M. Bezem and J.F. Groote},
1263 publisher = {Springer},
1264 series = {LNCS 664}}
1267 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1268 title = {Current Trends in Hardware Verification and Automated
1270 booktitle = {Current Trends in Hardware Verification and Automated
1272 publisher = {Springer},
1276 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1277 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1278 publisher = {Kluwer Academic Publishers},
1280 editor = {Robert S. Boyer}}
1282 @Proceedings{cade12,
1283 editor = {Alan Bundy},
1284 title = {Automated Deduction --- {CADE}-12
1285 International Conference},
1286 booktitle = {Automated Deduction --- {CADE}-12
1287 International Conference},
1289 series = {LNAI 814},
1290 publisher = {Springer}}
1293 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1294 title = TYPES # {: International Workshop {TYPES '94}},
1295 booktitle = TYPES # {: International Workshop {TYPES '94}},
1297 publisher = {Springer},
1298 series = {LNCS 996}}
1300 @book{huet-plotkin91,
1301 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1302 title = {Logical Frameworks},
1303 booktitle = {Logical Frameworks},
1307 @book{huet-plotkin93,
1308 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1309 title = {Logical Environments},
1310 booktitle = {Logical Environments},
1315 editor = {J. Joyce and C. Seger},
1316 title = {Higher Order Logic Theorem Proving and Its
1317 Applications: HUG '93},
1318 booktitle = {Higher Order Logic Theorem Proving and Its
1319 Applications: HUG '93},
1320 year = {Published 1994},
1321 publisher = {Springer},
1322 series = {LNCS 780}}
1324 @proceedings{colog88,
1325 editor = {P. Martin-L{\"o}f and G. Mints},
1326 title = {COLOG-88: International Conference on Computer Logic},
1327 booktitle = {COLOG-88: International Conference on Computer Logic},
1328 year = {Published 1990},
1329 publisher = {Springer},
1330 organization = {Estonian Academy of Sciences},
1331 address = {Tallinn},
1332 series = {LNCS 417}}
1335 editor = {P. Odifreddi},
1336 title = {Logic and Computer Science},
1337 booktitle = {Logic and Computer Science},
1338 publisher = {Academic Press},
1341 @proceedings{extensions91,
1342 editor = {Peter Schroeder-Heister},
1343 title = {Extensions of Logic Programming},
1344 booktitle = {Extensions of Logic Programming},
1346 series = {LNAI 475},
1347 publisher = {Springer}}
1349 @proceedings{cade10,
1350 editor = {Mark E. Stickel},
1351 title = {10th } # CADE,
1352 booktitle = {10th } # CADE,
1354 publisher = {Springer},
1355 series = {LNAI 449}}
1358 editor = {M. Vardi},
1359 title = {Eighth Annual Symposium on Logic in Computer Science},
1360 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1365 title = {Automated Reasoning and its Applications:
1366 Essays in Honor of {Larry Wos}},
1367 booktitle = {Automated Reasoning and its Applications:
1368 Essays in Honor of {Larry Wos}},
1369 publisher = {MIT Press},
1371 editor = {Robert Veroff}}
1374 editor = {J. C. P. Woodcock and P. G. Larsen},
1375 title = {FME '93: Industrial-Strength Formal Methods},
1376 booktitle = {FME '93: Industrial-Strength Formal Methods},
1378 publisher = Springer,
1382 @Proceedings{tphols96,
1383 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1384 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1385 editor = {J. von Wright and J. Grundy and J. Harrison},
1386 publisher = Springer,
1391 @Proceedings{tphols97,
1392 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1393 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1394 editor = {Elsa L. Gunter and Amy Felty},
1395 publisher = Springer,
1400 @Proceedings{tphols98,
1401 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1402 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1403 editor = {Jim Grundy and Malcom Newey},
1404 publisher = Springer,
1409 @Proceedings{tphols99,
1410 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1411 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1412 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1413 Paulin, C. and Thery, L.},
1414 publisher = Springer,
1419 @Proceedings{tphols2000,
1420 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1421 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1422 editor = {J. Harrison and M. Aagaard},
1423 publisher = Springer,
1428 @Proceedings{tphols2001,
1429 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1430 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1431 editor = {R. J. Boulton and P. B. Jackson},
1432 publisher = Springer,