1 % BibTeX database for the Isabelle documentation
4 @string{AP="Academic Press"}
5 @string{CUP="Cambridge University Press"}
6 @string{IEEE="{\sc ieee} Computer Society Press"}
7 @string{LNCS="Lecture Notes in Computer Science"}
8 @string{MIT="MIT Press"}
9 @string{NH="North-Holland"}
10 @string{Prentice="Prentice-Hall"}
11 @string{PH="Prentice-Hall"}
12 @string{Springer="Springer-Verlag"}
15 @string{CUCL="Computer Laboratory, University of Cambridge"}
16 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}
17 @string{TUM="Department of Informatics, Technical University of Munich"}
20 @string{AI="Artificial Intelligence"}
21 @string{FAC="Formal Aspects of Computing"}
22 @string{JAR="Journal of Automated Reasoning"}
23 @string{JCS="Journal of Computer Security"}
24 @string{JFP="Journal of Functional Programming"}
25 @string{JLC="Journal of Logic and Computation"}
26 @string{JLP="Journal of Logic Programming"}
27 @string{JSC="Journal of Symbolic Computation"}
28 @string{JSL="Journal of Symbolic Logic"}
29 @string{PROYAL="Proceedings of the Royal Society of London"}
30 @string{SIGPLAN="{SIGPLAN} Notices"}
31 @string{TISSEC="ACM Transactions on Information and System Security"}
34 @string{CADE="International Conference on Automated Deduction"}
35 @string{POPL="Symposium on Principles of Programming Languages"}
36 @string{TYPES="Types for Proofs and Programs"}
41 @incollection{abramsky90,
42 author = {Samson Abramsky},
43 title = {The Lazy Lambda Calculus},
45 editor = {David A. Turner},
46 booktitle = {Research Topics in Functional Programming},
47 publisher = {Addison-Wesley},
50 @Unpublished{abrial93,
51 author = {J. R. Abrial and G. Laffitte},
52 title = {Towards the Mechanization of the Proofs of Some Classical
53 Theorems of Set Theory},
58 @incollection{aczel77,
59 author = {Peter Aczel},
60 title = {An Introduction to Inductive Definitions},
62 crossref = {barwise-handbk}}
65 author = {Peter Aczel},
66 title = {Non-Well-Founded Sets},
71 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
72 title = {The {ALF} Proof Editor and Its Proof Engine},
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-Nipkow:2000:TPHOL,
176 crossref = "tphols2000",
177 title = "Proof terms for simply typed higher order logic",
178 author = "Stefan Berghofer and Tobias Nipkow",
181 @inproceedings{berghofer-nipkow-2004,
182 author = {Stefan Berghofer and Tobias Nipkow},
183 title = {Random Testing in {I}sabelle/{HOL}},
185 editor = "J. Cuellar and Z. Liu",
186 booktitle = {{SEFM} 2004},
190 @InProceedings{Berghofer-Nipkow:2002,
191 author = {Stefan Berghofer and Tobias Nipkow},
192 title = {Executing Higher Order Logic},
193 booktitle = {Types for Proofs and Programs: TYPES'2000},
194 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
196 publisher = Springer,
200 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
201 author = {Stefan Berghofer and Markus Wenzel},
202 title = {Inductive datatypes in {HOL} --- lessons learned in
203 {F}ormal-{L}ogic {E}ngineering},
204 crossref = {tphols99}}
207 @InProceedings{Bezem-Coquand:2005,
208 author = {M.A. Bezem and T. Coquand},
209 title = {Automating {Coherent Logic}},
210 booktitle = {LPAR-12},
211 editor = {G. Sutcliffe and A. Voronkov},
214 publisher = Springer}
216 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
217 title="Introduction to Functional Programming",publisher=PH,year=1988}
219 @book{Bird-Haskell,author="Richard Bird",
220 title="Introduction to Functional Programming using Haskell",
221 publisher=PH,year=1998}
223 @inproceedings{blanchette-nipkow-2009,
224 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)",
225 author = "Jasmin Christian Blanchette and Tobias Nipkow",
226 booktitle = "{TAP} 2009: Short Papers",
227 editor = "Catherine Dubois",
228 publisher = "ETH Technical Report 630",
232 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
233 Overbeek and Mark Stickel and Lawrence Wos},
234 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
243 author = {Robert S. Boyer and J Strother Moore},
244 title = {A Computational Logic},
245 publisher = {Academic Press},
249 author = {Robert S. Boyer and J Strother Moore},
250 title = {A Computational Logic Handbook},
251 publisher = {Academic Press},
255 author = {N. G. de Bruijn},
256 title = {Lambda Calculus Notation with Nameless Dummies,
257 a Tool for Automatic Formula Manipulation,
258 with Application to the {Church-Rosser Theorem}},
259 journal = {Indag. Math.},
264 @InProceedings{bulwahnKN07,
265 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
266 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
267 crossref = {tphols2007},
271 @InProceedings{bulwahn-et-al:2008:imperative,
272 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
273 title = {Imperative Functional Programming with {Isabelle/HOL}},
274 crossref = {tphols2008},
279 author = {M. Burrows and M. Abadi and R. M. Needham},
280 title = {A Logic of Authentication},
288 @TechReport{camilleri92,
289 author = {J. Camilleri and T. F. Melham},
290 title = {Reasoning with Inductively Defined Relations in the
291 {HOL} Theorem Prover},
298 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
299 title = {Artificial Intelligence Programming},
300 publisher = {Lawrence Erlbaum Associates},
304 author = "Alonzo Church",
305 title = "A Formulation of the Simple Theory of Types",
311 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
312 title="Model Checking",publisher=MIT,year=1999}
315 author = {Martin D. Coen},
316 title = {Interactive Program Derivation},
317 school = {University of Cambridge},
318 note = {Computer Laboratory Technical Report 272},
323 author = {R. L. Constable and others},
324 title = {Implementing Mathematics with the Nuprl Proof
326 publisher = Prentice,
331 @Book{davey-priestley,
332 author = {B. A. Davey and H. A. Priestley},
333 title = {Introduction to Lattices and Order},
338 author = {Keith J. Devlin},
339 title = {Fundamentals of Contemporary Set Theory},
340 publisher = {Springer},
344 author = {Michael Dummett},
345 title = {Elements of Intuitionism},
347 publisher = {Oxford University Press}}
349 @incollection{dybjer91,
350 author = {Peter Dybjer},
351 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
352 Theory and Their Set-Theoretic Semantics},
353 crossref = {huet-plotkin91},
357 author = {Roy Dyckhoff},
358 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
368 author = {William M. Farmer and Joshua D. Guttman and F. Javier
370 title = {{IMPS}: An Interactive Mathematical Proof System},
377 @InProceedings{felty91a,
378 Author = {Amy Felty},
379 Title = {A Logic Program for Transforming Sequent Proofs to Natural
381 crossref = {extensions91},
384 @Article{fleuriot-jcm,
385 author = {Jacques Fleuriot and Lawrence C. Paulson},
386 title = {Mechanizing Nonstandard Real Analysis},
387 journal = {LMS Journal of Computation and Mathematics},
391 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
395 author = {Jacob Frost},
396 title = {A Case Study of Co-induction in {Isabelle HOL}},
402 %revised version of frost93
404 author = {Jacob Frost},
405 title = {A Case Study of Co-induction in {Isabelle}},
412 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
414 title = {Principles of {OBJ2}},
422 author = {J. H. Gallier},
423 title = {Logic for Computer Science:
424 Foundations of Automatic Theorem Proving},
426 publisher = {Harper \& Row}}
429 author = {Antony Galton},
430 title = {Logic for Information Technology},
434 @Article{Gentzen:1935,
435 author = {G. Gentzen},
436 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
437 journal = {Math. Zeitschrift},
441 @InProceedings{gimenez-codifying,
442 author = {Eduardo Gim{\'e}nez},
443 title = {Codifying Guarded Definitions with Recursive Schemes},
444 crossref = {types94},
449 author = {Jean-Yves Girard},
450 title = {Proofs and Types},
453 note = {Translated by Yves LaFont and Paul Taylor}}
456 editor = {M. J. C. Gordon and T. F. Melham},
457 title = {Introduction to {HOL}: A Theorem Proving Environment for
463 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
465 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
467 publisher = {Springer},
470 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
471 title={Why we can't have {SML} style datatype declarations in {HOL}},
472 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
473 IFIP TC10/WG10.2 Intl. Workshop, 1992},
474 editor={L.J.M. Claesen and M.J.C. Gordon},
475 publisher=NH,year=1993,pages={561--568}}
477 @InProceedings{gunter-trees,
478 author = {Elsa L. Gunter},
479 title = {A Broader Class of Trees for Recursive Type Definitions for
486 @InProceedings{Haftmann-Wenzel:2006:classes,
487 author = {Florian Haftmann and Makarius Wenzel},
488 title = {Constructive Type Classes in {Isabelle}},
489 editor = {T. Altenkirch and C. McBride},
490 booktitle = {Types for Proofs and Programs, TYPES 2006},
491 publisher = {Springer},
497 @TechReport{Haftmann-Nipkow:2007:codegen,
498 author = {Florian Haftmann and Tobias Nipkow},
499 title = {A Code Generator Framework for {Isabelle/HOL}},
500 editor = {Klaus Schneider and Jens Brandt},
501 booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},
504 institution = {Department of Computer Science, University of Kaiserslautern},
508 @InProceedings{Haftmann-Wenzel:2009,
509 author = {Florian Haftmann and Makarius Wenzel},
510 title = {Local theory specifications in {Isabelle/Isar}},
511 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
512 booktitle = {Types for Proofs and Programs, TYPES 2008},
513 publisher = {Springer},
519 @manual{isabelle-classes,
520 author = {Florian Haftmann},
521 title = {Haskell-style type classes with {Isabelle}/{Isar}},
523 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
526 @manual{isabelle-codegen,
527 author = {Florian Haftmann},
528 title = {Code generation from Isabelle theories},
530 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
534 author = {Paul R. Halmos},
535 title = {Naive Set Theory},
536 publisher = {Van Nostrand},
539 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
540 title={Dynamic Logic},publisher=MIT,year=2000}
543 author = {Matthew Hennessy},
544 title = {The Semantics of Programming Languages: An Elementary
545 Introduction Using Structural Operational Semantics},
549 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
550 title={Introduction to Automata Theory, Languages, and Computation.},
551 publisher={Addison-Wesley},year=1979}
553 @Article{haskell-report,
554 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
555 title = {Report on the Programming Language {Haskell}: A
556 Non-strict, Purely Functional Language},
562 note = {Version 1.2}}
564 @Article{haskell-tutorial,
565 author = {Paul Hudak and Joseph H. Fasel},
566 title = {A Gentle Introduction to {Haskell}},
573 @book{Hudak-Haskell,author={Paul Hudak},
574 title={The Haskell School of Expression},publisher=CUP,year=2000}
577 author = {G. P. Huet},
578 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
585 author = {G. P. Huet and B. Lang},
586 title = {Proving and Applying Program Transformations Expressed with
587 Second-Order Patterns},
593 @inproceedings{huet88,
594 author = {G{\'e}rard Huet},
595 title = {Induction Principles Formalized in the {Calculus of
597 booktitle = {Programming of Future Generation Computers},
598 editor = {K. Fuchi and M. Nivat},
601 publisher = {Elsevier}}
603 @Book{Huth-Ryan-book,
604 author = {Michael Huth and Mark Ryan},
605 title = {Logic in Computer Science. Modelling and reasoning about systems},
609 @InProceedings{Harrison:1996:MizarHOL,
610 author = {J. Harrison},
611 title = {A {Mizar} Mode for {HOL}},
613 crossref = {tphols96}}
617 @article{haskell-revised-report,
618 author = {Simon {Peyton Jones} and others},
619 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
620 journal = {Journal of Functional Programming},
626 note = {\url{http://www.haskell.org/definition/}}}
629 author = "Daniel Jackson",
630 title = "Software Abstractions: Logic, Language, and Analysis",
636 @InProceedings{kammueller-locales,
637 author = {Florian Kamm{\"u}ller and Markus Wenzel and
638 Lawrence C. Paulson},
639 title = {Locales: A Sectioning Concept for {Isabelle}},
640 crossref = {tphols99}}
643 author={Donald E. Knuth},
644 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
645 publisher={Addison-Wesley},
649 author = {R. E. Korf},
650 title = {Depth-First Iterative-Deepening: an Optimal Admissible
657 @InProceedings{krauss2006,
658 author = {Alexander Krauss},
659 title = {Partial Recursive Functions in {Higher-Order Logic}},
660 crossref = {ijcar2006},
663 @PhdThesis{krauss_phd,
664 author = {Alexander Krauss},
665 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
666 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
671 @manual{isabelle-function,
672 author = {Alexander Krauss},
673 title = {Defining Recursive Functions in {Isabelle/HOL}},
675 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
679 author = {Kenneth Kunen},
680 title = {Set Theory: An Introduction to Independence Proofs},
687 author = {Xavier Leroy and others},
688 title = {The Objective Caml system -- Documentation and user's manual},
689 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
691 @InProceedings{lowe-fdr,
692 author = {Gavin Lowe},
693 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
694 Protocol using {CSP} and {FDR}},
695 booktitle = {Tools and Algorithms for the Construction and Analysis
696 of Systems: second international workshop, TACAS '96},
697 editor = {T. Margaria and B. Steffen},
698 series = {LNCS 1055},
700 publisher = {Springer},
706 author = {Zohar Manna and Richard Waldinger},
707 title = {Deductive Synthesis of the Unification Algorithm},
714 @InProceedings{martin-nipkow,
715 author = {Ursula Martin and Tobias Nipkow},
716 title = {Ordered Rewriting and Confluence},
721 author = {Per Martin-L{\"o}f},
722 title = {Intuitionistic type theory},
724 publisher = {Bibliopolis}}
726 @incollection{melham89,
727 author = {Thomas F. Melham},
728 title = {Automating Recursive Type Definitions in Higher Order
731 crossref = {birtwistle89}}
733 @Article{Miller:1991,
734 author = {Dale Miller},
735 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
736 and Simple Unification},
737 journal = {Journal of Logic and Computation},
743 @Article{miller-mixed,
744 Author = {Dale Miller},
745 Title = {Unification Under a Mixed Prefix},
753 author = {Robin Milner},
754 title = {A Theory of Type Polymorphism in Programming},
755 journal = "J. Comp.\ Sys.\ Sci.",
760 @TechReport{milner-ind,
761 author = {Robin Milner},
762 title = {How to Derive Inductions in {LCF}},
763 institution = Edinburgh,
767 @Article{milner-coind,
768 author = {Robin Milner and Mads Tofte},
769 title = {Co-induction in Relational Semantics},
776 author = {Robin Milner},
777 title = {Communication and Concurrency},
778 publisher = Prentice,
781 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
782 title="The Definition of Standard ML",publisher=MIT,year=1990}
784 @PhdThesis{monahan84,
785 author = {Brian Q. Monahan},
786 title = {Data Type Proofs using Edinburgh {LCF}},
787 school = {University of Edinburgh},
790 @article{MuellerNvOS99,
792 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
793 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
795 @Manual{Muzalewski:Mizar,
796 title = {An Outline of {PC} {Mizar}},
797 author = {Micha{\l} Muzalewski},
798 organization = {Fondation of Logic, Mathematics and Informatics
799 --- Mizar Users Group},
801 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
806 @InProceedings{NaraschewskiW-TPHOLs98,
807 author = {Wolfgang Naraschewski and Markus Wenzel},
809 {Object-Oriented Verification based on Record Subtyping in
811 crossref = {tphols98}}
813 @inproceedings{nazareth-nipkow,
814 author = {Dieter Nazareth and Tobias Nipkow},
815 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
816 crossref = {tphols96},
820 @Article{needham-schroeder,
821 author = "Roger M. Needham and Michael D. Schroeder",
822 title = "Using Encryption for Authentication in Large Networks
831 @inproceedings{nipkow-W,
832 author = {Wolfgang Naraschewski and Tobias Nipkow},
833 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
834 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
835 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
836 publisher = Springer,
842 @InCollection{nipkow-sorts93,
843 author = {T. Nipkow},
844 title = {Order-Sorted Polymorphism in {Isabelle}},
845 booktitle = {Logical Environments},
848 editor = {G. Huet and G. Plotkin},
852 @Misc{nipkow-types93,
853 author = {Tobias Nipkow},
854 title = {Axiomatic Type Classes (in {I}sabelle)},
855 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
859 @inproceedings{Nipkow-CR,
860 author = {Tobias Nipkow},
861 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
862 booktitle = {Automated Deduction --- CADE-13},
863 editor = {M. McRobbie and J.K. Slaney},
864 publisher = Springer,
871 @InProceedings{nipkow-patterns,
872 title = {Functional Unification of Higher-Order Patterns},
873 author = {Tobias Nipkow},
876 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
877 keywords = {unification}}
880 author = {Tobias Nipkow},
881 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
887 @inproceedings{Nipkow-TYPES02,
888 author = {Tobias Nipkow},
889 title = {{Structured Proofs in Isar/HOL}},
890 booktitle = {Types for Proofs and Programs (TYPES 2002)},
891 editor = {H. Geuvers and F. Wiedijk},
893 publisher = Springer,
898 @manual{isabelle-HOL,
899 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
900 title = {{Isabelle}'s Logics: {HOL}},
901 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
902 M{\"u}nchen and Computer Laboratory, University of Cambridge},
903 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
905 @article{nipkow-prehofer,
906 author = {Tobias Nipkow and Christian Prehofer},
907 title = {Type Reconstruction for Type Classes},
914 @InProceedings{Nipkow-Prehofer:1993,
915 author = {T. Nipkow and C. Prehofer},
916 title = {Type checking type classes},
917 booktitle = {ACM Symp.\ Principles of Programming Languages},
922 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
923 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
924 publisher = Springer,
930 author = {Philippe No{\"e}l},
931 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
939 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
940 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
942 publisher = {Oxford University Press},
947 @Manual{pvs-language,
948 title = {The {PVS} specification language},
949 author = {S. Owre and N. Shankar and J. M. Rushby},
950 organization = {Computer Science Laboratory, SRI International},
951 address = {Menlo Park, CA},
952 note = {Beta release},
955 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
960 @InProceedings{paulin-tlca,
961 author = {Christine Paulin-Mohring},
962 title = {Inductive Definitions in the System {Coq}: Rules and
967 @InProceedings{paulson-CADE,
968 author = {Lawrence C. Paulson},
969 title = {A Fixedpoint Approach to Implementing (Co)Inductive
974 @InProceedings{paulson-COLOG,
975 author = {Lawrence C. Paulson},
976 title = {A Formulation of the Simple Theory of Types (for
979 crossref = {colog88},
980 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
982 @Article{paulson-coind,
983 author = {Lawrence C. Paulson},
984 title = {Mechanizing Coinduction and Corecursion in Higher-Order
993 @manual{isabelle-intro,
994 author = {Lawrence C. Paulson},
995 title = {Introduction to {Isabelle}},
997 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
999 @manual{isabelle-logics,
1000 author = {Lawrence C. Paulson},
1001 title = {{Isabelle's} Logics},
1003 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1005 @manual{isabelle-ref,
1006 author = {Lawrence C. Paulson},
1007 title = {The {Isabelle} Reference Manual},
1009 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1011 @manual{isabelle-ZF,
1012 author = {Lawrence C. Paulson},
1013 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1015 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1017 @article{paulson-found,
1018 author = {Lawrence C. Paulson},
1019 title = {The Foundation of a Generic Theorem Prover},
1025 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1027 %replaces paulson-final
1028 @Article{paulson-mscs,
1029 author = {Lawrence C. Paulson},
1030 title = {Final Coalgebras as Greatest Fixed Points
1031 in {ZF} Set Theory},
1032 journal = {Mathematical Structures in Computer Science},
1038 @InCollection{paulson-generic,
1039 author = {Lawrence C. Paulson},
1040 title = {Generic Automatic Proof Tools},
1041 crossref = {wos-fest},
1044 @Article{paulson-gr,
1045 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1046 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1055 @InCollection{paulson-fixedpt-milner,
1056 author = {Lawrence C. Paulson},
1057 title = {A Fixedpoint Approach to (Co)inductive and
1058 (Co)datatype Definitions},
1060 crossref = {milner-fest}}
1063 title = {Proof, Language, and Interaction:
1064 Essays in Honor of {Robin Milner}},
1065 booktitle = {Proof, Language, and Interaction:
1066 Essays in Honor of {Robin Milner}},
1069 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1071 @InCollection{paulson-handbook,
1072 author = {Lawrence C. Paulson},
1073 title = {Designing a Theorem Prover},
1074 crossref = {handbk-lics2},
1077 @Book{paulson-isa-book,
1078 author = {Lawrence C. Paulson},
1079 title = {Isabelle: A Generic Theorem Prover},
1080 publisher = {Springer},
1084 @Book{isabelle-hol-book,
1085 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1086 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1087 publisher = {Springer},
1091 @InCollection{paulson-markt,
1092 author = {Lawrence C. Paulson},
1093 title = {Tool Support for Logics of Programs},
1094 booktitle = {Mathematical Methods in Program Development:
1095 Summer School Marktoberdorf 1996},
1096 publisher = {Springer},
1098 year = {Published 1997},
1099 editor = {Manfred Broy},
1100 series = {NATO ASI Series F}}
1102 %replaces Paulson-ML and paulson91
1104 author = {Lawrence C. Paulson},
1105 title = {{ML} for the Working Programmer},
1110 @article{paulson-natural,
1111 author = {Lawrence C. Paulson},
1112 title = {Natural Deduction as Higher-order Resolution},
1117 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1119 @Article{paulson-set-I,
1120 author = {Lawrence C. Paulson},
1121 title = {Set Theory for Verification: {I}. {From}
1122 Foundations to Functions},
1128 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1130 @Article{paulson-set-II,
1131 author = {Lawrence C. Paulson},
1132 title = {Set Theory for Verification: {II}. {Induction} and
1139 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1142 author = {Lawrence C. Paulson},
1143 title = {Verifying the Unification Algorithm in {LCF}},
1149 %replaces Paulson-LCF
1151 author = {Lawrence C. Paulson},
1152 title = {Logic and Computation: Interactive proof with Cambridge
1157 @incollection{paulson700,
1158 author = {Lawrence C. Paulson},
1159 title = {{Isabelle}: The Next 700 Theorem Provers},
1160 crossref = {odifreddi90},
1162 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1164 % replaces paulson-ns and paulson-security
1165 @Article{paulson-jcs,
1166 author = {Lawrence C. Paulson},
1167 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1173 @Article{paulson-tls,
1174 author = {Lawrence C. Paulson},
1175 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1183 @Article{paulson-yahalom,
1184 author = {Lawrence C. Paulson},
1185 title = {Relations Between Secrets:
1186 Two Formal Analyses of the {Yahalom} Protocol},
1193 @article{pelletier86,
1194 author = {F. J. Pelletier},
1195 title = {Seventy-five Problems for Testing Automatic Theorem
1201 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1204 author = {Andrew M. Pitts},
1205 title = {A Co-induction Principle for Recursively Defined Domains},
1211 @Article{plaisted90,
1212 author = {David A. Plaisted},
1213 title = {A Sequent-Style Model Elimination Strategy and a Positive
1224 author = {Art Quaife},
1225 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1235 @TechReport{rasmussen95,
1236 author = {Ole Rasmussen},
1237 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1239 institution = {Computer Laboratory, University of Cambridge},
1243 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1246 author = {Steve Reeves and Michael Clarke},
1247 title = {Logic for Computer Science},
1248 publisher = {Addison-Wesley},
1251 @book{Rosen-DMA,author={Kenneth H. Rosen},
1252 title={Discrete Mathematics and Its Applications},
1253 publisher={McGraw-Hill},year=1998}
1255 @InProceedings{Rudnicki:1992:MizarOverview,
1256 author = {P. Rudnicki},
1257 title = {An Overview of the {MIZAR} Project},
1258 booktitle = {1992 Workshop on Types for Proofs and Programs},
1260 organization = {Chalmers University of Technology},
1261 publisher = {Bastad}
1266 @inproceedings{saaltink-fme,
1267 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1268 Dan Craigen and Irwin Meisels},
1269 title = {An {EVES} Data Abstraction Example},
1273 @Article{Schroeder-Heister:1984,
1274 author = {Peter Schroeder-Heister},
1275 title = {A Natural Extension of Natural Deduction},
1276 journal = {Journal of Symbolic Logic},
1282 @misc{sledgehammer-2009,
1283 key = "Sledgehammer",
1284 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1285 Write Your {I}s\-a\-belle Scripts",
1286 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1288 @inproceedings{slind-tfl,
1289 author = {Konrad Slind},
1290 title = {Function Definition in Higher Order Logic},
1291 crossref = {tphols96},
1295 author = {Patrick Suppes},
1296 title = {Axiomatic Set Theory},
1298 publisher = {Dover}}
1300 @InCollection{szasz93,
1301 author = {Nora Szasz},
1302 title = {A Machine Checked Proof that {Ackermann's} Function is not
1303 Primitive Recursive},
1304 crossref = {huet-plotkin93},
1307 @TechReport{Syme:1997:DECLARE,
1309 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1310 institution = {University of Cambridge Computer Laboratory},
1315 @PhdThesis{Syme:1998:thesis,
1317 title = {Declarative Theorem Proving for Operational Semantics},
1318 school = {University of Cambridge},
1323 @InProceedings{Syme:1999:TPHOL,
1325 title = {Three Tactic Theorem Proving},
1326 crossref = {tphols99}}
1331 author = {G. Takeuti},
1332 title = {Proof Theory},
1338 author = {Simon Thompson},
1339 title = {Type Theory and Functional Programming},
1340 publisher = {Addison-Wesley},
1343 @book{Thompson-Haskell,author={Simon Thompson},
1344 title={Haskell: The Craft of Functional Programming},
1345 publisher={Addison-Wesley},year=1999}
1348 author = "Emina Torlak",
1349 title = {Kodkod: Constraint Solver for Relational Logic},
1350 note = "\url{http://alloy.mit.edu/kodkod/}"}
1352 @misc{kodkod-2009-options,
1353 author = "Emina Torlak",
1354 title = "Kodkod {API}: Class {Options}",
1355 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1357 @inproceedings{torlak-jackson-2007,
1358 title = "Kodkod: A Relational Model Finder",
1359 author = "Emina Torlak and Daniel Jackson",
1360 editor = "Orna Grumberg and Michael Huth",
1361 booktitle = "TACAS 2007",
1366 publisher = Springer}
1368 @Unpublished{Trybulec:1993:MizarFeatures,
1369 author = {A. Trybulec},
1370 title = {Some Features of the {Mizar} Language},
1371 note = {Presented at a workshop in Turin, Italy},
1377 @Unpublished{voelker94,
1378 author = {Norbert V{\"o}lker},
1379 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1380 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1386 @inproceedings{wadler89how,
1387 author = {P. Wadler and S. Blott},
1388 title = {How to make ad-hoc polymorphism less ad-hoc},
1389 booktitle = {ACM Symp.\ Principles of Programming Languages},
1393 @phdthesis{weber-2008,
1394 author = "Tjark Weber",
1395 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1396 school = {Dept.\ of Informatics, T.U. M\"unchen},
1397 type = "{Ph.D.}\ thesis",
1401 author = {Christoph Wedler},
1402 title = {Emacs package ``{X-Symbol}''},
1403 note = {\url{http://x-symbol.sourceforge.net}}
1406 @manual{isabelle-sys,
1407 author = {Markus Wenzel and Stefan Berghofer},
1408 title = {The {Isabelle} System Manual},
1409 institution = {TU Munich},
1410 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1412 @manual{isabelle-isar-ref,
1413 author = {Makarius Wenzel},
1414 title = {The {Isabelle/Isar} Reference Manual},
1415 institution = {TU Munich},
1416 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1418 @manual{isabelle-implementation,
1419 author = {Makarius Wenzel},
1420 title = {The {Isabelle/Isar} Implementation},
1421 institution = {TU Munich},
1422 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1424 @InProceedings{Wenzel:1999:TPHOL,
1425 author = {Markus Wenzel},
1426 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1427 crossref = {tphols99}}
1429 @InProceedings{Wenzel:1997:TPHOL,
1430 author = {Markus Wenzel},
1431 title = {Type Classes and Overloading in Higher-Order Logic},
1432 crossref = {tphols97}}
1434 @phdthesis{Wenzel-PhD,
1435 author={Markus Wenzel},
1436 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1437 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1439 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1441 @Article{Wenzel-Wiedijk:2002,
1442 author = {Freek Wiedijk and Markus Wenzel},
1443 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1444 journal = {Journal of Automated Reasoning},
1450 @InCollection{Wenzel-Paulson:2006,
1451 author = {Markus Wenzel and Lawrence C. Paulson},
1452 title = {{Isabelle/Isar}},
1453 booktitle = {The Seventeen Provers of the World},
1455 editor = {F. Wiedijk},
1456 series = {LNAI 3600}
1459 @InCollection{Wenzel:2006:Festschrift,
1460 author = {Makarius Wenzel},
1461 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1462 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1463 publisher = {University of Bia{\l}ystok},
1465 editor = {R. Matuszewski and A. Zalewska},
1467 series = {Studies in Logic, Grammar, and Rhetoric},
1468 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1472 author = {A. N. Whitehead and B. Russell},
1473 title = {Principia Mathematica},
1476 note = {Paperback edition to *56,
1477 abridged from the 2nd edition (1927)}}
1479 @Misc{Wiedijk:1999:Mizar,
1480 author = {Freek Wiedijk},
1481 title = {Mizar: An Impression},
1482 howpublished = {Unpublished paper},
1484 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1487 @Misc{Wiedijk:2000:MV,
1488 author = {Freek Wiedijk},
1489 title = {The Mathematical Vernacular},
1490 howpublished = {Unpublished paper},
1492 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1496 author = {Glynn Winskel},
1497 title = {The Formal Semantics of Programming Languages},
1498 publisher = MIT,year=1993}
1500 @InCollection{wos-bledsoe,
1501 author = {Larry Wos},
1502 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1503 crossref = {bledsoe-fest},
1506 @InProceedings{Zammit:1999:TPHOL,
1507 author = {Vincent Zammit},
1508 title = {On the Implementation of an Extensible Declarative Proof Language},
1509 crossref = {tphols99}}
1517 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1518 title = {Handbook of Logic in Computer Science},
1519 booktitle = {Handbook of Logic in Computer Science},
1520 publisher = {Oxford University Press},
1525 editor = {Henk Barendregt and Tobias Nipkow},
1526 title = TYPES # {: International Workshop {TYPES '93}},
1527 booktitle = TYPES # {: International Workshop {TYPES '93}},
1528 year = {published 1994},
1529 publisher = {Springer},
1530 series = {LNCS 806}}
1532 @book{barwise-handbk,
1533 editor = {J. Barwise},
1534 title = {Handbook of Mathematical Logic},
1535 booktitle = {Handbook of Mathematical Logic},
1539 @Proceedings{tlca93,
1540 title = {Typed Lambda Calculi and Applications},
1541 booktitle = {Typed Lambda Calculi and Applications},
1542 editor = {M. Bezem and J.F. Groote},
1544 publisher = {Springer},
1545 series = {LNCS 664}}
1548 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1549 title = {Current Trends in Hardware Verification and Automated
1551 booktitle = {Current Trends in Hardware Verification and Automated
1553 publisher = {Springer},
1557 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1558 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1559 publisher = {Kluwer Academic Publishers},
1561 editor = {Robert S. Boyer}}
1563 @Proceedings{cade12,
1564 editor = {Alan Bundy},
1565 title = {Automated Deduction --- {CADE}-12
1566 International Conference},
1567 booktitle = {Automated Deduction --- {CADE}-12
1568 International Conference},
1570 series = {LNAI 814},
1571 publisher = {Springer}}
1574 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1575 title = TYPES # {: International Workshop {TYPES '94}},
1576 booktitle = TYPES # {: International Workshop {TYPES '94}},
1578 publisher = {Springer},
1579 series = {LNCS 996}}
1581 @book{huet-plotkin91,
1582 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1583 title = {Logical Frameworks},
1584 booktitle = {Logical Frameworks},
1588 @book{huet-plotkin93,
1589 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1590 title = {Logical Environments},
1591 booktitle = {Logical Environments},
1596 editor = {J. Joyce and C. Seger},
1597 title = {Higher Order Logic Theorem Proving and Its
1598 Applications: HUG '93},
1599 booktitle = {Higher Order Logic Theorem Proving and Its
1600 Applications: HUG '93},
1601 year = {Published 1994},
1602 publisher = {Springer},
1603 series = {LNCS 780}}
1605 @proceedings{colog88,
1606 editor = {P. Martin-L{\"o}f and G. Mints},
1607 title = {COLOG-88: International Conference on Computer Logic},
1608 booktitle = {COLOG-88: International Conference on Computer Logic},
1609 year = {Published 1990},
1610 publisher = {Springer},
1611 organization = {Estonian Academy of Sciences},
1612 address = {Tallinn},
1613 series = {LNCS 417}}
1616 editor = {P. Odifreddi},
1617 title = {Logic and Computer Science},
1618 booktitle = {Logic and Computer Science},
1619 publisher = {Academic Press},
1622 @proceedings{extensions91,
1623 editor = {Peter Schroeder-Heister},
1624 title = {Extensions of Logic Programming},
1625 booktitle = {Extensions of Logic Programming},
1627 series = {LNAI 475},
1628 publisher = {Springer}}
1630 @proceedings{cade10,
1631 editor = {Mark E. Stickel},
1632 title = {10th } # CADE,
1633 booktitle = {10th } # CADE,
1635 publisher = {Springer},
1636 series = {LNAI 449}}
1639 editor = {M. Vardi},
1640 title = {Eighth Annual Symposium on Logic in Computer Science},
1641 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1646 title = {Automated Reasoning and its Applications:
1647 Essays in Honor of {Larry Wos}},
1648 booktitle = {Automated Reasoning and its Applications:
1649 Essays in Honor of {Larry Wos}},
1652 editor = {Robert Veroff}}
1655 editor = {J. C. P. Woodcock and P. G. Larsen},
1656 title = {FME '93: Industrial-Strength Formal Methods},
1657 booktitle = {FME '93: Industrial-Strength Formal Methods},
1659 publisher = Springer,
1663 @Proceedings{tphols96,
1664 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1665 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1666 editor = {J. von Wright and J. Grundy and J. Harrison},
1667 publisher = Springer,
1672 @Proceedings{tphols97,
1673 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1674 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1675 editor = {Elsa L. Gunter and Amy Felty},
1676 publisher = Springer,
1681 @Proceedings{tphols98,
1682 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1683 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1684 editor = {Jim Grundy and Malcom Newey},
1685 publisher = Springer,
1690 @Proceedings{tphols99,
1691 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1692 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1693 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1694 Paulin, C. and Thery, L.},
1695 publisher = Springer,
1700 @Proceedings{tphols2000,
1701 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1702 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1703 editor = {J. Harrison and M. Aagaard},
1704 publisher = Springer,
1709 @Proceedings{tphols2001,
1710 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1711 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1712 editor = {R. J. Boulton and P. B. Jackson},
1713 publisher = Springer,
1718 @Proceedings{ijcar2006,
1719 title = {Automated Reasoning: {IJCAR} 2006},
1720 booktitle = {Automated Reasoning: {IJCAR} 2006},
1721 editor = {U. Furbach and N. Shankar},
1722 publisher = Springer,
1727 @Proceedings{tphols2007,
1728 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1729 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1730 editor = {K. Schneider and J. Brandt},
1731 publisher = Springer,
1736 @Proceedings{tphols2008,
1737 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1738 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1739 publisher = Springer,
1745 @unpublished{classes_modules,
1746 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
1747 author = {Stefan Wehr et. al.}
1750 @misc{wikipedia-2009-aa-trees,
1752 title = "Wikipedia: {AA} Tree",
1753 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}