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}}
187 @InProceedings{Bezem-Coquand:2005,
188 author = {M.A. Bezem and T. Coquand},
189 title = {Automating {Coherent Logic}},
190 booktitle = {LPAR-12},
191 editor = {G. Sutcliffe and A. Voronkov},
194 publisher = Springer}
196 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
197 title="Introduction to Functional Programming",publisher=PH,year=1988}
199 @book{Bird-Haskell,author="Richard Bird",
200 title="Introduction to Functional Programming using Haskell",
201 publisher=PH,year=1998}
204 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
205 Overbeek and Mark Stickel and Lawrence Wos},
206 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
215 author = {Robert S. Boyer and J Strother Moore},
216 title = {A Computational Logic},
217 publisher = {Academic Press},
221 author = {Robert S. Boyer and J Strother Moore},
222 title = {A Computational Logic Handbook},
223 publisher = {Academic Press},
227 author = {N. G. de Bruijn},
228 title = {Lambda Calculus Notation with Nameless Dummies,
229 a Tool for Automatic Formula Manipulation,
230 with Application to the {Church-Rosser Theorem}},
231 journal = {Indag. Math.},
236 @InProceedings{bulwahnKN07,
237 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
238 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
239 crossref = {tphols2007},
243 @InProceedings{bulwahn-et-al:2008:imperative,
244 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
245 title = {Imperative Functional Programming with {Isabelle/HOL}},
246 crossref = {tphols2008},
251 author = {M. Burrows and M. Abadi and R. M. Needham},
252 title = {A Logic of Authentication},
260 @TechReport{camilleri92,
261 author = {J. Camilleri and T. F. Melham},
262 title = {Reasoning with Inductively Defined Relations in the
263 {HOL} Theorem Prover},
270 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
271 title = {Artificial Intelligence Programming},
272 publisher = {Lawrence Erlbaum Associates},
276 author = "Alonzo Church",
277 title = "A Formulation of the Simple Theory of Types",
283 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
284 title="Model Checking",publisher=MIT,year=1999}
287 author = {Martin D. Coen},
288 title = {Interactive Program Derivation},
289 school = {University of Cambridge},
290 note = {Computer Laboratory Technical Report 272},
295 author = {R. L. Constable and others},
296 title = {Implementing Mathematics with the Nuprl Proof
298 publisher = Prentice,
303 @Book{davey-priestley,
304 author = {B. A. Davey and H. A. Priestley},
305 title = {Introduction to Lattices and Order},
310 author = {Keith J. Devlin},
311 title = {Fundamentals of Contemporary Set Theory},
312 publisher = {Springer},
316 author = {Michael Dummett},
317 title = {Elements of Intuitionism},
319 publisher = {Oxford University Press}}
321 @incollection{dybjer91,
322 author = {Peter Dybjer},
323 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
324 Theory and Their Set-Theoretic Semantics},
325 crossref = {huet-plotkin91},
329 author = {Roy Dyckhoff},
330 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
340 author = {William M. Farmer and Joshua D. Guttman and F. Javier
342 title = {{IMPS}: An Interactive Mathematical Proof System},
349 @InProceedings{felty91a,
350 Author = {Amy Felty},
351 Title = {A Logic Program for Transforming Sequent Proofs to Natural
353 crossref = {extensions91},
356 @Article{fleuriot-jcm,
357 author = {Jacques Fleuriot and Lawrence C. Paulson},
358 title = {Mechanizing Nonstandard Real Analysis},
359 journal = {LMS Journal of Computation and Mathematics},
363 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
367 author = {Jacob Frost},
368 title = {A Case Study of Co-induction in {Isabelle HOL}},
374 %revised version of frost93
376 author = {Jacob Frost},
377 title = {A Case Study of Co-induction in {Isabelle}},
384 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
386 title = {Principles of {OBJ2}},
394 author = {J. H. Gallier},
395 title = {Logic for Computer Science:
396 Foundations of Automatic Theorem Proving},
398 publisher = {Harper \& Row}}
401 author = {Antony Galton},
402 title = {Logic for Information Technology},
406 @Article{Gentzen:1935,
407 author = {G. Gentzen},
408 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
409 journal = {Math. Zeitschrift},
413 @InProceedings{gimenez-codifying,
414 author = {Eduardo Gim{\'e}nez},
415 title = {Codifying Guarded Definitions with Recursive Schemes},
416 crossref = {types94},
421 author = {Jean-Yves Girard},
422 title = {Proofs and Types},
425 note = {Translated by Yves LaFont and Paul Taylor}}
428 editor = {M. J. C. Gordon and T. F. Melham},
429 title = {Introduction to {HOL}: A Theorem Proving Environment for
435 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
437 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
439 publisher = {Springer},
442 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
443 title={Why we can't have {SML} style datatype declarations in {HOL}},
444 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
445 IFIP TC10/WG10.2 Intl. Workshop, 1992},
446 editor={L.J.M. Claesen and M.J.C. Gordon},
447 publisher=NH,year=1993,pages={561--568}}
449 @InProceedings{gunter-trees,
450 author = {Elsa L. Gunter},
451 title = {A Broader Class of Trees for Recursive Type Definitions for
458 @InProceedings{Haftmann-Wenzel:2006:classes,
459 author = {Florian Haftmann and Makarius Wenzel},
460 title = {Constructive Type Classes in {Isabelle}},
461 editor = {T. Altenkirch and C. McBride},
462 booktitle = {Types for Proofs and Programs, TYPES 2006},
463 publisher = {Springer},
469 @TechReport{Haftmann-Nipkow:2007:codegen,
470 author = {Florian Haftmann and Tobias Nipkow},
471 title = {A Code Generator Framework for {Isabelle/HOL}},
472 editor = {Klaus Schneider and Jens Brandt},
473 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
476 institution = {Department of Computer Science, University of Kaiserslautern},
480 @InProceedings{Haftmann-Wenzel:2009,
481 author = {Florian Haftmann and Makarius Wenzel},
482 title = {Local theory specifications in {Isabelle/Isar}},
483 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
484 booktitle = {Types for Proofs and Programs, TYPES 2008},
485 publisher = {Springer},
491 @manual{isabelle-classes,
492 author = {Florian Haftmann},
493 title = {Haskell-style type classes with {Isabelle}/{Isar}},
495 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
498 @manual{isabelle-codegen,
499 author = {Florian Haftmann},
500 title = {Code generation from Isabelle theories},
502 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
506 author = {Paul R. Halmos},
507 title = {Naive Set Theory},
508 publisher = {Van Nostrand},
511 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
512 title={Dynamic Logic},publisher=MIT,year=2000}
515 author = {Matthew Hennessy},
516 title = {The Semantics of Programming Languages: An Elementary
517 Introduction Using Structural Operational Semantics},
521 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
522 title={Introduction to Automata Theory, Languages, and Computation.},
523 publisher={Addison-Wesley},year=1979}
525 @Article{haskell-report,
526 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
527 title = {Report on the Programming Language {Haskell}: A
528 Non-strict, Purely Functional Language},
534 note = {Version 1.2}}
536 @Article{haskell-tutorial,
537 author = {Paul Hudak and Joseph H. Fasel},
538 title = {A Gentle Introduction to {Haskell}},
545 @book{Hudak-Haskell,author={Paul Hudak},
546 title={The Haskell School of Expression},publisher=CUP,year=2000}
549 author = {G. P. Huet},
550 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
557 author = {G. P. Huet and B. Lang},
558 title = {Proving and Applying Program Transformations Expressed with
559 Second-Order Patterns},
565 @inproceedings{huet88,
566 author = {G{\'e}rard Huet},
567 title = {Induction Principles Formalized in the {Calculus of
569 booktitle = {Programming of Future Generation Computers},
570 editor = {K. Fuchi and M. Nivat},
573 publisher = {Elsevier}}
575 @Book{Huth-Ryan-book,
576 author = {Michael Huth and Mark Ryan},
577 title = {Logic in Computer Science. Modelling and reasoning about systems},
581 @InProceedings{Harrison:1996:MizarHOL,
582 author = {J. Harrison},
583 title = {A {Mizar} Mode for {HOL}},
585 crossref = {tphols96}}
589 @article{haskell-revised-report,
590 author = {Simon {Peyton Jones} and others},
591 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
592 journal = {Journal of Functional Programming},
598 note = {\url{http://www.haskell.org/definition/}}}
602 @InProceedings{kammueller-locales,
603 author = {Florian Kamm{\"u}ller and Markus Wenzel and
604 Lawrence C. Paulson},
605 title = {Locales: A Sectioning Concept for {Isabelle}},
606 crossref = {tphols99}}
609 author={Donald E. Knuth},
610 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
611 publisher={Addison-Wesley},
615 author = {R. E. Korf},
616 title = {Depth-First Iterative-Deepening: an Optimal Admissible
623 @InProceedings{krauss2006,
624 author = {Alexander Krauss},
625 title = {Partial Recursive Functions in {Higher-Order Logic}},
626 crossref = {ijcar2006},
629 @manual{isabelle-function,
630 author = {Alexander Krauss},
631 title = {Defining Recursive Functions in {Isabelle/HOL}},
633 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
637 author = {Kenneth Kunen},
638 title = {Set Theory: An Introduction to Independence Proofs},
645 author = {Xavier Leroy and others},
646 title = {The Objective Caml system -- Documentation and user's manual},
647 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
649 @InProceedings{lowe-fdr,
650 author = {Gavin Lowe},
651 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
652 Protocol using {CSP} and {FDR}},
653 booktitle = {Tools and Algorithms for the Construction and Analysis
654 of Systems: second international workshop, TACAS '96},
655 editor = {T. Margaria and B. Steffen},
656 series = {LNCS 1055},
658 publisher = {Springer},
664 author = {Zohar Manna and Richard Waldinger},
665 title = {Deductive Synthesis of the Unification Algorithm},
672 @InProceedings{martin-nipkow,
673 author = {Ursula Martin and Tobias Nipkow},
674 title = {Ordered Rewriting and Confluence},
679 author = {Per Martin-L{\"o}f},
680 title = {Intuitionistic type theory},
682 publisher = {Bibliopolis}}
684 @incollection{melham89,
685 author = {Thomas F. Melham},
686 title = {Automating Recursive Type Definitions in Higher Order
689 crossref = {birtwistle89}}
691 @Article{Miller:1991,
692 author = {Dale Miller},
693 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
694 and Simple Unification},
695 journal = {Journal of Logic and Computation},
701 @Article{miller-mixed,
702 Author = {Dale Miller},
703 Title = {Unification Under a Mixed Prefix},
711 author = {Robin Milner},
712 title = {A Theory of Type Polymorphism in Programming},
713 journal = "J. Comp.\ Sys.\ Sci.",
718 @TechReport{milner-ind,
719 author = {Robin Milner},
720 title = {How to Derive Inductions in {LCF}},
721 institution = Edinburgh,
725 @Article{milner-coind,
726 author = {Robin Milner and Mads Tofte},
727 title = {Co-induction in Relational Semantics},
734 author = {Robin Milner},
735 title = {Communication and Concurrency},
736 publisher = Prentice,
739 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
740 title="The Definition of Standard ML",publisher=MIT,year=1990}
742 @PhdThesis{monahan84,
743 author = {Brian Q. Monahan},
744 title = {Data Type Proofs using Edinburgh {LCF}},
745 school = {University of Edinburgh},
748 @article{MuellerNvOS99,
750 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
751 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
753 @Manual{Muzalewski:Mizar,
754 title = {An Outline of {PC} {Mizar}},
755 author = {Micha{\l} Muzalewski},
756 organization = {Fondation of Logic, Mathematics and Informatics
757 --- Mizar Users Group},
759 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
764 @InProceedings{NaraschewskiW-TPHOLs98,
765 author = {Wolfgang Naraschewski and Markus Wenzel},
767 {Object-Oriented Verification based on Record Subtyping in
769 crossref = {tphols98}}
771 @inproceedings{nazareth-nipkow,
772 author = {Dieter Nazareth and Tobias Nipkow},
773 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
774 crossref = {tphols96},
778 @Article{needham-schroeder,
779 author = "Roger M. Needham and Michael D. Schroeder",
780 title = "Using Encryption for Authentication in Large Networks
789 @inproceedings{nipkow-W,
790 author = {Wolfgang Naraschewski and Tobias Nipkow},
791 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
792 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
793 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
794 publisher = Springer,
800 @InCollection{nipkow-sorts93,
801 author = {T. Nipkow},
802 title = {Order-Sorted Polymorphism in {Isabelle}},
803 booktitle = {Logical Environments},
806 editor = {G. Huet and G. Plotkin},
810 @Misc{nipkow-types93,
811 author = {Tobias Nipkow},
812 title = {Axiomatic Type Classes (in {I}sabelle)},
813 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
817 @inproceedings{Nipkow-CR,
818 author = {Tobias Nipkow},
819 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
820 booktitle = {Automated Deduction --- CADE-13},
821 editor = {M. McRobbie and J.K. Slaney},
822 publisher = Springer,
829 @InProceedings{nipkow-patterns,
830 title = {Functional Unification of Higher-Order Patterns},
831 author = {Tobias Nipkow},
834 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
835 keywords = {unification}}
838 author = {Tobias Nipkow},
839 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
845 @inproceedings{Nipkow-TYPES02,
846 author = {Tobias Nipkow},
847 title = {{Structured Proofs in Isar/HOL}},
848 booktitle = {Types for Proofs and Programs (TYPES 2002)},
849 editor = {H. Geuvers and F. Wiedijk},
851 publisher = Springer,
856 @manual{isabelle-HOL,
857 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
858 title = {{Isabelle}'s Logics: {HOL}},
859 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
860 M{\"u}nchen and Computer Laboratory, University of Cambridge},
861 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
863 @article{nipkow-prehofer,
864 author = {Tobias Nipkow and Christian Prehofer},
865 title = {Type Reconstruction for Type Classes},
872 @InProceedings{Nipkow-Prehofer:1993,
873 author = {T. Nipkow and C. Prehofer},
874 title = {Type checking type classes},
875 booktitle = {ACM Symp.\ Principles of Programming Languages},
880 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
881 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
882 publisher = {Springer},
884 note = {LNCS Tutorial 2283}}
887 author = {Philippe No{\"e}l},
888 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
896 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
897 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
899 publisher = {Oxford University Press},
904 @Manual{pvs-language,
905 title = {The {PVS} specification language},
906 author = {S. Owre and N. Shankar and J. M. Rushby},
907 organization = {Computer Science Laboratory, SRI International},
908 address = {Menlo Park, CA},
909 note = {Beta release},
912 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
917 @InProceedings{paulin-tlca,
918 author = {Christine Paulin-Mohring},
919 title = {Inductive Definitions in the System {Coq}: Rules and
924 @InProceedings{paulson-CADE,
925 author = {Lawrence C. Paulson},
926 title = {A Fixedpoint Approach to Implementing (Co)Inductive
931 @InProceedings{paulson-COLOG,
932 author = {Lawrence C. Paulson},
933 title = {A Formulation of the Simple Theory of Types (for
936 crossref = {colog88},
937 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
939 @Article{paulson-coind,
940 author = {Lawrence C. Paulson},
941 title = {Mechanizing Coinduction and Corecursion in Higher-Order
950 @manual{isabelle-intro,
951 author = {Lawrence C. Paulson},
952 title = {Introduction to {Isabelle}},
954 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
956 @manual{isabelle-logics,
957 author = {Lawrence C. Paulson},
958 title = {{Isabelle's} Logics},
960 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
962 @manual{isabelle-ref,
963 author = {Lawrence C. Paulson},
964 title = {The {Isabelle} Reference Manual},
966 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
969 author = {Lawrence C. Paulson},
970 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
972 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
974 @article{paulson-found,
975 author = {Lawrence C. Paulson},
976 title = {The Foundation of a Generic Theorem Prover},
982 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
984 %replaces paulson-final
985 @Article{paulson-mscs,
986 author = {Lawrence C. Paulson},
987 title = {Final Coalgebras as Greatest Fixed Points
989 journal = {Mathematical Structures in Computer Science},
995 @InCollection{paulson-generic,
996 author = {Lawrence C. Paulson},
997 title = {Generic Automatic Proof Tools},
998 crossref = {wos-fest},
1001 @Article{paulson-gr,
1002 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1003 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1012 @InCollection{paulson-fixedpt-milner,
1013 author = {Lawrence C. Paulson},
1014 title = {A Fixedpoint Approach to (Co)inductive and
1015 (Co)datatype Definitions},
1017 crossref = {milner-fest}}
1020 title = {Proof, Language, and Interaction:
1021 Essays in Honor of {Robin Milner}},
1022 booktitle = {Proof, Language, and Interaction:
1023 Essays in Honor of {Robin Milner}},
1024 publisher = {MIT Press},
1026 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1028 @InCollection{paulson-handbook,
1029 author = {Lawrence C. Paulson},
1030 title = {Designing a Theorem Prover},
1031 crossref = {handbk-lics2},
1034 @Book{paulson-isa-book,
1035 author = {Lawrence C. Paulson},
1036 title = {Isabelle: A Generic Theorem Prover},
1037 publisher = {Springer},
1041 @Book{isabelle-hol-book,
1042 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1043 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1044 publisher = {Springer},
1048 @InCollection{paulson-markt,
1049 author = {Lawrence C. Paulson},
1050 title = {Tool Support for Logics of Programs},
1051 booktitle = {Mathematical Methods in Program Development:
1052 Summer School Marktoberdorf 1996},
1053 publisher = {Springer},
1055 year = {Published 1997},
1056 editor = {Manfred Broy},
1057 series = {NATO ASI Series F}}
1059 %replaces Paulson-ML and paulson91
1061 author = {Lawrence C. Paulson},
1062 title = {{ML} for the Working Programmer},
1067 @article{paulson-natural,
1068 author = {Lawrence C. Paulson},
1069 title = {Natural Deduction as Higher-order Resolution},
1074 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1076 @Article{paulson-set-I,
1077 author = {Lawrence C. Paulson},
1078 title = {Set Theory for Verification: {I}. {From}
1079 Foundations to Functions},
1085 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1087 @Article{paulson-set-II,
1088 author = {Lawrence C. Paulson},
1089 title = {Set Theory for Verification: {II}. {Induction} and
1096 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1099 author = {Lawrence C. Paulson},
1100 title = {Verifying the Unification Algorithm in {LCF}},
1106 %replaces Paulson-LCF
1108 author = {Lawrence C. Paulson},
1109 title = {Logic and Computation: Interactive proof with Cambridge
1114 @incollection{paulson700,
1115 author = {Lawrence C. Paulson},
1116 title = {{Isabelle}: The Next 700 Theorem Provers},
1117 crossref = {odifreddi90},
1119 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1121 % replaces paulson-ns and paulson-security
1122 @Article{paulson-jcs,
1123 author = {Lawrence C. Paulson},
1124 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1130 @Article{paulson-tls,
1131 author = {Lawrence C. Paulson},
1132 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1140 @Article{paulson-yahalom,
1141 author = {Lawrence C. Paulson},
1142 title = {Relations Between Secrets:
1143 Two Formal Analyses of the {Yahalom} Protocol},
1150 @article{pelletier86,
1151 author = {F. J. Pelletier},
1152 title = {Seventy-five Problems for Testing Automatic Theorem
1158 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1161 author = {Andrew M. Pitts},
1162 title = {A Co-induction Principle for Recursively Defined Domains},
1168 @Article{plaisted90,
1169 author = {David A. Plaisted},
1170 title = {A Sequent-Style Model Elimination Strategy and a Positive
1181 author = {Art Quaife},
1182 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1192 @TechReport{rasmussen95,
1193 author = {Ole Rasmussen},
1194 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1196 institution = {Computer Laboratory, University of Cambridge},
1200 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1203 author = {Steve Reeves and Michael Clarke},
1204 title = {Logic for Computer Science},
1205 publisher = {Addison-Wesley},
1208 @book{Rosen-DMA,author={Kenneth H. Rosen},
1209 title={Discrete Mathematics and Its Applications},
1210 publisher={McGraw-Hill},year=1998}
1212 @InProceedings{Rudnicki:1992:MizarOverview,
1213 author = {P. Rudnicki},
1214 title = {An Overview of the {MIZAR} Project},
1215 booktitle = {1992 Workshop on Types for Proofs and Programs},
1217 organization = {Chalmers University of Technology},
1218 publisher = {Bastad}
1223 @inproceedings{saaltink-fme,
1224 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1225 Dan Craigen and Irwin Meisels},
1226 title = {An {EVES} Data Abstraction Example},
1230 @Article{Schroeder-Heister:1984,
1231 author = {Peter Schroeder-Heister},
1232 title = {A Natural Extension of Natural Deduction},
1233 journal = {Journal of Symbolic Logic},
1239 @inproceedings{slind-tfl,
1240 author = {Konrad Slind},
1241 title = {Function Definition in Higher Order Logic},
1242 crossref = {tphols96},
1246 author = {Patrick Suppes},
1247 title = {Axiomatic Set Theory},
1249 publisher = {Dover}}
1251 @InCollection{szasz93,
1252 author = {Nora Szasz},
1253 title = {A Machine Checked Proof that {Ackermann's} Function is not
1254 Primitive Recursive},
1255 crossref = {huet-plotkin93},
1258 @TechReport{Syme:1997:DECLARE,
1260 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1261 institution = {University of Cambridge Computer Laboratory},
1266 @PhdThesis{Syme:1998:thesis,
1268 title = {Declarative Theorem Proving for Operational Semantics},
1269 school = {University of Cambridge},
1274 @InProceedings{Syme:1999:TPHOL,
1276 title = {Three Tactic Theorem Proving},
1277 crossref = {tphols99}}
1282 author = {G. Takeuti},
1283 title = {Proof Theory},
1289 author = {Simon Thompson},
1290 title = {Type Theory and Functional Programming},
1291 publisher = {Addison-Wesley},
1294 @book{Thompson-Haskell,author={Simon Thompson},
1295 title={Haskell: The Craft of Functional Programming},
1296 publisher={Addison-Wesley},year=1999}
1298 @Unpublished{Trybulec:1993:MizarFeatures,
1299 author = {A. Trybulec},
1300 title = {Some Features of the {Mizar} Language},
1301 note = {Presented at a workshop in Turin, Italy},
1307 @Unpublished{voelker94,
1308 author = {Norbert V{\"o}lker},
1309 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1310 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1316 @inproceedings{wadler89how,
1317 author = {P. Wadler and S. Blott},
1318 title = {How to make ad-hoc polymorphism less ad-hoc},
1319 booktitle = {ACM Symp.\ Principles of Programming Languages},
1324 author = {Christoph Wedler},
1325 title = {Emacs package ``{X-Symbol}''},
1326 note = {\url{http://x-symbol.sourceforge.net}}
1329 @manual{isabelle-sys,
1330 author = {Markus Wenzel and Stefan Berghofer},
1331 title = {The {Isabelle} System Manual},
1332 institution = {TU Munich},
1333 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1335 @manual{isabelle-isar-ref,
1336 author = {Makarius Wenzel},
1337 title = {The {Isabelle/Isar} Reference Manual},
1338 institution = {TU Munich},
1339 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1341 @manual{isabelle-implementation,
1342 author = {Makarius Wenzel},
1343 title = {The {Isabelle/Isar} Implementation},
1344 institution = {TU Munich},
1345 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1347 @InProceedings{Wenzel:1999:TPHOL,
1348 author = {Markus Wenzel},
1349 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1350 crossref = {tphols99}}
1352 @InProceedings{Wenzel:1997:TPHOL,
1353 author = {Markus Wenzel},
1354 title = {Type Classes and Overloading in Higher-Order Logic},
1355 crossref = {tphols97}}
1357 @phdthesis{Wenzel-PhD,
1358 author={Markus Wenzel},
1359 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1360 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1362 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1364 @Article{Wenzel-Wiedijk:2002,
1365 author = {Freek Wiedijk and Markus Wenzel},
1366 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1367 journal = {Journal of Automated Reasoning},
1373 @InCollection{Wenzel-Paulson:2006,
1374 author = {Markus Wenzel and Lawrence C. Paulson},
1375 title = {{Isabelle/Isar}},
1376 booktitle = {The Seventeen Provers of the World},
1378 editor = {F. Wiedijk},
1379 series = {LNAI 3600}
1382 @InCollection{Wenzel:2006:Festschrift,
1383 author = {Makarius Wenzel},
1384 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1385 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1386 publisher = {University of Bia{\l}ystok},
1388 editor = {R. Matuszewski and A. Zalewska},
1390 series = {Studies in Logic, Grammar, and Rhetoric},
1391 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1395 author = {A. N. Whitehead and B. Russell},
1396 title = {Principia Mathematica},
1399 note = {Paperback edition to *56,
1400 abridged from the 2nd edition (1927)}}
1402 @Misc{Wiedijk:1999:Mizar,
1403 author = {Freek Wiedijk},
1404 title = {Mizar: An Impression},
1405 howpublished = {Unpublished paper},
1407 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1410 @Misc{Wiedijk:2000:MV,
1411 author = {Freek Wiedijk},
1412 title = {The Mathematical Vernacular},
1413 howpublished = {Unpublished paper},
1415 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1419 author = {Glynn Winskel},
1420 title = {The Formal Semantics of Programming Languages},
1421 publisher = MIT,year=1993}
1423 @InCollection{wos-bledsoe,
1424 author = {Larry Wos},
1425 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1426 crossref = {bledsoe-fest},
1429 @InProceedings{Zammit:1999:TPHOL,
1430 author = {Vincent Zammit},
1431 title = {On the Implementation of an Extensible Declarative Proof Language},
1432 crossref = {tphols99}}
1440 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1441 title = {Handbook of Logic in Computer Science},
1442 booktitle = {Handbook of Logic in Computer Science},
1443 publisher = {Oxford University Press},
1448 editor = {Henk Barendregt and Tobias Nipkow},
1449 title = TYPES # {: International Workshop {TYPES '93}},
1450 booktitle = TYPES # {: International Workshop {TYPES '93}},
1451 year = {published 1994},
1452 publisher = {Springer},
1453 series = {LNCS 806}}
1455 @book{barwise-handbk,
1456 editor = {J. Barwise},
1457 title = {Handbook of Mathematical Logic},
1458 booktitle = {Handbook of Mathematical Logic},
1462 @Proceedings{tlca93,
1463 title = {Typed Lambda Calculi and Applications},
1464 booktitle = {Typed Lambda Calculi and Applications},
1465 editor = {M. Bezem and J.F. Groote},
1467 publisher = {Springer},
1468 series = {LNCS 664}}
1471 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1472 title = {Current Trends in Hardware Verification and Automated
1474 booktitle = {Current Trends in Hardware Verification and Automated
1476 publisher = {Springer},
1480 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1481 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1482 publisher = {Kluwer Academic Publishers},
1484 editor = {Robert S. Boyer}}
1486 @Proceedings{cade12,
1487 editor = {Alan Bundy},
1488 title = {Automated Deduction --- {CADE}-12
1489 International Conference},
1490 booktitle = {Automated Deduction --- {CADE}-12
1491 International Conference},
1493 series = {LNAI 814},
1494 publisher = {Springer}}
1497 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1498 title = TYPES # {: International Workshop {TYPES '94}},
1499 booktitle = TYPES # {: International Workshop {TYPES '94}},
1501 publisher = {Springer},
1502 series = {LNCS 996}}
1504 @book{huet-plotkin91,
1505 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1506 title = {Logical Frameworks},
1507 booktitle = {Logical Frameworks},
1511 @book{huet-plotkin93,
1512 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1513 title = {Logical Environments},
1514 booktitle = {Logical Environments},
1519 editor = {J. Joyce and C. Seger},
1520 title = {Higher Order Logic Theorem Proving and Its
1521 Applications: HUG '93},
1522 booktitle = {Higher Order Logic Theorem Proving and Its
1523 Applications: HUG '93},
1524 year = {Published 1994},
1525 publisher = {Springer},
1526 series = {LNCS 780}}
1528 @proceedings{colog88,
1529 editor = {P. Martin-L{\"o}f and G. Mints},
1530 title = {COLOG-88: International Conference on Computer Logic},
1531 booktitle = {COLOG-88: International Conference on Computer Logic},
1532 year = {Published 1990},
1533 publisher = {Springer},
1534 organization = {Estonian Academy of Sciences},
1535 address = {Tallinn},
1536 series = {LNCS 417}}
1539 editor = {P. Odifreddi},
1540 title = {Logic and Computer Science},
1541 booktitle = {Logic and Computer Science},
1542 publisher = {Academic Press},
1545 @proceedings{extensions91,
1546 editor = {Peter Schroeder-Heister},
1547 title = {Extensions of Logic Programming},
1548 booktitle = {Extensions of Logic Programming},
1550 series = {LNAI 475},
1551 publisher = {Springer}}
1553 @proceedings{cade10,
1554 editor = {Mark E. Stickel},
1555 title = {10th } # CADE,
1556 booktitle = {10th } # CADE,
1558 publisher = {Springer},
1559 series = {LNAI 449}}
1562 editor = {M. Vardi},
1563 title = {Eighth Annual Symposium on Logic in Computer Science},
1564 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1569 title = {Automated Reasoning and its Applications:
1570 Essays in Honor of {Larry Wos}},
1571 booktitle = {Automated Reasoning and its Applications:
1572 Essays in Honor of {Larry Wos}},
1573 publisher = {MIT Press},
1575 editor = {Robert Veroff}}
1578 editor = {J. C. P. Woodcock and P. G. Larsen},
1579 title = {FME '93: Industrial-Strength Formal Methods},
1580 booktitle = {FME '93: Industrial-Strength Formal Methods},
1582 publisher = Springer,
1586 @Proceedings{tphols96,
1587 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1588 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1589 editor = {J. von Wright and J. Grundy and J. Harrison},
1590 publisher = Springer,
1595 @Proceedings{tphols97,
1596 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1597 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1598 editor = {Elsa L. Gunter and Amy Felty},
1599 publisher = Springer,
1604 @Proceedings{tphols98,
1605 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1606 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1607 editor = {Jim Grundy and Malcom Newey},
1608 publisher = Springer,
1613 @Proceedings{tphols99,
1614 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1615 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1616 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1617 Paulin, C. and Thery, L.},
1618 publisher = Springer,
1623 @Proceedings{tphols2000,
1624 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1625 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1626 editor = {J. Harrison and M. Aagaard},
1627 publisher = Springer,
1632 @Proceedings{tphols2001,
1633 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1634 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1635 editor = {R. J. Boulton and P. B. Jackson},
1636 publisher = Springer,
1641 @Proceedings{ijcar2006,
1642 title = {Automated Reasoning: {IJCAR} 2006},
1643 booktitle = {Automated Reasoning: {IJCAR} 2006},
1644 editor = {U. Furbach and N. Shankar},
1645 publisher = Springer,
1650 @Proceedings{tphols2007,
1651 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1652 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1653 editor = {K. Schneider and J. Brandt},
1654 publisher = Springer,
1659 @Proceedings{tphols2008,
1660 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1661 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1662 publisher = Springer,
1668 @unpublished{classes_modules,
1669 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1670 author = {Stefan Wehr et. al.}