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},
77 author = "Peter Andrews",
78 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
81 series = "Computer Science and Applied Mathematics",
84 @InProceedings{Aspinall:2000:eProof,
85 author = {David Aspinall},
86 title = {Protocols for Interactive {e-Proof}},
87 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
89 note = {Unpublished work-in-progress paper,
90 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
93 @InProceedings{Aspinall:TACAS:2000,
94 author = {David Aspinall},
95 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
96 booktitle = {Tools and Algorithms for the Construction and Analysis of
106 author = {David Aspinall},
107 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
108 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
112 author = {David Aspinall},
113 title = {{P}roof {G}eneral},
114 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
119 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
120 title="Term Rewriting and All That",publisher=CUP,year=1998}
122 @InCollection{Barendregt-Geuvers:2001,
123 author = {H. Barendregt and H. Geuvers},
124 title = {Proof Assistants using Dependent Type Systems},
125 booktitle = {Handbook of Automated Reasoning},
126 publisher = {Elsevier},
128 editor = {A. Robinson and A. Voronkov}
131 @incollection{basin91,
132 author = {David Basin and Matt Kaufmann},
133 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
135 crossref = {huet-plotkin91},
138 @Unpublished{HOL-Library,
139 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
140 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
142 title = {The Supplemental {Isabelle/HOL} Library},
143 note = {Part of the Isabelle distribution,
144 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
148 @InProceedings{Bauer-Wenzel:2000:HB,
149 author = {Gertrud Bauer and Markus Wenzel},
150 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
152 booktitle = {Types for Proofs and Programs: TYPES'99},
153 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
159 @InProceedings{Bauer-Wenzel:2001,
160 author = {Gertrud Bauer and Markus Wenzel},
161 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
162 crossref = {tphols2001}}
164 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
165 crossref = "tphols2000",
166 title = "Proof terms for simply typed higher order logic",
167 author = "Stefan Berghofer and Tobias Nipkow",
170 @InProceedings{Berghofer-Nipkow:2002,
171 author = {Stefan Berghofer and Tobias Nipkow},
172 title = {Executing Higher Order Logic},
173 booktitle = {Types for Proofs and Programs: TYPES'2000},
174 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
176 publisher = Springer,
180 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
181 author = {Stefan Berghofer and Markus Wenzel},
182 title = {Inductive datatypes in {HOL} --- lessons learned in
183 {F}ormal-{L}ogic {E}ngineering},
184 crossref = {tphols99}}
186 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
187 title="Introduction to Functional Programming",publisher=PH,year=1988}
189 @book{Bird-Haskell,author="Richard Bird",
190 title="Introduction to Functional Programming using Haskell",
191 publisher=PH,year=1998}
194 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
195 Overbeek and Mark Stickel and Lawrence Wos},
196 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
205 author = {Robert S. Boyer and J Strother Moore},
206 title = {A Computational Logic},
207 publisher = {Academic Press},
211 author = {Robert S. Boyer and J Strother Moore},
212 title = {A Computational Logic Handbook},
213 publisher = {Academic Press},
217 author = {N. G. de Bruijn},
218 title = {Lambda Calculus Notation with Nameless Dummies,
219 a Tool for Automatic Formula Manipulation,
220 with Application to the {Church-Rosser Theorem}},
221 journal = {Indag. Math.},
226 @InProceedings{bulwahnKN07,
227 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
228 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
229 crossref = {tphols2007},
233 @InProceedings{bulwahn-et-al:2008:imperative,
234 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
235 title = {Imperative Functional Programming with {Isabelle/HOL}},
236 crossref = {tphols2008},
241 author = {M. Burrows and M. Abadi and R. M. Needham},
242 title = {A Logic of Authentication},
250 @TechReport{camilleri92,
251 author = {J. Camilleri and T. F. Melham},
252 title = {Reasoning with Inductively Defined Relations in the
253 {HOL} Theorem Prover},
260 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
261 title = {Artificial Intelligence Programming},
262 publisher = {Lawrence Erlbaum Associates},
266 author = "Alonzo Church",
267 title = "A Formulation of the Simple Theory of Types",
273 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
274 title="Model Checking",publisher=MIT,year=1999}
277 author = {Martin D. Coen},
278 title = {Interactive Program Derivation},
279 school = {University of Cambridge},
280 note = {Computer Laboratory Technical Report 272},
285 author = {R. L. Constable and others},
286 title = {Implementing Mathematics with the Nuprl Proof
288 publisher = Prentice,
293 @Book{davey-priestley,
294 author = {B. A. Davey and H. A. Priestley},
295 title = {Introduction to Lattices and Order},
300 author = {Keith J. Devlin},
301 title = {Fundamentals of Contemporary Set Theory},
302 publisher = {Springer},
306 author = {Michael Dummett},
307 title = {Elements of Intuitionism},
309 publisher = {Oxford University Press}}
311 @incollection{dybjer91,
312 author = {Peter Dybjer},
313 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
314 Theory and Their Set-Theoretic Semantics},
315 crossref = {huet-plotkin91},
319 author = {Roy Dyckhoff},
320 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
330 author = {William M. Farmer and Joshua D. Guttman and F. Javier
332 title = {{IMPS}: An Interactive Mathematical Proof System},
339 @InProceedings{felty91a,
340 Author = {Amy Felty},
341 Title = {A Logic Program for Transforming Sequent Proofs to Natural
343 crossref = {extensions91},
346 @Article{fleuriot-jcm,
347 author = {Jacques Fleuriot and Lawrence C. Paulson},
348 title = {Mechanizing Nonstandard Real Analysis},
349 journal = {LMS Journal of Computation and Mathematics},
353 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
357 author = {Jacob Frost},
358 title = {A Case Study of Co-induction in {Isabelle HOL}},
364 %revised version of frost93
366 author = {Jacob Frost},
367 title = {A Case Study of Co-induction in {Isabelle}},
374 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
376 title = {Principles of {OBJ2}},
384 author = {J. H. Gallier},
385 title = {Logic for Computer Science:
386 Foundations of Automatic Theorem Proving},
388 publisher = {Harper \& Row}}
391 author = {Antony Galton},
392 title = {Logic for Information Technology},
396 @Article{Gentzen:1935,
397 author = {G. Gentzen},
398 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
399 journal = {Math. Zeitschrift},
403 @InProceedings{gimenez-codifying,
404 author = {Eduardo Gim{\'e}nez},
405 title = {Codifying Guarded Definitions with Recursive Schemes},
406 crossref = {types94},
411 author = {Jean-Yves Girard},
412 title = {Proofs and Types},
415 note = {Translated by Yves LaFont and Paul Taylor}}
418 editor = {M. J. C. Gordon and T. F. Melham},
419 title = {Introduction to {HOL}: A Theorem Proving Environment for
425 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
427 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
429 publisher = {Springer},
432 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
433 title={Why we can't have {SML} style datatype declarations in {HOL}},
434 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
435 IFIP TC10/WG10.2 Intl. Workshop, 1992},
436 editor={L.J.M. Claesen and M.J.C. Gordon},
437 publisher=NH,year=1993,pages={561--568}}
439 @InProceedings{gunter-trees,
440 author = {Elsa L. Gunter},
441 title = {A Broader Class of Trees for Recursive Type Definitions for
448 @InProceedings{Haftmann-Wenzel:2006:classes,
449 author = {Florian Haftmann and Makarius Wenzel},
450 title = {Constructive Type Classes in {Isabelle}},
451 editor = {T. Altenkirch and C. McBride},
452 booktitle = {Types for Proofs and Programs, TYPES 2006},
453 publisher = {Springer},
459 @TechReport{Haftmann-Nipkow:2007:codegen,
460 author = {Florian Haftmann and Tobias Nipkow},
461 title = {A Code Generator Framework for {Isabelle/HOL}},
462 editor = {Klaus Schneider and Jens Brandt},
463 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
466 institution = {Department of Computer Science, University of Kaiserslautern},
470 @InProceedings{Haftmann-Wenzel:2009,
471 author = {Florian Haftmann and Makarius Wenzel},
472 title = {Local theory specifications in {Isabelle/Isar}},
473 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
474 booktitle = {Types for Proofs and Programs, TYPES 2008},
475 publisher = {Springer},
481 @manual{isabelle-classes,
482 author = {Florian Haftmann},
483 title = {Haskell-style type classes with {Isabelle}/{Isar}},
485 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
488 @manual{isabelle-codegen,
489 author = {Florian Haftmann},
490 title = {Code generation from Isabelle theories},
492 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
496 author = {Paul R. Halmos},
497 title = {Naive Set Theory},
498 publisher = {Van Nostrand},
501 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
502 title={Dynamic Logic},publisher=MIT,year=2000}
505 author = {Matthew Hennessy},
506 title = {The Semantics of Programming Languages: An Elementary
507 Introduction Using Structural Operational Semantics},
511 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
512 title={Introduction to Automata Theory, Languages, and Computation.},
513 publisher={Addison-Wesley},year=1979}
515 @Article{haskell-report,
516 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
517 title = {Report on the Programming Language {Haskell}: A
518 Non-strict, Purely Functional Language},
524 note = {Version 1.2}}
526 @Article{haskell-tutorial,
527 author = {Paul Hudak and Joseph H. Fasel},
528 title = {A Gentle Introduction to {Haskell}},
535 @book{Hudak-Haskell,author={Paul Hudak},
536 title={The Haskell School of Expression},publisher=CUP,year=2000}
539 author = {G. P. Huet},
540 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
547 author = {G. P. Huet and B. Lang},
548 title = {Proving and Applying Program Transformations Expressed with
549 Second-Order Patterns},
555 @inproceedings{huet88,
556 author = {G{\'e}rard Huet},
557 title = {Induction Principles Formalized in the {Calculus of
559 booktitle = {Programming of Future Generation Computers},
560 editor = {K. Fuchi and M. Nivat},
563 publisher = {Elsevier}}
565 @Book{Huth-Ryan-book,
566 author = {Michael Huth and Mark Ryan},
567 title = {Logic in Computer Science. Modelling and reasoning about systems},
571 @InProceedings{Harrison:1996:MizarHOL,
572 author = {J. Harrison},
573 title = {A {Mizar} Mode for {HOL}},
575 crossref = {tphols96}}
579 @article{haskell-revised-report,
580 author = {Simon {Peyton Jones} and others},
581 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
582 journal = {Journal of Functional Programming},
588 note = {\url{http://www.haskell.org/definition/}}}
592 @InProceedings{kammueller-locales,
593 author = {Florian Kamm{\"u}ller and Markus Wenzel and
594 Lawrence C. Paulson},
595 title = {Locales: A Sectioning Concept for {Isabelle}},
596 crossref = {tphols99}}
599 author={Donald E. Knuth},
600 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
601 publisher={Addison-Wesley},
605 author = {R. E. Korf},
606 title = {Depth-First Iterative-Deepening: an Optimal Admissible
613 @InProceedings{krauss2006,
614 author = {Alexander Krauss},
615 title = {Partial Recursive Functions in {Higher-Order Logic}},
616 crossref = {ijcar2006},
619 @manual{isabelle-function,
620 author = {Alexander Krauss},
621 title = {Defining Recursive Functions in {Isabelle/HOL}},
623 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
627 author = {Kenneth Kunen},
628 title = {Set Theory: An Introduction to Independence Proofs},
635 author = {Xavier Leroy and others},
636 title = {The Objective Caml system -- Documentation and user's manual},
637 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
639 @InProceedings{lowe-fdr,
640 author = {Gavin Lowe},
641 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
642 Protocol using {CSP} and {FDR}},
643 booktitle = {Tools and Algorithms for the Construction and Analysis
644 of Systems: second international workshop, TACAS '96},
645 editor = {T. Margaria and B. Steffen},
646 series = {LNCS 1055},
648 publisher = {Springer},
654 author = {Zohar Manna and Richard Waldinger},
655 title = {Deductive Synthesis of the Unification Algorithm},
662 @InProceedings{martin-nipkow,
663 author = {Ursula Martin and Tobias Nipkow},
664 title = {Ordered Rewriting and Confluence},
669 author = {Per Martin-L{\"o}f},
670 title = {Intuitionistic type theory},
672 publisher = {Bibliopolis}}
674 @incollection{melham89,
675 author = {Thomas F. Melham},
676 title = {Automating Recursive Type Definitions in Higher Order
679 crossref = {birtwistle89}}
681 @Article{Miller:1991,
682 author = {Dale Miller},
683 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
684 and Simple Unification},
685 journal = {Journal of Logic and Computation},
691 @Article{miller-mixed,
692 Author = {Dale Miller},
693 Title = {Unification Under a Mixed Prefix},
701 author = {Robin Milner},
702 title = {A Theory of Type Polymorphism in Programming},
703 journal = "J. Comp.\ Sys.\ Sci.",
708 @TechReport{milner-ind,
709 author = {Robin Milner},
710 title = {How to Derive Inductions in {LCF}},
711 institution = Edinburgh,
715 @Article{milner-coind,
716 author = {Robin Milner and Mads Tofte},
717 title = {Co-induction in Relational Semantics},
724 author = {Robin Milner},
725 title = {Communication and Concurrency},
726 publisher = Prentice,
729 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
730 title="The Definition of Standard ML",publisher=MIT,year=1990}
732 @PhdThesis{monahan84,
733 author = {Brian Q. Monahan},
734 title = {Data Type Proofs using Edinburgh {LCF}},
735 school = {University of Edinburgh},
738 @article{MuellerNvOS99,
740 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
741 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
743 @Manual{Muzalewski:Mizar,
744 title = {An Outline of {PC} {Mizar}},
745 author = {Micha{\l} Muzalewski},
746 organization = {Fondation of Logic, Mathematics and Informatics
747 --- Mizar Users Group},
749 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
754 @InProceedings{NaraschewskiW-TPHOLs98,
755 author = {Wolfgang Naraschewski and Markus Wenzel},
757 {Object-Oriented Verification based on Record Subtyping in
759 crossref = {tphols98}}
761 @inproceedings{nazareth-nipkow,
762 author = {Dieter Nazareth and Tobias Nipkow},
763 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
764 crossref = {tphols96},
768 @Article{needham-schroeder,
769 author = "Roger M. Needham and Michael D. Schroeder",
770 title = "Using Encryption for Authentication in Large Networks
779 @inproceedings{nipkow-W,
780 author = {Wolfgang Naraschewski and Tobias Nipkow},
781 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
782 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
783 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
784 publisher = Springer,
790 @InCollection{nipkow-sorts93,
791 author = {T. Nipkow},
792 title = {Order-Sorted Polymorphism in {Isabelle}},
793 booktitle = {Logical Environments},
796 editor = {G. Huet and G. Plotkin},
800 @Misc{nipkow-types93,
801 author = {Tobias Nipkow},
802 title = {Axiomatic Type Classes (in {I}sabelle)},
803 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
807 @inproceedings{Nipkow-CR,
808 author = {Tobias Nipkow},
809 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
810 booktitle = {Automated Deduction --- CADE-13},
811 editor = {M. McRobbie and J.K. Slaney},
812 publisher = Springer,
819 @InProceedings{nipkow-patterns,
820 title = {Functional Unification of Higher-Order Patterns},
821 author = {Tobias Nipkow},
824 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
825 keywords = {unification}}
828 author = {Tobias Nipkow},
829 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
835 @inproceedings{Nipkow-TYPES02,
836 author = {Tobias Nipkow},
837 title = {{Structured Proofs in Isar/HOL}},
838 booktitle = {Types for Proofs and Programs (TYPES 2002)},
839 editor = {H. Geuvers and F. Wiedijk},
841 publisher = Springer,
846 @manual{isabelle-HOL,
847 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
848 title = {{Isabelle}'s Logics: {HOL}},
849 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
850 M{\"u}nchen and Computer Laboratory, University of Cambridge},
851 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
853 @article{nipkow-prehofer,
854 author = {Tobias Nipkow and Christian Prehofer},
855 title = {Type Reconstruction for Type Classes},
862 @InProceedings{Nipkow-Prehofer:1993,
863 author = {T. Nipkow and C. Prehofer},
864 title = {Type checking type classes},
865 booktitle = {ACM Symp.\ Principles of Programming Languages},
870 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
871 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
872 publisher = {Springer},
874 note = {LNCS Tutorial 2283}}
877 author = {Philippe No{\"e}l},
878 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
886 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
887 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
889 publisher = {Oxford University Press},
894 @Manual{pvs-language,
895 title = {The {PVS} specification language},
896 author = {S. Owre and N. Shankar and J. M. Rushby},
897 organization = {Computer Science Laboratory, SRI International},
898 address = {Menlo Park, CA},
899 note = {Beta release},
902 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
907 @InProceedings{paulin-tlca,
908 author = {Christine Paulin-Mohring},
909 title = {Inductive Definitions in the System {Coq}: Rules and
914 @InProceedings{paulson-CADE,
915 author = {Lawrence C. Paulson},
916 title = {A Fixedpoint Approach to Implementing (Co)Inductive
921 @InProceedings{paulson-COLOG,
922 author = {Lawrence C. Paulson},
923 title = {A Formulation of the Simple Theory of Types (for
926 crossref = {colog88},
927 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
929 @Article{paulson-coind,
930 author = {Lawrence C. Paulson},
931 title = {Mechanizing Coinduction and Corecursion in Higher-Order
940 @manual{isabelle-intro,
941 author = {Lawrence C. Paulson},
942 title = {Introduction to {Isabelle}},
944 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
946 @manual{isabelle-logics,
947 author = {Lawrence C. Paulson},
948 title = {{Isabelle's} Logics},
950 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
952 @manual{isabelle-ref,
953 author = {Lawrence C. Paulson},
954 title = {The {Isabelle} Reference Manual},
956 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
959 author = {Lawrence C. Paulson},
960 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
962 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
964 @article{paulson-found,
965 author = {Lawrence C. Paulson},
966 title = {The Foundation of a Generic Theorem Prover},
972 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
974 %replaces paulson-final
975 @Article{paulson-mscs,
976 author = {Lawrence C. Paulson},
977 title = {Final Coalgebras as Greatest Fixed Points
979 journal = {Mathematical Structures in Computer Science},
985 @InCollection{paulson-generic,
986 author = {Lawrence C. Paulson},
987 title = {Generic Automatic Proof Tools},
988 crossref = {wos-fest},
992 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
993 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1002 @InCollection{paulson-fixedpt-milner,
1003 author = {Lawrence C. Paulson},
1004 title = {A Fixedpoint Approach to (Co)inductive and
1005 (Co)datatype Definitions},
1007 crossref = {milner-fest}}
1010 title = {Proof, Language, and Interaction:
1011 Essays in Honor of {Robin Milner}},
1012 booktitle = {Proof, Language, and Interaction:
1013 Essays in Honor of {Robin Milner}},
1014 publisher = {MIT Press},
1016 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1018 @InCollection{paulson-handbook,
1019 author = {Lawrence C. Paulson},
1020 title = {Designing a Theorem Prover},
1021 crossref = {handbk-lics2},
1024 @Book{paulson-isa-book,
1025 author = {Lawrence C. Paulson},
1026 title = {Isabelle: A Generic Theorem Prover},
1027 publisher = {Springer},
1031 @Book{isabelle-hol-book,
1032 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1033 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1034 publisher = {Springer},
1038 @InCollection{paulson-markt,
1039 author = {Lawrence C. Paulson},
1040 title = {Tool Support for Logics of Programs},
1041 booktitle = {Mathematical Methods in Program Development:
1042 Summer School Marktoberdorf 1996},
1043 publisher = {Springer},
1045 year = {Published 1997},
1046 editor = {Manfred Broy},
1047 series = {NATO ASI Series F}}
1049 %replaces Paulson-ML and paulson91
1051 author = {Lawrence C. Paulson},
1052 title = {{ML} for the Working Programmer},
1057 @article{paulson-natural,
1058 author = {Lawrence C. Paulson},
1059 title = {Natural Deduction as Higher-order Resolution},
1064 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1066 @Article{paulson-set-I,
1067 author = {Lawrence C. Paulson},
1068 title = {Set Theory for Verification: {I}. {From}
1069 Foundations to Functions},
1075 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1077 @Article{paulson-set-II,
1078 author = {Lawrence C. Paulson},
1079 title = {Set Theory for Verification: {II}. {Induction} and
1086 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1089 author = {Lawrence C. Paulson},
1090 title = {Verifying the Unification Algorithm in {LCF}},
1096 %replaces Paulson-LCF
1098 author = {Lawrence C. Paulson},
1099 title = {Logic and Computation: Interactive proof with Cambridge
1104 @incollection{paulson700,
1105 author = {Lawrence C. Paulson},
1106 title = {{Isabelle}: The Next 700 Theorem Provers},
1107 crossref = {odifreddi90},
1109 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1111 % replaces paulson-ns and paulson-security
1112 @Article{paulson-jcs,
1113 author = {Lawrence C. Paulson},
1114 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1120 @Article{paulson-tls,
1121 author = {Lawrence C. Paulson},
1122 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1130 @Article{paulson-yahalom,
1131 author = {Lawrence C. Paulson},
1132 title = {Relations Between Secrets:
1133 Two Formal Analyses of the {Yahalom} Protocol},
1140 @article{pelletier86,
1141 author = {F. J. Pelletier},
1142 title = {Seventy-five Problems for Testing Automatic Theorem
1148 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1151 author = {Andrew M. Pitts},
1152 title = {A Co-induction Principle for Recursively Defined Domains},
1158 @Article{plaisted90,
1159 author = {David A. Plaisted},
1160 title = {A Sequent-Style Model Elimination Strategy and a Positive
1171 author = {Art Quaife},
1172 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1182 @TechReport{rasmussen95,
1183 author = {Ole Rasmussen},
1184 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1186 institution = {Computer Laboratory, University of Cambridge},
1190 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1193 author = {Steve Reeves and Michael Clarke},
1194 title = {Logic for Computer Science},
1195 publisher = {Addison-Wesley},
1198 @book{Rosen-DMA,author={Kenneth H. Rosen},
1199 title={Discrete Mathematics and Its Applications},
1200 publisher={McGraw-Hill},year=1998}
1202 @InProceedings{Rudnicki:1992:MizarOverview,
1203 author = {P. Rudnicki},
1204 title = {An Overview of the {MIZAR} Project},
1205 booktitle = {1992 Workshop on Types for Proofs and Programs},
1207 organization = {Chalmers University of Technology},
1208 publisher = {Bastad}
1213 @inproceedings{saaltink-fme,
1214 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1215 Dan Craigen and Irwin Meisels},
1216 title = {An {EVES} Data Abstraction Example},
1220 @Article{Schroeder-Heister:1984,
1221 author = {Peter Schroeder-Heister},
1222 title = {A Natural Extension of Natural Deduction},
1223 journal = {Journal of Symbolic Logic},
1229 @inproceedings{slind-tfl,
1230 author = {Konrad Slind},
1231 title = {Function Definition in Higher Order Logic},
1232 crossref = {tphols96},
1236 author = {Patrick Suppes},
1237 title = {Axiomatic Set Theory},
1239 publisher = {Dover}}
1241 @InCollection{szasz93,
1242 author = {Nora Szasz},
1243 title = {A Machine Checked Proof that {Ackermann's} Function is not
1244 Primitive Recursive},
1245 crossref = {huet-plotkin93},
1248 @TechReport{Syme:1997:DECLARE,
1250 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1251 institution = {University of Cambridge Computer Laboratory},
1256 @PhdThesis{Syme:1998:thesis,
1258 title = {Declarative Theorem Proving for Operational Semantics},
1259 school = {University of Cambridge},
1264 @InProceedings{Syme:1999:TPHOL,
1266 title = {Three Tactic Theorem Proving},
1267 crossref = {tphols99}}
1272 author = {G. Takeuti},
1273 title = {Proof Theory},
1279 author = {Simon Thompson},
1280 title = {Type Theory and Functional Programming},
1281 publisher = {Addison-Wesley},
1284 @book{Thompson-Haskell,author={Simon Thompson},
1285 title={Haskell: The Craft of Functional Programming},
1286 publisher={Addison-Wesley},year=1999}
1288 @Unpublished{Trybulec:1993:MizarFeatures,
1289 author = {A. Trybulec},
1290 title = {Some Features of the {Mizar} Language},
1291 note = {Presented at a workshop in Turin, Italy},
1297 @Unpublished{voelker94,
1298 author = {Norbert V{\"o}lker},
1299 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1300 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1306 @inproceedings{wadler89how,
1307 author = {P. Wadler and S. Blott},
1308 title = {How to make ad-hoc polymorphism less ad-hoc},
1309 booktitle = {ACM Symp.\ Principles of Programming Languages},
1314 author = {Christoph Wedler},
1315 title = {Emacs package ``{X-Symbol}''},
1316 note = {\url{http://x-symbol.sourceforge.net}}
1319 @manual{isabelle-sys,
1320 author = {Markus Wenzel and Stefan Berghofer},
1321 title = {The {Isabelle} System Manual},
1322 institution = {TU Munich},
1323 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1325 @manual{isabelle-isar-ref,
1326 author = {Makarius Wenzel},
1327 title = {The {Isabelle/Isar} Reference Manual},
1328 institution = {TU Munich},
1329 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1331 @manual{isabelle-implementation,
1332 author = {Makarius Wenzel},
1333 title = {The {Isabelle/Isar} Implementation},
1334 institution = {TU Munich},
1335 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1337 @manual{isabelle-axclass,
1338 author = {Markus Wenzel},
1339 title = {Using Axiomatic Type Classes in {I}sabelle},
1340 institution = {TU Munich},
1342 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1345 @InProceedings{Wenzel:1999:TPHOL,
1346 author = {Markus Wenzel},
1347 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1348 crossref = {tphols99}}
1350 @InProceedings{Wenzel:1997:TPHOL,
1351 author = {Markus Wenzel},
1352 title = {Type Classes and Overloading in Higher-Order Logic},
1353 crossref = {tphols97}}
1355 @phdthesis{Wenzel-PhD,
1356 author={Markus Wenzel},
1357 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1358 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1360 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1362 @Article{Wenzel-Wiedijk:2002,
1363 author = {Freek Wiedijk and Markus Wenzel},
1364 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1365 journal = {Journal of Automated Reasoning},
1371 @InCollection{Wenzel-Paulson:2006,
1372 author = {Markus Wenzel and Lawrence C. Paulson},
1373 title = {{Isabelle/Isar}},
1374 booktitle = {The Seventeen Provers of the World},
1376 editor = {F. Wiedijk},
1377 series = {LNAI 3600}
1380 @InCollection{Wenzel:2006:Festschrift,
1381 author = {Makarius Wenzel},
1382 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1383 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1384 publisher = {University of Bia{\l}ystok},
1386 editor = {R. Matuszewski and A. Zalewska},
1388 series = {Studies in Logic, Grammar, and Rhetoric},
1389 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1393 author = {A. N. Whitehead and B. Russell},
1394 title = {Principia Mathematica},
1397 note = {Paperback edition to *56,
1398 abridged from the 2nd edition (1927)}}
1400 @Misc{Wiedijk:1999:Mizar,
1401 author = {Freek Wiedijk},
1402 title = {Mizar: An Impression},
1403 howpublished = {Unpublished paper},
1405 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1408 @Misc{Wiedijk:2000:MV,
1409 author = {Freek Wiedijk},
1410 title = {The Mathematical Vernacular},
1411 howpublished = {Unpublished paper},
1413 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1417 author = {Glynn Winskel},
1418 title = {The Formal Semantics of Programming Languages},
1419 publisher = MIT,year=1993}
1421 @InCollection{wos-bledsoe,
1422 author = {Larry Wos},
1423 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1424 crossref = {bledsoe-fest},
1427 @InProceedings{Zammit:1999:TPHOL,
1428 author = {Vincent Zammit},
1429 title = {On the Implementation of an Extensible Declarative Proof Language},
1430 crossref = {tphols99}}
1438 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1439 title = {Handbook of Logic in Computer Science},
1440 booktitle = {Handbook of Logic in Computer Science},
1441 publisher = {Oxford University Press},
1446 editor = {Henk Barendregt and Tobias Nipkow},
1447 title = TYPES # {: International Workshop {TYPES '93}},
1448 booktitle = TYPES # {: International Workshop {TYPES '93}},
1449 year = {published 1994},
1450 publisher = {Springer},
1451 series = {LNCS 806}}
1453 @book{barwise-handbk,
1454 editor = {J. Barwise},
1455 title = {Handbook of Mathematical Logic},
1456 booktitle = {Handbook of Mathematical Logic},
1460 @Proceedings{tlca93,
1461 title = {Typed Lambda Calculi and Applications},
1462 booktitle = {Typed Lambda Calculi and Applications},
1463 editor = {M. Bezem and J.F. Groote},
1465 publisher = {Springer},
1466 series = {LNCS 664}}
1469 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1470 title = {Current Trends in Hardware Verification and Automated
1472 booktitle = {Current Trends in Hardware Verification and Automated
1474 publisher = {Springer},
1478 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1479 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1480 publisher = {Kluwer Academic Publishers},
1482 editor = {Robert S. Boyer}}
1484 @Proceedings{cade12,
1485 editor = {Alan Bundy},
1486 title = {Automated Deduction --- {CADE}-12
1487 International Conference},
1488 booktitle = {Automated Deduction --- {CADE}-12
1489 International Conference},
1491 series = {LNAI 814},
1492 publisher = {Springer}}
1495 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1496 title = TYPES # {: International Workshop {TYPES '94}},
1497 booktitle = TYPES # {: International Workshop {TYPES '94}},
1499 publisher = {Springer},
1500 series = {LNCS 996}}
1502 @book{huet-plotkin91,
1503 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1504 title = {Logical Frameworks},
1505 booktitle = {Logical Frameworks},
1509 @book{huet-plotkin93,
1510 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1511 title = {Logical Environments},
1512 booktitle = {Logical Environments},
1517 editor = {J. Joyce and C. Seger},
1518 title = {Higher Order Logic Theorem Proving and Its
1519 Applications: HUG '93},
1520 booktitle = {Higher Order Logic Theorem Proving and Its
1521 Applications: HUG '93},
1522 year = {Published 1994},
1523 publisher = {Springer},
1524 series = {LNCS 780}}
1526 @proceedings{colog88,
1527 editor = {P. Martin-L{\"o}f and G. Mints},
1528 title = {COLOG-88: International Conference on Computer Logic},
1529 booktitle = {COLOG-88: International Conference on Computer Logic},
1530 year = {Published 1990},
1531 publisher = {Springer},
1532 organization = {Estonian Academy of Sciences},
1533 address = {Tallinn},
1534 series = {LNCS 417}}
1537 editor = {P. Odifreddi},
1538 title = {Logic and Computer Science},
1539 booktitle = {Logic and Computer Science},
1540 publisher = {Academic Press},
1543 @proceedings{extensions91,
1544 editor = {Peter Schroeder-Heister},
1545 title = {Extensions of Logic Programming},
1546 booktitle = {Extensions of Logic Programming},
1548 series = {LNAI 475},
1549 publisher = {Springer}}
1551 @proceedings{cade10,
1552 editor = {Mark E. Stickel},
1553 title = {10th } # CADE,
1554 booktitle = {10th } # CADE,
1556 publisher = {Springer},
1557 series = {LNAI 449}}
1560 editor = {M. Vardi},
1561 title = {Eighth Annual Symposium on Logic in Computer Science},
1562 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1567 title = {Automated Reasoning and its Applications:
1568 Essays in Honor of {Larry Wos}},
1569 booktitle = {Automated Reasoning and its Applications:
1570 Essays in Honor of {Larry Wos}},
1571 publisher = {MIT Press},
1573 editor = {Robert Veroff}}
1576 editor = {J. C. P. Woodcock and P. G. Larsen},
1577 title = {FME '93: Industrial-Strength Formal Methods},
1578 booktitle = {FME '93: Industrial-Strength Formal Methods},
1580 publisher = Springer,
1584 @Proceedings{tphols96,
1585 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1586 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1587 editor = {J. von Wright and J. Grundy and J. Harrison},
1588 publisher = Springer,
1593 @Proceedings{tphols97,
1594 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1595 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1596 editor = {Elsa L. Gunter and Amy Felty},
1597 publisher = Springer,
1602 @Proceedings{tphols98,
1603 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1604 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1605 editor = {Jim Grundy and Malcom Newey},
1606 publisher = Springer,
1611 @Proceedings{tphols99,
1612 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1613 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1614 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1615 Paulin, C. and Thery, L.},
1616 publisher = Springer,
1621 @Proceedings{tphols2000,
1622 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1623 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1624 editor = {J. Harrison and M. Aagaard},
1625 publisher = Springer,
1630 @Proceedings{tphols2001,
1631 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1632 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1633 editor = {R. J. Boulton and P. B. Jackson},
1634 publisher = Springer,
1639 @Proceedings{ijcar2006,
1640 title = {Automated Reasoning: {IJCAR} 2006},
1641 booktitle = {Automated Reasoning: {IJCAR} 2006},
1642 editor = {U. Furbach and N. Shankar},
1643 publisher = Springer,
1648 @Proceedings{tphols2007,
1649 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1650 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1651 editor = {K. Schneider and J. Brandt},
1652 publisher = Springer,
1657 @Proceedings{tphols2008,
1658 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1659 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1660 publisher = Springer,
1666 @unpublished{classes_modules,
1667 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1668 author = {Stefan Wehr et. al.}