optimization to quantifiers in Nitpick's handling of simp rules + renamed some SAT solvers
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-2009,
232 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)",
233 author = "Jasmin Christian Blanchette and Tobias Nipkow",
234 booktitle = "{TAP} 2009: Short Papers",
235 editor = "Catherine Dubois",
236 publisher = "ETH Technical Report 630",
240 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
241 Overbeek and Mark Stickel and Lawrence Wos},
242 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
251 author = {Robert S. Boyer and J Strother Moore},
252 title = {A Computational Logic},
253 publisher = {Academic Press},
257 author = {Robert S. Boyer and J Strother Moore},
258 title = {A Computational Logic Handbook},
259 publisher = {Academic Press},
263 author = {N. G. de Bruijn},
264 title = {Lambda Calculus Notation with Nameless Dummies,
265 a Tool for Automatic Formula Manipulation,
266 with Application to the {Church-Rosser Theorem}},
267 journal = {Indag. Math.},
272 @InProceedings{bulwahnKN07,
273 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
274 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
275 crossref = {tphols2007},
279 @InProceedings{bulwahn-et-al:2008:imperative,
280 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
281 title = {Imperative Functional Programming with {Isabelle/HOL}},
282 crossref = {tphols2008},
287 author = {M. Burrows and M. Abadi and R. M. Needham},
288 title = {A Logic of Authentication},
296 @TechReport{camilleri92,
297 author = {J. Camilleri and T. F. Melham},
298 title = {Reasoning with Inductively Defined Relations in the
299 {HOL} Theorem Prover},
306 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
307 title = {Artificial Intelligence Programming},
308 publisher = {Lawrence Erlbaum Associates},
312 author = "Alonzo Church",
313 title = "A Formulation of the Simple Theory of Types",
319 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
320 title="Model Checking",publisher=MIT,year=1999}
323 author = {Martin D. Coen},
324 title = {Interactive Program Derivation},
325 school = {University of Cambridge},
326 note = {Computer Laboratory Technical Report 272},
331 author = {R. L. Constable and others},
332 title = {Implementing Mathematics with the Nuprl Proof
334 publisher = Prentice,
339 @Book{davey-priestley,
340 author = {B. A. Davey and H. A. Priestley},
341 title = {Introduction to Lattices and Order},
346 author = {Keith J. Devlin},
347 title = {Fundamentals of Contemporary Set Theory},
348 publisher = {Springer},
352 author = {Michael Dummett},
353 title = {Elements of Intuitionism},
355 publisher = {Oxford University Press}}
357 @incollection{dybjer91,
358 author = {Peter Dybjer},
359 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
360 Theory and Their Set-Theoretic Semantics},
361 crossref = {huet-plotkin91},
365 author = {Roy Dyckhoff},
366 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
376 author = {William M. Farmer and Joshua D. Guttman and F. Javier
378 title = {{IMPS}: An Interactive Mathematical Proof System},
385 @InProceedings{felty91a,
386 Author = {Amy Felty},
387 Title = {A Logic Program for Transforming Sequent Proofs to Natural
389 crossref = {extensions91},
392 @Article{fleuriot-jcm,
393 author = {Jacques Fleuriot and Lawrence C. Paulson},
394 title = {Mechanizing Nonstandard Real Analysis},
395 journal = {LMS Journal of Computation and Mathematics},
399 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
403 author = {Jacob Frost},
404 title = {A Case Study of Co-induction in {Isabelle HOL}},
410 %revised version of frost93
412 author = {Jacob Frost},
413 title = {A Case Study of Co-induction in {Isabelle}},
420 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
422 title = {Principles of {OBJ2}},
430 author = {J. H. Gallier},
431 title = {Logic for Computer Science:
432 Foundations of Automatic Theorem Proving},
434 publisher = {Harper \& Row}}
437 author = {Antony Galton},
438 title = {Logic for Information Technology},
442 @Article{Gentzen:1935,
443 author = {G. Gentzen},
444 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
445 journal = {Math. Zeitschrift},
449 @InProceedings{gimenez-codifying,
450 author = {Eduardo Gim{\'e}nez},
451 title = {Codifying Guarded Definitions with Recursive Schemes},
452 crossref = {types94},
457 author = {Jean-Yves Girard},
458 title = {Proofs and Types},
461 note = {Translated by Yves LaFont and Paul Taylor}}
464 editor = {M. J. C. Gordon and T. F. Melham},
465 title = {Introduction to {HOL}: A Theorem Proving Environment for
471 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
473 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
475 publisher = {Springer},
478 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
479 title={Why we can't have {SML} style datatype declarations in {HOL}},
480 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
481 IFIP TC10/WG10.2 Intl. Workshop, 1992},
482 editor={L.J.M. Claesen and M.J.C. Gordon},
483 publisher=NH,year=1993,pages={561--568}}
485 @InProceedings{gunter-trees,
486 author = {Elsa L. Gunter},
487 title = {A Broader Class of Trees for Recursive Type Definitions for
494 @InProceedings{Haftmann-Wenzel:2006:classes,
495 author = {Florian Haftmann and Makarius Wenzel},
496 title = {Constructive Type Classes in {Isabelle}},
497 editor = {T. Altenkirch and C. McBride},
498 booktitle = {Types for Proofs and Programs, TYPES 2006},
499 publisher = {Springer},
505 @TechReport{Haftmann-Nipkow:2007:codegen,
506 author = {Florian Haftmann and Tobias Nipkow},
507 title = {A Code Generator Framework for {Isabelle/HOL}},
508 editor = {Klaus Schneider and Jens Brandt},
509 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
512 institution = {Department of Computer Science, University of Kaiserslautern},
516 @InProceedings{Haftmann-Wenzel:2009,
517 author = {Florian Haftmann and Makarius Wenzel},
518 title = {Local theory specifications in {Isabelle/Isar}},
519 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
520 booktitle = {Types for Proofs and Programs, TYPES 2008},
521 publisher = {Springer},
527 @manual{isabelle-classes,
528 author = {Florian Haftmann},
529 title = {Haskell-style type classes with {Isabelle}/{Isar}},
531 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
534 @manual{isabelle-codegen,
535 author = {Florian Haftmann},
536 title = {Code generation from Isabelle theories},
538 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
542 author = {Paul R. Halmos},
543 title = {Naive Set Theory},
544 publisher = {Van Nostrand},
547 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
548 title={Dynamic Logic},publisher=MIT,year=2000}
551 author = {Matthew Hennessy},
552 title = {The Semantics of Programming Languages: An Elementary
553 Introduction Using Structural Operational Semantics},
557 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
558 title={Introduction to Automata Theory, Languages, and Computation.},
559 publisher={Addison-Wesley},year=1979}
561 @Article{haskell-report,
562 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
563 title = {Report on the Programming Language {Haskell}: A
564 Non-strict, Purely Functional Language},
570 note = {Version 1.2}}
572 @Article{haskell-tutorial,
573 author = {Paul Hudak and Joseph H. Fasel},
574 title = {A Gentle Introduction to {Haskell}},
581 @book{Hudak-Haskell,author={Paul Hudak},
582 title={The Haskell School of Expression},publisher=CUP,year=2000}
585 author = {G. P. Huet},
586 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
593 author = {G. P. Huet and B. Lang},
594 title = {Proving and Applying Program Transformations Expressed with
595 Second-Order Patterns},
601 @inproceedings{huet88,
602 author = {G{\'e}rard Huet},
603 title = {Induction Principles Formalized in the {Calculus of
605 booktitle = {Programming of Future Generation Computers},
606 editor = {K. Fuchi and M. Nivat},
609 publisher = {Elsevier}}
611 @Book{Huth-Ryan-book,
612 author = {Michael Huth and Mark Ryan},
613 title = {Logic in Computer Science. Modelling and reasoning about systems},
617 @InProceedings{Harrison:1996:MizarHOL,
618 author = {J. Harrison},
619 title = {A {Mizar} Mode for {HOL}},
621 crossref = {tphols96}}
625 @article{haskell-revised-report,
626 author = {Simon {Peyton Jones} and others},
627 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
628 journal = {Journal of Functional Programming},
634 note = {\url{http://www.haskell.org/definition/}}}
637 author = "Daniel Jackson",
638 title = "Software Abstractions: Logic, Language, and Analysis",
644 @InProceedings{kammueller-locales,
645 author = {Florian Kamm{\"u}ller and Markus Wenzel and
646 Lawrence C. Paulson},
647 title = {Locales: A Sectioning Concept for {Isabelle}},
648 crossref = {tphols99}}
651 author={Donald E. Knuth},
652 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
653 publisher={Addison-Wesley},
657 author = {R. E. Korf},
658 title = {Depth-First Iterative-Deepening: an Optimal Admissible
665 @InProceedings{krauss2006,
666 author = {Alexander Krauss},
667 title = {Partial Recursive Functions in {Higher-Order Logic}},
668 crossref = {ijcar2006},
671 @PhdThesis{krauss_phd,
672 author = {Alexander Krauss},
673 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
674 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
679 @manual{isabelle-function,
680 author = {Alexander Krauss},
681 title = {Defining Recursive Functions in {Isabelle/HOL}},
683 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
687 author = {Kenneth Kunen},
688 title = {Set Theory: An Introduction to Independence Proofs},
695 author = {Xavier Leroy and others},
696 title = {The Objective Caml system -- Documentation and user's manual},
697 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
699 @InProceedings{lowe-fdr,
700 author = {Gavin Lowe},
701 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
702 Protocol using {CSP} and {FDR}},
703 booktitle = {Tools and Algorithms for the Construction and Analysis
704 of Systems: second international workshop, TACAS '96},
705 editor = {T. Margaria and B. Steffen},
706 series = {LNCS 1055},
708 publisher = {Springer},
714 author = {Zohar Manna and Richard Waldinger},
715 title = {Deductive Synthesis of the Unification Algorithm},
722 @InProceedings{martin-nipkow,
723 author = {Ursula Martin and Tobias Nipkow},
724 title = {Ordered Rewriting and Confluence},
729 author = {Per Martin-L{\"o}f},
730 title = {Intuitionistic type theory},
732 publisher = {Bibliopolis}}
734 @incollection{melham89,
735 author = {Thomas F. Melham},
736 title = {Automating Recursive Type Definitions in Higher Order
739 crossref = {birtwistle89}}
741 @Article{Miller:1991,
742 author = {Dale Miller},
743 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
744 and Simple Unification},
745 journal = {Journal of Logic and Computation},
751 @Article{miller-mixed,
752 Author = {Dale Miller},
753 Title = {Unification Under a Mixed Prefix},
761 author = {Robin Milner},
762 title = {A Theory of Type Polymorphism in Programming},
763 journal = "J. Comp.\ Sys.\ Sci.",
768 @TechReport{milner-ind,
769 author = {Robin Milner},
770 title = {How to Derive Inductions in {LCF}},
771 institution = Edinburgh,
775 @Article{milner-coind,
776 author = {Robin Milner and Mads Tofte},
777 title = {Co-induction in Relational Semantics},
784 author = {Robin Milner},
785 title = {Communication and Concurrency},
786 publisher = Prentice,
789 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
790 title="The Definition of Standard ML",publisher=MIT,year=1990}
792 @PhdThesis{monahan84,
793 author = {Brian Q. Monahan},
794 title = {Data Type Proofs using Edinburgh {LCF}},
795 school = {University of Edinburgh},
798 @article{MuellerNvOS99,
800 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
801 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
803 @Manual{Muzalewski:Mizar,
804 title = {An Outline of {PC} {Mizar}},
805 author = {Micha{\l} Muzalewski},
806 organization = {Fondation of Logic, Mathematics and Informatics
807 --- Mizar Users Group},
809 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
814 @InProceedings{NaraschewskiW-TPHOLs98,
815 author = {Wolfgang Naraschewski and Markus Wenzel},
817 {Object-Oriented Verification based on Record Subtyping in
819 crossref = {tphols98}}
821 @inproceedings{nazareth-nipkow,
822 author = {Dieter Nazareth and Tobias Nipkow},
823 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
824 crossref = {tphols96},
828 @Article{needham-schroeder,
829 author = "Roger M. Needham and Michael D. Schroeder",
830 title = "Using Encryption for Authentication in Large Networks
839 @inproceedings{nipkow-W,
840 author = {Wolfgang Naraschewski and Tobias Nipkow},
841 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
842 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
843 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
844 publisher = Springer,
850 @InCollection{nipkow-sorts93,
851 author = {T. Nipkow},
852 title = {Order-Sorted Polymorphism in {Isabelle}},
853 booktitle = {Logical Environments},
856 editor = {G. Huet and G. Plotkin},
860 @Misc{nipkow-types93,
861 author = {Tobias Nipkow},
862 title = {Axiomatic Type Classes (in {I}sabelle)},
863 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
867 @inproceedings{Nipkow-CR,
868 author = {Tobias Nipkow},
869 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
870 booktitle = {Automated Deduction --- CADE-13},
871 editor = {M. McRobbie and J.K. Slaney},
872 publisher = Springer,
879 @InProceedings{nipkow-patterns,
880 title = {Functional Unification of Higher-Order Patterns},
881 author = {Tobias Nipkow},
884 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
885 keywords = {unification}}
888 author = {Tobias Nipkow},
889 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
895 @inproceedings{Nipkow-TYPES02,
896 author = {Tobias Nipkow},
897 title = {{Structured Proofs in Isar/HOL}},
898 booktitle = {Types for Proofs and Programs (TYPES 2002)},
899 editor = {H. Geuvers and F. Wiedijk},
901 publisher = Springer,
906 @manual{isabelle-HOL,
907 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
908 title = {{Isabelle}'s Logics: {HOL}},
909 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
910 M{\"u}nchen and Computer Laboratory, University of Cambridge},
911 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
913 @article{nipkow-prehofer,
914 author = {Tobias Nipkow and Christian Prehofer},
915 title = {Type Reconstruction for Type Classes},
922 @InProceedings{Nipkow-Prehofer:1993,
923 author = {T. Nipkow and C. Prehofer},
924 title = {Type checking type classes},
925 booktitle = {ACM Symp.\ Principles of Programming Languages},
930 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
931 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
932 publisher = Springer,
938 author = {Philippe No{\"e}l},
939 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
947 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
948 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
950 publisher = {Oxford University Press},
955 @Manual{pvs-language,
956 title = {The {PVS} specification language},
957 author = {S. Owre and N. Shankar and J. M. Rushby},
958 organization = {Computer Science Laboratory, SRI International},
959 address = {Menlo Park, CA},
960 note = {Beta release},
963 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
968 @InProceedings{paulin-tlca,
969 author = {Christine Paulin-Mohring},
970 title = {Inductive Definitions in the System {Coq}: Rules and
975 @InProceedings{paulson-CADE,
976 author = {Lawrence C. Paulson},
977 title = {A Fixedpoint Approach to Implementing (Co)Inductive
982 @InProceedings{paulson-COLOG,
983 author = {Lawrence C. Paulson},
984 title = {A Formulation of the Simple Theory of Types (for
987 crossref = {colog88},
988 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
990 @Article{paulson-coind,
991 author = {Lawrence C. Paulson},
992 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1001 @manual{isabelle-intro,
1002 author = {Lawrence C. Paulson},
1003 title = {Introduction to {Isabelle}},
1005 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1007 @manual{isabelle-logics,
1008 author = {Lawrence C. Paulson},
1009 title = {{Isabelle's} Logics},
1011 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1013 @manual{isabelle-ref,
1014 author = {Lawrence C. Paulson},
1015 title = {The {Isabelle} Reference Manual},
1017 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1019 @manual{isabelle-ZF,
1020 author = {Lawrence C. Paulson},
1021 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1023 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1025 @article{paulson-found,
1026 author = {Lawrence C. Paulson},
1027 title = {The Foundation of a Generic Theorem Prover},
1033 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1035 %replaces paulson-final
1036 @Article{paulson-mscs,
1037 author = {Lawrence C. Paulson},
1038 title = {Final Coalgebras as Greatest Fixed Points
1039 in {ZF} Set Theory},
1040 journal = {Mathematical Structures in Computer Science},
1046 @InCollection{paulson-generic,
1047 author = {Lawrence C. Paulson},
1048 title = {Generic Automatic Proof Tools},
1049 crossref = {wos-fest},
1052 @Article{paulson-gr,
1053 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1054 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1063 @InCollection{paulson-fixedpt-milner,
1064 author = {Lawrence C. Paulson},
1065 title = {A Fixedpoint Approach to (Co)inductive and
1066 (Co)datatype Definitions},
1068 crossref = {milner-fest}}
1071 title = {Proof, Language, and Interaction:
1072 Essays in Honor of {Robin Milner}},
1073 booktitle = {Proof, Language, and Interaction:
1074 Essays in Honor of {Robin Milner}},
1077 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1079 @InCollection{paulson-handbook,
1080 author = {Lawrence C. Paulson},
1081 title = {Designing a Theorem Prover},
1082 crossref = {handbk-lics2},
1085 @Book{paulson-isa-book,
1086 author = {Lawrence C. Paulson},
1087 title = {Isabelle: A Generic Theorem Prover},
1088 publisher = {Springer},
1092 @Book{isabelle-hol-book,
1093 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1094 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1095 publisher = {Springer},
1099 @InCollection{paulson-markt,
1100 author = {Lawrence C. Paulson},
1101 title = {Tool Support for Logics of Programs},
1102 booktitle = {Mathematical Methods in Program Development:
1103 Summer School Marktoberdorf 1996},
1104 publisher = {Springer},
1106 year = {Published 1997},
1107 editor = {Manfred Broy},
1108 series = {NATO ASI Series F}}
1110 %replaces Paulson-ML and paulson91
1112 author = {Lawrence C. Paulson},
1113 title = {{ML} for the Working Programmer},
1118 @article{paulson-natural,
1119 author = {Lawrence C. Paulson},
1120 title = {Natural Deduction as Higher-order Resolution},
1125 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1127 @Article{paulson-set-I,
1128 author = {Lawrence C. Paulson},
1129 title = {Set Theory for Verification: {I}. {From}
1130 Foundations to Functions},
1136 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1138 @Article{paulson-set-II,
1139 author = {Lawrence C. Paulson},
1140 title = {Set Theory for Verification: {II}. {Induction} and
1147 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1150 author = {Lawrence C. Paulson},
1151 title = {Verifying the Unification Algorithm in {LCF}},
1157 %replaces Paulson-LCF
1159 author = {Lawrence C. Paulson},
1160 title = {Logic and Computation: Interactive proof with Cambridge
1165 @incollection{paulson700,
1166 author = {Lawrence C. Paulson},
1167 title = {{Isabelle}: The Next 700 Theorem Provers},
1168 crossref = {odifreddi90},
1170 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1172 % replaces paulson-ns and paulson-security
1173 @Article{paulson-jcs,
1174 author = {Lawrence C. Paulson},
1175 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1181 @Article{paulson-tls,
1182 author = {Lawrence C. Paulson},
1183 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1191 @Article{paulson-yahalom,
1192 author = {Lawrence C. Paulson},
1193 title = {Relations Between Secrets:
1194 Two Formal Analyses of the {Yahalom} Protocol},
1201 @article{pelletier86,
1202 author = {F. J. Pelletier},
1203 title = {Seventy-five Problems for Testing Automatic Theorem
1209 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1212 author = {Andrew M. Pitts},
1213 title = {A Co-induction Principle for Recursively Defined Domains},
1219 @Article{plaisted90,
1220 author = {David A. Plaisted},
1221 title = {A Sequent-Style Model Elimination Strategy and a Positive
1232 author = {Art Quaife},
1233 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1243 @TechReport{rasmussen95,
1244 author = {Ole Rasmussen},
1245 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1247 institution = {Computer Laboratory, University of Cambridge},
1251 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1254 author = {Steve Reeves and Michael Clarke},
1255 title = {Logic for Computer Science},
1256 publisher = {Addison-Wesley},
1259 @book{Rosen-DMA,author={Kenneth H. Rosen},
1260 title={Discrete Mathematics and Its Applications},
1261 publisher={McGraw-Hill},year=1998}
1263 @InProceedings{Rudnicki:1992:MizarOverview,
1264 author = {P. Rudnicki},
1265 title = {An Overview of the {MIZAR} Project},
1266 booktitle = {1992 Workshop on Types for Proofs and Programs},
1268 organization = {Chalmers University of Technology},
1269 publisher = {Bastad}
1274 @inproceedings{saaltink-fme,
1275 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1276 Dan Craigen and Irwin Meisels},
1277 title = {An {EVES} Data Abstraction Example},
1281 @Article{Schroeder-Heister:1984,
1282 author = {Peter Schroeder-Heister},
1283 title = {A Natural Extension of Natural Deduction},
1284 journal = {Journal of Symbolic Logic},
1290 @misc{sledgehammer-2009,
1291 key = "Sledgehammer",
1292 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1293 Write Your {I}s\-a\-belle Scripts",
1294 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1296 @inproceedings{slind-tfl,
1297 author = {Konrad Slind},
1298 title = {Function Definition in Higher Order Logic},
1299 crossref = {tphols96},
1303 author = {Patrick Suppes},
1304 title = {Axiomatic Set Theory},
1306 publisher = {Dover}}
1308 @InCollection{szasz93,
1309 author = {Nora Szasz},
1310 title = {A Machine Checked Proof that {Ackermann's} Function is not
1311 Primitive Recursive},
1312 crossref = {huet-plotkin93},
1315 @TechReport{Syme:1997:DECLARE,
1317 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1318 institution = {University of Cambridge Computer Laboratory},
1323 @PhdThesis{Syme:1998:thesis,
1325 title = {Declarative Theorem Proving for Operational Semantics},
1326 school = {University of Cambridge},
1331 @InProceedings{Syme:1999:TPHOL,
1333 title = {Three Tactic Theorem Proving},
1334 crossref = {tphols99}}
1339 author = {G. Takeuti},
1340 title = {Proof Theory},
1346 author = {Simon Thompson},
1347 title = {Type Theory and Functional Programming},
1348 publisher = {Addison-Wesley},
1351 @book{Thompson-Haskell,author={Simon Thompson},
1352 title={Haskell: The Craft of Functional Programming},
1353 publisher={Addison-Wesley},year=1999}
1356 author = "Emina Torlak",
1357 title = {Kodkod: Constraint Solver for Relational Logic},
1358 note = "\url{http://alloy.mit.edu/kodkod/}"}
1360 @misc{kodkod-2009-options,
1361 author = "Emina Torlak",
1362 title = "Kodkod {API}: Class {Options}",
1363 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1365 @inproceedings{torlak-jackson-2007,
1366 title = "Kodkod: A Relational Model Finder",
1367 author = "Emina Torlak and Daniel Jackson",
1368 editor = "Orna Grumberg and Michael Huth",
1369 booktitle = "TACAS 2007",
1374 publisher = Springer}
1376 @Unpublished{Trybulec:1993:MizarFeatures,
1377 author = {A. Trybulec},
1378 title = {Some Features of the {Mizar} Language},
1379 note = {Presented at a workshop in Turin, Italy},
1385 @Unpublished{voelker94,
1386 author = {Norbert V{\"o}lker},
1387 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1388 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1394 @inproceedings{wadler89how,
1395 author = {P. Wadler and S. Blott},
1396 title = {How to make ad-hoc polymorphism less ad-hoc},
1397 booktitle = {ACM Symp.\ Principles of Programming Languages},
1401 @phdthesis{weber-2008,
1402 author = "Tjark Weber",
1403 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1404 school = {Dept.\ of Informatics, T.U. M\"unchen},
1405 type = "{Ph.D.}\ thesis",
1409 author = {Christoph Wedler},
1410 title = {Emacs package ``{X-Symbol}''},
1411 note = {\url{http://x-symbol.sourceforge.net}}
1414 @manual{isabelle-sys,
1415 author = {Markus Wenzel and Stefan Berghofer},
1416 title = {The {Isabelle} System Manual},
1417 institution = {TU Munich},
1418 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1420 @manual{isabelle-isar-ref,
1421 author = {Makarius Wenzel},
1422 title = {The {Isabelle/Isar} Reference Manual},
1423 institution = {TU Munich},
1424 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1426 @manual{isabelle-implementation,
1427 author = {Makarius Wenzel},
1428 title = {The {Isabelle/Isar} Implementation},
1429 institution = {TU Munich},
1430 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1432 @InProceedings{Wenzel:1999:TPHOL,
1433 author = {Markus Wenzel},
1434 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1435 crossref = {tphols99}}
1437 @InProceedings{Wenzel:1997:TPHOL,
1438 author = {Markus Wenzel},
1439 title = {Type Classes and Overloading in Higher-Order Logic},
1440 crossref = {tphols97}}
1442 @phdthesis{Wenzel-PhD,
1443 author={Markus Wenzel},
1444 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1445 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1447 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1449 @Article{Wenzel-Wiedijk:2002,
1450 author = {Freek Wiedijk and Markus Wenzel},
1451 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1452 journal = {Journal of Automated Reasoning},
1458 @InCollection{Wenzel-Paulson:2006,
1459 author = {Markus Wenzel and Lawrence C. Paulson},
1460 title = {{Isabelle/Isar}},
1461 booktitle = {The Seventeen Provers of the World},
1463 editor = {F. Wiedijk},
1464 series = {LNAI 3600}
1467 @InCollection{Wenzel:2006:Festschrift,
1468 author = {Makarius Wenzel},
1469 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1470 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1471 publisher = {University of Bia{\l}ystok},
1473 editor = {R. Matuszewski and A. Zalewska},
1475 series = {Studies in Logic, Grammar, and Rhetoric},
1476 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1480 author = {A. N. Whitehead and B. Russell},
1481 title = {Principia Mathematica},
1484 note = {Paperback edition to *56,
1485 abridged from the 2nd edition (1927)}}
1487 @Misc{Wiedijk:1999:Mizar,
1488 author = {Freek Wiedijk},
1489 title = {Mizar: An Impression},
1490 howpublished = {Unpublished paper},
1492 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1495 @Misc{Wiedijk:2000:MV,
1496 author = {Freek Wiedijk},
1497 title = {The Mathematical Vernacular},
1498 howpublished = {Unpublished paper},
1500 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1504 author = {Glynn Winskel},
1505 title = {The Formal Semantics of Programming Languages},
1506 publisher = MIT,year=1993}
1508 @InCollection{wos-bledsoe,
1509 author = {Larry Wos},
1510 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1511 crossref = {bledsoe-fest},
1514 @InProceedings{Zammit:1999:TPHOL,
1515 author = {Vincent Zammit},
1516 title = {On the Implementation of an Extensible Declarative Proof Language},
1517 crossref = {tphols99}}
1525 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1526 title = {Handbook of Logic in Computer Science},
1527 booktitle = {Handbook of Logic in Computer Science},
1528 publisher = {Oxford University Press},
1533 editor = {Henk Barendregt and Tobias Nipkow},
1534 title = TYPES # {: International Workshop {TYPES '93}},
1535 booktitle = TYPES # {: International Workshop {TYPES '93}},
1536 year = {published 1994},
1537 publisher = {Springer},
1538 series = {LNCS 806}}
1540 @book{barwise-handbk,
1541 editor = {J. Barwise},
1542 title = {Handbook of Mathematical Logic},
1543 booktitle = {Handbook of Mathematical Logic},
1547 @Proceedings{tlca93,
1548 title = {Typed Lambda Calculi and Applications},
1549 booktitle = {Typed Lambda Calculi and Applications},
1550 editor = {M. Bezem and J.F. Groote},
1552 publisher = {Springer},
1553 series = {LNCS 664}}
1556 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1557 title = {Current Trends in Hardware Verification and Automated
1559 booktitle = {Current Trends in Hardware Verification and Automated
1561 publisher = {Springer},
1565 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1566 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1567 publisher = {Kluwer Academic Publishers},
1569 editor = {Robert S. Boyer}}
1571 @Proceedings{cade12,
1572 editor = {Alan Bundy},
1573 title = {Automated Deduction --- {CADE}-12
1574 International Conference},
1575 booktitle = {Automated Deduction --- {CADE}-12
1576 International Conference},
1578 series = {LNAI 814},
1579 publisher = {Springer}}
1582 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1583 title = TYPES # {: International Workshop {TYPES '94}},
1584 booktitle = TYPES # {: International Workshop {TYPES '94}},
1586 publisher = {Springer},
1587 series = {LNCS 996}}
1589 @book{huet-plotkin91,
1590 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1591 title = {Logical Frameworks},
1592 booktitle = {Logical Frameworks},
1596 @book{huet-plotkin93,
1597 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1598 title = {Logical Environments},
1599 booktitle = {Logical Environments},
1604 editor = {J. Joyce and C. Seger},
1605 title = {Higher Order Logic Theorem Proving and Its
1606 Applications: HUG '93},
1607 booktitle = {Higher Order Logic Theorem Proving and Its
1608 Applications: HUG '93},
1609 year = {Published 1994},
1610 publisher = {Springer},
1611 series = {LNCS 780}}
1613 @proceedings{colog88,
1614 editor = {P. Martin-L{\"o}f and G. Mints},
1615 title = {COLOG-88: International Conference on Computer Logic},
1616 booktitle = {COLOG-88: International Conference on Computer Logic},
1617 year = {Published 1990},
1618 publisher = {Springer},
1619 organization = {Estonian Academy of Sciences},
1620 address = {Tallinn},
1621 series = {LNCS 417}}
1624 editor = {P. Odifreddi},
1625 title = {Logic and Computer Science},
1626 booktitle = {Logic and Computer Science},
1627 publisher = {Academic Press},
1630 @proceedings{extensions91,
1631 editor = {Peter Schroeder-Heister},
1632 title = {Extensions of Logic Programming},
1633 booktitle = {Extensions of Logic Programming},
1635 series = {LNAI 475},
1636 publisher = {Springer}}
1638 @proceedings{cade10,
1639 editor = {Mark E. Stickel},
1640 title = {10th } # CADE,
1641 booktitle = {10th } # CADE,
1643 publisher = {Springer},
1644 series = {LNAI 449}}
1647 editor = {M. Vardi},
1648 title = {Eighth Annual Symposium on Logic in Computer Science},
1649 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1654 title = {Automated Reasoning and its Applications:
1655 Essays in Honor of {Larry Wos}},
1656 booktitle = {Automated Reasoning and its Applications:
1657 Essays in Honor of {Larry Wos}},
1660 editor = {Robert Veroff}}
1663 editor = {J. C. P. Woodcock and P. G. Larsen},
1664 title = {FME '93: Industrial-Strength Formal Methods},
1665 booktitle = {FME '93: Industrial-Strength Formal Methods},
1667 publisher = Springer,
1671 @Proceedings{tphols96,
1672 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1673 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1674 editor = {J. von Wright and J. Grundy and J. Harrison},
1675 publisher = Springer,
1680 @Proceedings{tphols97,
1681 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1682 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1683 editor = {Elsa L. Gunter and Amy Felty},
1684 publisher = Springer,
1689 @Proceedings{tphols98,
1690 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1691 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1692 editor = {Jim Grundy and Malcom Newey},
1693 publisher = Springer,
1698 @Proceedings{tphols99,
1699 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1700 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1701 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1702 Paulin, C. and Thery, L.},
1703 publisher = Springer,
1708 @Proceedings{tphols2000,
1709 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1710 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1711 editor = {J. Harrison and M. Aagaard},
1712 publisher = Springer,
1717 @Proceedings{tphols2001,
1718 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1719 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1720 editor = {R. J. Boulton and P. B. Jackson},
1721 publisher = Springer,
1726 @Proceedings{ijcar2006,
1727 title = {Automated Reasoning: {IJCAR} 2006},
1728 booktitle = {Automated Reasoning: {IJCAR} 2006},
1729 editor = {U. Furbach and N. Shankar},
1730 publisher = Springer,
1735 @Proceedings{tphols2007,
1736 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1737 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1738 editor = {K. Schneider and J. Brandt},
1739 publisher = Springer,
1744 @Proceedings{tphols2008,
1745 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1746 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1747 publisher = Springer,
1753 @unpublished{classes_modules,
1754 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1755 author = {Stefan Wehr et. al.}
1758 @misc{wikipedia-2009-aa-trees,
1760 title = "Wikipedia: {AA} Tree",
1761 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}