Added Nitpick manual.
1 % BibTeX database for the Isabelle documentation
4 @string{AP="Academic Press"}
5 @string{CUP="Cambridge University Press"}
6 @string{IEEE="{\sc ieee} Computer Society Press"}
7 @string{LNCS="Lecture Notes in Computer Science"}
8 @string{MIT="MIT Press"}
9 @string{NH="North-Holland"}
10 @string{Prentice="Prentice-Hall"}
11 @string{PH="Prentice-Hall"}
12 @string{Springer="Springer-Verlag"}
15 @string{CUCL="Computer Laboratory, University of Cambridge"}
16 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}
17 @string{TUM="Department of Informatics, Technical University of Munich"}
20 @string{AI="Artificial Intelligence"}
21 @string{FAC="Formal Aspects of Computing"}
22 @string{JAR="Journal of Automated Reasoning"}
23 @string{JCS="Journal of Computer Security"}
24 @string{JFP="Journal of Functional Programming"}
25 @string{JLC="Journal of Logic and Computation"}
26 @string{JLP="Journal of Logic Programming"}
27 @string{JSC="Journal of Symbolic Computation"}
28 @string{JSL="Journal of Symbolic Logic"}
29 @string{PROYAL="Proceedings of the Royal Society of London"}
30 @string{SIGPLAN="{SIGPLAN} Notices"}
31 @string{TISSEC="ACM Transactions on Information and System Security"}
34 @string{CADE="International Conference on Automated Deduction"}
35 @string{POPL="Symposium on Principles of Programming Languages"}
36 @string{TYPES="Types for Proofs and Programs"}
41 @incollection{abramsky90,
42 author = {Samson Abramsky},
43 title = {The Lazy Lambda Calculus},
45 editor = {David A. Turner},
46 booktitle = {Research Topics in Functional Programming},
47 publisher = {Addison-Wesley},
50 @Unpublished{abrial93,
51 author = {J. R. Abrial and G. Laffitte},
52 title = {Towards the Mechanization of the Proofs of Some Classical
53 Theorems of Set Theory},
58 @incollection{aczel77,
59 author = {Peter Aczel},
60 title = {An Introduction to Inductive Definitions},
62 crossref = {barwise-handbk}}
65 author = {Peter Aczel},
66 title = {Non-Well-Founded Sets},
71 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
72 title = {The {ALF} Proof Editor and Its Proof Engine},
76 @inproceedings{andersson-1993,
77 author = "Arne Andersson",
78 title = "Balanced Search Trees Made Simple",
79 editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides",
80 booktitle = "WADS 1993",
88 author = "Peter Andrews",
89 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
92 series = "Computer Science and Applied Mathematics",
95 @InProceedings{Aspinall:2000:eProof,
96 author = {David Aspinall},
97 title = {Protocols for Interactive {e-Proof}},
98 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
100 note = {Unpublished work-in-progress paper,
101 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
104 @InProceedings{Aspinall:TACAS:2000,
105 author = {David Aspinall},
106 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
107 booktitle = {Tools and Algorithms for the Construction and Analysis of
110 publisher = Springer,
117 author = {David Aspinall},
118 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
119 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
123 author = {David Aspinall},
124 title = {{P}roof {G}eneral},
125 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
130 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
131 title="Term Rewriting and All That",publisher=CUP,year=1998}
133 @InCollection{Barendregt-Geuvers:2001,
134 author = {H. Barendregt and H. Geuvers},
135 title = {Proof Assistants using Dependent Type Systems},
136 booktitle = {Handbook of Automated Reasoning},
137 publisher = {Elsevier},
139 editor = {A. Robinson and A. Voronkov}
142 @incollection{basin91,
143 author = {David Basin and Matt Kaufmann},
144 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
146 crossref = {huet-plotkin91},
149 @Unpublished{HOL-Library,
150 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
151 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
153 title = {The Supplemental {Isabelle/HOL} Library},
154 note = {Part of the Isabelle distribution,
155 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
159 @InProceedings{Bauer-Wenzel:2000:HB,
160 author = {Gertrud Bauer and Markus Wenzel},
161 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
163 booktitle = {Types for Proofs and Programs: TYPES'99},
164 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
170 @InProceedings{Bauer-Wenzel:2001,
171 author = {Gertrud Bauer and Markus Wenzel},
172 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
173 crossref = {tphols2001}}
175 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
176 crossref = "tphols2000",
177 title = "Proof terms for simply typed higher order logic",
178 author = "Stefan Berghofer and Tobias Nipkow",
181 @inproceedings{berghofer-nipkow-2004,
182 author = {Stefan Berghofer and Tobias Nipkow},
183 title = {Random Testing in {I}sabelle/{HOL}},
185 editor = "J. Cuellar and Z. Liu",
186 booktitle = {{SEFM} 2004},
190 @InProceedings{Berghofer-Nipkow:2002,
191 author = {Stefan Berghofer and Tobias Nipkow},
192 title = {Executing Higher Order Logic},
193 booktitle = {Types for Proofs and Programs: TYPES'2000},
194 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
196 publisher = Springer,
200 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
201 author = {Stefan Berghofer and Markus Wenzel},
202 title = {Inductive datatypes in {HOL} --- lessons learned in
203 {F}ormal-{L}ogic {E}ngineering},
204 crossref = {tphols99}}
207 @InProceedings{Bezem-Coquand:2005,
208 author = {M.A. Bezem and T. Coquand},
209 title = {Automating {Coherent Logic}},
210 booktitle = {LPAR-12},
211 editor = {G. Sutcliffe and A. Voronkov},
214 publisher = Springer}
216 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
217 title="Introduction to Functional Programming",publisher=PH,year=1988}
219 @book{Bird-Haskell,author="Richard Bird",
220 title="Introduction to Functional Programming using Haskell",
221 publisher=PH,year=1998}
223 @inproceedings{blanchette-nipkow-2009,
224 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)",
225 author = "Jasmin Christian Blanchette and Tobias Nipkow",
226 booktitle = "{TAP} 2009: Short Papers",
227 editor = "Catherine Dubois",
228 publisher = "ETH Technical Report 630",
232 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
233 Overbeek and Mark Stickel and Lawrence Wos},
234 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
243 author = {Robert S. Boyer and J Strother Moore},
244 title = {A Computational Logic},
245 publisher = {Academic Press},
249 author = {Robert S. Boyer and J Strother Moore},
250 title = {A Computational Logic Handbook},
251 publisher = {Academic Press},
255 author = {N. G. de Bruijn},
256 title = {Lambda Calculus Notation with Nameless Dummies,
257 a Tool for Automatic Formula Manipulation,
258 with Application to the {Church-Rosser Theorem}},
259 journal = {Indag. Math.},
264 @InProceedings{bulwahnKN07,
265 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
266 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
267 crossref = {tphols2007},
271 @InProceedings{bulwahn-et-al:2008:imperative,
272 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
273 title = {Imperative Functional Programming with {Isabelle/HOL}},
274 crossref = {tphols2008},
279 author = {M. Burrows and M. Abadi and R. M. Needham},
280 title = {A Logic of Authentication},
288 @TechReport{camilleri92,
289 author = {J. Camilleri and T. F. Melham},
290 title = {Reasoning with Inductively Defined Relations in the
291 {HOL} Theorem Prover},
298 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
299 title = {Artificial Intelligence Programming},
300 publisher = {Lawrence Erlbaum Associates},
304 author = "Alonzo Church",
305 title = "A Formulation of the Simple Theory of Types",
311 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
312 title="Model Checking",publisher=MIT,year=1999}
315 author = {Martin D. Coen},
316 title = {Interactive Program Derivation},
317 school = {University of Cambridge},
318 note = {Computer Laboratory Technical Report 272},
323 author = {R. L. Constable and others},
324 title = {Implementing Mathematics with the Nuprl Proof
326 publisher = Prentice,
331 @Book{davey-priestley,
332 author = {B. A. Davey and H. A. Priestley},
333 title = {Introduction to Lattices and Order},
338 author = {Keith J. Devlin},
339 title = {Fundamentals of Contemporary Set Theory},
340 publisher = {Springer},
344 author = {Michael Dummett},
345 title = {Elements of Intuitionism},
347 publisher = {Oxford University Press}}
349 @incollection{dybjer91,
350 author = {Peter Dybjer},
351 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
352 Theory and Their Set-Theoretic Semantics},
353 crossref = {huet-plotkin91},
357 author = {Roy Dyckhoff},
358 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
368 author = {William M. Farmer and Joshua D. Guttman and F. Javier
370 title = {{IMPS}: An Interactive Mathematical Proof System},
377 @InProceedings{felty91a,
378 Author = {Amy Felty},
379 Title = {A Logic Program for Transforming Sequent Proofs to Natural
381 crossref = {extensions91},
384 @Article{fleuriot-jcm,
385 author = {Jacques Fleuriot and Lawrence C. Paulson},
386 title = {Mechanizing Nonstandard Real Analysis},
387 journal = {LMS Journal of Computation and Mathematics},
391 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
395 author = {Jacob Frost},
396 title = {A Case Study of Co-induction in {Isabelle HOL}},
402 %revised version of frost93
404 author = {Jacob Frost},
405 title = {A Case Study of Co-induction in {Isabelle}},
412 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
414 title = {Principles of {OBJ2}},
422 author = {J. H. Gallier},
423 title = {Logic for Computer Science:
424 Foundations of Automatic Theorem Proving},
426 publisher = {Harper \& Row}}
429 author = {Antony Galton},
430 title = {Logic for Information Technology},
434 @Article{Gentzen:1935,
435 author = {G. Gentzen},
436 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
437 journal = {Math. Zeitschrift},
441 @InProceedings{gimenez-codifying,
442 author = {Eduardo Gim{\'e}nez},
443 title = {Codifying Guarded Definitions with Recursive Schemes},
444 crossref = {types94},
449 author = {Jean-Yves Girard},
450 title = {Proofs and Types},
453 note = {Translated by Yves LaFont and Paul Taylor}}
456 editor = {M. J. C. Gordon and T. F. Melham},
457 title = {Introduction to {HOL}: A Theorem Proving Environment for
463 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
465 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
467 publisher = {Springer},
470 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
471 title={Why we can't have {SML} style datatype declarations in {HOL}},
472 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
473 IFIP TC10/WG10.2 Intl. Workshop, 1992},
474 editor={L.J.M. Claesen and M.J.C. Gordon},
475 publisher=NH,year=1993,pages={561--568}}
477 @InProceedings{gunter-trees,
478 author = {Elsa L. Gunter},
479 title = {A Broader Class of Trees for Recursive Type Definitions for
486 @InProceedings{Haftmann-Wenzel:2006:classes,
487 author = {Florian Haftmann and Makarius Wenzel},
488 title = {Constructive Type Classes in {Isabelle}},
489 editor = {T. Altenkirch and C. McBride},
490 booktitle = {Types for Proofs and Programs, TYPES 2006},
491 publisher = {Springer},
497 @TechReport{Haftmann-Nipkow:2007:codegen,
498 author = {Florian Haftmann and Tobias Nipkow},
499 title = {A Code Generator Framework for {Isabelle/HOL}},
500 editor = {Klaus Schneider and Jens Brandt},
501 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
504 institution = {Department of Computer Science, University of Kaiserslautern},
508 @InProceedings{Haftmann-Wenzel:2009,
509 author = {Florian Haftmann and Makarius Wenzel},
510 title = {Local theory specifications in {Isabelle/Isar}},
511 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
512 booktitle = {Types for Proofs and Programs, TYPES 2008},
513 publisher = {Springer},
519 @manual{isabelle-classes,
520 author = {Florian Haftmann},
521 title = {Haskell-style type classes with {Isabelle}/{Isar}},
523 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
526 @manual{isabelle-codegen,
527 author = {Florian Haftmann},
528 title = {Code generation from Isabelle theories},
530 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
534 author = {Paul R. Halmos},
535 title = {Naive Set Theory},
536 publisher = {Van Nostrand},
539 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
540 title={Dynamic Logic},publisher=MIT,year=2000}
543 author = {Matthew Hennessy},
544 title = {The Semantics of Programming Languages: An Elementary
545 Introduction Using Structural Operational Semantics},
549 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
550 title={Introduction to Automata Theory, Languages, and Computation.},
551 publisher={Addison-Wesley},year=1979}
553 @Article{haskell-report,
554 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
555 title = {Report on the Programming Language {Haskell}: A
556 Non-strict, Purely Functional Language},
562 note = {Version 1.2}}
564 @Article{haskell-tutorial,
565 author = {Paul Hudak and Joseph H. Fasel},
566 title = {A Gentle Introduction to {Haskell}},
573 @book{Hudak-Haskell,author={Paul Hudak},
574 title={The Haskell School of Expression},publisher=CUP,year=2000}
577 author = {G. P. Huet},
578 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
585 author = {G. P. Huet and B. Lang},
586 title = {Proving and Applying Program Transformations Expressed with
587 Second-Order Patterns},
593 @inproceedings{huet88,
594 author = {G{\'e}rard Huet},
595 title = {Induction Principles Formalized in the {Calculus of
597 booktitle = {Programming of Future Generation Computers},
598 editor = {K. Fuchi and M. Nivat},
601 publisher = {Elsevier}}
603 @Book{Huth-Ryan-book,
604 author = {Michael Huth and Mark Ryan},
605 title = {Logic in Computer Science. Modelling and reasoning about systems},
609 @InProceedings{Harrison:1996:MizarHOL,
610 author = {J. Harrison},
611 title = {A {Mizar} Mode for {HOL}},
613 crossref = {tphols96}}
617 @article{haskell-revised-report,
618 author = {Simon {Peyton Jones} and others},
619 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
620 journal = {Journal of Functional Programming},
626 note = {\url{http://www.haskell.org/definition/}}}
629 author = "Daniel Jackson",
630 title = "Software Abstractions: Logic, Language, and Analysis",
636 @InProceedings{kammueller-locales,
637 author = {Florian Kamm{\"u}ller and Markus Wenzel and
638 Lawrence C. Paulson},
639 title = {Locales: A Sectioning Concept for {Isabelle}},
640 crossref = {tphols99}}
643 author={Donald E. Knuth},
644 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
645 publisher={Addison-Wesley},
649 author = {R. E. Korf},
650 title = {Depth-First Iterative-Deepening: an Optimal Admissible
657 @InProceedings{krauss2006,
658 author = {Alexander Krauss},
659 title = {Partial Recursive Functions in {Higher-Order Logic}},
660 crossref = {ijcar2006},
663 @manual{isabelle-function,
664 author = {Alexander Krauss},
665 title = {Defining Recursive Functions in {Isabelle/HOL}},
667 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
671 author = {Kenneth Kunen},
672 title = {Set Theory: An Introduction to Independence Proofs},
679 author = {Xavier Leroy and others},
680 title = {The Objective Caml system -- Documentation and user's manual},
681 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
683 @InProceedings{lowe-fdr,
684 author = {Gavin Lowe},
685 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
686 Protocol using {CSP} and {FDR}},
687 booktitle = {Tools and Algorithms for the Construction and Analysis
688 of Systems: second international workshop, TACAS '96},
689 editor = {T. Margaria and B. Steffen},
690 series = {LNCS 1055},
692 publisher = {Springer},
698 author = {Zohar Manna and Richard Waldinger},
699 title = {Deductive Synthesis of the Unification Algorithm},
706 @InProceedings{martin-nipkow,
707 author = {Ursula Martin and Tobias Nipkow},
708 title = {Ordered Rewriting and Confluence},
713 author = {Per Martin-L{\"o}f},
714 title = {Intuitionistic type theory},
716 publisher = {Bibliopolis}}
718 @incollection{melham89,
719 author = {Thomas F. Melham},
720 title = {Automating Recursive Type Definitions in Higher Order
723 crossref = {birtwistle89}}
725 @Article{Miller:1991,
726 author = {Dale Miller},
727 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
728 and Simple Unification},
729 journal = {Journal of Logic and Computation},
735 @Article{miller-mixed,
736 Author = {Dale Miller},
737 Title = {Unification Under a Mixed Prefix},
745 author = {Robin Milner},
746 title = {A Theory of Type Polymorphism in Programming},
747 journal = "J. Comp.\ Sys.\ Sci.",
752 @TechReport{milner-ind,
753 author = {Robin Milner},
754 title = {How to Derive Inductions in {LCF}},
755 institution = Edinburgh,
759 @Article{milner-coind,
760 author = {Robin Milner and Mads Tofte},
761 title = {Co-induction in Relational Semantics},
768 author = {Robin Milner},
769 title = {Communication and Concurrency},
770 publisher = Prentice,
773 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
774 title="The Definition of Standard ML",publisher=MIT,year=1990}
776 @PhdThesis{monahan84,
777 author = {Brian Q. Monahan},
778 title = {Data Type Proofs using Edinburgh {LCF}},
779 school = {University of Edinburgh},
782 @article{MuellerNvOS99,
784 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
785 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
787 @Manual{Muzalewski:Mizar,
788 title = {An Outline of {PC} {Mizar}},
789 author = {Micha{\l} Muzalewski},
790 organization = {Fondation of Logic, Mathematics and Informatics
791 --- Mizar Users Group},
793 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
798 @InProceedings{NaraschewskiW-TPHOLs98,
799 author = {Wolfgang Naraschewski and Markus Wenzel},
801 {Object-Oriented Verification based on Record Subtyping in
803 crossref = {tphols98}}
805 @inproceedings{nazareth-nipkow,
806 author = {Dieter Nazareth and Tobias Nipkow},
807 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
808 crossref = {tphols96},
812 @Article{needham-schroeder,
813 author = "Roger M. Needham and Michael D. Schroeder",
814 title = "Using Encryption for Authentication in Large Networks
823 @inproceedings{nipkow-W,
824 author = {Wolfgang Naraschewski and Tobias Nipkow},
825 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
826 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
827 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
828 publisher = Springer,
834 @InCollection{nipkow-sorts93,
835 author = {T. Nipkow},
836 title = {Order-Sorted Polymorphism in {Isabelle}},
837 booktitle = {Logical Environments},
840 editor = {G. Huet and G. Plotkin},
844 @Misc{nipkow-types93,
845 author = {Tobias Nipkow},
846 title = {Axiomatic Type Classes (in {I}sabelle)},
847 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
851 @inproceedings{Nipkow-CR,
852 author = {Tobias Nipkow},
853 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
854 booktitle = {Automated Deduction --- CADE-13},
855 editor = {M. McRobbie and J.K. Slaney},
856 publisher = Springer,
863 @InProceedings{nipkow-patterns,
864 title = {Functional Unification of Higher-Order Patterns},
865 author = {Tobias Nipkow},
868 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
869 keywords = {unification}}
872 author = {Tobias Nipkow},
873 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
879 @inproceedings{Nipkow-TYPES02,
880 author = {Tobias Nipkow},
881 title = {{Structured Proofs in Isar/HOL}},
882 booktitle = {Types for Proofs and Programs (TYPES 2002)},
883 editor = {H. Geuvers and F. Wiedijk},
885 publisher = Springer,
890 @manual{isabelle-HOL,
891 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
892 title = {{Isabelle}'s Logics: {HOL}},
893 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
894 M{\"u}nchen and Computer Laboratory, University of Cambridge},
895 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
897 @article{nipkow-prehofer,
898 author = {Tobias Nipkow and Christian Prehofer},
899 title = {Type Reconstruction for Type Classes},
906 @InProceedings{Nipkow-Prehofer:1993,
907 author = {T. Nipkow and C. Prehofer},
908 title = {Type checking type classes},
909 booktitle = {ACM Symp.\ Principles of Programming Languages},
914 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
915 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
916 publisher = Springer,
922 author = {Philippe No{\"e}l},
923 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
931 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
932 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
934 publisher = {Oxford University Press},
939 @Manual{pvs-language,
940 title = {The {PVS} specification language},
941 author = {S. Owre and N. Shankar and J. M. Rushby},
942 organization = {Computer Science Laboratory, SRI International},
943 address = {Menlo Park, CA},
944 note = {Beta release},
947 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
952 @InProceedings{paulin-tlca,
953 author = {Christine Paulin-Mohring},
954 title = {Inductive Definitions in the System {Coq}: Rules and
959 @InProceedings{paulson-CADE,
960 author = {Lawrence C. Paulson},
961 title = {A Fixedpoint Approach to Implementing (Co)Inductive
966 @InProceedings{paulson-COLOG,
967 author = {Lawrence C. Paulson},
968 title = {A Formulation of the Simple Theory of Types (for
971 crossref = {colog88},
972 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
974 @Article{paulson-coind,
975 author = {Lawrence C. Paulson},
976 title = {Mechanizing Coinduction and Corecursion in Higher-Order
985 @manual{isabelle-intro,
986 author = {Lawrence C. Paulson},
987 title = {Introduction to {Isabelle}},
989 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
991 @manual{isabelle-logics,
992 author = {Lawrence C. Paulson},
993 title = {{Isabelle's} Logics},
995 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
997 @manual{isabelle-ref,
998 author = {Lawrence C. Paulson},
999 title = {The {Isabelle} Reference Manual},
1001 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1003 @manual{isabelle-ZF,
1004 author = {Lawrence C. Paulson},
1005 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1007 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1009 @article{paulson-found,
1010 author = {Lawrence C. Paulson},
1011 title = {The Foundation of a Generic Theorem Prover},
1017 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1019 %replaces paulson-final
1020 @Article{paulson-mscs,
1021 author = {Lawrence C. Paulson},
1022 title = {Final Coalgebras as Greatest Fixed Points
1023 in {ZF} Set Theory},
1024 journal = {Mathematical Structures in Computer Science},
1030 @InCollection{paulson-generic,
1031 author = {Lawrence C. Paulson},
1032 title = {Generic Automatic Proof Tools},
1033 crossref = {wos-fest},
1036 @Article{paulson-gr,
1037 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1038 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1047 @InCollection{paulson-fixedpt-milner,
1048 author = {Lawrence C. Paulson},
1049 title = {A Fixedpoint Approach to (Co)inductive and
1050 (Co)datatype Definitions},
1052 crossref = {milner-fest}}
1055 title = {Proof, Language, and Interaction:
1056 Essays in Honor of {Robin Milner}},
1057 booktitle = {Proof, Language, and Interaction:
1058 Essays in Honor of {Robin Milner}},
1061 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1063 @InCollection{paulson-handbook,
1064 author = {Lawrence C. Paulson},
1065 title = {Designing a Theorem Prover},
1066 crossref = {handbk-lics2},
1069 @Book{paulson-isa-book,
1070 author = {Lawrence C. Paulson},
1071 title = {Isabelle: A Generic Theorem Prover},
1072 publisher = {Springer},
1076 @Book{isabelle-hol-book,
1077 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1078 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1079 publisher = {Springer},
1083 @InCollection{paulson-markt,
1084 author = {Lawrence C. Paulson},
1085 title = {Tool Support for Logics of Programs},
1086 booktitle = {Mathematical Methods in Program Development:
1087 Summer School Marktoberdorf 1996},
1088 publisher = {Springer},
1090 year = {Published 1997},
1091 editor = {Manfred Broy},
1092 series = {NATO ASI Series F}}
1094 %replaces Paulson-ML and paulson91
1096 author = {Lawrence C. Paulson},
1097 title = {{ML} for the Working Programmer},
1102 @article{paulson-natural,
1103 author = {Lawrence C. Paulson},
1104 title = {Natural Deduction as Higher-order Resolution},
1109 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1111 @Article{paulson-set-I,
1112 author = {Lawrence C. Paulson},
1113 title = {Set Theory for Verification: {I}. {From}
1114 Foundations to Functions},
1120 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1122 @Article{paulson-set-II,
1123 author = {Lawrence C. Paulson},
1124 title = {Set Theory for Verification: {II}. {Induction} and
1131 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1134 author = {Lawrence C. Paulson},
1135 title = {Verifying the Unification Algorithm in {LCF}},
1141 %replaces Paulson-LCF
1143 author = {Lawrence C. Paulson},
1144 title = {Logic and Computation: Interactive proof with Cambridge
1149 @incollection{paulson700,
1150 author = {Lawrence C. Paulson},
1151 title = {{Isabelle}: The Next 700 Theorem Provers},
1152 crossref = {odifreddi90},
1154 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1156 % replaces paulson-ns and paulson-security
1157 @Article{paulson-jcs,
1158 author = {Lawrence C. Paulson},
1159 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1165 @Article{paulson-tls,
1166 author = {Lawrence C. Paulson},
1167 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1175 @Article{paulson-yahalom,
1176 author = {Lawrence C. Paulson},
1177 title = {Relations Between Secrets:
1178 Two Formal Analyses of the {Yahalom} Protocol},
1185 @article{pelletier86,
1186 author = {F. J. Pelletier},
1187 title = {Seventy-five Problems for Testing Automatic Theorem
1193 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1196 author = {Andrew M. Pitts},
1197 title = {A Co-induction Principle for Recursively Defined Domains},
1203 @Article{plaisted90,
1204 author = {David A. Plaisted},
1205 title = {A Sequent-Style Model Elimination Strategy and a Positive
1216 author = {Art Quaife},
1217 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1227 @TechReport{rasmussen95,
1228 author = {Ole Rasmussen},
1229 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1231 institution = {Computer Laboratory, University of Cambridge},
1235 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1238 author = {Steve Reeves and Michael Clarke},
1239 title = {Logic for Computer Science},
1240 publisher = {Addison-Wesley},
1243 @book{Rosen-DMA,author={Kenneth H. Rosen},
1244 title={Discrete Mathematics and Its Applications},
1245 publisher={McGraw-Hill},year=1998}
1247 @InProceedings{Rudnicki:1992:MizarOverview,
1248 author = {P. Rudnicki},
1249 title = {An Overview of the {MIZAR} Project},
1250 booktitle = {1992 Workshop on Types for Proofs and Programs},
1252 organization = {Chalmers University of Technology},
1253 publisher = {Bastad}
1258 @inproceedings{saaltink-fme,
1259 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1260 Dan Craigen and Irwin Meisels},
1261 title = {An {EVES} Data Abstraction Example},
1265 @Article{Schroeder-Heister:1984,
1266 author = {Peter Schroeder-Heister},
1267 title = {A Natural Extension of Natural Deduction},
1268 journal = {Journal of Symbolic Logic},
1274 @misc{sledgehammer-2009,
1275 key = "Sledgehammer",
1276 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1277 Write Your {I}s\-a\-belle Scripts",
1278 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1280 @inproceedings{slind-tfl,
1281 author = {Konrad Slind},
1282 title = {Function Definition in Higher Order Logic},
1283 crossref = {tphols96},
1287 author = {Patrick Suppes},
1288 title = {Axiomatic Set Theory},
1290 publisher = {Dover}}
1292 @InCollection{szasz93,
1293 author = {Nora Szasz},
1294 title = {A Machine Checked Proof that {Ackermann's} Function is not
1295 Primitive Recursive},
1296 crossref = {huet-plotkin93},
1299 @TechReport{Syme:1997:DECLARE,
1301 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1302 institution = {University of Cambridge Computer Laboratory},
1307 @PhdThesis{Syme:1998:thesis,
1309 title = {Declarative Theorem Proving for Operational Semantics},
1310 school = {University of Cambridge},
1315 @InProceedings{Syme:1999:TPHOL,
1317 title = {Three Tactic Theorem Proving},
1318 crossref = {tphols99}}
1323 author = {G. Takeuti},
1324 title = {Proof Theory},
1330 author = {Simon Thompson},
1331 title = {Type Theory and Functional Programming},
1332 publisher = {Addison-Wesley},
1335 @book{Thompson-Haskell,author={Simon Thompson},
1336 title={Haskell: The Craft of Functional Programming},
1337 publisher={Addison-Wesley},year=1999}
1340 author = "Emina Torlak",
1341 title = {Kodkod: Constraint Solver for Relational Logic},
1342 note = "\url{http://alloy.mit.edu/kodkod/}"}
1344 @misc{kodkod-2009-options,
1345 author = "Emina Torlak",
1346 title = "Kodkod {API}: Class {Options}",
1347 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1349 @inproceedings{torlak-jackson-2007,
1350 title = "Kodkod: A Relational Model Finder",
1351 author = "Emina Torlak and Daniel Jackson",
1352 editor = "Orna Grumberg and Michael Huth",
1353 booktitle = "TACAS 2007",
1358 publisher = Springer}
1360 @Unpublished{Trybulec:1993:MizarFeatures,
1361 author = {A. Trybulec},
1362 title = {Some Features of the {Mizar} Language},
1363 note = {Presented at a workshop in Turin, Italy},
1369 @Unpublished{voelker94,
1370 author = {Norbert V{\"o}lker},
1371 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1372 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1378 @inproceedings{wadler89how,
1379 author = {P. Wadler and S. Blott},
1380 title = {How to make ad-hoc polymorphism less ad-hoc},
1381 booktitle = {ACM Symp.\ Principles of Programming Languages},
1385 @phdthesis{weber-2008,
1386 author = "Tjark Weber",
1387 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1388 school = {Dept.\ of Informatics, T.U. M\"unchen},
1389 type = "{Ph.D.}\ thesis",
1393 author = {Christoph Wedler},
1394 title = {Emacs package ``{X-Symbol}''},
1395 note = {\url{http://x-symbol.sourceforge.net}}
1398 @manual{isabelle-sys,
1399 author = {Markus Wenzel and Stefan Berghofer},
1400 title = {The {Isabelle} System Manual},
1401 institution = {TU Munich},
1402 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1404 @manual{isabelle-isar-ref,
1405 author = {Makarius Wenzel},
1406 title = {The {Isabelle/Isar} Reference Manual},
1407 institution = {TU Munich},
1408 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1410 @manual{isabelle-implementation,
1411 author = {Makarius Wenzel},
1412 title = {The {Isabelle/Isar} Implementation},
1413 institution = {TU Munich},
1414 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1416 @InProceedings{Wenzel:1999:TPHOL,
1417 author = {Markus Wenzel},
1418 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1419 crossref = {tphols99}}
1421 @InProceedings{Wenzel:1997:TPHOL,
1422 author = {Markus Wenzel},
1423 title = {Type Classes and Overloading in Higher-Order Logic},
1424 crossref = {tphols97}}
1426 @phdthesis{Wenzel-PhD,
1427 author={Markus Wenzel},
1428 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1429 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1431 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1433 @Article{Wenzel-Wiedijk:2002,
1434 author = {Freek Wiedijk and Markus Wenzel},
1435 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1436 journal = {Journal of Automated Reasoning},
1442 @InCollection{Wenzel-Paulson:2006,
1443 author = {Markus Wenzel and Lawrence C. Paulson},
1444 title = {{Isabelle/Isar}},
1445 booktitle = {The Seventeen Provers of the World},
1447 editor = {F. Wiedijk},
1448 series = {LNAI 3600}
1451 @InCollection{Wenzel:2006:Festschrift,
1452 author = {Makarius Wenzel},
1453 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1454 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1455 publisher = {University of Bia{\l}ystok},
1457 editor = {R. Matuszewski and A. Zalewska},
1459 series = {Studies in Logic, Grammar, and Rhetoric},
1460 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1464 author = {A. N. Whitehead and B. Russell},
1465 title = {Principia Mathematica},
1468 note = {Paperback edition to *56,
1469 abridged from the 2nd edition (1927)}}
1471 @Misc{Wiedijk:1999:Mizar,
1472 author = {Freek Wiedijk},
1473 title = {Mizar: An Impression},
1474 howpublished = {Unpublished paper},
1476 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1479 @Misc{Wiedijk:2000:MV,
1480 author = {Freek Wiedijk},
1481 title = {The Mathematical Vernacular},
1482 howpublished = {Unpublished paper},
1484 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1488 author = {Glynn Winskel},
1489 title = {The Formal Semantics of Programming Languages},
1490 publisher = MIT,year=1993}
1492 @InCollection{wos-bledsoe,
1493 author = {Larry Wos},
1494 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1495 crossref = {bledsoe-fest},
1498 @InProceedings{Zammit:1999:TPHOL,
1499 author = {Vincent Zammit},
1500 title = {On the Implementation of an Extensible Declarative Proof Language},
1501 crossref = {tphols99}}
1509 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1510 title = {Handbook of Logic in Computer Science},
1511 booktitle = {Handbook of Logic in Computer Science},
1512 publisher = {Oxford University Press},
1517 editor = {Henk Barendregt and Tobias Nipkow},
1518 title = TYPES # {: International Workshop {TYPES '93}},
1519 booktitle = TYPES # {: International Workshop {TYPES '93}},
1520 year = {published 1994},
1521 publisher = {Springer},
1522 series = {LNCS 806}}
1524 @book{barwise-handbk,
1525 editor = {J. Barwise},
1526 title = {Handbook of Mathematical Logic},
1527 booktitle = {Handbook of Mathematical Logic},
1531 @Proceedings{tlca93,
1532 title = {Typed Lambda Calculi and Applications},
1533 booktitle = {Typed Lambda Calculi and Applications},
1534 editor = {M. Bezem and J.F. Groote},
1536 publisher = {Springer},
1537 series = {LNCS 664}}
1540 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1541 title = {Current Trends in Hardware Verification and Automated
1543 booktitle = {Current Trends in Hardware Verification and Automated
1545 publisher = {Springer},
1549 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1550 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1551 publisher = {Kluwer Academic Publishers},
1553 editor = {Robert S. Boyer}}
1555 @Proceedings{cade12,
1556 editor = {Alan Bundy},
1557 title = {Automated Deduction --- {CADE}-12
1558 International Conference},
1559 booktitle = {Automated Deduction --- {CADE}-12
1560 International Conference},
1562 series = {LNAI 814},
1563 publisher = {Springer}}
1566 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1567 title = TYPES # {: International Workshop {TYPES '94}},
1568 booktitle = TYPES # {: International Workshop {TYPES '94}},
1570 publisher = {Springer},
1571 series = {LNCS 996}}
1573 @book{huet-plotkin91,
1574 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1575 title = {Logical Frameworks},
1576 booktitle = {Logical Frameworks},
1580 @book{huet-plotkin93,
1581 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1582 title = {Logical Environments},
1583 booktitle = {Logical Environments},
1588 editor = {J. Joyce and C. Seger},
1589 title = {Higher Order Logic Theorem Proving and Its
1590 Applications: HUG '93},
1591 booktitle = {Higher Order Logic Theorem Proving and Its
1592 Applications: HUG '93},
1593 year = {Published 1994},
1594 publisher = {Springer},
1595 series = {LNCS 780}}
1597 @proceedings{colog88,
1598 editor = {P. Martin-L{\"o}f and G. Mints},
1599 title = {COLOG-88: International Conference on Computer Logic},
1600 booktitle = {COLOG-88: International Conference on Computer Logic},
1601 year = {Published 1990},
1602 publisher = {Springer},
1603 organization = {Estonian Academy of Sciences},
1604 address = {Tallinn},
1605 series = {LNCS 417}}
1608 editor = {P. Odifreddi},
1609 title = {Logic and Computer Science},
1610 booktitle = {Logic and Computer Science},
1611 publisher = {Academic Press},
1614 @proceedings{extensions91,
1615 editor = {Peter Schroeder-Heister},
1616 title = {Extensions of Logic Programming},
1617 booktitle = {Extensions of Logic Programming},
1619 series = {LNAI 475},
1620 publisher = {Springer}}
1622 @proceedings{cade10,
1623 editor = {Mark E. Stickel},
1624 title = {10th } # CADE,
1625 booktitle = {10th } # CADE,
1627 publisher = {Springer},
1628 series = {LNAI 449}}
1631 editor = {M. Vardi},
1632 title = {Eighth Annual Symposium on Logic in Computer Science},
1633 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1638 title = {Automated Reasoning and its Applications:
1639 Essays in Honor of {Larry Wos}},
1640 booktitle = {Automated Reasoning and its Applications:
1641 Essays in Honor of {Larry Wos}},
1644 editor = {Robert Veroff}}
1647 editor = {J. C. P. Woodcock and P. G. Larsen},
1648 title = {FME '93: Industrial-Strength Formal Methods},
1649 booktitle = {FME '93: Industrial-Strength Formal Methods},
1651 publisher = Springer,
1655 @Proceedings{tphols96,
1656 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1657 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1658 editor = {J. von Wright and J. Grundy and J. Harrison},
1659 publisher = Springer,
1664 @Proceedings{tphols97,
1665 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1666 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1667 editor = {Elsa L. Gunter and Amy Felty},
1668 publisher = Springer,
1673 @Proceedings{tphols98,
1674 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1675 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1676 editor = {Jim Grundy and Malcom Newey},
1677 publisher = Springer,
1682 @Proceedings{tphols99,
1683 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1684 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1685 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1686 Paulin, C. and Thery, L.},
1687 publisher = Springer,
1692 @Proceedings{tphols2000,
1693 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1694 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1695 editor = {J. Harrison and M. Aagaard},
1696 publisher = Springer,
1701 @Proceedings{tphols2001,
1702 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1703 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1704 editor = {R. J. Boulton and P. B. Jackson},
1705 publisher = Springer,
1710 @Proceedings{ijcar2006,
1711 title = {Automated Reasoning: {IJCAR} 2006},
1712 booktitle = {Automated Reasoning: {IJCAR} 2006},
1713 editor = {U. Furbach and N. Shankar},
1714 publisher = Springer,
1719 @Proceedings{tphols2007,
1720 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1721 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1722 editor = {K. Schneider and J. Brandt},
1723 publisher = Springer,
1728 @Proceedings{tphols2008,
1729 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1730 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1731 publisher = Springer,
1737 @unpublished{classes_modules,
1738 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1739 author = {Stefan Wehr et. al.}
1742 @misc{wikipedia-2009-aa-trees,
1744 title = "Wikipedia: {AA} Tree",
1745 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}