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"}
19 @string{TUM="Department of Informatics, Technical University of Munich"}
22 @string{AI="Artificial Intelligence"}
23 @string{FAC="Formal Aspects of Computing"}
24 @string{JAR="Journal of Automated Reasoning"}
25 @string{JCS="Journal of Computer Security"}
26 @string{JFP="Journal of Functional Programming"}
27 @string{JLC="Journal of Logic and Computation"}
28 @string{JLP="Journal of Logic Programming"}
29 @string{JSC="Journal of Symbolic Computation"}
30 @string{JSL="Journal of Symbolic Logic"}
31 @string{PROYAL="Proceedings of the Royal Society of London"}
32 @string{SIGPLAN="{SIGPLAN} Notices"}
33 @string{TISSEC="ACM Transactions on Information and System Security"}
36 @string{CADE="International Conference on Automated Deduction"}
37 @string{POPL="Symposium on Principles of Programming Languages"}
38 @string{TYPES="Types for Proofs and Programs"}
43 @incollection{abramsky90,
44 author = {Samson Abramsky},
45 title = {The Lazy Lambda Calculus},
47 editor = {David A. Turner},
48 booktitle = {Research Topics in Functional Programming},
49 publisher = {Addison-Wesley},
52 @Unpublished{abrial93,
53 author = {J. R. Abrial and G. Laffitte},
54 title = {Towards the Mechanization of the Proofs of some Classical
55 Theorems of Set Theory},
60 @incollection{aczel77,
61 author = {Peter Aczel},
62 title = {An Introduction to Inductive Definitions},
64 crossref = {barwise-handbk}}
67 author = {Peter Aczel},
68 title = {Non-Well-Founded Sets},
73 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
74 title = {The {ALF} Proof Editor and Its Proof Engine},
79 author = "Peter Andrews",
80 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
83 series = "Computer Science and Applied Mathematics",
86 @InProceedings{Aspinall:2000:eProof,
87 author = {David Aspinall},
88 title = {Protocols for Interactive {e-Proof}},
89 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
91 note = {Unpublished work-in-progress paper,
92 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
95 @InProceedings{Aspinall:TACAS:2000,
96 author = {David Aspinall},
97 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
98 booktitle = {Tools and Algorithms for the Construction and Analysis of
101 publisher = Springer,
108 author = {David Aspinall},
109 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
110 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
114 author = {David Aspinall},
115 title = {{P}roof {G}eneral},
116 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
121 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
122 title="Term Rewriting and All That",publisher=CUP,year=1998}
124 @InCollection{Barendregt-Geuvers:2001,
125 author = {H. Barendregt and H. Geuvers},
126 title = {Proof Assistants using Dependent Type Systems},
127 booktitle = {Handbook of Automated Reasoning},
128 publisher = {Elsevier},
130 editor = {A. Robinson and A. Voronkov}
133 @incollection{basin91,
134 author = {David Basin and Matt Kaufmann},
135 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
137 crossref = {huet-plotkin91},
140 @Unpublished{HOL-Library,
141 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
142 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
144 title = {The Supplemental {Isabelle/HOL} Library},
145 note = {Part of the Isabelle distribution,
146 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
150 @InProceedings{Bauer-Wenzel:2000:HB,
151 author = {Gertrud Bauer and Markus Wenzel},
152 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
154 booktitle = {Types for Proofs and Programs: TYPES'99},
155 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
161 @InProceedings{Bauer-Wenzel:2001,
162 author = {Gertrud Bauer and Markus Wenzel},
163 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
164 crossref = {tphols2001}}
166 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
167 crossref = "tphols2000",
168 title = "Proof terms for simply typed higher order logic",
169 author = "Stefan Berghofer and Tobias Nipkow",
172 @InProceedings{Berghofer-Nipkow:2002,
173 author = {Stefan Berghofer and Tobias Nipkow},
174 title = {Executing Higher Order Logic},
175 booktitle = {Types for Proofs and Programs: TYPES'2000},
176 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
178 publisher = Springer,
182 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
183 author = {Stefan Berghofer and Markus Wenzel},
184 title = {Inductive datatypes in {HOL} --- lessons learned in
185 {F}ormal-{L}ogic {E}ngineering},
186 crossref = {tphols99}}
188 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
189 title="Introduction to Functional Programming",publisher=PH,year=1988}
191 @book{Bird-Haskell,author="Richard Bird",
192 title="Introduction to Functional Programming using Haskell",
193 publisher=PH,year=1998}
196 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
197 Overbeek and Mark Stickel and Lawrence Wos},
198 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
207 author = {Robert S. Boyer and J Strother Moore},
208 title = {A Computational Logic},
209 publisher = {Academic Press},
213 author = {Robert S. Boyer and J Strother Moore},
214 title = {A Computational Logic Handbook},
215 publisher = {Academic Press},
219 author = {N. G. de Bruijn},
220 title = {Lambda Calculus Notation with Nameless Dummies,
221 a Tool for Automatic Formula Manipulation,
222 with Application to the {Church-Rosser Theorem}},
223 journal = {Indag. Math.},
228 @InProceedings{bulwahnKN07,
229 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
230 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
231 crossref = {tphols2007},
236 author = {M. Burrows and M. Abadi and R. M. Needham},
237 title = {A Logic of Authentication},
245 @TechReport{camilleri92,
246 author = {J. Camilleri and T. F. Melham},
247 title = {Reasoning with Inductively Defined Relations in the
248 {HOL} Theorem Prover},
255 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
256 title = {Artificial Intelligence Programming},
257 publisher = {Lawrence Erlbaum Associates},
261 author = "Alonzo Church",
262 title = "A Formulation of the Simple Theory of Types",
268 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
269 title="Model Checking",publisher=MIT,year=1999}
272 author = {Martin D. Coen},
273 title = {Interactive Program Derivation},
274 school = {University of Cambridge},
275 note = {Computer Laboratory Technical Report 272},
280 author = {R. L. Constable and others},
281 title = {Implementing Mathematics with the Nuprl Proof
283 publisher = Prentice,
288 @Book{davey-priestley,
289 author = {B. A. Davey and H. A. Priestley},
290 title = {Introduction to Lattices and Order},
295 author = {Keith J. Devlin},
296 title = {Fundamentals of Contemporary Set Theory},
297 publisher = {Springer},
301 author = {Michael Dummett},
302 title = {Elements of Intuitionism},
304 publisher = {Oxford University Press}}
306 @incollection{dybjer91,
307 author = {Peter Dybjer},
308 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
309 Theory and Their Set-Theoretic Semantics},
310 crossref = {huet-plotkin91},
314 author = {Roy Dyckhoff},
315 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
325 author = {William M. Farmer and Joshua D. Guttman and F. Javier
327 title = {{IMPS}: An Interactive Mathematical Proof System},
334 @InProceedings{felty91a,
335 Author = {Amy Felty},
336 Title = {A Logic Program for Transforming Sequent Proofs to Natural
338 crossref = {extensions91},
341 @Article{fleuriot-jcm,
342 author = {Jacques Fleuriot and Lawrence C. Paulson},
343 title = {Mechanizing Nonstandard Real Analysis},
344 journal = {LMS Journal of Computation and Mathematics},
348 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
352 author = {Jacob Frost},
353 title = {A Case Study of Co-induction in {Isabelle HOL}},
359 %revised version of frost93
361 author = {Jacob Frost},
362 title = {A Case Study of Co-induction in {Isabelle}},
369 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
371 title = {Principles of {OBJ2}},
379 author = {J. H. Gallier},
380 title = {Logic for Computer Science:
381 Foundations of Automatic Theorem Proving},
383 publisher = {Harper \& Row}}
386 author = {Antony Galton},
387 title = {Logic for Information Technology},
391 @Article{Gentzen:1935,
392 author = {G. Gentzen},
393 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
394 journal = {Math. Zeitschrift},
398 @InProceedings{gimenez-codifying,
399 author = {Eduardo Gim{\'e}nez},
400 title = {Codifying Guarded Definitions with Recursive Schemes},
401 crossref = {types94},
406 author = {Jean-Yves Girard},
407 title = {Proofs and Types},
410 note = {Translated by Yves LaFont and Paul Taylor}}
413 editor = {M. J. C. Gordon and T. F. Melham},
414 title = {Introduction to {HOL}: A Theorem Proving Environment for
420 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
422 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
424 publisher = {Springer},
427 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
428 title={Why we can't have {SML} style datatype declarations in {HOL}},
429 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
430 IFIP TC10/WG10.2 Intl. Workshop, 1992},
431 editor={L.J.M. Claesen and M.J.C. Gordon},
432 publisher=NH,year=1993,pages={561--568}}
434 @InProceedings{gunter-trees,
435 author = {Elsa L. Gunter},
436 title = {A Broader Class of Trees for Recursive Type Definitions for
443 @InProceedings{Haftmann-Wenzel:2006:classes,
444 author = {Florian Haftmann and Makarius Wenzel},
445 title = {Constructive Type Classes in {Isabelle}},
446 editor = {T. Altenkirch and C. McBride},
447 booktitle = {Types for Proofs and Programs, TYPES 2006},
448 publisher = {Springer},
454 @TechReport{Haftmann-Nipkow:2007:codegen,
455 author = {Florian Haftmann and Tobias Nipkow},
456 title = {A Code Generator Framework for {Isabelle/HOL}},
457 editor = {Klaus Schneider and Jens Brandt},
458 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
461 institution = {Department of Computer Science, University of Kaiserslautern},
465 @manual{isabelle-classes,
466 author = {Florian Haftmann},
467 title = {Haskell-style type classes with {Isabelle}/{Isar}},
469 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
472 @manual{isabelle-codegen,
473 author = {Florian Haftmann},
474 title = {Code generation from Isabelle theories},
476 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
480 author = {Paul R. Halmos},
481 title = {Naive Set Theory},
482 publisher = {Van Nostrand},
485 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
486 title={Dynamic Logic},publisher=MIT,year=2000}
489 author = {Matthew Hennessy},
490 title = {The Semantics of Programming Languages: An Elementary
491 Introduction Using Structural Operational Semantics},
495 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
496 title={Introduction to Automata Theory, Languages, and Computation.},
497 publisher={Addison-Wesley},year=1979}
499 @Article{haskell-report,
500 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
501 title = {Report on the Programming Language {Haskell}: A
502 Non-strict, Purely Functional Language},
508 note = {Version 1.2}}
510 @Article{haskell-tutorial,
511 author = {Paul Hudak and Joseph H. Fasel},
512 title = {A Gentle Introduction to {Haskell}},
519 @book{Hudak-Haskell,author={Paul Hudak},
520 title={The Haskell School of Expression},publisher=CUP,year=2000}
523 author = {G. P. Huet},
524 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
531 author = {G. P. Huet and B. Lang},
532 title = {Proving and Applying Program Transformations Expressed with
533 Second-Order Patterns},
539 @inproceedings{huet88,
540 author = {G{\'e}rard Huet},
541 title = {Induction Principles Formalized in the {Calculus of
543 booktitle = {Programming of Future Generation Computers},
544 editor = {K. Fuchi and M. Nivat},
547 publisher = {Elsevier}}
549 @Book{Huth-Ryan-book,
550 author = {Michael Huth and Mark Ryan},
551 title = {Logic in Computer Science. Modelling and reasoning about systems},
555 @InProceedings{Harrison:1996:MizarHOL,
556 author = {J. Harrison},
557 title = {A {Mizar} Mode for {HOL}},
559 crossref = {tphols96}}
563 @article{haskell-revised-report,
564 author = {Simon {Peyton Jones} and others},
565 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
566 journal = {Journal of Functional Programming},
572 note = {\url{http://www.haskell.org/definition/}}}
576 @InProceedings{kammueller-locales,
577 author = {Florian Kamm{\"u}ller and Markus Wenzel and
578 Lawrence C. Paulson},
579 title = {Locales: A Sectioning Concept for {Isabelle}},
580 crossref = {tphols99}}
583 author={Donald E. Knuth},
584 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
585 publisher={Addison-Wesley},
589 author = {R. E. Korf},
590 title = {Depth-First Iterative-Deepening: an Optimal Admissible
597 @InProceedings{krauss2006,
598 author = {Alexander Krauss},
599 title = {Partial Recursive Functions in {Higher-Order Logic}},
600 crossref = {ijcar2006},
603 @manual{isabelle-function,
604 author = {Alexander Krauss},
605 title = {Defining Recursive Functions in {Isabelle/HOL}},
607 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
611 author = {Kenneth Kunen},
612 title = {Set Theory: An Introduction to Independence Proofs},
619 author = {Xavier Leroy and others},
620 title = {The Objective Caml system -- Documentation and user's manual},
621 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
623 @InProceedings{lowe-fdr,
624 author = {Gavin Lowe},
625 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
626 Protocol using {CSP} and {FDR}},
627 booktitle = {Tools and Algorithms for the Construction and Analysis
628 of Systems: second international workshop, TACAS '96},
629 editor = {T. Margaria and B. Steffen},
630 series = {LNCS 1055},
632 publisher = {Springer},
638 author = {Zohar Manna and Richard Waldinger},
639 title = {Deductive Synthesis of the Unification Algorithm},
646 @InProceedings{martin-nipkow,
647 author = {Ursula Martin and Tobias Nipkow},
648 title = {Ordered Rewriting and Confluence},
653 author = {Per Martin-L{\"o}f},
654 title = {Intuitionistic type theory},
656 publisher = {Bibliopolis}}
658 @incollection{melham89,
659 author = {Thomas F. Melham},
660 title = {Automating Recursive Type Definitions in Higher Order
663 crossref = {birtwistle89}}
665 @Article{miller-mixed,
666 Author = {Dale Miller},
667 Title = {Unification Under a Mixed Prefix},
675 author = {Robin Milner},
676 title = {A Theory of Type Polymorphism in Programming},
677 journal = "J. Comp.\ Sys.\ Sci.",
682 @TechReport{milner-ind,
683 author = {Robin Milner},
684 title = {How to Derive Inductions in {LCF}},
685 institution = Edinburgh,
689 @Article{milner-coind,
690 author = {Robin Milner and Mads Tofte},
691 title = {Co-induction in Relational Semantics},
698 author = {Robin Milner},
699 title = {Communication and Concurrency},
700 publisher = Prentice,
703 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
704 title="The Definition of Standard ML",publisher=MIT,year=1990}
706 @PhdThesis{monahan84,
707 author = {Brian Q. Monahan},
708 title = {Data Type Proofs using Edinburgh {LCF}},
709 school = {University of Edinburgh},
712 @article{MuellerNvOS99,
714 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
715 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
717 @Manual{Muzalewski:Mizar,
718 title = {An Outline of {PC} {Mizar}},
719 author = {Micha{\l} Muzalewski},
720 organization = {Fondation of Logic, Mathematics and Informatics
721 --- Mizar Users Group},
723 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
728 @InProceedings{NaraschewskiW-TPHOLs98,
729 author = {Wolfgang Naraschewski and Markus Wenzel},
731 {Object-Oriented Verification based on Record Subtyping in
733 crossref = {tphols98}}
735 @inproceedings{nazareth-nipkow,
736 author = {Dieter Nazareth and Tobias Nipkow},
737 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
738 crossref = {tphols96},
742 @Article{needham-schroeder,
743 author = "Roger M. Needham and Michael D. Schroeder",
744 title = "Using Encryption for Authentication in Large Networks
753 @inproceedings{nipkow-W,
754 author = {Wolfgang Naraschewski and Tobias Nipkow},
755 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
756 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
757 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
758 publisher = Springer,
764 @InCollection{nipkow-sorts93,
765 author = {T. Nipkow},
766 title = {Order-Sorted Polymorphism in {Isabelle}},
767 booktitle = {Logical Environments},
770 editor = {G. Huet and G. Plotkin},
774 @Misc{nipkow-types93,
775 author = {Tobias Nipkow},
776 title = {Axiomatic Type Classes (in {I}sabelle)},
777 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
781 @inproceedings{Nipkow-CR,
782 author = {Tobias Nipkow},
783 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
784 booktitle = {Automated Deduction --- CADE-13},
785 editor = {M. McRobbie and J.K. Slaney},
786 publisher = Springer,
793 @InProceedings{nipkow-patterns,
794 title = {Functional Unification of Higher-Order Patterns},
795 author = {Tobias Nipkow},
798 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
799 keywords = {unification}}
802 author = {Tobias Nipkow},
803 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
809 @inproceedings{Nipkow-TYPES02,
810 author = {Tobias Nipkow},
811 title = {{Structured Proofs in Isar/HOL}},
812 booktitle = {Types for Proofs and Programs (TYPES 2002)},
813 editor = {H. Geuvers and F. Wiedijk},
815 publisher = Springer,
820 @manual{isabelle-HOL,
821 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
822 title = {{Isabelle}'s Logics: {HOL}},
823 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
824 M{\"u}nchen and Computer Laboratory, University of Cambridge},
825 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
827 @article{nipkow-prehofer,
828 author = {Tobias Nipkow and Christian Prehofer},
829 title = {Type Reconstruction for Type Classes},
836 @InProceedings{Nipkow-Prehofer:1993,
837 author = {T. Nipkow and C. Prehofer},
838 title = {Type checking type classes},
839 booktitle = {ACM Symp.\ Principles of Programming Languages},
844 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
845 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
846 publisher = {Springer},
848 note = {LNCS Tutorial 2283}}
851 author = {Philippe No{\"e}l},
852 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
860 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
861 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
863 publisher = {Oxford University Press},
868 @Manual{pvs-language,
869 title = {The {PVS} specification language},
870 author = {S. Owre and N. Shankar and J. M. Rushby},
871 organization = {Computer Science Laboratory, SRI International},
872 address = {Menlo Park, CA},
873 note = {Beta release},
876 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
881 @InProceedings{paulin-tlca,
882 author = {Christine Paulin-Mohring},
883 title = {Inductive Definitions in the System {Coq}: Rules and
888 @InProceedings{paulson-CADE,
889 author = {Lawrence C. Paulson},
890 title = {A Fixedpoint Approach to Implementing (Co)Inductive
895 @InProceedings{paulson-COLOG,
896 author = {Lawrence C. Paulson},
897 title = {A Formulation of the Simple Theory of Types (for
900 crossref = {colog88},
901 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
903 @Article{paulson-coind,
904 author = {Lawrence C. Paulson},
905 title = {Mechanizing Coinduction and Corecursion in Higher-Order
914 @manual{isabelle-intro,
915 author = {Lawrence C. Paulson},
916 title = {Introduction to {Isabelle}},
918 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
920 @manual{isabelle-logics,
921 author = {Lawrence C. Paulson},
922 title = {{Isabelle's} Logics},
924 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
926 @manual{isabelle-ref,
927 author = {Lawrence C. Paulson},
928 title = {The {Isabelle} Reference Manual},
930 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
933 author = {Lawrence C. Paulson},
934 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
936 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
938 @article{paulson-found,
939 author = {Lawrence C. Paulson},
940 title = {The Foundation of a Generic Theorem Prover},
946 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
948 %replaces paulson-final
949 @Article{paulson-mscs,
950 author = {Lawrence C. Paulson},
951 title = {Final Coalgebras as Greatest Fixed Points
953 journal = {Mathematical Structures in Computer Science},
959 @InCollection{paulson-generic,
960 author = {Lawrence C. Paulson},
961 title = {Generic Automatic Proof Tools},
962 crossref = {wos-fest},
966 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
967 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
976 @InCollection{paulson-fixedpt-milner,
977 author = {Lawrence C. Paulson},
978 title = {A Fixedpoint Approach to (Co)inductive and
979 (Co)datatype Definitions},
981 crossref = {milner-fest}}
984 title = {Proof, Language, and Interaction:
985 Essays in Honor of {Robin Milner}},
986 booktitle = {Proof, Language, and Interaction:
987 Essays in Honor of {Robin Milner}},
988 publisher = {MIT Press},
990 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
992 @InCollection{paulson-handbook,
993 author = {Lawrence C. Paulson},
994 title = {Designing a Theorem Prover},
995 crossref = {handbk-lics2},
998 @Book{paulson-isa-book,
999 author = {Lawrence C. Paulson},
1000 title = {Isabelle: A Generic Theorem Prover},
1001 publisher = {Springer},
1005 @Book{isabelle-hol-book,
1006 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1007 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1008 publisher = {Springer},
1012 @InCollection{paulson-markt,
1013 author = {Lawrence C. Paulson},
1014 title = {Tool Support for Logics of Programs},
1015 booktitle = {Mathematical Methods in Program Development:
1016 Summer School Marktoberdorf 1996},
1017 publisher = {Springer},
1019 year = {Published 1997},
1020 editor = {Manfred Broy},
1021 series = {NATO ASI Series F}}
1023 %replaces Paulson-ML and paulson91
1025 author = {Lawrence C. Paulson},
1026 title = {{ML} for the Working Programmer},
1031 @article{paulson-natural,
1032 author = {Lawrence C. Paulson},
1033 title = {Natural Deduction as Higher-order Resolution},
1038 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1040 @Article{paulson-set-I,
1041 author = {Lawrence C. Paulson},
1042 title = {Set Theory for Verification: {I}. {From}
1043 Foundations to Functions},
1049 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1051 @Article{paulson-set-II,
1052 author = {Lawrence C. Paulson},
1053 title = {Set Theory for Verification: {II}. {Induction} and
1060 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1063 author = {Lawrence C. Paulson},
1064 title = {Verifying the Unification Algorithm in {LCF}},
1070 %replaces Paulson-LCF
1072 author = {Lawrence C. Paulson},
1073 title = {Logic and Computation: Interactive proof with Cambridge
1078 @incollection{paulson700,
1079 author = {Lawrence C. Paulson},
1080 title = {{Isabelle}: The Next 700 Theorem Provers},
1081 crossref = {odifreddi90},
1083 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1085 % replaces paulson-ns and paulson-security
1086 @Article{paulson-jcs,
1087 author = {Lawrence C. Paulson},
1088 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1094 @Article{paulson-tls,
1095 author = {Lawrence C. Paulson},
1096 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1104 @Article{paulson-yahalom,
1105 author = {Lawrence C. Paulson},
1106 title = {Relations Between Secrets:
1107 Two Formal Analyses of the {Yahalom} Protocol},
1114 @article{pelletier86,
1115 author = {F. J. Pelletier},
1116 title = {Seventy-five Problems for Testing Automatic Theorem
1122 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1125 author = {Andrew M. Pitts},
1126 title = {A Co-induction Principle for Recursively Defined Domains},
1132 @Article{plaisted90,
1133 author = {David A. Plaisted},
1134 title = {A Sequent-Style Model Elimination Strategy and a Positive
1145 author = {Art Quaife},
1146 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1156 @TechReport{rasmussen95,
1157 author = {Ole Rasmussen},
1158 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1160 institution = {Computer Laboratory, University of Cambridge},
1164 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1167 author = {Steve Reeves and Michael Clarke},
1168 title = {Logic for Computer Science},
1169 publisher = {Addison-Wesley},
1172 @book{Rosen-DMA,author={Kenneth H. Rosen},
1173 title={Discrete Mathematics and Its Applications},
1174 publisher={McGraw-Hill},year=1998}
1176 @InProceedings{Rudnicki:1992:MizarOverview,
1177 author = {P. Rudnicki},
1178 title = {An Overview of the {MIZAR} Project},
1179 booktitle = {1992 Workshop on Types for Proofs and Programs},
1181 organization = {Chalmers University of Technology},
1182 publisher = {Bastad}
1187 @inproceedings{saaltink-fme,
1188 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1189 Dan Craigen and Irwin Meisels},
1190 title = {An {EVES} Data Abstraction Example},
1194 @inproceedings{slind-tfl,
1195 author = {Konrad Slind},
1196 title = {Function Definition in Higher Order Logic},
1197 crossref = {tphols96},
1201 author = {Patrick Suppes},
1202 title = {Axiomatic Set Theory},
1204 publisher = {Dover}}
1206 @InCollection{szasz93,
1207 author = {Nora Szasz},
1208 title = {A Machine Checked Proof that {Ackermann's} Function is not
1209 Primitive Recursive},
1210 crossref = {huet-plotkin93},
1213 @TechReport{Syme:1997:DECLARE,
1215 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1216 institution = {University of Cambridge Computer Laboratory},
1221 @PhdThesis{Syme:1998:thesis,
1223 title = {Declarative Theorem Proving for Operational Semantics},
1224 school = {University of Cambridge},
1229 @InProceedings{Syme:1999:TPHOL,
1231 title = {Three Tactic Theorem Proving},
1232 crossref = {tphols99}}
1237 author = {G. Takeuti},
1238 title = {Proof Theory},
1244 author = {Simon Thompson},
1245 title = {Type Theory and Functional Programming},
1246 publisher = {Addison-Wesley},
1249 @book{Thompson-Haskell,author={Simon Thompson},
1250 title={Haskell: The Craft of Functional Programming},
1251 publisher={Addison-Wesley},year=1999}
1253 @Unpublished{Trybulec:1993:MizarFeatures,
1254 author = {A. Trybulec},
1255 title = {Some Features of the {Mizar} Language},
1256 note = {Presented at a workshop in Turin, Italy},
1262 @Unpublished{voelker94,
1263 author = {Norbert V{\"o}lker},
1264 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1265 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1271 @inproceedings{wadler89how,
1272 author = {P. Wadler and S. Blott},
1273 title = {How to make ad-hoc polymorphism less ad-hoc},
1274 booktitle = {ACM Symp.\ Principles of Programming Languages},
1279 author = {Christoph Wedler},
1280 title = {Emacs package ``{X-Symbol}''},
1281 note = {\url{http://x-symbol.sourceforge.net}}
1284 @manual{isabelle-sys,
1285 author = {Markus Wenzel and Stefan Berghofer},
1286 title = {The {Isabelle} System Manual},
1287 institution = {TU Munich},
1288 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1290 @manual{isabelle-isar-ref,
1291 author = {Markus Wenzel},
1292 title = {The {Isabelle/Isar} Reference Manual},
1293 institution = {TU Munich},
1294 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1296 @manual{isabelle-axclass,
1297 author = {Markus Wenzel},
1298 title = {Using Axiomatic Type Classes in {I}sabelle},
1299 institution = {TU Munich},
1301 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1304 @InProceedings{Wenzel:1999:TPHOL,
1305 author = {Markus Wenzel},
1306 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1307 crossref = {tphols99}}
1309 @InProceedings{Wenzel:1997:TPHOL,
1310 author = {Markus Wenzel},
1311 title = {Type Classes and Overloading in Higher-Order Logic},
1312 crossref = {tphols97}}
1314 @phdthesis{Wenzel-PhD,
1315 author={Markus Wenzel},
1316 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1317 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1319 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1322 author = {A. N. Whitehead and B. Russell},
1323 title = {Principia Mathematica},
1326 note = {Paperback edition to *56,
1327 abridged from the 2nd edition (1927)}}
1329 @Misc{Wiedijk:1999:Mizar,
1330 author = {Freek Wiedijk},
1331 title = {Mizar: An Impression},
1332 howpublished = {Unpublished paper},
1334 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1337 @Misc{Wiedijk:2000:MV,
1338 author = {Freek Wiedijk},
1339 title = {The Mathematical Vernacular},
1340 howpublished = {Unpublished paper},
1342 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1346 author = {Glynn Winskel},
1347 title = {The Formal Semantics of Programming Languages},
1348 publisher = MIT,year=1993}
1350 @InCollection{wos-bledsoe,
1351 author = {Larry Wos},
1352 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1353 crossref = {bledsoe-fest},
1356 @InProceedings{Zammit:1999:TPHOL,
1357 author = {Vincent Zammit},
1358 title = {On the Implementation of an Extensible Declarative Proof Language},
1359 crossref = {tphols99}}
1367 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1368 title = {Handbook of Logic in Computer Science},
1369 booktitle = {Handbook of Logic in Computer Science},
1370 publisher = {Oxford University Press},
1375 editor = {Henk Barendregt and Tobias Nipkow},
1376 title = TYPES # {: International Workshop {TYPES '93}},
1377 booktitle = TYPES # {: International Workshop {TYPES '93}},
1378 year = {published 1994},
1379 publisher = {Springer},
1380 series = {LNCS 806}}
1382 @book{barwise-handbk,
1383 editor = {J. Barwise},
1384 title = {Handbook of Mathematical Logic},
1385 booktitle = {Handbook of Mathematical Logic},
1389 @Proceedings{tlca93,
1390 title = {Typed Lambda Calculi and Applications},
1391 booktitle = {Typed Lambda Calculi and Applications},
1392 editor = {M. Bezem and J.F. Groote},
1394 publisher = {Springer},
1395 series = {LNCS 664}}
1398 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1399 title = {Current Trends in Hardware Verification and Automated
1401 booktitle = {Current Trends in Hardware Verification and Automated
1403 publisher = {Springer},
1407 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1408 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1409 publisher = {Kluwer Academic Publishers},
1411 editor = {Robert S. Boyer}}
1413 @Proceedings{cade12,
1414 editor = {Alan Bundy},
1415 title = {Automated Deduction --- {CADE}-12
1416 International Conference},
1417 booktitle = {Automated Deduction --- {CADE}-12
1418 International Conference},
1420 series = {LNAI 814},
1421 publisher = {Springer}}
1424 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1425 title = TYPES # {: International Workshop {TYPES '94}},
1426 booktitle = TYPES # {: International Workshop {TYPES '94}},
1428 publisher = {Springer},
1429 series = {LNCS 996}}
1431 @book{huet-plotkin91,
1432 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1433 title = {Logical Frameworks},
1434 booktitle = {Logical Frameworks},
1438 @book{huet-plotkin93,
1439 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1440 title = {Logical Environments},
1441 booktitle = {Logical Environments},
1446 editor = {J. Joyce and C. Seger},
1447 title = {Higher Order Logic Theorem Proving and Its
1448 Applications: HUG '93},
1449 booktitle = {Higher Order Logic Theorem Proving and Its
1450 Applications: HUG '93},
1451 year = {Published 1994},
1452 publisher = {Springer},
1453 series = {LNCS 780}}
1455 @proceedings{colog88,
1456 editor = {P. Martin-L{\"o}f and G. Mints},
1457 title = {COLOG-88: International Conference on Computer Logic},
1458 booktitle = {COLOG-88: International Conference on Computer Logic},
1459 year = {Published 1990},
1460 publisher = {Springer},
1461 organization = {Estonian Academy of Sciences},
1462 address = {Tallinn},
1463 series = {LNCS 417}}
1466 editor = {P. Odifreddi},
1467 title = {Logic and Computer Science},
1468 booktitle = {Logic and Computer Science},
1469 publisher = {Academic Press},
1472 @proceedings{extensions91,
1473 editor = {Peter Schroeder-Heister},
1474 title = {Extensions of Logic Programming},
1475 booktitle = {Extensions of Logic Programming},
1477 series = {LNAI 475},
1478 publisher = {Springer}}
1480 @proceedings{cade10,
1481 editor = {Mark E. Stickel},
1482 title = {10th } # CADE,
1483 booktitle = {10th } # CADE,
1485 publisher = {Springer},
1486 series = {LNAI 449}}
1489 editor = {M. Vardi},
1490 title = {Eighth Annual Symposium on Logic in Computer Science},
1491 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1496 title = {Automated Reasoning and its Applications:
1497 Essays in Honor of {Larry Wos}},
1498 booktitle = {Automated Reasoning and its Applications:
1499 Essays in Honor of {Larry Wos}},
1500 publisher = {MIT Press},
1502 editor = {Robert Veroff}}
1505 editor = {J. C. P. Woodcock and P. G. Larsen},
1506 title = {FME '93: Industrial-Strength Formal Methods},
1507 booktitle = {FME '93: Industrial-Strength Formal Methods},
1509 publisher = Springer,
1513 @Proceedings{tphols96,
1514 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1515 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1516 editor = {J. von Wright and J. Grundy and J. Harrison},
1517 publisher = Springer,
1522 @Proceedings{tphols97,
1523 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1524 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1525 editor = {Elsa L. Gunter and Amy Felty},
1526 publisher = Springer,
1531 @Proceedings{tphols98,
1532 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1533 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1534 editor = {Jim Grundy and Malcom Newey},
1535 publisher = Springer,
1540 @Proceedings{tphols99,
1541 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1542 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1543 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1544 Paulin, C. and Thery, L.},
1545 publisher = Springer,
1550 @Proceedings{tphols2000,
1551 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1552 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1553 editor = {J. Harrison and M. Aagaard},
1554 publisher = Springer,
1559 @Proceedings{tphols2001,
1560 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1561 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1562 editor = {R. J. Boulton and P. B. Jackson},
1563 publisher = Springer,
1568 @Proceedings{ijcar2006,
1569 title = {Automated Reasoning: {IJCAR} 2006},
1570 booktitle = {Automated Reasoning: {IJCAR} 2006},
1571 editor = {U. Furbach and N. Shankar},
1572 publisher = Springer,
1577 @Proceedings{tphols2007,
1578 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1579 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1580 editor = {K. Schneider and J. Brandt},
1581 publisher = Springer,
1586 @unpublished{classes_modules,
1587 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1588 author = {Stefan Wehr et. al.}