1 % BibTeX database for the Isabelle documentation
4 @string{AP="Academic Press"}
5 @string{CUP="Cambridge University Press"}
6 @string{IEEE="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},
76 @inproceedings{andersson-1993,
77 author = "Arne Andersson",
78 title = "Balanced Search Trees Made Simple",
79 editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides",
80 booktitle = "WADS 1993",
88 author = "Peter Andrews",
89 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
92 series = "Computer Science and Applied Mathematics",
95 @InProceedings{Aspinall:2000:eProof,
96 author = {David Aspinall},
97 title = {Protocols for Interactive {e-Proof}},
98 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
100 note = {Unpublished work-in-progress paper,
101 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
104 @InProceedings{Aspinall:TACAS:2000,
105 author = {David Aspinall},
106 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
107 booktitle = {Tools and Algorithms for the Construction and Analysis of
110 publisher = Springer,
117 author = {David Aspinall},
118 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
119 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
123 author = {David Aspinall},
124 title = {{P}roof {G}eneral},
125 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
130 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
131 title="Term Rewriting and All That",publisher=CUP,year=1998}
133 @InCollection{Barendregt-Geuvers:2001,
134 author = {H. Barendregt and H. Geuvers},
135 title = {Proof Assistants using Dependent Type Systems},
136 booktitle = {Handbook of Automated Reasoning},
137 publisher = {Elsevier},
139 editor = {A. Robinson and A. Voronkov}
142 @incollection{basin91,
143 author = {David Basin and Matt Kaufmann},
144 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
146 crossref = {huet-plotkin91},
149 @Unpublished{HOL-Library,
150 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
151 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
153 title = {The Supplemental {Isabelle/HOL} Library},
154 note = {Part of the Isabelle distribution,
155 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
159 @InProceedings{Bauer-Wenzel:2000:HB,
160 author = {Gertrud Bauer and Markus Wenzel},
161 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
163 booktitle = {Types for Proofs and Programs: TYPES'99},
164 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
170 @InProceedings{Bauer-Wenzel:2001,
171 author = {Gertrud Bauer and Markus Wenzel},
172 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
173 crossref = {tphols2001}}
175 @inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL,
176 author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian},
177 booktitle = {Theorem Proving in Higher Order Logics},
179 title = {Turning Inductive into Equational Specifications},
183 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
184 crossref = "tphols2000",
185 title = "Proof terms for simply typed higher order logic",
186 author = "Stefan Berghofer and Tobias Nipkow",
189 @inproceedings{berghofer-nipkow-2004,
190 author = {Stefan Berghofer and Tobias Nipkow},
191 title = {Random Testing in {I}sabelle/{HOL}},
193 editor = "J. Cuellar and Z. Liu",
194 booktitle = {{SEFM} 2004},
198 @InProceedings{Berghofer-Nipkow:2002,
199 author = {Stefan Berghofer and Tobias Nipkow},
200 title = {Executing Higher Order Logic},
201 booktitle = {Types for Proofs and Programs: TYPES'2000},
202 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
204 publisher = Springer,
208 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
209 author = {Stefan Berghofer and Markus Wenzel},
210 title = {Inductive datatypes in {HOL} --- lessons learned in
211 {F}ormal-{L}ogic {E}ngineering},
212 crossref = {tphols99}}
215 @InProceedings{Bezem-Coquand:2005,
216 author = {M.A. Bezem and T. Coquand},
217 title = {Automating {Coherent Logic}},
218 booktitle = {LPAR-12},
219 editor = {G. Sutcliffe and A. Voronkov},
222 publisher = Springer}
224 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
225 title="Introduction to Functional Programming",publisher=PH,year=1988}
227 @book{Bird-Haskell,author="Richard Bird",
228 title="Introduction to Functional Programming using Haskell",
229 publisher=PH,year=1998}
231 @inproceedings{blanchette-nipkow-2010,
232 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder",
233 author = "Jasmin Christian Blanchette and Tobias Nipkow",
234 crossref = {itp2010}}
236 @inproceedings{boehme-nipkow-2010,
237 author={Sascha B\"ohme and Tobias Nipkow},
238 title={Sledgehammer: Judgement Day},
239 booktitle={Automated Reasoning: IJCAR 2010},
240 editor={J. Giesl and R. H\"ahnle},
246 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
247 Overbeek and Mark Stickel and Lawrence Wos},
248 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
257 author = {Robert S. Boyer and J Strother Moore},
258 title = {A Computational Logic},
259 publisher = {Academic Press},
263 author = {Robert S. Boyer and J Strother Moore},
264 title = {A Computational Logic Handbook},
265 publisher = {Academic Press},
269 author = {N. G. de Bruijn},
270 title = {Lambda Calculus Notation with Nameless Dummies,
271 a Tool for Automatic Formula Manipulation,
272 with Application to the {Church-Rosser Theorem}},
273 journal = {Indag. Math.},
278 @InProceedings{bulwahnKN07,
279 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
280 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
281 crossref = {tphols2007},
285 @InProceedings{bulwahn-et-al:2008:imperative,
286 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
287 title = {Imperative Functional Programming with {Isabelle/HOL}},
288 crossref = {tphols2008},
293 author = {M. Burrows and M. Abadi and R. M. Needham},
294 title = {A Logic of Authentication},
302 @TechReport{camilleri92,
303 author = {J. Camilleri and T. F. Melham},
304 title = {Reasoning with Inductively Defined Relations in the
305 {HOL} Theorem Prover},
312 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
313 title = {Artificial Intelligence Programming},
314 publisher = {Lawrence Erlbaum Associates},
318 author = "Alonzo Church",
319 title = "A Formulation of the Simple Theory of Types",
325 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
326 title="Model Checking",publisher=MIT,year=1999}
329 author = {Martin D. Coen},
330 title = {Interactive Program Derivation},
331 school = {University of Cambridge},
332 note = {Computer Laboratory Technical Report 272},
337 author = {R. L. Constable and others},
338 title = {Implementing Mathematics with the Nuprl Proof
340 publisher = Prentice,
345 @Book{davey-priestley,
346 author = {B. A. Davey and H. A. Priestley},
347 title = {Introduction to Lattices and Order},
352 author = {Keith J. Devlin},
353 title = {Fundamentals of Contemporary Set Theory},
354 publisher = {Springer},
358 author = {Michael Dummett},
359 title = {Elements of Intuitionism},
361 publisher = {Oxford University Press}}
363 @incollection{dybjer91,
364 author = {Peter Dybjer},
365 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
366 Theory and Their Set-Theoretic Semantics},
367 crossref = {huet-plotkin91},
371 author = {Roy Dyckhoff},
372 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
382 author = {William M. Farmer and Joshua D. Guttman and F. Javier
384 title = {{IMPS}: An Interactive Mathematical Proof System},
391 @InProceedings{felty91a,
392 Author = {Amy Felty},
393 Title = {A Logic Program for Transforming Sequent Proofs to Natural
395 crossref = {extensions91},
398 @Article{fleuriot-jcm,
399 author = {Jacques Fleuriot and Lawrence C. Paulson},
400 title = {Mechanizing Nonstandard Real Analysis},
401 journal = {LMS Journal of Computation and Mathematics},
405 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
409 author = {Jacob Frost},
410 title = {A Case Study of Co-induction in {Isabelle HOL}},
416 %revised version of frost93
418 author = {Jacob Frost},
419 title = {A Case Study of Co-induction in {Isabelle}},
426 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
428 title = {Principles of {OBJ2}},
436 author = {J. H. Gallier},
437 title = {Logic for Computer Science:
438 Foundations of Automatic Theorem Proving},
440 publisher = {Harper \& Row}}
443 author = {Antony Galton},
444 title = {Logic for Information Technology},
448 @Article{Gentzen:1935,
449 author = {G. Gentzen},
450 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
451 journal = {Math. Zeitschrift},
455 @InProceedings{gimenez-codifying,
456 author = {Eduardo Gim{\'e}nez},
457 title = {Codifying Guarded Definitions with Recursive Schemes},
458 crossref = {types94},
463 author = {Jean-Yves Girard},
464 title = {Proofs and Types},
467 note = {Translated by Yves LaFont and Paul Taylor}}
470 editor = {M. J. C. Gordon and T. F. Melham},
471 title = {Introduction to {HOL}: A Theorem Proving Environment for
477 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
479 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
481 publisher = {Springer},
484 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
485 title={Why we can't have {SML} style datatype declarations in {HOL}},
486 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
487 IFIP TC10/WG10.2 Intl. Workshop, 1992},
488 editor={L.J.M. Claesen and M.J.C. Gordon},
489 publisher=NH,year=1993,pages={561--568}}
491 @InProceedings{gunter-trees,
492 author = {Elsa L. Gunter},
493 title = {A Broader Class of Trees for Recursive Type Definitions for
500 @InProceedings{Haftmann-Wenzel:2006:classes,
501 author = {Florian Haftmann and Makarius Wenzel},
502 title = {Constructive Type Classes in {Isabelle}},
503 editor = {T. Altenkirch and C. McBride},
504 booktitle = {Types for Proofs and Programs, TYPES 2006},
505 publisher = {Springer},
511 @TechReport{Haftmann-Nipkow:2007:codegen,
512 author = {Florian Haftmann and Tobias Nipkow},
513 title = {A Code Generator Framework for {Isabelle/HOL}},
514 editor = {Klaus Schneider and Jens Brandt},
515 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
518 institution = {Department of Computer Science, University of Kaiserslautern},
522 @InProceedings{Haftmann-Wenzel:2009,
523 author = {Florian Haftmann and Makarius Wenzel},
524 title = {Local theory specifications in {Isabelle/Isar}},
525 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
526 booktitle = {Types for Proofs and Programs, TYPES 2008},
527 publisher = {Springer},
533 @manual{isabelle-classes,
534 author = {Florian Haftmann},
535 title = {Haskell-style type classes with {Isabelle}/{Isar}},
537 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
540 @manual{isabelle-codegen,
541 author = {Florian Haftmann},
542 title = {Code generation from Isabelle theories},
544 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
548 author = {Paul R. Halmos},
549 title = {Naive Set Theory},
550 publisher = {Van Nostrand},
553 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
554 title={Dynamic Logic},publisher=MIT,year=2000}
557 author = {Matthew Hennessy},
558 title = {The Semantics of Programming Languages: An Elementary
559 Introduction Using Structural Operational Semantics},
563 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
564 title={Introduction to Automata Theory, Languages, and Computation.},
565 publisher={Addison-Wesley},year=1979}
567 @Article{haskell-report,
568 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
569 title = {Report on the Programming Language {Haskell}: A
570 Non-strict, Purely Functional Language},
576 note = {Version 1.2}}
578 @Article{haskell-tutorial,
579 author = {Paul Hudak and Joseph H. Fasel},
580 title = {A Gentle Introduction to {Haskell}},
587 @book{Hudak-Haskell,author={Paul Hudak},
588 title={The Haskell School of Expression},publisher=CUP,year=2000}
591 author = {G. P. Huet},
592 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
599 author = {G. P. Huet and B. Lang},
600 title = {Proving and Applying Program Transformations Expressed with
601 Second-Order Patterns},
607 @inproceedings{huet88,
608 author = {G{\'e}rard Huet},
609 title = {Induction Principles Formalized in the {Calculus of
611 booktitle = {Programming of Future Generation Computers},
612 editor = {K. Fuchi and M. Nivat},
615 publisher = {Elsevier}}
617 @Book{Huth-Ryan-book,
618 author = {Michael Huth and Mark Ryan},
619 title = {Logic in Computer Science. Modelling and reasoning about systems},
623 @InProceedings{Harrison:1996:MizarHOL,
624 author = {J. Harrison},
625 title = {A {Mizar} Mode for {HOL}},
627 crossref = {tphols96}}
631 title = "Metis Theorem Prover",
632 note = "\url{http://www.gilith.com/software/metis/}"}
636 @article{haskell-revised-report,
637 author = {Simon {Peyton Jones} and others},
638 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
639 journal = {Journal of Functional Programming},
645 note = {\url{http://www.haskell.org/definition/}}}
648 author = "Daniel Jackson",
649 title = "Software Abstractions: Logic, Language, and Analysis",
655 @InProceedings{kammueller-locales,
656 author = {Florian Kamm{\"u}ller and Markus Wenzel and
657 Lawrence C. Paulson},
658 title = {Locales: A Sectioning Concept for {Isabelle}},
659 crossref = {tphols99}}
662 author={Donald E. Knuth},
663 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
664 publisher={Addison-Wesley},
668 author = {R. E. Korf},
669 title = {Depth-First Iterative-Deepening: an Optimal Admissible
676 @InProceedings{krauss2006,
677 author = {Alexander Krauss},
678 title = {Partial Recursive Functions in {Higher-Order Logic}},
679 crossref = {ijcar2006},
682 @PhdThesis{krauss_phd,
683 author = {Alexander Krauss},
684 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
685 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
690 @manual{isabelle-function,
691 author = {Alexander Krauss},
692 title = {Defining Recursive Functions in {Isabelle/HOL}},
694 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
698 author = {Kenneth Kunen},
699 title = {Set Theory: An Introduction to Independence Proofs},
706 author = {Xavier Leroy and others},
707 title = {The Objective Caml system -- Documentation and user's manual},
708 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
710 @InProceedings{lowe-fdr,
711 author = {Gavin Lowe},
712 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
713 Protocol using {CSP} and {FDR}},
714 booktitle = {Tools and Algorithms for the Construction and Analysis
715 of Systems: second international workshop, TACAS '96},
716 editor = {T. Margaria and B. Steffen},
717 series = {LNCS 1055},
719 publisher = {Springer},
725 author = {Zohar Manna and Richard Waldinger},
726 title = {Deductive Synthesis of the Unification Algorithm},
733 @InProceedings{martin-nipkow,
734 author = {Ursula Martin and Tobias Nipkow},
735 title = {Ordered Rewriting and Confluence},
740 author = {Per Martin-L{\"o}f},
741 title = {Intuitionistic type theory},
743 publisher = {Bibliopolis}}
745 @incollection{melham89,
746 author = {Thomas F. Melham},
747 title = {Automating Recursive Type Definitions in Higher Order
750 crossref = {birtwistle89}}
752 @Article{Miller:1991,
753 author = {Dale Miller},
754 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
755 and Simple Unification},
756 journal = {Journal of Logic and Computation},
762 @Article{miller-mixed,
763 Author = {Dale Miller},
764 Title = {Unification Under a Mixed Prefix},
772 author = {Robin Milner},
773 title = {A Theory of Type Polymorphism in Programming},
774 journal = "J. Comp.\ Sys.\ Sci.",
779 @TechReport{milner-ind,
780 author = {Robin Milner},
781 title = {How to Derive Inductions in {LCF}},
782 institution = Edinburgh,
786 @Article{milner-coind,
787 author = {Robin Milner and Mads Tofte},
788 title = {Co-induction in Relational Semantics},
795 author = {Robin Milner},
796 title = {Communication and Concurrency},
797 publisher = Prentice,
800 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
801 title="The Definition of Standard ML",publisher=MIT,year=1990}
803 @PhdThesis{monahan84,
804 author = {Brian Q. Monahan},
805 title = {Data Type Proofs using Edinburgh {LCF}},
806 school = {University of Edinburgh},
809 @article{MuellerNvOS99,
811 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
812 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
814 @Manual{Muzalewski:Mizar,
815 title = {An Outline of {PC} {Mizar}},
816 author = {Micha{\l} Muzalewski},
817 organization = {Fondation of Logic, Mathematics and Informatics
818 --- Mizar Users Group},
820 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
825 @InProceedings{NaraschewskiW-TPHOLs98,
826 author = {Wolfgang Naraschewski and Markus Wenzel},
828 {Object-Oriented Verification based on Record Subtyping in
830 crossref = {tphols98}}
832 @inproceedings{nazareth-nipkow,
833 author = {Dieter Nazareth and Tobias Nipkow},
834 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
835 crossref = {tphols96},
839 @Article{needham-schroeder,
840 author = "Roger M. Needham and Michael D. Schroeder",
841 title = "Using Encryption for Authentication in Large Networks
850 @inproceedings{nipkow-W,
851 author = {Wolfgang Naraschewski and Tobias Nipkow},
852 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
853 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
854 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
855 publisher = Springer,
861 @InCollection{nipkow-sorts93,
862 author = {T. Nipkow},
863 title = {Order-Sorted Polymorphism in {Isabelle}},
864 booktitle = {Logical Environments},
867 editor = {G. Huet and G. Plotkin},
871 @Misc{nipkow-types93,
872 author = {Tobias Nipkow},
873 title = {Axiomatic Type Classes (in {I}sabelle)},
874 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
878 @inproceedings{Nipkow-CR,
879 author = {Tobias Nipkow},
880 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
881 booktitle = {Automated Deduction --- CADE-13},
882 editor = {M. McRobbie and J.K. Slaney},
883 publisher = Springer,
890 @InProceedings{nipkow-patterns,
891 title = {Functional Unification of Higher-Order Patterns},
892 author = {Tobias Nipkow},
895 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
896 keywords = {unification}}
899 author = {Tobias Nipkow},
900 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
906 @inproceedings{Nipkow-TYPES02,
907 author = {Tobias Nipkow},
908 title = {{Structured Proofs in Isar/HOL}},
909 booktitle = {Types for Proofs and Programs (TYPES 2002)},
910 editor = {H. Geuvers and F. Wiedijk},
912 publisher = Springer,
917 @manual{isabelle-HOL,
918 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
919 title = {{Isabelle}'s Logics: {HOL}},
920 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
921 M{\"u}nchen and Computer Laboratory, University of Cambridge},
922 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
924 @article{nipkow-prehofer,
925 author = {Tobias Nipkow and Christian Prehofer},
926 title = {Type Reconstruction for Type Classes},
933 @InProceedings{Nipkow-Prehofer:1993,
934 author = {T. Nipkow and C. Prehofer},
935 title = {Type checking type classes},
936 booktitle = {ACM Symp.\ Principles of Programming Languages},
941 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
942 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
943 publisher = Springer,
949 author = {Philippe No{\"e}l},
950 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
958 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
959 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
961 publisher = {Oxford University Press},
966 @Manual{pvs-language,
967 title = {The {PVS} specification language},
968 author = {S. Owre and N. Shankar and J. M. Rushby},
969 organization = {Computer Science Laboratory, SRI International},
970 address = {Menlo Park, CA},
971 note = {Beta release},
974 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
979 @InProceedings{paulin-tlca,
980 author = {Christine Paulin-Mohring},
981 title = {Inductive Definitions in the System {Coq}: Rules and
986 @InProceedings{paulson-CADE,
987 author = {Lawrence C. Paulson},
988 title = {A Fixedpoint Approach to Implementing (Co)Inductive
993 @InProceedings{paulson-COLOG,
994 author = {Lawrence C. Paulson},
995 title = {A Formulation of the Simple Theory of Types (for
998 crossref = {colog88},
999 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
1001 @Article{paulson-coind,
1002 author = {Lawrence C. Paulson},
1003 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1012 @manual{isabelle-intro,
1013 author = {Lawrence C. Paulson},
1014 title = {Introduction to {Isabelle}},
1016 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1018 @manual{isabelle-logics,
1019 author = {Lawrence C. Paulson},
1020 title = {{Isabelle's} Logics},
1022 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1024 @manual{isabelle-ref,
1025 author = {Lawrence C. Paulson},
1026 title = {The {Isabelle} Reference Manual},
1028 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1030 @manual{isabelle-ZF,
1031 author = {Lawrence C. Paulson},
1032 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1034 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1036 @article{paulson-found,
1037 author = {Lawrence C. Paulson},
1038 title = {The Foundation of a Generic Theorem Prover},
1044 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1046 %replaces paulson-final
1047 @Article{paulson-mscs,
1048 author = {Lawrence C. Paulson},
1049 title = {Final Coalgebras as Greatest Fixed Points
1050 in {ZF} Set Theory},
1051 journal = {Mathematical Structures in Computer Science},
1057 @InCollection{paulson-generic,
1058 author = {Lawrence C. Paulson},
1059 title = {Generic Automatic Proof Tools},
1060 crossref = {wos-fest},
1063 @Article{paulson-gr,
1064 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1065 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1074 @InCollection{paulson-fixedpt-milner,
1075 author = {Lawrence C. Paulson},
1076 title = {A Fixedpoint Approach to (Co)inductive and
1077 (Co)datatype Definitions},
1079 crossref = {milner-fest}}
1082 title = {Proof, Language, and Interaction:
1083 Essays in Honor of {Robin Milner}},
1084 booktitle = {Proof, Language, and Interaction:
1085 Essays in Honor of {Robin Milner}},
1088 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1090 @InCollection{paulson-handbook,
1091 author = {Lawrence C. Paulson},
1092 title = {Designing a Theorem Prover},
1093 crossref = {handbk-lics2},
1096 @Book{paulson-isa-book,
1097 author = {Lawrence C. Paulson},
1098 title = {Isabelle: A Generic Theorem Prover},
1099 publisher = {Springer},
1103 @Book{isabelle-hol-book,
1104 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1105 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1106 publisher = {Springer},
1110 @InCollection{paulson-markt,
1111 author = {Lawrence C. Paulson},
1112 title = {Tool Support for Logics of Programs},
1113 booktitle = {Mathematical Methods in Program Development:
1114 Summer School Marktoberdorf 1996},
1115 publisher = {Springer},
1117 year = {Published 1997},
1118 editor = {Manfred Broy},
1119 series = {NATO ASI Series F}}
1121 %replaces Paulson-ML and paulson91
1123 author = {Lawrence C. Paulson},
1124 title = {{ML} for the Working Programmer},
1129 @article{paulson-natural,
1130 author = {Lawrence C. Paulson},
1131 title = {Natural Deduction as Higher-order Resolution},
1136 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1138 @Article{paulson-set-I,
1139 author = {Lawrence C. Paulson},
1140 title = {Set Theory for Verification: {I}. {From}
1141 Foundations to Functions},
1147 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1149 @Article{paulson-set-II,
1150 author = {Lawrence C. Paulson},
1151 title = {Set Theory for Verification: {II}. {Induction} and
1158 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1161 author = {Lawrence C. Paulson},
1162 title = {Verifying the Unification Algorithm in {LCF}},
1168 %replaces Paulson-LCF
1170 author = {Lawrence C. Paulson},
1171 title = {Logic and Computation: Interactive proof with Cambridge
1176 @incollection{paulson700,
1177 author = {Lawrence C. Paulson},
1178 title = {{Isabelle}: The Next 700 Theorem Provers},
1179 crossref = {odifreddi90},
1181 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1183 % replaces paulson-ns and paulson-security
1184 @Article{paulson-jcs,
1185 author = {Lawrence C. Paulson},
1186 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1192 @Article{paulson-tls,
1193 author = {Lawrence C. Paulson},
1194 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1202 @Article{paulson-yahalom,
1203 author = {Lawrence C. Paulson},
1204 title = {Relations Between Secrets:
1205 Two Formal Analyses of the {Yahalom} Protocol},
1212 @article{pelletier86,
1213 author = {F. J. Pelletier},
1214 title = {Seventy-five Problems for Testing Automatic Theorem
1220 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1223 author = {Andrew M. Pitts},
1224 title = {A Co-induction Principle for Recursively Defined Domains},
1230 @Article{plaisted90,
1231 author = {David A. Plaisted},
1232 title = {A Sequent-Style Model Elimination Strategy and a Positive
1243 author = {Art Quaife},
1244 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1254 @TechReport{rasmussen95,
1255 author = {Ole Rasmussen},
1256 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1258 institution = {Computer Laboratory, University of Cambridge},
1262 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1265 author = {Steve Reeves and Michael Clarke},
1266 title = {Logic for Computer Science},
1267 publisher = {Addison-Wesley},
1270 @article{riazanov-voronkov-2002,
1271 author = "Alexander Riazanov and Andrei Voronkov",
1272 title = "The Design and Implementation of {Vampire}",
1273 journal = "Journal of AI Communications",
1279 @book{Rosen-DMA,author={Kenneth H. Rosen},
1280 title={Discrete Mathematics and Its Applications},
1281 publisher={McGraw-Hill},year=1998}
1283 @InProceedings{Rudnicki:1992:MizarOverview,
1284 author = {P. Rudnicki},
1285 title = {An Overview of the {MIZAR} Project},
1286 booktitle = {1992 Workshop on Types for Proofs and Programs},
1288 organization = {Chalmers University of Technology},
1289 publisher = {Bastad}
1294 @inproceedings{saaltink-fme,
1295 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1296 Dan Craigen and Irwin Meisels},
1297 title = {An {EVES} Data Abstraction Example},
1301 @Article{Schroeder-Heister:1984,
1302 author = {Peter Schroeder-Heister},
1303 title = {A Natural Extension of Natural Deduction},
1304 journal = {Journal of Symbolic Logic},
1310 @article{schulz-2002,
1311 author = "Stephan Schulz",
1312 title = "E---A Brainiac Theorem Prover",
1313 journal = "Journal of AI Communications",
1319 @misc{sledgehammer-2009,
1320 key = "Sledgehammer",
1321 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1322 Write Your {I}s\-a\-belle Scripts",
1323 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1325 @inproceedings{slind-tfl,
1326 author = {Konrad Slind},
1327 title = {Function Definition in Higher Order Logic},
1328 crossref = {tphols96},
1332 author = {Patrick Suppes},
1333 title = {Axiomatic Set Theory},
1335 publisher = {Dover}}
1337 @inproceedings{sutcliffe-2000,
1338 author = "Geoff Sutcliffe",
1339 title = "System Description: {SystemOnTPTP}",
1340 editor = "J. G. Carbonell and J. Siekmann",
1341 booktitle = {Automated Deduction --- {CADE}-17 International Conference},
1342 series = "Lecture Notes in Artificial Intelligence",
1346 publisher = Springer}
1348 @InCollection{szasz93,
1349 author = {Nora Szasz},
1350 title = {A Machine Checked Proof that {Ackermann's} Function is not
1351 Primitive Recursive},
1352 crossref = {huet-plotkin93},
1355 @TechReport{Syme:1997:DECLARE,
1357 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1358 institution = {University of Cambridge Computer Laboratory},
1363 @PhdThesis{Syme:1998:thesis,
1365 title = {Declarative Theorem Proving for Operational Semantics},
1366 school = {University of Cambridge},
1371 @InProceedings{Syme:1999:TPHOL,
1373 title = {Three Tactic Theorem Proving},
1374 crossref = {tphols99}}
1379 author = {G. Takeuti},
1380 title = {Proof Theory},
1386 author = {Simon Thompson},
1387 title = {Type Theory and Functional Programming},
1388 publisher = {Addison-Wesley},
1391 @book{Thompson-Haskell,author={Simon Thompson},
1392 title={Haskell: The Craft of Functional Programming},
1393 publisher={Addison-Wesley},year=1999}
1396 author = "Emina Torlak",
1397 title = {Kodkod: Constraint Solver for Relational Logic},
1398 note = "\url{http://alloy.mit.edu/kodkod/}"}
1400 @misc{kodkod-2009-options,
1401 author = "Emina Torlak",
1402 title = "Kodkod {API}: Class {Options}",
1403 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1405 @inproceedings{torlak-jackson-2007,
1406 title = "Kodkod: A Relational Model Finder",
1407 author = "Emina Torlak and Daniel Jackson",
1408 editor = "Orna Grumberg and Michael Huth",
1409 booktitle = "TACAS 2007",
1414 publisher = Springer}
1416 @Unpublished{Trybulec:1993:MizarFeatures,
1417 author = {A. Trybulec},
1418 title = {Some Features of the {Mizar} Language},
1419 note = {Presented at a workshop in Turin, Italy},
1425 @Unpublished{voelker94,
1426 author = {Norbert V{\"o}lker},
1427 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1428 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1434 @inproceedings{wadler89how,
1435 author = {P. Wadler and S. Blott},
1436 title = {How to make ad-hoc polymorphism less ad-hoc},
1437 booktitle = {ACM Symp.\ Principles of Programming Languages},
1441 @phdthesis{weber-2008,
1442 author = "Tjark Weber",
1443 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1444 school = {Dept.\ of Informatics, T.U. M\"unchen},
1445 type = "{Ph.D.}\ thesis",
1449 author = {Christoph Wedler},
1450 title = {Emacs package ``{X-Symbol}''},
1451 note = {\url{http://x-symbol.sourceforge.net}}
1454 @misc{weidenbach-et-al-2009,
1455 author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski",
1456 title = "{SPASS} Version 3.5",
1457 note = {\url{http://www.spass-prover.org/publications/spass.pdf}}}
1459 @manual{isabelle-sys,
1460 author = {Markus Wenzel and Stefan Berghofer},
1461 title = {The {Isabelle} System Manual},
1462 institution = {TU Munich},
1463 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1465 @manual{isabelle-isar-ref,
1466 author = {Makarius Wenzel},
1467 title = {The {Isabelle/Isar} Reference Manual},
1468 institution = {TU Munich},
1469 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1471 @manual{isabelle-implementation,
1472 author = {Makarius Wenzel},
1473 title = {The {Isabelle/Isar} Implementation},
1474 institution = {TU Munich},
1475 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1477 @InProceedings{Wenzel:1999:TPHOL,
1478 author = {Markus Wenzel},
1479 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1480 crossref = {tphols99}}
1482 @InProceedings{Wenzel:1997:TPHOL,
1483 author = {Markus Wenzel},
1484 title = {Type Classes and Overloading in Higher-Order Logic},
1485 crossref = {tphols97}}
1487 @phdthesis{Wenzel-PhD,
1488 author={Markus Wenzel},
1489 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1490 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1492 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1494 @Article{Wenzel-Wiedijk:2002,
1495 author = {Freek Wiedijk and Markus Wenzel},
1496 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1497 journal = {Journal of Automated Reasoning},
1503 @InCollection{Wenzel-Paulson:2006,
1504 author = {Markus Wenzel and Lawrence C. Paulson},
1505 title = {{Isabelle/Isar}},
1506 booktitle = {The Seventeen Provers of the World},
1508 editor = {F. Wiedijk},
1509 series = {LNAI 3600}
1512 @InCollection{Wenzel:2006:Festschrift,
1513 author = {Makarius Wenzel},
1514 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1515 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1516 publisher = {University of Bia{\l}ystok},
1518 editor = {R. Matuszewski and A. Zalewska},
1520 series = {Studies in Logic, Grammar, and Rhetoric},
1521 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1525 author = {A. N. Whitehead and B. Russell},
1526 title = {Principia Mathematica},
1529 note = {Paperback edition to *56,
1530 abridged from the 2nd edition (1927)}}
1532 @Misc{Wiedijk:1999:Mizar,
1533 author = {Freek Wiedijk},
1534 title = {Mizar: An Impression},
1535 howpublished = {Unpublished paper},
1537 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1540 @Misc{Wiedijk:2000:MV,
1541 author = {Freek Wiedijk},
1542 title = {The Mathematical Vernacular},
1543 howpublished = {Unpublished paper},
1545 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1549 author = {Glynn Winskel},
1550 title = {The Formal Semantics of Programming Languages},
1551 publisher = MIT,year=1993}
1553 @InCollection{wos-bledsoe,
1554 author = {Larry Wos},
1555 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1556 crossref = {bledsoe-fest},
1559 @InProceedings{Zammit:1999:TPHOL,
1560 author = {Vincent Zammit},
1561 title = {On the Implementation of an Extensible Declarative Proof Language},
1562 crossref = {tphols99}}
1570 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1571 title = {Handbook of Logic in Computer Science},
1572 booktitle = {Handbook of Logic in Computer Science},
1573 publisher = {Oxford University Press},
1578 editor = {Henk Barendregt and Tobias Nipkow},
1579 title = TYPES # {: International Workshop {TYPES '93}},
1580 booktitle = TYPES # {: International Workshop {TYPES '93}},
1581 year = {published 1994},
1582 publisher = {Springer},
1583 series = {LNCS 806}}
1585 @book{barwise-handbk,
1586 editor = {J. Barwise},
1587 title = {Handbook of Mathematical Logic},
1588 booktitle = {Handbook of Mathematical Logic},
1592 @Proceedings{tlca93,
1593 title = {Typed Lambda Calculi and Applications},
1594 booktitle = {Typed Lambda Calculi and Applications},
1595 editor = {M. Bezem and J.F. Groote},
1597 publisher = {Springer},
1598 series = {LNCS 664}}
1601 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1602 title = {Current Trends in Hardware Verification and Automated
1604 booktitle = {Current Trends in Hardware Verification and Automated
1606 publisher = {Springer},
1610 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1611 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1612 publisher = {Kluwer Academic Publishers},
1614 editor = {Robert S. Boyer}}
1616 @Proceedings{cade12,
1617 editor = {Alan Bundy},
1618 title = {Automated Deduction --- {CADE}-12
1619 International Conference},
1620 booktitle = {Automated Deduction --- {CADE}-12
1621 International Conference},
1623 series = {LNAI 814},
1624 publisher = {Springer}}
1627 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1628 title = TYPES # {: International Workshop {TYPES '94}},
1629 booktitle = TYPES # {: International Workshop {TYPES '94}},
1631 publisher = {Springer},
1632 series = {LNCS 996}}
1634 @book{huet-plotkin91,
1635 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1636 title = {Logical Frameworks},
1637 booktitle = {Logical Frameworks},
1641 @book{huet-plotkin93,
1642 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1643 title = {Logical Environments},
1644 booktitle = {Logical Environments},
1649 editor = {J. Joyce and C. Seger},
1650 title = {Higher Order Logic Theorem Proving and Its
1651 Applications: HUG '93},
1652 booktitle = {Higher Order Logic Theorem Proving and Its
1653 Applications: HUG '93},
1654 year = {Published 1994},
1655 publisher = {Springer},
1656 series = {LNCS 780}}
1658 @proceedings{colog88,
1659 editor = {P. Martin-L{\"o}f and G. Mints},
1660 title = {COLOG-88: International Conference on Computer Logic},
1661 booktitle = {COLOG-88: International Conference on Computer Logic},
1662 year = {Published 1990},
1663 publisher = {Springer},
1664 organization = {Estonian Academy of Sciences},
1665 address = {Tallinn},
1666 series = {LNCS 417}}
1669 editor = {P. Odifreddi},
1670 title = {Logic and Computer Science},
1671 booktitle = {Logic and Computer Science},
1672 publisher = {Academic Press},
1675 @proceedings{extensions91,
1676 editor = {Peter Schroeder-Heister},
1677 title = {Extensions of Logic Programming},
1678 booktitle = {Extensions of Logic Programming},
1680 series = {LNAI 475},
1681 publisher = {Springer}}
1683 @proceedings{cade10,
1684 editor = {Mark E. Stickel},
1685 title = {10th } # CADE,
1686 booktitle = {10th } # CADE,
1688 publisher = {Springer},
1689 series = {LNAI 449}}
1692 editor = {M. Vardi},
1693 title = {Eighth Annual Symposium on Logic in Computer Science},
1694 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1699 title = {Automated Reasoning and its Applications:
1700 Essays in Honor of {Larry Wos}},
1701 booktitle = {Automated Reasoning and its Applications:
1702 Essays in Honor of {Larry Wos}},
1705 editor = {Robert Veroff}}
1708 editor = {J. C. P. Woodcock and P. G. Larsen},
1709 title = {FME '93: Industrial-Strength Formal Methods},
1710 booktitle = {FME '93: Industrial-Strength Formal Methods},
1712 publisher = Springer,
1716 @Proceedings{tphols96,
1717 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1718 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1719 editor = {J. von Wright and J. Grundy and J. Harrison},
1720 publisher = Springer,
1725 @Proceedings{tphols97,
1726 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1727 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1728 editor = {Elsa L. Gunter and Amy Felty},
1729 publisher = Springer,
1734 @Proceedings{tphols98,
1735 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1736 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1737 editor = {Jim Grundy and Malcom Newey},
1738 publisher = Springer,
1743 @Proceedings{tphols99,
1744 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1745 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1746 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1747 Paulin, C. and Thery, L.},
1748 publisher = Springer,
1753 @Proceedings{tphols2000,
1754 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1755 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1756 editor = {J. Harrison and M. Aagaard},
1757 publisher = Springer,
1762 @Proceedings{tphols2001,
1763 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1764 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1765 editor = {R. J. Boulton and P. B. Jackson},
1766 publisher = Springer,
1771 @Proceedings{ijcar2006,
1772 title = {Automated Reasoning: {IJCAR} 2006},
1773 booktitle = {Automated Reasoning: {IJCAR} 2006},
1774 editor = {U. Furbach and N. Shankar},
1775 publisher = Springer,
1780 @Proceedings{tphols2007,
1781 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1782 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1783 editor = {K. Schneider and J. Brandt},
1784 publisher = Springer,
1789 @Proceedings{tphols2008,
1790 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1791 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1792 publisher = Springer,
1798 @Proceedings{itp2010,
1799 title = {Interactive Theorem Proving: {ITP}-10},
1800 booktitle = {Interactive Theorem Proving: {ITP}-10},
1801 editor = "Matt Kaufmann and Lawrence Paulson",
1802 publisher = Springer,
1806 @unpublished{classes_modules,
1807 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1808 author = {Stefan Wehr et. al.}
1811 @misc{wikipedia-2009-aa-trees,
1813 title = "Wikipedia: {AA} Tree",
1814 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
1816 @incollection{lochbihler-2010,
1817 title = "Coinduction",
1818 author = "Andreas Lochbihler",
1819 booktitle = "The Archive of Formal Proofs",
1820 editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
1821 publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",