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 @manual{isabelle-classes,
445 author = {Florian Haftmann},
446 title = {Haskell-style type classes with {Isabelle}/{Isar}},
448 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}}
450 @manual{isabelle-codegen,
451 author = {Florian Haftmann},
452 title = {Code generation from Isabelle theories},
454 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}}
457 author = {Paul R. Halmos},
458 title = {Naive Set Theory},
459 publisher = {Van Nostrand},
462 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
463 title={Dynamic Logic},publisher=MIT,year=2000}
466 author = {Matthew Hennessy},
467 title = {The Semantics of Programming Languages: An Elementary
468 Introduction Using Structural Operational Semantics},
472 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
473 title={Introduction to Automata Theory, Languages, and Computation.},
474 publisher={Addison-Wesley},year=1979}
476 @Article{haskell-report,
477 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
478 title = {Report on the Programming Language {Haskell}: A
479 Non-strict, Purely Functional Language},
485 note = {Version 1.2}}
487 @Article{haskell-tutorial,
488 author = {Paul Hudak and Joseph H. Fasel},
489 title = {A Gentle Introduction to {Haskell}},
496 @book{Hudak-Haskell,author={Paul Hudak},
497 title={The Haskell School of Expression},publisher=CUP,year=2000}
500 author = {G. P. Huet},
501 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
508 author = {G. P. Huet and B. Lang},
509 title = {Proving and Applying Program Transformations Expressed with
510 Second-Order Patterns},
516 @inproceedings{huet88,
517 author = {G{\'e}rard Huet},
518 title = {Induction Principles Formalized in the {Calculus of
520 booktitle = {Programming of Future Generation Computers},
521 editor = {K. Fuchi and M. Nivat},
524 publisher = {Elsevier}}
526 @Book{Huth-Ryan-book,
527 author = {Michael Huth and Mark Ryan},
528 title = {Logic in Computer Science. Modelling and reasoning about systems},
532 @InProceedings{Harrison:1996:MizarHOL,
533 author = {J. Harrison},
534 title = {A {Mizar} Mode for {HOL}},
536 crossref = {tphols96}}
540 @article{haskell-revised-report,
541 author = {Simon {Peyton Jones} and others},
542 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
543 journal = {Journal of Functional Programming},
549 note = {\url{http://www.haskell.org/definition/}}}
553 @InProceedings{kammueller-locales,
554 author = {Florian Kamm{\"u}ller and Markus Wenzel and
555 Lawrence C. Paulson},
556 title = {Locales: A Sectioning Concept for {Isabelle}},
557 crossref = {tphols99}}
560 author={Donald E. Knuth},
561 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
562 publisher={Addison-Wesley},
566 author = {R. E. Korf},
567 title = {Depth-First Iterative-Deepening: an Optimal Admissible
574 @InProceedings{krauss2006,
575 author = {Alexander Krauss},
576 title = {Partial Recursive Functions in {Higher-Order Logic}},
577 crossref = {ijcar2006},
581 author = {Kenneth Kunen},
582 title = {Set Theory: An Introduction to Independence Proofs},
589 author = {Xavier Leroy and others},
590 title = {The Objective Caml system -- Documentation and user's manual},
591 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
593 @InProceedings{lowe-fdr,
594 author = {Gavin Lowe},
595 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
596 Protocol using {CSP} and {FDR}},
597 booktitle = {Tools and Algorithms for the Construction and Analysis
598 of Systems: second international workshop, TACAS '96},
599 editor = {T. Margaria and B. Steffen},
600 series = {LNCS 1055},
602 publisher = {Springer},
608 author = {Zohar Manna and Richard Waldinger},
609 title = {Deductive Synthesis of the Unification Algorithm},
616 @InProceedings{martin-nipkow,
617 author = {Ursula Martin and Tobias Nipkow},
618 title = {Ordered Rewriting and Confluence},
623 author = {Per Martin-L{\"o}f},
624 title = {Intuitionistic type theory},
626 publisher = {Bibliopolis}}
628 @incollection{melham89,
629 author = {Thomas F. Melham},
630 title = {Automating Recursive Type Definitions in Higher Order
633 crossref = {birtwistle89}}
635 @Article{miller-mixed,
636 Author = {Dale Miller},
637 Title = {Unification Under a Mixed Prefix},
645 author = {Robin Milner},
646 title = {A Theory of Type Polymorphism in Programming},
647 journal = "J. Comp.\ Sys.\ Sci.",
652 @TechReport{milner-ind,
653 author = {Robin Milner},
654 title = {How to Derive Inductions in {LCF}},
655 institution = Edinburgh,
659 @Article{milner-coind,
660 author = {Robin Milner and Mads Tofte},
661 title = {Co-induction in Relational Semantics},
668 author = {Robin Milner},
669 title = {Communication and Concurrency},
670 publisher = Prentice,
673 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
674 title="The Definition of Standard ML",publisher=MIT,year=1990}
676 @PhdThesis{monahan84,
677 author = {Brian Q. Monahan},
678 title = {Data Type Proofs using Edinburgh {LCF}},
679 school = {University of Edinburgh},
682 @article{MuellerNvOS99,
684 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
685 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
687 @Manual{Muzalewski:Mizar,
688 title = {An Outline of {PC} {Mizar}},
689 author = {Micha{\l} Muzalewski},
690 organization = {Fondation of Logic, Mathematics and Informatics
691 --- Mizar Users Group},
693 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
698 @InProceedings{NaraschewskiW-TPHOLs98,
699 author = {Wolfgang Naraschewski and Markus Wenzel},
701 {Object-Oriented Verification based on Record Subtyping in
703 crossref = {tphols98}}
705 @inproceedings{nazareth-nipkow,
706 author = {Dieter Nazareth and Tobias Nipkow},
707 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
708 crossref = {tphols96},
712 @Article{needham-schroeder,
713 author = "Roger M. Needham and Michael D. Schroeder",
714 title = "Using Encryption for Authentication in Large Networks
723 @inproceedings{nipkow-W,
724 author = {Wolfgang Naraschewski and Tobias Nipkow},
725 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
726 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
727 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
728 publisher = Springer,
734 @InCollection{nipkow-sorts93,
735 author = {T. Nipkow},
736 title = {Order-Sorted Polymorphism in {Isabelle}},
737 booktitle = {Logical Environments},
740 editor = {G. Huet and G. Plotkin},
744 @Misc{nipkow-types93,
745 author = {Tobias Nipkow},
746 title = {Axiomatic Type Classes (in {I}sabelle)},
747 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
751 @inproceedings{Nipkow-CR,
752 author = {Tobias Nipkow},
753 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
754 booktitle = {Automated Deduction --- CADE-13},
755 editor = {M. McRobbie and J.K. Slaney},
756 publisher = Springer,
763 @InProceedings{nipkow-patterns,
764 title = {Functional Unification of Higher-Order Patterns},
765 author = {Tobias Nipkow},
768 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
769 keywords = {unification}}
772 author = {Tobias Nipkow},
773 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
779 @inproceedings{Nipkow-TYPES02,
780 author = {Tobias Nipkow},
781 title = {{Structured Proofs in Isar/HOL}},
782 booktitle = {Types for Proofs and Programs (TYPES 2002)},
783 editor = {H. Geuvers and F. Wiedijk},
785 publisher = Springer,
790 @manual{isabelle-HOL,
791 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
792 title = {{Isabelle}'s Logics: {HOL}},
793 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
794 M{\"u}nchen and Computer Laboratory, University of Cambridge},
795 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
797 @article{nipkow-prehofer,
798 author = {Tobias Nipkow and Christian Prehofer},
799 title = {Type Reconstruction for Type Classes},
807 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
808 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
809 publisher = {Springer},
811 note = {LNCS Tutorial 2283}}
814 author = {Philippe No{\"e}l},
815 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
823 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
824 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
826 publisher = {Oxford University Press},
831 @Manual{pvs-language,
832 title = {The {PVS} specification language},
833 author = {S. Owre and N. Shankar and J. M. Rushby},
834 organization = {Computer Science Laboratory, SRI International},
835 address = {Menlo Park, CA},
836 note = {Beta release},
839 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
844 @InProceedings{paulin-tlca,
845 author = {Christine Paulin-Mohring},
846 title = {Inductive Definitions in the System {Coq}: Rules and
851 @InProceedings{paulson-CADE,
852 author = {Lawrence C. Paulson},
853 title = {A Fixedpoint Approach to Implementing (Co)Inductive
858 @InProceedings{paulson-COLOG,
859 author = {Lawrence C. Paulson},
860 title = {A Formulation of the Simple Theory of Types (for
863 crossref = {colog88},
864 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
866 @Article{paulson-coind,
867 author = {Lawrence C. Paulson},
868 title = {Mechanizing Coinduction and Corecursion in Higher-Order
877 @manual{isabelle-intro,
878 author = {Lawrence C. Paulson},
879 title = {Introduction to {Isabelle}},
881 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
883 @manual{isabelle-logics,
884 author = {Lawrence C. Paulson},
885 title = {{Isabelle's} Logics},
887 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
889 @manual{isabelle-ref,
890 author = {Lawrence C. Paulson},
891 title = {The {Isabelle} Reference Manual},
893 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
896 author = {Lawrence C. Paulson},
897 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
899 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
901 @article{paulson-found,
902 author = {Lawrence C. Paulson},
903 title = {The Foundation of a Generic Theorem Prover},
909 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
911 %replaces paulson-final
912 @Article{paulson-mscs,
913 author = {Lawrence C. Paulson},
914 title = {Final Coalgebras as Greatest Fixed Points
916 journal = {Mathematical Structures in Computer Science},
921 @InCollection{paulson-generic,
922 author = {Lawrence C. Paulson},
923 title = {Generic Automatic Proof Tools},
924 crossref = {wos-fest},
928 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
929 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
938 @InCollection{paulson-fixedpt-milner,
939 author = {Lawrence C. Paulson},
940 title = {A Fixedpoint Approach to (Co)inductive and
941 (Co)datatype Definitions},
943 crossref = {milner-fest}}
946 title = {Proof, Language, and Interaction:
947 Essays in Honor of {Robin Milner}},
948 booktitle = {Proof, Language, and Interaction:
949 Essays in Honor of {Robin Milner}},
950 publisher = {MIT Press},
952 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
954 @InCollection{paulson-handbook,
955 author = {Lawrence C. Paulson},
956 title = {Designing a Theorem Prover},
957 crossref = {handbk-lics2},
960 @Book{paulson-isa-book,
961 author = {Lawrence C. Paulson},
962 title = {Isabelle: A Generic Theorem Prover},
963 publisher = {Springer},
967 @Book{isabelle-hol-book,
968 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
969 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
970 publisher = {Springer},
974 @InCollection{paulson-markt,
975 author = {Lawrence C. Paulson},
976 title = {Tool Support for Logics of Programs},
977 booktitle = {Mathematical Methods in Program Development:
978 Summer School Marktoberdorf 1996},
979 publisher = {Springer},
981 year = {Published 1997},
982 editor = {Manfred Broy},
983 series = {NATO ASI Series F}}
985 %replaces Paulson-ML and paulson91
987 author = {Lawrence C. Paulson},
988 title = {{ML} for the Working Programmer},
993 @article{paulson-natural,
994 author = {Lawrence C. Paulson},
995 title = {Natural Deduction as Higher-order Resolution},
1000 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1002 @Article{paulson-set-I,
1003 author = {Lawrence C. Paulson},
1004 title = {Set Theory for Verification: {I}. {From}
1005 Foundations to Functions},
1011 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1013 @Article{paulson-set-II,
1014 author = {Lawrence C. Paulson},
1015 title = {Set Theory for Verification: {II}. {Induction} and
1022 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1025 author = {Lawrence C. Paulson},
1026 title = {Verifying the Unification Algorithm in {LCF}},
1032 %replaces Paulson-LCF
1034 author = {Lawrence C. Paulson},
1035 title = {Logic and Computation: Interactive proof with Cambridge
1040 @incollection{paulson700,
1041 author = {Lawrence C. Paulson},
1042 title = {{Isabelle}: The Next 700 Theorem Provers},
1043 crossref = {odifreddi90},
1045 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1047 % replaces paulson-ns and paulson-security
1048 @Article{paulson-jcs,
1049 author = {Lawrence C. Paulson},
1050 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1056 @Article{paulson-tls,
1057 author = {Lawrence C. Paulson},
1058 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1066 @Article{paulson-yahalom,
1067 author = {Lawrence C. Paulson},
1068 title = {Relations Between Secrets:
1069 Two Formal Analyses of the {Yahalom} Protocol},
1073 @article{pelletier86,
1074 author = {F. J. Pelletier},
1075 title = {Seventy-five Problems for Testing Automatic Theorem
1081 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1084 author = {Andrew M. Pitts},
1085 title = {A Co-induction Principle for Recursively Defined Domains},
1091 @Article{plaisted90,
1092 author = {David A. Plaisted},
1093 title = {A Sequent-Style Model Elimination Strategy and a Positive
1104 author = {Art Quaife},
1105 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1115 @TechReport{rasmussen95,
1116 author = {Ole Rasmussen},
1117 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1119 institution = {Computer Laboratory, University of Cambridge},
1123 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1126 author = {Steve Reeves and Michael Clarke},
1127 title = {Logic for Computer Science},
1128 publisher = {Addison-Wesley},
1131 @book{Rosen-DMA,author={Kenneth H. Rosen},
1132 title={Discrete Mathematics and Its Applications},
1133 publisher={McGraw-Hill},year=1998}
1135 @InProceedings{Rudnicki:1992:MizarOverview,
1136 author = {P. Rudnicki},
1137 title = {An Overview of the {MIZAR} Project},
1138 booktitle = {1992 Workshop on Types for Proofs and Programs},
1140 organization = {Chalmers University of Technology},
1141 publisher = {Bastad}
1146 @inproceedings{saaltink-fme,
1147 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1148 Dan Craigen and Irwin Meisels},
1149 title = {An {EVES} Data Abstraction Example},
1153 @inproceedings{slind-tfl,
1154 author = {Konrad Slind},
1155 title = {Function Definition in Higher Order Logic},
1156 crossref = {tphols96},
1160 author = {Patrick Suppes},
1161 title = {Axiomatic Set Theory},
1163 publisher = {Dover}}
1165 @InCollection{szasz93,
1166 author = {Nora Szasz},
1167 title = {A Machine Checked Proof that {Ackermann's} Function is not
1168 Primitive Recursive},
1169 crossref = {huet-plotkin93},
1172 @TechReport{Syme:1997:DECLARE,
1174 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1175 institution = {University of Cambridge Computer Laboratory},
1180 @PhdThesis{Syme:1998:thesis,
1182 title = {Declarative Theorem Proving for Operational Semantics},
1183 school = {University of Cambridge},
1188 @InProceedings{Syme:1999:TPHOL,
1190 title = {Three Tactic Theorem Proving},
1191 crossref = {tphols99}}
1196 author = {G. Takeuti},
1197 title = {Proof Theory},
1203 author = {Simon Thompson},
1204 title = {Type Theory and Functional Programming},
1205 publisher = {Addison-Wesley},
1208 @book{Thompson-Haskell,author={Simon Thompson},
1209 title={Haskell: The Craft of Functional Programming},
1210 publisher={Addison-Wesley},year=1999}
1212 @Unpublished{Trybulec:1993:MizarFeatures,
1213 author = {A. Trybulec},
1214 title = {Some Features of the {Mizar} Language},
1215 note = {Presented at a workshop in Turin, Italy},
1221 @Unpublished{voelker94,
1222 author = {Norbert V{\"o}lker},
1223 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1224 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1231 author = {Christoph Wedler},
1232 title = {Emacs package ``{X-Symbol}''},
1233 note = {\url{http://x-symbol.sourceforge.net}}
1236 @manual{isabelle-sys,
1237 author = {Markus Wenzel and Stefan Berghofer},
1238 title = {The {Isabelle} System Manual},
1239 institution = {TU Munich},
1240 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1242 @manual{isabelle-isar-ref,
1243 author = {Markus Wenzel},
1244 title = {The {Isabelle/Isar} Reference Manual},
1245 institution = {TU Munich},
1246 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1248 @manual{isabelle-axclass,
1249 author = {Markus Wenzel},
1250 title = {Using Axiomatic Type Classes in {I}sabelle},
1251 institution = {TU Munich},
1253 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1256 @InProceedings{Wenzel:1999:TPHOL,
1257 author = {Markus Wenzel},
1258 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1259 crossref = {tphols99}}
1261 @InProceedings{Wenzel:1997:TPHOL,
1262 author = {Markus Wenzel},
1263 title = {Type Classes and Overloading in Higher-Order Logic},
1264 crossref = {tphols97}}
1266 @phdthesis{Wenzel-PhD,
1267 author={Markus Wenzel},
1268 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1269 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1271 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1274 author = {A. N. Whitehead and B. Russell},
1275 title = {Principia Mathematica},
1278 note = {Paperback edition to *56,
1279 abridged from the 2nd edition (1927)}}
1281 @Misc{Wiedijk:1999:Mizar,
1282 author = {Freek Wiedijk},
1283 title = {Mizar: An Impression},
1284 howpublished = {Unpublished paper},
1286 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1289 @Misc{Wiedijk:2000:MV,
1290 author = {Freek Wiedijk},
1291 title = {The Mathematical Vernacular},
1292 howpublished = {Unpublished paper},
1294 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1298 author = {Glynn Winskel},
1299 title = {The Formal Semantics of Programming Languages},
1300 publisher = MIT,year=1993}
1302 @InCollection{wos-bledsoe,
1303 author = {Larry Wos},
1304 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1305 crossref = {bledsoe-fest},
1308 @InProceedings{Zammit:1999:TPHOL,
1309 author = {Vincent Zammit},
1310 title = {On the Implementation of an Extensible Declarative Proof Language},
1311 crossref = {tphols99}}
1319 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1320 title = {Handbook of Logic in Computer Science},
1321 booktitle = {Handbook of Logic in Computer Science},
1322 publisher = {Oxford University Press},
1327 editor = {Henk Barendregt and Tobias Nipkow},
1328 title = TYPES # {: International Workshop {TYPES '93}},
1329 booktitle = TYPES # {: International Workshop {TYPES '93}},
1330 year = {published 1994},
1331 publisher = {Springer},
1332 series = {LNCS 806}}
1334 @book{barwise-handbk,
1335 editor = {J. Barwise},
1336 title = {Handbook of Mathematical Logic},
1337 booktitle = {Handbook of Mathematical Logic},
1341 @Proceedings{tlca93,
1342 title = {Typed Lambda Calculi and Applications},
1343 booktitle = {Typed Lambda Calculi and Applications},
1344 editor = {M. Bezem and J.F. Groote},
1346 publisher = {Springer},
1347 series = {LNCS 664}}
1350 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1351 title = {Current Trends in Hardware Verification and Automated
1353 booktitle = {Current Trends in Hardware Verification and Automated
1355 publisher = {Springer},
1359 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1360 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1361 publisher = {Kluwer Academic Publishers},
1363 editor = {Robert S. Boyer}}
1365 @Proceedings{cade12,
1366 editor = {Alan Bundy},
1367 title = {Automated Deduction --- {CADE}-12
1368 International Conference},
1369 booktitle = {Automated Deduction --- {CADE}-12
1370 International Conference},
1372 series = {LNAI 814},
1373 publisher = {Springer}}
1376 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1377 title = TYPES # {: International Workshop {TYPES '94}},
1378 booktitle = TYPES # {: International Workshop {TYPES '94}},
1380 publisher = {Springer},
1381 series = {LNCS 996}}
1383 @book{huet-plotkin91,
1384 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1385 title = {Logical Frameworks},
1386 booktitle = {Logical Frameworks},
1390 @book{huet-plotkin93,
1391 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1392 title = {Logical Environments},
1393 booktitle = {Logical Environments},
1398 editor = {J. Joyce and C. Seger},
1399 title = {Higher Order Logic Theorem Proving and Its
1400 Applications: HUG '93},
1401 booktitle = {Higher Order Logic Theorem Proving and Its
1402 Applications: HUG '93},
1403 year = {Published 1994},
1404 publisher = {Springer},
1405 series = {LNCS 780}}
1407 @proceedings{colog88,
1408 editor = {P. Martin-L{\"o}f and G. Mints},
1409 title = {COLOG-88: International Conference on Computer Logic},
1410 booktitle = {COLOG-88: International Conference on Computer Logic},
1411 year = {Published 1990},
1412 publisher = {Springer},
1413 organization = {Estonian Academy of Sciences},
1414 address = {Tallinn},
1415 series = {LNCS 417}}
1418 editor = {P. Odifreddi},
1419 title = {Logic and Computer Science},
1420 booktitle = {Logic and Computer Science},
1421 publisher = {Academic Press},
1424 @proceedings{extensions91,
1425 editor = {Peter Schroeder-Heister},
1426 title = {Extensions of Logic Programming},
1427 booktitle = {Extensions of Logic Programming},
1429 series = {LNAI 475},
1430 publisher = {Springer}}
1432 @proceedings{cade10,
1433 editor = {Mark E. Stickel},
1434 title = {10th } # CADE,
1435 booktitle = {10th } # CADE,
1437 publisher = {Springer},
1438 series = {LNAI 449}}
1441 editor = {M. Vardi},
1442 title = {Eighth Annual Symposium on Logic in Computer Science},
1443 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1448 title = {Automated Reasoning and its Applications:
1449 Essays in Honor of {Larry Wos}},
1450 booktitle = {Automated Reasoning and its Applications:
1451 Essays in Honor of {Larry Wos}},
1452 publisher = {MIT Press},
1454 editor = {Robert Veroff}}
1457 editor = {J. C. P. Woodcock and P. G. Larsen},
1458 title = {FME '93: Industrial-Strength Formal Methods},
1459 booktitle = {FME '93: Industrial-Strength Formal Methods},
1461 publisher = Springer,
1465 @Proceedings{tphols96,
1466 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1467 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1468 editor = {J. von Wright and J. Grundy and J. Harrison},
1469 publisher = Springer,
1474 @Proceedings{tphols97,
1475 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1476 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1477 editor = {Elsa L. Gunter and Amy Felty},
1478 publisher = Springer,
1483 @Proceedings{tphols98,
1484 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1485 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1486 editor = {Jim Grundy and Malcom Newey},
1487 publisher = Springer,
1492 @Proceedings{tphols99,
1493 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1494 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1495 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1496 Paulin, C. and Thery, L.},
1497 publisher = Springer,
1502 @Proceedings{tphols2000,
1503 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1504 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1505 editor = {J. Harrison and M. Aagaard},
1506 publisher = Springer,
1511 @Proceedings{tphols2001,
1512 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1513 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1514 editor = {R. J. Boulton and P. B. Jackson},
1515 publisher = Springer,
1520 @Proceedings{ijcar2006,
1521 title = {Automated Reasoning: {IJCAR} 2006},
1522 booktitle = {Automated Reasoning: {IJCAR} 2006},
1523 editor = {U. Furbach and N. Shankar},
1524 publisher = Springer,
1529 @unpublished{classes_modules,
1530 title = {ML Modules and Haskell Type Classes: A Constructive Comparison},
1531 author = {Stefan Wehr et. al.}