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}},
451 @manual{isabelle-classes,
452 author = {Florian Haftmann},
453 title = {Haskell-style type classes with {Isabelle}/{Isar}},
455 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}}
457 @manual{isabelle-codegen,
458 author = {Florian Haftmann},
459 title = {Code generation from Isabelle theories},
461 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}}
464 author = {Paul R. Halmos},
465 title = {Naive Set Theory},
466 publisher = {Van Nostrand},
469 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
470 title={Dynamic Logic},publisher=MIT,year=2000}
473 author = {Matthew Hennessy},
474 title = {The Semantics of Programming Languages: An Elementary
475 Introduction Using Structural Operational Semantics},
479 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
480 title={Introduction to Automata Theory, Languages, and Computation.},
481 publisher={Addison-Wesley},year=1979}
483 @Article{haskell-report,
484 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
485 title = {Report on the Programming Language {Haskell}: A
486 Non-strict, Purely Functional Language},
492 note = {Version 1.2}}
494 @Article{haskell-tutorial,
495 author = {Paul Hudak and Joseph H. Fasel},
496 title = {A Gentle Introduction to {Haskell}},
503 @book{Hudak-Haskell,author={Paul Hudak},
504 title={The Haskell School of Expression},publisher=CUP,year=2000}
507 author = {G. P. Huet},
508 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
515 author = {G. P. Huet and B. Lang},
516 title = {Proving and Applying Program Transformations Expressed with
517 Second-Order Patterns},
523 @inproceedings{huet88,
524 author = {G{\'e}rard Huet},
525 title = {Induction Principles Formalized in the {Calculus of
527 booktitle = {Programming of Future Generation Computers},
528 editor = {K. Fuchi and M. Nivat},
531 publisher = {Elsevier}}
533 @Book{Huth-Ryan-book,
534 author = {Michael Huth and Mark Ryan},
535 title = {Logic in Computer Science. Modelling and reasoning about systems},
539 @InProceedings{Harrison:1996:MizarHOL,
540 author = {J. Harrison},
541 title = {A {Mizar} Mode for {HOL}},
543 crossref = {tphols96}}
547 @article{haskell-revised-report,
548 author = {Simon {Peyton Jones} and others},
549 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
550 journal = {Journal of Functional Programming},
556 note = {\url{http://www.haskell.org/definition/}}}
560 @InProceedings{kammueller-locales,
561 author = {Florian Kamm{\"u}ller and Markus Wenzel and
562 Lawrence C. Paulson},
563 title = {Locales: A Sectioning Concept for {Isabelle}},
564 crossref = {tphols99}}
567 author={Donald E. Knuth},
568 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
569 publisher={Addison-Wesley},
573 author = {R. E. Korf},
574 title = {Depth-First Iterative-Deepening: an Optimal Admissible
581 @InProceedings{krauss2006,
582 author = {Alexander Krauss},
583 title = {Partial Recursive Functions in {Higher-Order Logic}},
584 crossref = {ijcar2006},
588 author = {Kenneth Kunen},
589 title = {Set Theory: An Introduction to Independence Proofs},
596 author = {Xavier Leroy and others},
597 title = {The Objective Caml system -- Documentation and user's manual},
598 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
600 @InProceedings{lowe-fdr,
601 author = {Gavin Lowe},
602 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
603 Protocol using {CSP} and {FDR}},
604 booktitle = {Tools and Algorithms for the Construction and Analysis
605 of Systems: second international workshop, TACAS '96},
606 editor = {T. Margaria and B. Steffen},
607 series = {LNCS 1055},
609 publisher = {Springer},
615 author = {Zohar Manna and Richard Waldinger},
616 title = {Deductive Synthesis of the Unification Algorithm},
623 @InProceedings{martin-nipkow,
624 author = {Ursula Martin and Tobias Nipkow},
625 title = {Ordered Rewriting and Confluence},
630 author = {Per Martin-L{\"o}f},
631 title = {Intuitionistic type theory},
633 publisher = {Bibliopolis}}
635 @incollection{melham89,
636 author = {Thomas F. Melham},
637 title = {Automating Recursive Type Definitions in Higher Order
640 crossref = {birtwistle89}}
642 @Article{miller-mixed,
643 Author = {Dale Miller},
644 Title = {Unification Under a Mixed Prefix},
652 author = {Robin Milner},
653 title = {A Theory of Type Polymorphism in Programming},
654 journal = "J. Comp.\ Sys.\ Sci.",
659 @TechReport{milner-ind,
660 author = {Robin Milner},
661 title = {How to Derive Inductions in {LCF}},
662 institution = Edinburgh,
666 @Article{milner-coind,
667 author = {Robin Milner and Mads Tofte},
668 title = {Co-induction in Relational Semantics},
675 author = {Robin Milner},
676 title = {Communication and Concurrency},
677 publisher = Prentice,
680 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
681 title="The Definition of Standard ML",publisher=MIT,year=1990}
683 @PhdThesis{monahan84,
684 author = {Brian Q. Monahan},
685 title = {Data Type Proofs using Edinburgh {LCF}},
686 school = {University of Edinburgh},
689 @article{MuellerNvOS99,
691 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
692 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
694 @Manual{Muzalewski:Mizar,
695 title = {An Outline of {PC} {Mizar}},
696 author = {Micha{\l} Muzalewski},
697 organization = {Fondation of Logic, Mathematics and Informatics
698 --- Mizar Users Group},
700 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
705 @InProceedings{NaraschewskiW-TPHOLs98,
706 author = {Wolfgang Naraschewski and Markus Wenzel},
708 {Object-Oriented Verification based on Record Subtyping in
710 crossref = {tphols98}}
712 @inproceedings{nazareth-nipkow,
713 author = {Dieter Nazareth and Tobias Nipkow},
714 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
715 crossref = {tphols96},
719 @Article{needham-schroeder,
720 author = "Roger M. Needham and Michael D. Schroeder",
721 title = "Using Encryption for Authentication in Large Networks
730 @inproceedings{nipkow-W,
731 author = {Wolfgang Naraschewski and Tobias Nipkow},
732 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
733 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
734 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
735 publisher = Springer,
741 @InCollection{nipkow-sorts93,
742 author = {T. Nipkow},
743 title = {Order-Sorted Polymorphism in {Isabelle}},
744 booktitle = {Logical Environments},
747 editor = {G. Huet and G. Plotkin},
751 @Misc{nipkow-types93,
752 author = {Tobias Nipkow},
753 title = {Axiomatic Type Classes (in {I}sabelle)},
754 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
758 @inproceedings{Nipkow-CR,
759 author = {Tobias Nipkow},
760 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
761 booktitle = {Automated Deduction --- CADE-13},
762 editor = {M. McRobbie and J.K. Slaney},
763 publisher = Springer,
770 @InProceedings{nipkow-patterns,
771 title = {Functional Unification of Higher-Order Patterns},
772 author = {Tobias Nipkow},
775 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
776 keywords = {unification}}
779 author = {Tobias Nipkow},
780 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
786 @inproceedings{Nipkow-TYPES02,
787 author = {Tobias Nipkow},
788 title = {{Structured Proofs in Isar/HOL}},
789 booktitle = {Types for Proofs and Programs (TYPES 2002)},
790 editor = {H. Geuvers and F. Wiedijk},
792 publisher = Springer,
797 @manual{isabelle-HOL,
798 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
799 title = {{Isabelle}'s Logics: {HOL}},
800 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
801 M{\"u}nchen and Computer Laboratory, University of Cambridge},
802 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
804 @article{nipkow-prehofer,
805 author = {Tobias Nipkow and Christian Prehofer},
806 title = {Type Reconstruction for Type Classes},
813 @InProceedings{Nipkow-Prehofer:1993,
814 author = {T. Nipkow and C. Prehofer},
815 title = {Type checking type classes},
816 booktitle = {ACM Symp.\ Principles of Programming Languages},
821 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
822 title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
823 publisher = {Springer},
825 note = {LNCS Tutorial 2283}}
828 author = {Philippe No{\"e}l},
829 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
837 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
838 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
840 publisher = {Oxford University Press},
845 @Manual{pvs-language,
846 title = {The {PVS} specification language},
847 author = {S. Owre and N. Shankar and J. M. Rushby},
848 organization = {Computer Science Laboratory, SRI International},
849 address = {Menlo Park, CA},
850 note = {Beta release},
853 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
858 @InProceedings{paulin-tlca,
859 author = {Christine Paulin-Mohring},
860 title = {Inductive Definitions in the System {Coq}: Rules and
865 @InProceedings{paulson-CADE,
866 author = {Lawrence C. Paulson},
867 title = {A Fixedpoint Approach to Implementing (Co)Inductive
872 @InProceedings{paulson-COLOG,
873 author = {Lawrence C. Paulson},
874 title = {A Formulation of the Simple Theory of Types (for
877 crossref = {colog88},
878 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
880 @Article{paulson-coind,
881 author = {Lawrence C. Paulson},
882 title = {Mechanizing Coinduction and Corecursion in Higher-Order
891 @manual{isabelle-intro,
892 author = {Lawrence C. Paulson},
893 title = {Introduction to {Isabelle}},
895 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
897 @manual{isabelle-logics,
898 author = {Lawrence C. Paulson},
899 title = {{Isabelle's} Logics},
901 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
903 @manual{isabelle-ref,
904 author = {Lawrence C. Paulson},
905 title = {The {Isabelle} Reference Manual},
907 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
910 author = {Lawrence C. Paulson},
911 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
913 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
915 @article{paulson-found,
916 author = {Lawrence C. Paulson},
917 title = {The Foundation of a Generic Theorem Prover},
923 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
925 %replaces paulson-final
926 @Article{paulson-mscs,
927 author = {Lawrence C. Paulson},
928 title = {Final Coalgebras as Greatest Fixed Points
930 journal = {Mathematical Structures in Computer Science},
936 @InCollection{paulson-generic,
937 author = {Lawrence C. Paulson},
938 title = {Generic Automatic Proof Tools},
939 crossref = {wos-fest},
943 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
944 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
953 @InCollection{paulson-fixedpt-milner,
954 author = {Lawrence C. Paulson},
955 title = {A Fixedpoint Approach to (Co)inductive and
956 (Co)datatype Definitions},
958 crossref = {milner-fest}}
961 title = {Proof, Language, and Interaction:
962 Essays in Honor of {Robin Milner}},
963 booktitle = {Proof, Language, and Interaction:
964 Essays in Honor of {Robin Milner}},
965 publisher = {MIT Press},
967 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
969 @InCollection{paulson-handbook,
970 author = {Lawrence C. Paulson},
971 title = {Designing a Theorem Prover},
972 crossref = {handbk-lics2},
975 @Book{paulson-isa-book,
976 author = {Lawrence C. Paulson},
977 title = {Isabelle: A Generic Theorem Prover},
978 publisher = {Springer},
982 @Book{isabelle-hol-book,
983 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
984 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
985 publisher = {Springer},
989 @InCollection{paulson-markt,
990 author = {Lawrence C. Paulson},
991 title = {Tool Support for Logics of Programs},
992 booktitle = {Mathematical Methods in Program Development:
993 Summer School Marktoberdorf 1996},
994 publisher = {Springer},
996 year = {Published 1997},
997 editor = {Manfred Broy},
998 series = {NATO ASI Series F}}
1000 %replaces Paulson-ML and paulson91
1002 author = {Lawrence C. Paulson},
1003 title = {{ML} for the Working Programmer},
1008 @article{paulson-natural,
1009 author = {Lawrence C. Paulson},
1010 title = {Natural Deduction as Higher-order Resolution},
1015 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1017 @Article{paulson-set-I,
1018 author = {Lawrence C. Paulson},
1019 title = {Set Theory for Verification: {I}. {From}
1020 Foundations to Functions},
1026 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1028 @Article{paulson-set-II,
1029 author = {Lawrence C. Paulson},
1030 title = {Set Theory for Verification: {II}. {Induction} and
1037 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1040 author = {Lawrence C. Paulson},
1041 title = {Verifying the Unification Algorithm in {LCF}},
1047 %replaces Paulson-LCF
1049 author = {Lawrence C. Paulson},
1050 title = {Logic and Computation: Interactive proof with Cambridge
1055 @incollection{paulson700,
1056 author = {Lawrence C. Paulson},
1057 title = {{Isabelle}: The Next 700 Theorem Provers},
1058 crossref = {odifreddi90},
1060 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1062 % replaces paulson-ns and paulson-security
1063 @Article{paulson-jcs,
1064 author = {Lawrence C. Paulson},
1065 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1071 @Article{paulson-tls,
1072 author = {Lawrence C. Paulson},
1073 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1081 @Article{paulson-yahalom,
1082 author = {Lawrence C. Paulson},
1083 title = {Relations Between Secrets:
1084 Two Formal Analyses of the {Yahalom} Protocol},
1091 @article{pelletier86,
1092 author = {F. J. Pelletier},
1093 title = {Seventy-five Problems for Testing Automatic Theorem
1099 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1102 author = {Andrew M. Pitts},
1103 title = {A Co-induction Principle for Recursively Defined Domains},
1109 @Article{plaisted90,
1110 author = {David A. Plaisted},
1111 title = {A Sequent-Style Model Elimination Strategy and a Positive
1122 author = {Art Quaife},
1123 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1133 @TechReport{rasmussen95,
1134 author = {Ole Rasmussen},
1135 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1137 institution = {Computer Laboratory, University of Cambridge},
1141 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1144 author = {Steve Reeves and Michael Clarke},
1145 title = {Logic for Computer Science},
1146 publisher = {Addison-Wesley},
1149 @book{Rosen-DMA,author={Kenneth H. Rosen},
1150 title={Discrete Mathematics and Its Applications},
1151 publisher={McGraw-Hill},year=1998}
1153 @InProceedings{Rudnicki:1992:MizarOverview,
1154 author = {P. Rudnicki},
1155 title = {An Overview of the {MIZAR} Project},
1156 booktitle = {1992 Workshop on Types for Proofs and Programs},
1158 organization = {Chalmers University of Technology},
1159 publisher = {Bastad}
1164 @inproceedings{saaltink-fme,
1165 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1166 Dan Craigen and Irwin Meisels},
1167 title = {An {EVES} Data Abstraction Example},
1171 @inproceedings{slind-tfl,
1172 author = {Konrad Slind},
1173 title = {Function Definition in Higher Order Logic},
1174 crossref = {tphols96},
1178 author = {Patrick Suppes},
1179 title = {Axiomatic Set Theory},
1181 publisher = {Dover}}
1183 @InCollection{szasz93,
1184 author = {Nora Szasz},
1185 title = {A Machine Checked Proof that {Ackermann's} Function is not
1186 Primitive Recursive},
1187 crossref = {huet-plotkin93},
1190 @TechReport{Syme:1997:DECLARE,
1192 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1193 institution = {University of Cambridge Computer Laboratory},
1198 @PhdThesis{Syme:1998:thesis,
1200 title = {Declarative Theorem Proving for Operational Semantics},
1201 school = {University of Cambridge},
1206 @InProceedings{Syme:1999:TPHOL,
1208 title = {Three Tactic Theorem Proving},
1209 crossref = {tphols99}}
1214 author = {G. Takeuti},
1215 title = {Proof Theory},
1221 author = {Simon Thompson},
1222 title = {Type Theory and Functional Programming},
1223 publisher = {Addison-Wesley},
1226 @book{Thompson-Haskell,author={Simon Thompson},
1227 title={Haskell: The Craft of Functional Programming},
1228 publisher={Addison-Wesley},year=1999}
1230 @Unpublished{Trybulec:1993:MizarFeatures,
1231 author = {A. Trybulec},
1232 title = {Some Features of the {Mizar} Language},
1233 note = {Presented at a workshop in Turin, Italy},
1239 @Unpublished{voelker94,
1240 author = {Norbert V{\"o}lker},
1241 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1242 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1248 @inproceedings{wadler89how,
1249 author = {P. Wadler and S. Blott},
1250 title = {How to make ad-hoc polymorphism less ad-hoc},
1251 booktitle = {ACM Symp.\ Principles of Programming Languages},
1256 author = {Christoph Wedler},
1257 title = {Emacs package ``{X-Symbol}''},
1258 note = {\url{http://x-symbol.sourceforge.net}}
1261 @manual{isabelle-sys,
1262 author = {Markus Wenzel and Stefan Berghofer},
1263 title = {The {Isabelle} System Manual},
1264 institution = {TU Munich},
1265 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1267 @manual{isabelle-isar-ref,
1268 author = {Markus Wenzel},
1269 title = {The {Isabelle/Isar} Reference Manual},
1270 institution = {TU Munich},
1271 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1273 @manual{isabelle-axclass,
1274 author = {Markus Wenzel},
1275 title = {Using Axiomatic Type Classes in {I}sabelle},
1276 institution = {TU Munich},
1278 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1281 @InProceedings{Wenzel:1999:TPHOL,
1282 author = {Markus Wenzel},
1283 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1284 crossref = {tphols99}}
1286 @InProceedings{Wenzel:1997:TPHOL,
1287 author = {Markus Wenzel},
1288 title = {Type Classes and Overloading in Higher-Order Logic},
1289 crossref = {tphols97}}
1291 @phdthesis{Wenzel-PhD,
1292 author={Markus Wenzel},
1293 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1294 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1296 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1299 author = {A. N. Whitehead and B. Russell},
1300 title = {Principia Mathematica},
1303 note = {Paperback edition to *56,
1304 abridged from the 2nd edition (1927)}}
1306 @Misc{Wiedijk:1999:Mizar,
1307 author = {Freek Wiedijk},
1308 title = {Mizar: An Impression},
1309 howpublished = {Unpublished paper},
1311 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1314 @Misc{Wiedijk:2000:MV,
1315 author = {Freek Wiedijk},
1316 title = {The Mathematical Vernacular},
1317 howpublished = {Unpublished paper},
1319 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1323 author = {Glynn Winskel},
1324 title = {The Formal Semantics of Programming Languages},
1325 publisher = MIT,year=1993}
1327 @InCollection{wos-bledsoe,
1328 author = {Larry Wos},
1329 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1330 crossref = {bledsoe-fest},
1333 @InProceedings{Zammit:1999:TPHOL,
1334 author = {Vincent Zammit},
1335 title = {On the Implementation of an Extensible Declarative Proof Language},
1336 crossref = {tphols99}}
1344 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1345 title = {Handbook of Logic in Computer Science},
1346 booktitle = {Handbook of Logic in Computer Science},
1347 publisher = {Oxford University Press},
1352 editor = {Henk Barendregt and Tobias Nipkow},
1353 title = TYPES # {: International Workshop {TYPES '93}},
1354 booktitle = TYPES # {: International Workshop {TYPES '93}},
1355 year = {published 1994},
1356 publisher = {Springer},
1357 series = {LNCS 806}}
1359 @book{barwise-handbk,
1360 editor = {J. Barwise},
1361 title = {Handbook of Mathematical Logic},
1362 booktitle = {Handbook of Mathematical Logic},
1366 @Proceedings{tlca93,
1367 title = {Typed Lambda Calculi and Applications},
1368 booktitle = {Typed Lambda Calculi and Applications},
1369 editor = {M. Bezem and J.F. Groote},
1371 publisher = {Springer},
1372 series = {LNCS 664}}
1375 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1376 title = {Current Trends in Hardware Verification and Automated
1378 booktitle = {Current Trends in Hardware Verification and Automated
1380 publisher = {Springer},
1384 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1385 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1386 publisher = {Kluwer Academic Publishers},
1388 editor = {Robert S. Boyer}}
1390 @Proceedings{cade12,
1391 editor = {Alan Bundy},
1392 title = {Automated Deduction --- {CADE}-12
1393 International Conference},
1394 booktitle = {Automated Deduction --- {CADE}-12
1395 International Conference},
1397 series = {LNAI 814},
1398 publisher = {Springer}}
1401 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1402 title = TYPES # {: International Workshop {TYPES '94}},
1403 booktitle = TYPES # {: International Workshop {TYPES '94}},
1405 publisher = {Springer},
1406 series = {LNCS 996}}
1408 @book{huet-plotkin91,
1409 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1410 title = {Logical Frameworks},
1411 booktitle = {Logical Frameworks},
1415 @book{huet-plotkin93,
1416 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1417 title = {Logical Environments},
1418 booktitle = {Logical Environments},
1423 editor = {J. Joyce and C. Seger},
1424 title = {Higher Order Logic Theorem Proving and Its
1425 Applications: HUG '93},
1426 booktitle = {Higher Order Logic Theorem Proving and Its
1427 Applications: HUG '93},
1428 year = {Published 1994},
1429 publisher = {Springer},
1430 series = {LNCS 780}}
1432 @proceedings{colog88,
1433 editor = {P. Martin-L{\"o}f and G. Mints},
1434 title = {COLOG-88: International Conference on Computer Logic},
1435 booktitle = {COLOG-88: International Conference on Computer Logic},
1436 year = {Published 1990},
1437 publisher = {Springer},
1438 organization = {Estonian Academy of Sciences},
1439 address = {Tallinn},
1440 series = {LNCS 417}}
1443 editor = {P. Odifreddi},
1444 title = {Logic and Computer Science},
1445 booktitle = {Logic and Computer Science},
1446 publisher = {Academic Press},
1449 @proceedings{extensions91,
1450 editor = {Peter Schroeder-Heister},
1451 title = {Extensions of Logic Programming},
1452 booktitle = {Extensions of Logic Programming},
1454 series = {LNAI 475},
1455 publisher = {Springer}}
1457 @proceedings{cade10,
1458 editor = {Mark E. Stickel},
1459 title = {10th } # CADE,
1460 booktitle = {10th } # CADE,
1462 publisher = {Springer},
1463 series = {LNAI 449}}
1466 editor = {M. Vardi},
1467 title = {Eighth Annual Symposium on Logic in Computer Science},
1468 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1473 title = {Automated Reasoning and its Applications:
1474 Essays in Honor of {Larry Wos}},
1475 booktitle = {Automated Reasoning and its Applications:
1476 Essays in Honor of {Larry Wos}},
1477 publisher = {MIT Press},
1479 editor = {Robert Veroff}}
1482 editor = {J. C. P. Woodcock and P. G. Larsen},
1483 title = {FME '93: Industrial-Strength Formal Methods},
1484 booktitle = {FME '93: Industrial-Strength Formal Methods},
1486 publisher = Springer,
1490 @Proceedings{tphols96,
1491 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1492 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1493 editor = {J. von Wright and J. Grundy and J. Harrison},
1494 publisher = Springer,
1499 @Proceedings{tphols97,
1500 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1501 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1502 editor = {Elsa L. Gunter and Amy Felty},
1503 publisher = Springer,
1508 @Proceedings{tphols98,
1509 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1510 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1511 editor = {Jim Grundy and Malcom Newey},
1512 publisher = Springer,
1517 @Proceedings{tphols99,
1518 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1519 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1520 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1521 Paulin, C. and Thery, L.},
1522 publisher = Springer,
1527 @Proceedings{tphols2000,
1528 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1529 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1530 editor = {J. Harrison and M. Aagaard},
1531 publisher = Springer,
1536 @Proceedings{tphols2001,
1537 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1538 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1539 editor = {R. J. Boulton and P. B. Jackson},
1540 publisher = Springer,
1545 @Proceedings{ijcar2006,
1546 title = {Automated Reasoning: {IJCAR} 2006},
1547 booktitle = {Automated Reasoning: {IJCAR} 2006},
1548 editor = {U. Furbach and N. Shankar},
1549 publisher = Springer,
1554 @unpublished{classes_modules,
1555 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1556 author = {Stefan Wehr et. al.}