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},
235 @InProceedings{bulwahn-et-al:2008:imperative,
236 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
237 title = {Imperative Functional Programming with {Isabelle/HOL}},
238 crossref = {tphols2008},
243 author = {M. Burrows and M. Abadi and R. M. Needham},
244 title = {A Logic of Authentication},
252 @TechReport{camilleri92,
253 author = {J. Camilleri and T. F. Melham},
254 title = {Reasoning with Inductively Defined Relations in the
255 {HOL} Theorem Prover},
262 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
263 title = {Artificial Intelligence Programming},
264 publisher = {Lawrence Erlbaum Associates},
268 author = "Alonzo Church",
269 title = "A Formulation of the Simple Theory of Types",
275 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
276 title="Model Checking",publisher=MIT,year=1999}
279 author = {Martin D. Coen},
280 title = {Interactive Program Derivation},
281 school = {University of Cambridge},
282 note = {Computer Laboratory Technical Report 272},
287 author = {R. L. Constable and others},
288 title = {Implementing Mathematics with the Nuprl Proof
290 publisher = Prentice,
295 @Book{davey-priestley,
296 author = {B. A. Davey and H. A. Priestley},
297 title = {Introduction to Lattices and Order},
302 author = {Keith J. Devlin},
303 title = {Fundamentals of Contemporary Set Theory},
304 publisher = {Springer},
308 author = {Michael Dummett},
309 title = {Elements of Intuitionism},
311 publisher = {Oxford University Press}}
313 @incollection{dybjer91,
314 author = {Peter Dybjer},
315 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
316 Theory and Their Set-Theoretic Semantics},
317 crossref = {huet-plotkin91},
321 author = {Roy Dyckhoff},
322 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
332 author = {William M. Farmer and Joshua D. Guttman and F. Javier
334 title = {{IMPS}: An Interactive Mathematical Proof System},
341 @InProceedings{felty91a,
342 Author = {Amy Felty},
343 Title = {A Logic Program for Transforming Sequent Proofs to Natural
345 crossref = {extensions91},
348 @Article{fleuriot-jcm,
349 author = {Jacques Fleuriot and Lawrence C. Paulson},
350 title = {Mechanizing Nonstandard Real Analysis},
351 journal = {LMS Journal of Computation and Mathematics},
355 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
359 author = {Jacob Frost},
360 title = {A Case Study of Co-induction in {Isabelle HOL}},
366 %revised version of frost93
368 author = {Jacob Frost},
369 title = {A Case Study of Co-induction in {Isabelle}},
376 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
378 title = {Principles of {OBJ2}},
386 author = {J. H. Gallier},
387 title = {Logic for Computer Science:
388 Foundations of Automatic Theorem Proving},
390 publisher = {Harper \& Row}}
393 author = {Antony Galton},
394 title = {Logic for Information Technology},
398 @Article{Gentzen:1935,
399 author = {G. Gentzen},
400 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
401 journal = {Math. Zeitschrift},
405 @InProceedings{gimenez-codifying,
406 author = {Eduardo Gim{\'e}nez},
407 title = {Codifying Guarded Definitions with Recursive Schemes},
408 crossref = {types94},
413 author = {Jean-Yves Girard},
414 title = {Proofs and Types},
417 note = {Translated by Yves LaFont and Paul Taylor}}
420 editor = {M. J. C. Gordon and T. F. Melham},
421 title = {Introduction to {HOL}: A Theorem Proving Environment for
427 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
429 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
431 publisher = {Springer},
434 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
435 title={Why we can't have {SML} style datatype declarations in {HOL}},
436 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
437 IFIP TC10/WG10.2 Intl. Workshop, 1992},
438 editor={L.J.M. Claesen and M.J.C. Gordon},
439 publisher=NH,year=1993,pages={561--568}}
441 @InProceedings{gunter-trees,
442 author = {Elsa L. Gunter},
443 title = {A Broader Class of Trees for Recursive Type Definitions for
450 @InProceedings{Haftmann-Wenzel:2006:classes,
451 author = {Florian Haftmann and Makarius Wenzel},
452 title = {Constructive Type Classes in {Isabelle}},
453 editor = {T. Altenkirch and C. McBride},
454 booktitle = {Types for Proofs and Programs, TYPES 2006},
455 publisher = {Springer},
461 @TechReport{Haftmann-Nipkow:2007:codegen,
462 author = {Florian Haftmann and Tobias Nipkow},
463 title = {A Code Generator Framework for {Isabelle/HOL}},
464 editor = {Klaus Schneider and Jens Brandt},
465 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
468 institution = {Department of Computer Science, University of Kaiserslautern},
472 @manual{isabelle-classes,
473 author = {Florian Haftmann},
474 title = {Haskell-style type classes with {Isabelle}/{Isar}},
476 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
479 @manual{isabelle-codegen,
480 author = {Florian Haftmann},
481 title = {Code generation from Isabelle theories},
483 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
487 author = {Paul R. Halmos},
488 title = {Naive Set Theory},
489 publisher = {Van Nostrand},
492 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
493 title={Dynamic Logic},publisher=MIT,year=2000}
496 author = {Matthew Hennessy},
497 title = {The Semantics of Programming Languages: An Elementary
498 Introduction Using Structural Operational Semantics},
502 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
503 title={Introduction to Automata Theory, Languages, and Computation.},
504 publisher={Addison-Wesley},year=1979}
506 @Article{haskell-report,
507 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
508 title = {Report on the Programming Language {Haskell}: A
509 Non-strict, Purely Functional Language},
515 note = {Version 1.2}}
517 @Article{haskell-tutorial,
518 author = {Paul Hudak and Joseph H. Fasel},
519 title = {A Gentle Introduction to {Haskell}},
526 @book{Hudak-Haskell,author={Paul Hudak},
527 title={The Haskell School of Expression},publisher=CUP,year=2000}
530 author = {G. P. Huet},
531 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
538 author = {G. P. Huet and B. Lang},
539 title = {Proving and Applying Program Transformations Expressed with
540 Second-Order Patterns},
546 @inproceedings{huet88,
547 author = {G{\'e}rard Huet},
548 title = {Induction Principles Formalized in the {Calculus of
550 booktitle = {Programming of Future Generation Computers},
551 editor = {K. Fuchi and M. Nivat},
554 publisher = {Elsevier}}
556 @Book{Huth-Ryan-book,
557 author = {Michael Huth and Mark Ryan},
558 title = {Logic in Computer Science. Modelling and reasoning about systems},
562 @InProceedings{Harrison:1996:MizarHOL,
563 author = {J. Harrison},
564 title = {A {Mizar} Mode for {HOL}},
566 crossref = {tphols96}}
570 @article{haskell-revised-report,
571 author = {Simon {Peyton Jones} and others},
572 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
573 journal = {Journal of Functional Programming},
579 note = {\url{http://www.haskell.org/definition/}}}
583 @InProceedings{kammueller-locales,
584 author = {Florian Kamm{\"u}ller and Markus Wenzel and
585 Lawrence C. Paulson},
586 title = {Locales: A Sectioning Concept for {Isabelle}},
587 crossref = {tphols99}}
590 author={Donald E. Knuth},
591 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
592 publisher={Addison-Wesley},
596 author = {R. E. Korf},
597 title = {Depth-First Iterative-Deepening: an Optimal Admissible
604 @InProceedings{krauss2006,
605 author = {Alexander Krauss},
606 title = {Partial Recursive Functions in {Higher-Order Logic}},
607 crossref = {ijcar2006},
610 @manual{isabelle-function,
611 author = {Alexander Krauss},
612 title = {Defining Recursive Functions in {Isabelle/HOL}},
614 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
618 author = {Kenneth Kunen},
619 title = {Set Theory: An Introduction to Independence Proofs},
626 author = {Xavier Leroy and others},
627 title = {The Objective Caml system -- Documentation and user's manual},
628 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
630 @InProceedings{lowe-fdr,
631 author = {Gavin Lowe},
632 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
633 Protocol using {CSP} and {FDR}},
634 booktitle = {Tools and Algorithms for the Construction and Analysis
635 of Systems: second international workshop, TACAS '96},
636 editor = {T. Margaria and B. Steffen},
637 series = {LNCS 1055},
639 publisher = {Springer},
645 author = {Zohar Manna and Richard Waldinger},
646 title = {Deductive Synthesis of the Unification Algorithm},
653 @InProceedings{martin-nipkow,
654 author = {Ursula Martin and Tobias Nipkow},
655 title = {Ordered Rewriting and Confluence},
660 author = {Per Martin-L{\"o}f},
661 title = {Intuitionistic type theory},
663 publisher = {Bibliopolis}}
665 @incollection{melham89,
666 author = {Thomas F. Melham},
667 title = {Automating Recursive Type Definitions in Higher Order
670 crossref = {birtwistle89}}
672 @Article{miller-mixed,
673 Author = {Dale Miller},
674 Title = {Unification Under a Mixed Prefix},
682 author = {Robin Milner},
683 title = {A Theory of Type Polymorphism in Programming},
684 journal = "J. Comp.\ Sys.\ Sci.",
689 @TechReport{milner-ind,
690 author = {Robin Milner},
691 title = {How to Derive Inductions in {LCF}},
692 institution = Edinburgh,
696 @Article{milner-coind,
697 author = {Robin Milner and Mads Tofte},
698 title = {Co-induction in Relational Semantics},
705 author = {Robin Milner},
706 title = {Communication and Concurrency},
707 publisher = Prentice,
710 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
711 title="The Definition of Standard ML",publisher=MIT,year=1990}
713 @PhdThesis{monahan84,
714 author = {Brian Q. Monahan},
715 title = {Data Type Proofs using Edinburgh {LCF}},
716 school = {University of Edinburgh},
719 @article{MuellerNvOS99,
721 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
722 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
724 @Manual{Muzalewski:Mizar,
725 title = {An Outline of {PC} {Mizar}},
726 author = {Micha{\l} Muzalewski},
727 organization = {Fondation of Logic, Mathematics and Informatics
728 --- Mizar Users Group},
730 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
735 @InProceedings{NaraschewskiW-TPHOLs98,
736 author = {Wolfgang Naraschewski and Markus Wenzel},
738 {Object-Oriented Verification based on Record Subtyping in
740 crossref = {tphols98}}
742 @inproceedings{nazareth-nipkow,
743 author = {Dieter Nazareth and Tobias Nipkow},
744 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
745 crossref = {tphols96},
749 @Article{needham-schroeder,
750 author = "Roger M. Needham and Michael D. Schroeder",
751 title = "Using Encryption for Authentication in Large Networks
760 @inproceedings{nipkow-W,
761 author = {Wolfgang Naraschewski and Tobias Nipkow},
762 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
763 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
764 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
765 publisher = Springer,
771 @InCollection{nipkow-sorts93,
772 author = {T. Nipkow},
773 title = {Order-Sorted Polymorphism in {Isabelle}},
774 booktitle = {Logical Environments},
777 editor = {G. Huet and G. Plotkin},
781 @Misc{nipkow-types93,
782 author = {Tobias Nipkow},
783 title = {Axiomatic Type Classes (in {I}sabelle)},
784 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
788 @inproceedings{Nipkow-CR,
789 author = {Tobias Nipkow},
790 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
791 booktitle = {Automated Deduction --- CADE-13},
792 editor = {M. McRobbie and J.K. Slaney},
793 publisher = Springer,
800 @InProceedings{nipkow-patterns,
801 title = {Functional Unification of Higher-Order Patterns},
802 author = {Tobias Nipkow},
805 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
806 keywords = {unification}}
809 author = {Tobias Nipkow},
810 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
816 @inproceedings{Nipkow-TYPES02,
817 author = {Tobias Nipkow},
818 title = {{Structured Proofs in Isar/HOL}},
819 booktitle = {Types for Proofs and Programs (TYPES 2002)},
820 editor = {H. Geuvers and F. Wiedijk},
822 publisher = Springer,
827 @manual{isabelle-HOL,
828 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
829 title = {{Isabelle}'s Logics: {HOL}},
830 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
831 M{\"u}nchen and Computer Laboratory, University of Cambridge},
832 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
834 @article{nipkow-prehofer,
835 author = {Tobias Nipkow and Christian Prehofer},
836 title = {Type Reconstruction for Type Classes},
843 @InProceedings{Nipkow-Prehofer:1993,
844 author = {T. Nipkow and C. Prehofer},
845 title = {Type checking type classes},
846 booktitle = {ACM Symp.\ Principles of Programming Languages},
851 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
852 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
853 publisher = {Springer},
855 note = {LNCS Tutorial 2283}}
858 author = {Philippe No{\"e}l},
859 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
867 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
868 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
870 publisher = {Oxford University Press},
875 @Manual{pvs-language,
876 title = {The {PVS} specification language},
877 author = {S. Owre and N. Shankar and J. M. Rushby},
878 organization = {Computer Science Laboratory, SRI International},
879 address = {Menlo Park, CA},
880 note = {Beta release},
883 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
888 @InProceedings{paulin-tlca,
889 author = {Christine Paulin-Mohring},
890 title = {Inductive Definitions in the System {Coq}: Rules and
895 @InProceedings{paulson-CADE,
896 author = {Lawrence C. Paulson},
897 title = {A Fixedpoint Approach to Implementing (Co)Inductive
902 @InProceedings{paulson-COLOG,
903 author = {Lawrence C. Paulson},
904 title = {A Formulation of the Simple Theory of Types (for
907 crossref = {colog88},
908 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
910 @Article{paulson-coind,
911 author = {Lawrence C. Paulson},
912 title = {Mechanizing Coinduction and Corecursion in Higher-Order
921 @manual{isabelle-intro,
922 author = {Lawrence C. Paulson},
923 title = {Introduction to {Isabelle}},
925 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
927 @manual{isabelle-logics,
928 author = {Lawrence C. Paulson},
929 title = {{Isabelle's} Logics},
931 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
933 @manual{isabelle-ref,
934 author = {Lawrence C. Paulson},
935 title = {The {Isabelle} Reference Manual},
937 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
940 author = {Lawrence C. Paulson},
941 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
943 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
945 @article{paulson-found,
946 author = {Lawrence C. Paulson},
947 title = {The Foundation of a Generic Theorem Prover},
953 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
955 %replaces paulson-final
956 @Article{paulson-mscs,
957 author = {Lawrence C. Paulson},
958 title = {Final Coalgebras as Greatest Fixed Points
960 journal = {Mathematical Structures in Computer Science},
966 @InCollection{paulson-generic,
967 author = {Lawrence C. Paulson},
968 title = {Generic Automatic Proof Tools},
969 crossref = {wos-fest},
973 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
974 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
983 @InCollection{paulson-fixedpt-milner,
984 author = {Lawrence C. Paulson},
985 title = {A Fixedpoint Approach to (Co)inductive and
986 (Co)datatype Definitions},
988 crossref = {milner-fest}}
991 title = {Proof, Language, and Interaction:
992 Essays in Honor of {Robin Milner}},
993 booktitle = {Proof, Language, and Interaction:
994 Essays in Honor of {Robin Milner}},
995 publisher = {MIT Press},
997 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
999 @InCollection{paulson-handbook,
1000 author = {Lawrence C. Paulson},
1001 title = {Designing a Theorem Prover},
1002 crossref = {handbk-lics2},
1005 @Book{paulson-isa-book,
1006 author = {Lawrence C. Paulson},
1007 title = {Isabelle: A Generic Theorem Prover},
1008 publisher = {Springer},
1012 @Book{isabelle-hol-book,
1013 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1014 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1015 publisher = {Springer},
1019 @InCollection{paulson-markt,
1020 author = {Lawrence C. Paulson},
1021 title = {Tool Support for Logics of Programs},
1022 booktitle = {Mathematical Methods in Program Development:
1023 Summer School Marktoberdorf 1996},
1024 publisher = {Springer},
1026 year = {Published 1997},
1027 editor = {Manfred Broy},
1028 series = {NATO ASI Series F}}
1030 %replaces Paulson-ML and paulson91
1032 author = {Lawrence C. Paulson},
1033 title = {{ML} for the Working Programmer},
1038 @article{paulson-natural,
1039 author = {Lawrence C. Paulson},
1040 title = {Natural Deduction as Higher-order Resolution},
1045 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1047 @Article{paulson-set-I,
1048 author = {Lawrence C. Paulson},
1049 title = {Set Theory for Verification: {I}. {From}
1050 Foundations to Functions},
1056 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1058 @Article{paulson-set-II,
1059 author = {Lawrence C. Paulson},
1060 title = {Set Theory for Verification: {II}. {Induction} and
1067 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1070 author = {Lawrence C. Paulson},
1071 title = {Verifying the Unification Algorithm in {LCF}},
1077 %replaces Paulson-LCF
1079 author = {Lawrence C. Paulson},
1080 title = {Logic and Computation: Interactive proof with Cambridge
1085 @incollection{paulson700,
1086 author = {Lawrence C. Paulson},
1087 title = {{Isabelle}: The Next 700 Theorem Provers},
1088 crossref = {odifreddi90},
1090 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1092 % replaces paulson-ns and paulson-security
1093 @Article{paulson-jcs,
1094 author = {Lawrence C. Paulson},
1095 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1101 @Article{paulson-tls,
1102 author = {Lawrence C. Paulson},
1103 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1111 @Article{paulson-yahalom,
1112 author = {Lawrence C. Paulson},
1113 title = {Relations Between Secrets:
1114 Two Formal Analyses of the {Yahalom} Protocol},
1121 @article{pelletier86,
1122 author = {F. J. Pelletier},
1123 title = {Seventy-five Problems for Testing Automatic Theorem
1129 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1132 author = {Andrew M. Pitts},
1133 title = {A Co-induction Principle for Recursively Defined Domains},
1139 @Article{plaisted90,
1140 author = {David A. Plaisted},
1141 title = {A Sequent-Style Model Elimination Strategy and a Positive
1152 author = {Art Quaife},
1153 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1163 @TechReport{rasmussen95,
1164 author = {Ole Rasmussen},
1165 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1167 institution = {Computer Laboratory, University of Cambridge},
1171 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1174 author = {Steve Reeves and Michael Clarke},
1175 title = {Logic for Computer Science},
1176 publisher = {Addison-Wesley},
1179 @book{Rosen-DMA,author={Kenneth H. Rosen},
1180 title={Discrete Mathematics and Its Applications},
1181 publisher={McGraw-Hill},year=1998}
1183 @InProceedings{Rudnicki:1992:MizarOverview,
1184 author = {P. Rudnicki},
1185 title = {An Overview of the {MIZAR} Project},
1186 booktitle = {1992 Workshop on Types for Proofs and Programs},
1188 organization = {Chalmers University of Technology},
1189 publisher = {Bastad}
1194 @inproceedings{saaltink-fme,
1195 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1196 Dan Craigen and Irwin Meisels},
1197 title = {An {EVES} Data Abstraction Example},
1201 @inproceedings{slind-tfl,
1202 author = {Konrad Slind},
1203 title = {Function Definition in Higher Order Logic},
1204 crossref = {tphols96},
1208 author = {Patrick Suppes},
1209 title = {Axiomatic Set Theory},
1211 publisher = {Dover}}
1213 @InCollection{szasz93,
1214 author = {Nora Szasz},
1215 title = {A Machine Checked Proof that {Ackermann's} Function is not
1216 Primitive Recursive},
1217 crossref = {huet-plotkin93},
1220 @TechReport{Syme:1997:DECLARE,
1222 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1223 institution = {University of Cambridge Computer Laboratory},
1228 @PhdThesis{Syme:1998:thesis,
1230 title = {Declarative Theorem Proving for Operational Semantics},
1231 school = {University of Cambridge},
1236 @InProceedings{Syme:1999:TPHOL,
1238 title = {Three Tactic Theorem Proving},
1239 crossref = {tphols99}}
1244 author = {G. Takeuti},
1245 title = {Proof Theory},
1251 author = {Simon Thompson},
1252 title = {Type Theory and Functional Programming},
1253 publisher = {Addison-Wesley},
1256 @book{Thompson-Haskell,author={Simon Thompson},
1257 title={Haskell: The Craft of Functional Programming},
1258 publisher={Addison-Wesley},year=1999}
1260 @Unpublished{Trybulec:1993:MizarFeatures,
1261 author = {A. Trybulec},
1262 title = {Some Features of the {Mizar} Language},
1263 note = {Presented at a workshop in Turin, Italy},
1269 @Unpublished{voelker94,
1270 author = {Norbert V{\"o}lker},
1271 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1272 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1278 @inproceedings{wadler89how,
1279 author = {P. Wadler and S. Blott},
1280 title = {How to make ad-hoc polymorphism less ad-hoc},
1281 booktitle = {ACM Symp.\ Principles of Programming Languages},
1286 author = {Christoph Wedler},
1287 title = {Emacs package ``{X-Symbol}''},
1288 note = {\url{http://x-symbol.sourceforge.net}}
1291 @manual{isabelle-sys,
1292 author = {Markus Wenzel and Stefan Berghofer},
1293 title = {The {Isabelle} System Manual},
1294 institution = {TU Munich},
1295 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1297 @manual{isabelle-isar-ref,
1298 author = {Markus Wenzel},
1299 title = {The {Isabelle/Isar} Reference Manual},
1300 institution = {TU Munich},
1301 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1303 @manual{isabelle-axclass,
1304 author = {Markus Wenzel},
1305 title = {Using Axiomatic Type Classes in {I}sabelle},
1306 institution = {TU Munich},
1308 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1311 @InProceedings{Wenzel:1999:TPHOL,
1312 author = {Markus Wenzel},
1313 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1314 crossref = {tphols99}}
1316 @InProceedings{Wenzel:1997:TPHOL,
1317 author = {Markus Wenzel},
1318 title = {Type Classes and Overloading in Higher-Order Logic},
1319 crossref = {tphols97}}
1321 @phdthesis{Wenzel-PhD,
1322 author={Markus Wenzel},
1323 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1324 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1326 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1328 @InCollection{Wenzel:2006:Festschrift,
1329 author = {Makarius Wenzel},
1330 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1331 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1332 publisher = {University of Bia{\l}ystok},
1334 editor = {R. Matuszewski and A. Zalewska},
1336 series = {Studies in Logic, Grammar, and Rhetoric},
1337 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1341 author = {A. N. Whitehead and B. Russell},
1342 title = {Principia Mathematica},
1345 note = {Paperback edition to *56,
1346 abridged from the 2nd edition (1927)}}
1348 @Misc{Wiedijk:1999:Mizar,
1349 author = {Freek Wiedijk},
1350 title = {Mizar: An Impression},
1351 howpublished = {Unpublished paper},
1353 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1356 @Misc{Wiedijk:2000:MV,
1357 author = {Freek Wiedijk},
1358 title = {The Mathematical Vernacular},
1359 howpublished = {Unpublished paper},
1361 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1365 author = {Glynn Winskel},
1366 title = {The Formal Semantics of Programming Languages},
1367 publisher = MIT,year=1993}
1369 @InCollection{wos-bledsoe,
1370 author = {Larry Wos},
1371 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1372 crossref = {bledsoe-fest},
1375 @InProceedings{Zammit:1999:TPHOL,
1376 author = {Vincent Zammit},
1377 title = {On the Implementation of an Extensible Declarative Proof Language},
1378 crossref = {tphols99}}
1386 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1387 title = {Handbook of Logic in Computer Science},
1388 booktitle = {Handbook of Logic in Computer Science},
1389 publisher = {Oxford University Press},
1394 editor = {Henk Barendregt and Tobias Nipkow},
1395 title = TYPES # {: International Workshop {TYPES '93}},
1396 booktitle = TYPES # {: International Workshop {TYPES '93}},
1397 year = {published 1994},
1398 publisher = {Springer},
1399 series = {LNCS 806}}
1401 @book{barwise-handbk,
1402 editor = {J. Barwise},
1403 title = {Handbook of Mathematical Logic},
1404 booktitle = {Handbook of Mathematical Logic},
1408 @Proceedings{tlca93,
1409 title = {Typed Lambda Calculi and Applications},
1410 booktitle = {Typed Lambda Calculi and Applications},
1411 editor = {M. Bezem and J.F. Groote},
1413 publisher = {Springer},
1414 series = {LNCS 664}}
1417 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1418 title = {Current Trends in Hardware Verification and Automated
1420 booktitle = {Current Trends in Hardware Verification and Automated
1422 publisher = {Springer},
1426 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1427 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1428 publisher = {Kluwer Academic Publishers},
1430 editor = {Robert S. Boyer}}
1432 @Proceedings{cade12,
1433 editor = {Alan Bundy},
1434 title = {Automated Deduction --- {CADE}-12
1435 International Conference},
1436 booktitle = {Automated Deduction --- {CADE}-12
1437 International Conference},
1439 series = {LNAI 814},
1440 publisher = {Springer}}
1443 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1444 title = TYPES # {: International Workshop {TYPES '94}},
1445 booktitle = TYPES # {: International Workshop {TYPES '94}},
1447 publisher = {Springer},
1448 series = {LNCS 996}}
1450 @book{huet-plotkin91,
1451 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1452 title = {Logical Frameworks},
1453 booktitle = {Logical Frameworks},
1457 @book{huet-plotkin93,
1458 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1459 title = {Logical Environments},
1460 booktitle = {Logical Environments},
1465 editor = {J. Joyce and C. Seger},
1466 title = {Higher Order Logic Theorem Proving and Its
1467 Applications: HUG '93},
1468 booktitle = {Higher Order Logic Theorem Proving and Its
1469 Applications: HUG '93},
1470 year = {Published 1994},
1471 publisher = {Springer},
1472 series = {LNCS 780}}
1474 @proceedings{colog88,
1475 editor = {P. Martin-L{\"o}f and G. Mints},
1476 title = {COLOG-88: International Conference on Computer Logic},
1477 booktitle = {COLOG-88: International Conference on Computer Logic},
1478 year = {Published 1990},
1479 publisher = {Springer},
1480 organization = {Estonian Academy of Sciences},
1481 address = {Tallinn},
1482 series = {LNCS 417}}
1485 editor = {P. Odifreddi},
1486 title = {Logic and Computer Science},
1487 booktitle = {Logic and Computer Science},
1488 publisher = {Academic Press},
1491 @proceedings{extensions91,
1492 editor = {Peter Schroeder-Heister},
1493 title = {Extensions of Logic Programming},
1494 booktitle = {Extensions of Logic Programming},
1496 series = {LNAI 475},
1497 publisher = {Springer}}
1499 @proceedings{cade10,
1500 editor = {Mark E. Stickel},
1501 title = {10th } # CADE,
1502 booktitle = {10th } # CADE,
1504 publisher = {Springer},
1505 series = {LNAI 449}}
1508 editor = {M. Vardi},
1509 title = {Eighth Annual Symposium on Logic in Computer Science},
1510 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1515 title = {Automated Reasoning and its Applications:
1516 Essays in Honor of {Larry Wos}},
1517 booktitle = {Automated Reasoning and its Applications:
1518 Essays in Honor of {Larry Wos}},
1519 publisher = {MIT Press},
1521 editor = {Robert Veroff}}
1524 editor = {J. C. P. Woodcock and P. G. Larsen},
1525 title = {FME '93: Industrial-Strength Formal Methods},
1526 booktitle = {FME '93: Industrial-Strength Formal Methods},
1528 publisher = Springer,
1532 @Proceedings{tphols96,
1533 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1534 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1535 editor = {J. von Wright and J. Grundy and J. Harrison},
1536 publisher = Springer,
1541 @Proceedings{tphols97,
1542 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1543 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1544 editor = {Elsa L. Gunter and Amy Felty},
1545 publisher = Springer,
1550 @Proceedings{tphols98,
1551 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1552 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1553 editor = {Jim Grundy and Malcom Newey},
1554 publisher = Springer,
1559 @Proceedings{tphols99,
1560 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1561 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1562 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1563 Paulin, C. and Thery, L.},
1564 publisher = Springer,
1569 @Proceedings{tphols2000,
1570 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1571 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1572 editor = {J. Harrison and M. Aagaard},
1573 publisher = Springer,
1578 @Proceedings{tphols2001,
1579 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1580 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1581 editor = {R. J. Boulton and P. B. Jackson},
1582 publisher = Springer,
1587 @Proceedings{ijcar2006,
1588 title = {Automated Reasoning: {IJCAR} 2006},
1589 booktitle = {Automated Reasoning: {IJCAR} 2006},
1590 editor = {U. Furbach and N. Shankar},
1591 publisher = Springer,
1596 @Proceedings{tphols2007,
1597 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1598 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1599 editor = {K. Schneider and J. Brandt},
1600 publisher = Springer,
1605 @Proceedings{tphols2008,
1606 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1607 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1608 publisher = Springer,
1614 @unpublished{classes_modules,
1615 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1616 author = {Stefan Wehr et. al.}