Documented function package in IsarRef-manual.
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 booktitle = {TPHOLS 2007},
233 publisher = Springer,
237 author = {M. Burrows and M. Abadi and R. M. Needham},
238 title = {A Logic of Authentication},
246 @TechReport{camilleri92,
247 author = {J. Camilleri and T. F. Melham},
248 title = {Reasoning with Inductively Defined Relations in the
249 {HOL} Theorem Prover},
256 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
257 title = {Artificial Intelligence Programming},
258 publisher = {Lawrence Erlbaum Associates},
262 author = "Alonzo Church",
263 title = "A Formulation of the Simple Theory of Types",
269 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
270 title="Model Checking",publisher=MIT,year=1999}
273 author = {Martin D. Coen},
274 title = {Interactive Program Derivation},
275 school = {University of Cambridge},
276 note = {Computer Laboratory Technical Report 272},
281 author = {R. L. Constable and others},
282 title = {Implementing Mathematics with the Nuprl Proof
284 publisher = Prentice,
289 @Book{davey-priestley,
290 author = {B. A. Davey and H. A. Priestley},
291 title = {Introduction to Lattices and Order},
296 author = {Keith J. Devlin},
297 title = {Fundamentals of Contemporary Set Theory},
298 publisher = {Springer},
302 author = {Michael Dummett},
303 title = {Elements of Intuitionism},
305 publisher = {Oxford University Press}}
307 @incollection{dybjer91,
308 author = {Peter Dybjer},
309 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
310 Theory and Their Set-Theoretic Semantics},
311 crossref = {huet-plotkin91},
315 author = {Roy Dyckhoff},
316 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
326 author = {William M. Farmer and Joshua D. Guttman and F. Javier
328 title = {{IMPS}: An Interactive Mathematical Proof System},
335 @InProceedings{felty91a,
336 Author = {Amy Felty},
337 Title = {A Logic Program for Transforming Sequent Proofs to Natural
339 crossref = {extensions91},
342 @Article{fleuriot-jcm,
343 author = {Jacques Fleuriot and Lawrence C. Paulson},
344 title = {Mechanizing Nonstandard Real Analysis},
345 journal = {LMS Journal of Computation and Mathematics},
349 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
353 author = {Jacob Frost},
354 title = {A Case Study of Co-induction in {Isabelle HOL}},
360 %revised version of frost93
362 author = {Jacob Frost},
363 title = {A Case Study of Co-induction in {Isabelle}},
370 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
372 title = {Principles of {OBJ2}},
380 author = {J. H. Gallier},
381 title = {Logic for Computer Science:
382 Foundations of Automatic Theorem Proving},
384 publisher = {Harper \& Row}}
387 author = {Antony Galton},
388 title = {Logic for Information Technology},
392 @Article{Gentzen:1935,
393 author = {G. Gentzen},
394 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
395 journal = {Math. Zeitschrift},
399 @InProceedings{gimenez-codifying,
400 author = {Eduardo Gim{\'e}nez},
401 title = {Codifying Guarded Definitions with Recursive Schemes},
402 crossref = {types94},
407 author = {Jean-Yves Girard},
408 title = {Proofs and Types},
411 note = {Translated by Yves LaFont and Paul Taylor}}
414 editor = {M. J. C. Gordon and T. F. Melham},
415 title = {Introduction to {HOL}: A Theorem Proving Environment for
421 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
423 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
425 publisher = {Springer},
428 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
429 title={Why we can't have {SML} style datatype declarations in {HOL}},
430 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
431 IFIP TC10/WG10.2 Intl. Workshop, 1992},
432 editor={L.J.M. Claesen and M.J.C. Gordon},
433 publisher=NH,year=1993,pages={561--568}}
435 @InProceedings{gunter-trees,
436 author = {Elsa L. Gunter},
437 title = {A Broader Class of Trees for Recursive Type Definitions for
444 @InProceedings{Haftmann-Wenzel:2006:classes,
445 author = {Florian Haftmann and Makarius Wenzel},
446 title = {Constructive Type Classes in {Isabelle}},
448 note = {To appear; \url{http://www4.in.tum.de/~haftmann/pdf/constructive_type_classes_haftmann_wenzel.pdf}}
451 @TechReport{Haftmann-Nipkow:2007:codegen,
452 author = {Florian Haftmann and Tobias Nipkow},
453 title = {A Code Generator Framework for {Isabelle/HOL}},
455 note = {\url{http://www4.in.tum.de/~haftmann/pdf/codegen_isabelle_haftmann_nipkow_16pp.pdf}}
458 @manual{isabelle-classes,
459 author = {Florian Haftmann},
460 title = {Haskell-style type classes with {Isabelle}/{Isar}},
462 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
465 @manual{isabelle-codegen,
466 author = {Florian Haftmann},
467 title = {Code generation from Isabelle theories},
469 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
473 author = {Paul R. Halmos},
474 title = {Naive Set Theory},
475 publisher = {Van Nostrand},
478 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
479 title={Dynamic Logic},publisher=MIT,year=2000}
482 author = {Matthew Hennessy},
483 title = {The Semantics of Programming Languages: An Elementary
484 Introduction Using Structural Operational Semantics},
488 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
489 title={Introduction to Automata Theory, Languages, and Computation.},
490 publisher={Addison-Wesley},year=1979}
492 @Article{haskell-report,
493 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
494 title = {Report on the Programming Language {Haskell}: A
495 Non-strict, Purely Functional Language},
501 note = {Version 1.2}}
503 @Article{haskell-tutorial,
504 author = {Paul Hudak and Joseph H. Fasel},
505 title = {A Gentle Introduction to {Haskell}},
512 @book{Hudak-Haskell,author={Paul Hudak},
513 title={The Haskell School of Expression},publisher=CUP,year=2000}
516 author = {G. P. Huet},
517 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
524 author = {G. P. Huet and B. Lang},
525 title = {Proving and Applying Program Transformations Expressed with
526 Second-Order Patterns},
532 @inproceedings{huet88,
533 author = {G{\'e}rard Huet},
534 title = {Induction Principles Formalized in the {Calculus of
536 booktitle = {Programming of Future Generation Computers},
537 editor = {K. Fuchi and M. Nivat},
540 publisher = {Elsevier}}
542 @Book{Huth-Ryan-book,
543 author = {Michael Huth and Mark Ryan},
544 title = {Logic in Computer Science. Modelling and reasoning about systems},
548 @InProceedings{Harrison:1996:MizarHOL,
549 author = {J. Harrison},
550 title = {A {Mizar} Mode for {HOL}},
552 crossref = {tphols96}}
556 @article{haskell-revised-report,
557 author = {Simon {Peyton Jones} and others},
558 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
559 journal = {Journal of Functional Programming},
565 note = {\url{http://www.haskell.org/definition/}}}
569 @InProceedings{kammueller-locales,
570 author = {Florian Kamm{\"u}ller and Markus Wenzel and
571 Lawrence C. Paulson},
572 title = {Locales: A Sectioning Concept for {Isabelle}},
573 crossref = {tphols99}}
576 author={Donald E. Knuth},
577 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
578 publisher={Addison-Wesley},
582 author = {R. E. Korf},
583 title = {Depth-First Iterative-Deepening: an Optimal Admissible
590 @InProceedings{krauss2006,
591 author = {Alexander Krauss},
592 title = {Partial Recursive Functions in {Higher-Order Logic}},
593 crossref = {ijcar2006},
596 @manual{isabelle-function,
597 author = {Alexander Krauss},
598 title = {Defining Recursive Functions in {Isabelle/HOL}},
600 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
604 author = {Kenneth Kunen},
605 title = {Set Theory: An Introduction to Independence Proofs},
612 author = {Xavier Leroy and others},
613 title = {The Objective Caml system -- Documentation and user's manual},
614 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
616 @InProceedings{lowe-fdr,
617 author = {Gavin Lowe},
618 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
619 Protocol using {CSP} and {FDR}},
620 booktitle = {Tools and Algorithms for the Construction and Analysis
621 of Systems: second international workshop, TACAS '96},
622 editor = {T. Margaria and B. Steffen},
623 series = {LNCS 1055},
625 publisher = {Springer},
631 author = {Zohar Manna and Richard Waldinger},
632 title = {Deductive Synthesis of the Unification Algorithm},
639 @InProceedings{martin-nipkow,
640 author = {Ursula Martin and Tobias Nipkow},
641 title = {Ordered Rewriting and Confluence},
646 author = {Per Martin-L{\"o}f},
647 title = {Intuitionistic type theory},
649 publisher = {Bibliopolis}}
651 @incollection{melham89,
652 author = {Thomas F. Melham},
653 title = {Automating Recursive Type Definitions in Higher Order
656 crossref = {birtwistle89}}
658 @Article{miller-mixed,
659 Author = {Dale Miller},
660 Title = {Unification Under a Mixed Prefix},
668 author = {Robin Milner},
669 title = {A Theory of Type Polymorphism in Programming},
670 journal = "J. Comp.\ Sys.\ Sci.",
675 @TechReport{milner-ind,
676 author = {Robin Milner},
677 title = {How to Derive Inductions in {LCF}},
678 institution = Edinburgh,
682 @Article{milner-coind,
683 author = {Robin Milner and Mads Tofte},
684 title = {Co-induction in Relational Semantics},
691 author = {Robin Milner},
692 title = {Communication and Concurrency},
693 publisher = Prentice,
696 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
697 title="The Definition of Standard ML",publisher=MIT,year=1990}
699 @PhdThesis{monahan84,
700 author = {Brian Q. Monahan},
701 title = {Data Type Proofs using Edinburgh {LCF}},
702 school = {University of Edinburgh},
705 @article{MuellerNvOS99,
707 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
708 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
710 @Manual{Muzalewski:Mizar,
711 title = {An Outline of {PC} {Mizar}},
712 author = {Micha{\l} Muzalewski},
713 organization = {Fondation of Logic, Mathematics and Informatics
714 --- Mizar Users Group},
716 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
721 @InProceedings{NaraschewskiW-TPHOLs98,
722 author = {Wolfgang Naraschewski and Markus Wenzel},
724 {Object-Oriented Verification based on Record Subtyping in
726 crossref = {tphols98}}
728 @inproceedings{nazareth-nipkow,
729 author = {Dieter Nazareth and Tobias Nipkow},
730 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
731 crossref = {tphols96},
735 @Article{needham-schroeder,
736 author = "Roger M. Needham and Michael D. Schroeder",
737 title = "Using Encryption for Authentication in Large Networks
746 @inproceedings{nipkow-W,
747 author = {Wolfgang Naraschewski and Tobias Nipkow},
748 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
749 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
750 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
751 publisher = Springer,
757 @InCollection{nipkow-sorts93,
758 author = {T. Nipkow},
759 title = {Order-Sorted Polymorphism in {Isabelle}},
760 booktitle = {Logical Environments},
763 editor = {G. Huet and G. Plotkin},
767 @Misc{nipkow-types93,
768 author = {Tobias Nipkow},
769 title = {Axiomatic Type Classes (in {I}sabelle)},
770 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
774 @inproceedings{Nipkow-CR,
775 author = {Tobias Nipkow},
776 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
777 booktitle = {Automated Deduction --- CADE-13},
778 editor = {M. McRobbie and J.K. Slaney},
779 publisher = Springer,
786 @InProceedings{nipkow-patterns,
787 title = {Functional Unification of Higher-Order Patterns},
788 author = {Tobias Nipkow},
791 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
792 keywords = {unification}}
795 author = {Tobias Nipkow},
796 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
802 @inproceedings{Nipkow-TYPES02,
803 author = {Tobias Nipkow},
804 title = {{Structured Proofs in Isar/HOL}},
805 booktitle = {Types for Proofs and Programs (TYPES 2002)},
806 editor = {H. Geuvers and F. Wiedijk},
808 publisher = Springer,
813 @manual{isabelle-HOL,
814 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
815 title = {{Isabelle}'s Logics: {HOL}},
816 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
817 M{\"u}nchen and Computer Laboratory, University of Cambridge},
818 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
820 @article{nipkow-prehofer,
821 author = {Tobias Nipkow and Christian Prehofer},
822 title = {Type Reconstruction for Type Classes},
829 @InProceedings{Nipkow-Prehofer:1993,
830 author = {T. Nipkow and C. Prehofer},
831 title = {Type checking type classes},
832 booktitle = {ACM Symp.\ Principles of Programming Languages},
837 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
838 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
839 publisher = {Springer},
841 note = {LNCS Tutorial 2283}}
844 author = {Philippe No{\"e}l},
845 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
853 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
854 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
856 publisher = {Oxford University Press},
861 @Manual{pvs-language,
862 title = {The {PVS} specification language},
863 author = {S. Owre and N. Shankar and J. M. Rushby},
864 organization = {Computer Science Laboratory, SRI International},
865 address = {Menlo Park, CA},
866 note = {Beta release},
869 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
874 @InProceedings{paulin-tlca,
875 author = {Christine Paulin-Mohring},
876 title = {Inductive Definitions in the System {Coq}: Rules and
881 @InProceedings{paulson-CADE,
882 author = {Lawrence C. Paulson},
883 title = {A Fixedpoint Approach to Implementing (Co)Inductive
888 @InProceedings{paulson-COLOG,
889 author = {Lawrence C. Paulson},
890 title = {A Formulation of the Simple Theory of Types (for
893 crossref = {colog88},
894 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
896 @Article{paulson-coind,
897 author = {Lawrence C. Paulson},
898 title = {Mechanizing Coinduction and Corecursion in Higher-Order
907 @manual{isabelle-intro,
908 author = {Lawrence C. Paulson},
909 title = {Introduction to {Isabelle}},
911 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
913 @manual{isabelle-logics,
914 author = {Lawrence C. Paulson},
915 title = {{Isabelle's} Logics},
917 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
919 @manual{isabelle-ref,
920 author = {Lawrence C. Paulson},
921 title = {The {Isabelle} Reference Manual},
923 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
926 author = {Lawrence C. Paulson},
927 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
929 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
931 @article{paulson-found,
932 author = {Lawrence C. Paulson},
933 title = {The Foundation of a Generic Theorem Prover},
939 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
941 %replaces paulson-final
942 @Article{paulson-mscs,
943 author = {Lawrence C. Paulson},
944 title = {Final Coalgebras as Greatest Fixed Points
946 journal = {Mathematical Structures in Computer Science},
952 @InCollection{paulson-generic,
953 author = {Lawrence C. Paulson},
954 title = {Generic Automatic Proof Tools},
955 crossref = {wos-fest},
959 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
960 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
969 @InCollection{paulson-fixedpt-milner,
970 author = {Lawrence C. Paulson},
971 title = {A Fixedpoint Approach to (Co)inductive and
972 (Co)datatype Definitions},
974 crossref = {milner-fest}}
977 title = {Proof, Language, and Interaction:
978 Essays in Honor of {Robin Milner}},
979 booktitle = {Proof, Language, and Interaction:
980 Essays in Honor of {Robin Milner}},
981 publisher = {MIT Press},
983 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
985 @InCollection{paulson-handbook,
986 author = {Lawrence C. Paulson},
987 title = {Designing a Theorem Prover},
988 crossref = {handbk-lics2},
991 @Book{paulson-isa-book,
992 author = {Lawrence C. Paulson},
993 title = {Isabelle: A Generic Theorem Prover},
994 publisher = {Springer},
998 @Book{isabelle-hol-book,
999 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1000 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1001 publisher = {Springer},
1005 @InCollection{paulson-markt,
1006 author = {Lawrence C. Paulson},
1007 title = {Tool Support for Logics of Programs},
1008 booktitle = {Mathematical Methods in Program Development:
1009 Summer School Marktoberdorf 1996},
1010 publisher = {Springer},
1012 year = {Published 1997},
1013 editor = {Manfred Broy},
1014 series = {NATO ASI Series F}}
1016 %replaces Paulson-ML and paulson91
1018 author = {Lawrence C. Paulson},
1019 title = {{ML} for the Working Programmer},
1024 @article{paulson-natural,
1025 author = {Lawrence C. Paulson},
1026 title = {Natural Deduction as Higher-order Resolution},
1031 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1033 @Article{paulson-set-I,
1034 author = {Lawrence C. Paulson},
1035 title = {Set Theory for Verification: {I}. {From}
1036 Foundations to Functions},
1042 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1044 @Article{paulson-set-II,
1045 author = {Lawrence C. Paulson},
1046 title = {Set Theory for Verification: {II}. {Induction} and
1053 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1056 author = {Lawrence C. Paulson},
1057 title = {Verifying the Unification Algorithm in {LCF}},
1063 %replaces Paulson-LCF
1065 author = {Lawrence C. Paulson},
1066 title = {Logic and Computation: Interactive proof with Cambridge
1071 @incollection{paulson700,
1072 author = {Lawrence C. Paulson},
1073 title = {{Isabelle}: The Next 700 Theorem Provers},
1074 crossref = {odifreddi90},
1076 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1078 % replaces paulson-ns and paulson-security
1079 @Article{paulson-jcs,
1080 author = {Lawrence C. Paulson},
1081 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1087 @Article{paulson-tls,
1088 author = {Lawrence C. Paulson},
1089 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1097 @Article{paulson-yahalom,
1098 author = {Lawrence C. Paulson},
1099 title = {Relations Between Secrets:
1100 Two Formal Analyses of the {Yahalom} Protocol},
1107 @article{pelletier86,
1108 author = {F. J. Pelletier},
1109 title = {Seventy-five Problems for Testing Automatic Theorem
1115 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1118 author = {Andrew M. Pitts},
1119 title = {A Co-induction Principle for Recursively Defined Domains},
1125 @Article{plaisted90,
1126 author = {David A. Plaisted},
1127 title = {A Sequent-Style Model Elimination Strategy and a Positive
1138 author = {Art Quaife},
1139 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1149 @TechReport{rasmussen95,
1150 author = {Ole Rasmussen},
1151 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1153 institution = {Computer Laboratory, University of Cambridge},
1157 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1160 author = {Steve Reeves and Michael Clarke},
1161 title = {Logic for Computer Science},
1162 publisher = {Addison-Wesley},
1165 @book{Rosen-DMA,author={Kenneth H. Rosen},
1166 title={Discrete Mathematics and Its Applications},
1167 publisher={McGraw-Hill},year=1998}
1169 @InProceedings{Rudnicki:1992:MizarOverview,
1170 author = {P. Rudnicki},
1171 title = {An Overview of the {MIZAR} Project},
1172 booktitle = {1992 Workshop on Types for Proofs and Programs},
1174 organization = {Chalmers University of Technology},
1175 publisher = {Bastad}
1180 @inproceedings{saaltink-fme,
1181 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1182 Dan Craigen and Irwin Meisels},
1183 title = {An {EVES} Data Abstraction Example},
1187 @inproceedings{slind-tfl,
1188 author = {Konrad Slind},
1189 title = {Function Definition in Higher Order Logic},
1190 crossref = {tphols96},
1194 author = {Patrick Suppes},
1195 title = {Axiomatic Set Theory},
1197 publisher = {Dover}}
1199 @InCollection{szasz93,
1200 author = {Nora Szasz},
1201 title = {A Machine Checked Proof that {Ackermann's} Function is not
1202 Primitive Recursive},
1203 crossref = {huet-plotkin93},
1206 @TechReport{Syme:1997:DECLARE,
1208 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1209 institution = {University of Cambridge Computer Laboratory},
1214 @PhdThesis{Syme:1998:thesis,
1216 title = {Declarative Theorem Proving for Operational Semantics},
1217 school = {University of Cambridge},
1222 @InProceedings{Syme:1999:TPHOL,
1224 title = {Three Tactic Theorem Proving},
1225 crossref = {tphols99}}
1230 author = {G. Takeuti},
1231 title = {Proof Theory},
1237 author = {Simon Thompson},
1238 title = {Type Theory and Functional Programming},
1239 publisher = {Addison-Wesley},
1242 @book{Thompson-Haskell,author={Simon Thompson},
1243 title={Haskell: The Craft of Functional Programming},
1244 publisher={Addison-Wesley},year=1999}
1246 @Unpublished{Trybulec:1993:MizarFeatures,
1247 author = {A. Trybulec},
1248 title = {Some Features of the {Mizar} Language},
1249 note = {Presented at a workshop in Turin, Italy},
1255 @Unpublished{voelker94,
1256 author = {Norbert V{\"o}lker},
1257 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1258 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1264 @inproceedings{wadler89how,
1265 author = {P. Wadler and S. Blott},
1266 title = {How to make ad-hoc polymorphism less ad-hoc},
1267 booktitle = {ACM Symp.\ Principles of Programming Languages},
1272 author = {Christoph Wedler},
1273 title = {Emacs package ``{X-Symbol}''},
1274 note = {\url{http://x-symbol.sourceforge.net}}
1277 @manual{isabelle-sys,
1278 author = {Markus Wenzel and Stefan Berghofer},
1279 title = {The {Isabelle} System Manual},
1280 institution = {TU Munich},
1281 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1283 @manual{isabelle-isar-ref,
1284 author = {Markus Wenzel},
1285 title = {The {Isabelle/Isar} Reference Manual},
1286 institution = {TU Munich},
1287 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1289 @manual{isabelle-axclass,
1290 author = {Markus Wenzel},
1291 title = {Using Axiomatic Type Classes in {I}sabelle},
1292 institution = {TU Munich},
1294 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1297 @InProceedings{Wenzel:1999:TPHOL,
1298 author = {Markus Wenzel},
1299 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1300 crossref = {tphols99}}
1302 @InProceedings{Wenzel:1997:TPHOL,
1303 author = {Markus Wenzel},
1304 title = {Type Classes and Overloading in Higher-Order Logic},
1305 crossref = {tphols97}}
1307 @phdthesis{Wenzel-PhD,
1308 author={Markus Wenzel},
1309 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1310 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1312 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1315 author = {A. N. Whitehead and B. Russell},
1316 title = {Principia Mathematica},
1319 note = {Paperback edition to *56,
1320 abridged from the 2nd edition (1927)}}
1322 @Misc{Wiedijk:1999:Mizar,
1323 author = {Freek Wiedijk},
1324 title = {Mizar: An Impression},
1325 howpublished = {Unpublished paper},
1327 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1330 @Misc{Wiedijk:2000:MV,
1331 author = {Freek Wiedijk},
1332 title = {The Mathematical Vernacular},
1333 howpublished = {Unpublished paper},
1335 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1339 author = {Glynn Winskel},
1340 title = {The Formal Semantics of Programming Languages},
1341 publisher = MIT,year=1993}
1343 @InCollection{wos-bledsoe,
1344 author = {Larry Wos},
1345 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1346 crossref = {bledsoe-fest},
1349 @InProceedings{Zammit:1999:TPHOL,
1350 author = {Vincent Zammit},
1351 title = {On the Implementation of an Extensible Declarative Proof Language},
1352 crossref = {tphols99}}
1360 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1361 title = {Handbook of Logic in Computer Science},
1362 booktitle = {Handbook of Logic in Computer Science},
1363 publisher = {Oxford University Press},
1368 editor = {Henk Barendregt and Tobias Nipkow},
1369 title = TYPES # {: International Workshop {TYPES '93}},
1370 booktitle = TYPES # {: International Workshop {TYPES '93}},
1371 year = {published 1994},
1372 publisher = {Springer},
1373 series = {LNCS 806}}
1375 @book{barwise-handbk,
1376 editor = {J. Barwise},
1377 title = {Handbook of Mathematical Logic},
1378 booktitle = {Handbook of Mathematical Logic},
1382 @Proceedings{tlca93,
1383 title = {Typed Lambda Calculi and Applications},
1384 booktitle = {Typed Lambda Calculi and Applications},
1385 editor = {M. Bezem and J.F. Groote},
1387 publisher = {Springer},
1388 series = {LNCS 664}}
1391 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1392 title = {Current Trends in Hardware Verification and Automated
1394 booktitle = {Current Trends in Hardware Verification and Automated
1396 publisher = {Springer},
1400 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1401 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1402 publisher = {Kluwer Academic Publishers},
1404 editor = {Robert S. Boyer}}
1406 @Proceedings{cade12,
1407 editor = {Alan Bundy},
1408 title = {Automated Deduction --- {CADE}-12
1409 International Conference},
1410 booktitle = {Automated Deduction --- {CADE}-12
1411 International Conference},
1413 series = {LNAI 814},
1414 publisher = {Springer}}
1417 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1418 title = TYPES # {: International Workshop {TYPES '94}},
1419 booktitle = TYPES # {: International Workshop {TYPES '94}},
1421 publisher = {Springer},
1422 series = {LNCS 996}}
1424 @book{huet-plotkin91,
1425 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1426 title = {Logical Frameworks},
1427 booktitle = {Logical Frameworks},
1431 @book{huet-plotkin93,
1432 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1433 title = {Logical Environments},
1434 booktitle = {Logical Environments},
1439 editor = {J. Joyce and C. Seger},
1440 title = {Higher Order Logic Theorem Proving and Its
1441 Applications: HUG '93},
1442 booktitle = {Higher Order Logic Theorem Proving and Its
1443 Applications: HUG '93},
1444 year = {Published 1994},
1445 publisher = {Springer},
1446 series = {LNCS 780}}
1448 @proceedings{colog88,
1449 editor = {P. Martin-L{\"o}f and G. Mints},
1450 title = {COLOG-88: International Conference on Computer Logic},
1451 booktitle = {COLOG-88: International Conference on Computer Logic},
1452 year = {Published 1990},
1453 publisher = {Springer},
1454 organization = {Estonian Academy of Sciences},
1455 address = {Tallinn},
1456 series = {LNCS 417}}
1459 editor = {P. Odifreddi},
1460 title = {Logic and Computer Science},
1461 booktitle = {Logic and Computer Science},
1462 publisher = {Academic Press},
1465 @proceedings{extensions91,
1466 editor = {Peter Schroeder-Heister},
1467 title = {Extensions of Logic Programming},
1468 booktitle = {Extensions of Logic Programming},
1470 series = {LNAI 475},
1471 publisher = {Springer}}
1473 @proceedings{cade10,
1474 editor = {Mark E. Stickel},
1475 title = {10th } # CADE,
1476 booktitle = {10th } # CADE,
1478 publisher = {Springer},
1479 series = {LNAI 449}}
1482 editor = {M. Vardi},
1483 title = {Eighth Annual Symposium on Logic in Computer Science},
1484 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1489 title = {Automated Reasoning and its Applications:
1490 Essays in Honor of {Larry Wos}},
1491 booktitle = {Automated Reasoning and its Applications:
1492 Essays in Honor of {Larry Wos}},
1493 publisher = {MIT Press},
1495 editor = {Robert Veroff}}
1498 editor = {J. C. P. Woodcock and P. G. Larsen},
1499 title = {FME '93: Industrial-Strength Formal Methods},
1500 booktitle = {FME '93: Industrial-Strength Formal Methods},
1502 publisher = Springer,
1506 @Proceedings{tphols96,
1507 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1508 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1509 editor = {J. von Wright and J. Grundy and J. Harrison},
1510 publisher = Springer,
1515 @Proceedings{tphols97,
1516 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1517 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1518 editor = {Elsa L. Gunter and Amy Felty},
1519 publisher = Springer,
1524 @Proceedings{tphols98,
1525 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1526 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1527 editor = {Jim Grundy and Malcom Newey},
1528 publisher = Springer,
1533 @Proceedings{tphols99,
1534 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1535 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1536 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1537 Paulin, C. and Thery, L.},
1538 publisher = Springer,
1543 @Proceedings{tphols2000,
1544 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1545 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1546 editor = {J. Harrison and M. Aagaard},
1547 publisher = Springer,
1552 @Proceedings{tphols2001,
1553 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1554 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1555 editor = {R. J. Boulton and P. B. Jackson},
1556 publisher = Springer,
1561 @Proceedings{ijcar2006,
1562 title = {Automated Reasoning: {IJCAR} 2006},
1563 booktitle = {Automated Reasoning: {IJCAR} 2006},
1564 editor = {U. Furbach and N. Shankar},
1565 publisher = Springer,
1570 @unpublished{classes_modules,
1571 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1572 author = {Stefan Wehr et. al.}