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},
70 @inproceedings{Aehlig-Haftmann-Nipkow:2008:nbe,
71 author = {Klaus Aehlig and Florian Haftmann and Tobias Nipkow},
72 title = {A Compiled Implementation of Normalization by Evaluation},
73 booktitle = {TPHOLs '08: Proceedings of the 21th International Conference on Theorem Proving in Higher Order Logics},
75 isbn = {978-3-540-71065-3},
80 editor = {Otmane A\"{\i}t Mohamed and C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tahar}
84 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
85 title = {The {ALF} Proof Editor and Its Proof Engine},
89 @inproceedings{andersson-1993,
90 author = "Arne Andersson",
91 title = "Balanced Search Trees Made Simple",
92 editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides",
93 booktitle = "WADS 1993",
101 author = "Peter Andrews",
102 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
105 series = "Computer Science and Applied Mathematics",
108 @InProceedings{Aspinall:2000:eProof,
109 author = {David Aspinall},
110 title = {Protocols for Interactive {e-Proof}},
111 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
113 note = {Unpublished work-in-progress paper,
114 \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}
117 @InProceedings{Aspinall:TACAS:2000,
118 author = {David Aspinall},
119 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
120 booktitle = {Tools and Algorithms for the Construction and Analysis of
123 publisher = Springer,
130 author = {David Aspinall},
131 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
132 note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}
136 author = {David Aspinall},
137 title = {{P}roof {G}eneral},
138 note = {\url{http://proofgeneral.inf.ed.ac.uk/}}
143 @inproceedings{satallax,
144 title = "Analytic Tableaux for Higher-Order Logic with Choice",
145 author = "Julian Backes and Chad E. Brown",
146 booktitle={Automated Reasoning: IJCAR 2010},
147 editor={J. Giesl and R. H\"ahnle},
148 publisher = Springer,
154 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
155 title="Term Rewriting and All That",publisher=CUP,year=1998}
157 @manual{isabelle-locale,
158 author = {Clemens Ballarin},
159 title = {Tutorial to Locales and Locale Interpretation},
161 note = {\url{http://isabelle.in.tum.de/doc/locales.pdf}}
164 @InCollection{Barendregt-Geuvers:2001,
165 author = {H. Barendregt and H. Geuvers},
166 title = {Proof Assistants using Dependent Type Systems},
167 booktitle = {Handbook of Automated Reasoning},
168 publisher = {Elsevier},
170 editor = {A. Robinson and A. Voronkov}
174 author = {Clark Barrett and Cesare Tinelli},
177 editor = {Werner Damm and Holger Hermanns},
181 publisher = {Springer},
185 @incollection{basin91,
186 author = {David Basin and Matt Kaufmann},
187 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
189 crossref = {huet-plotkin91},
192 @Unpublished{HOL-Library,
193 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
194 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
196 title = {The Supplemental {Isabelle/HOL} Library},
197 note = {Part of the Isabelle distribution,
198 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
202 @InProceedings{Bauer-Wenzel:2000:HB,
203 author = {Gertrud Bauer and Markus Wenzel},
204 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
206 booktitle = {Types for Proofs and Programs: TYPES'99},
207 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
213 @InProceedings{Bauer-Wenzel:2001,
214 author = {Gertrud Bauer and Markus Wenzel},
215 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
216 crossref = {tphols2001}}
219 author = "Christoph Benzm{\"u}ller and Lawrence C. Paulson and Frank Theiss and Arnaud Fietzke",
220 title = "{LEO-II}---A Cooperative Automatic Theorem Prover for Higher-Order Logic",
221 editor = "Alessandro Armando and Peter Baumgartner and Gilles Dowek",
222 booktitle = "Automated Reasoning: IJCAR 2008",
223 publisher = Springer,
229 @inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL,
230 author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian},
231 booktitle = {Theorem Proving in Higher Order Logics},
233 title = {Turning Inductive into Equational Specifications},
237 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
238 crossref = "tphols2000",
239 title = "Proof terms for simply typed higher order logic",
240 author = "Stefan Berghofer and Tobias Nipkow",
243 @inproceedings{berghofer-nipkow-2004,
244 author = {Stefan Berghofer and Tobias Nipkow},
245 title = {Random Testing in {I}sabelle/{HOL}},
247 editor = "J. Cuellar and Z. Liu",
248 booktitle = {{SEFM} 2004},
252 @InProceedings{Berghofer-Nipkow:2002,
253 author = {Stefan Berghofer and Tobias Nipkow},
254 title = {Executing Higher Order Logic},
255 booktitle = {Types for Proofs and Programs: TYPES'2000},
256 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
258 publisher = Springer,
262 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
263 author = {Stefan Berghofer and Markus Wenzel},
264 title = {Inductive datatypes in {HOL} --- lessons learned in
265 {F}ormal-{L}ogic {E}ngineering},
266 crossref = {tphols99}}
269 @InProceedings{Bezem-Coquand:2005,
270 author = {M.A. Bezem and T. Coquand},
271 title = {Automating {Coherent Logic}},
272 booktitle = {LPAR-12},
273 editor = {G. Sutcliffe and A. Voronkov},
276 publisher = Springer}
278 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
279 title="Introduction to Functional Programming",publisher=PH,year=1988}
281 @book{Bird-Haskell,author="Richard Bird",
282 title="Introduction to Functional Programming using Haskell",
283 publisher=PH,year=1998}
285 @manual{isabelle-nitpick,
286 author = {Jasmin Christian Blanchette},
287 title = {Picking Nits: A User's Guide to {N}itpick for {I}sabelle/{HOL}},
289 note = {\url{http://isabelle.in.tum.de/doc/nitpick.pdf}}
292 @manual{isabelle-sledgehammer,
293 author = {Jasmin Christian Blanchette},
294 title = {Hammering Away: A User's Guide to {S}ledgehammer for {I}sabelle/{HOL}},
296 note = {\url{http://isabelle.in.tum.de/doc/sledgehammer.pdf}}
299 @inproceedings{blanchette-nipkow-2010,
300 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder",
301 author = "Jasmin Christian Blanchette and Tobias Nipkow",
302 crossref = {itp2010}}
304 @inproceedings{boehme-nipkow-2010,
305 author={Sascha B\"ohme and Tobias Nipkow},
306 title={Sledgehammer: Judgement Day},
307 booktitle={Automated Reasoning: IJCAR 2010},
308 editor={J. Giesl and R. H\"ahnle},
316 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
317 Overbeek and Mark Stickel and Lawrence Wos},
318 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
327 author = {Robert S. Boyer and J Strother Moore},
328 title = {A Computational Logic},
329 publisher = {Academic Press},
333 author = {Robert S. Boyer and J Strother Moore},
334 title = {A Computational Logic Handbook},
335 publisher = {Academic Press},
339 author = {N. G. de Bruijn},
340 title = {Lambda Calculus Notation with Nameless Dummies,
341 a Tool for Automatic Formula Manipulation,
342 with Application to the {Church-Rosser Theorem}},
343 journal = {Indag. Math.},
348 @InProceedings{bulwahnKN07,
349 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
350 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
351 crossref = {tphols2007},
355 @InProceedings{bulwahn-et-al:2008:imperative,
356 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
357 title = {Imperative Functional Programming with {Isabelle/HOL}},
358 crossref = {tphols2008},
363 author = {M. Burrows and M. Abadi and R. M. Needham},
364 title = {A Logic of Authentication},
372 @InProceedings{Chaieb-Wenzel:2007,
373 author = {Amine Chaieb and Makarius Wenzel},
374 title = {Context aware Calculation and Deduction ---
375 Ring Equalities via {Gr\"obner Bases} in {Isabelle}},
376 booktitle = {Towards Mechanized Mathematical Assistants (CALCULEMUS 2007)},
377 editor = {Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger},
384 @TechReport{camilleri92,
385 author = {J. Camilleri and T. F. Melham},
386 title = {Reasoning with Inductively Defined Relations in the
387 {HOL} Theorem Prover},
394 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
395 title = {Artificial Intelligence Programming},
396 publisher = {Lawrence Erlbaum Associates},
400 author = "Alonzo Church",
401 title = "A Formulation of the Simple Theory of Types",
407 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
408 title="Model Checking",publisher=MIT,year=1999}
411 author = {Martin D. Coen},
412 title = {Interactive Program Derivation},
413 school = {University of Cambridge},
414 note = {Computer Laboratory Technical Report 272},
419 author = {R. L. Constable and others},
420 title = {Implementing Mathematics with the Nuprl Proof
422 publisher = Prentice,
427 @Book{davey-priestley,
428 author = {B. A. Davey and H. A. Priestley},
429 title = {Introduction to Lattices and Order},
434 author = {Keith J. Devlin},
435 title = {Fundamentals of Contemporary Set Theory},
436 publisher = {Springer},
440 author = {Michael Dummett},
441 title = {Elements of Intuitionism},
443 publisher = {Oxford University Press}}
446 author = {Bruno Dutertre and Leonardo de Moura},
447 title = {The {Yices} {SMT} Solver},
448 howpublished = "\url{http://yices.csl.sri.com/tool-paper.pdf}",
451 @incollection{dybjer91,
452 author = {Peter Dybjer},
453 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
454 Theory and Their Set-Theoretic Semantics},
455 crossref = {huet-plotkin91},
459 author = {Roy Dyckhoff},
460 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
470 author = {William M. Farmer and Joshua D. Guttman and F. Javier
472 title = {{IMPS}: An Interactive Mathematical Proof System},
479 @InProceedings{felty91a,
480 Author = {Amy Felty},
481 Title = {A Logic Program for Transforming Sequent Proofs to Natural
483 crossref = {extensions91},
486 @Article{fleuriot-jcm,
487 author = {Jacques Fleuriot and Lawrence C. Paulson},
488 title = {Mechanizing Nonstandard Real Analysis},
489 journal = {LMS Journal of Computation and Mathematics},
493 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
497 author = {Jacob Frost},
498 title = {A Case Study of Co-induction in {Isabelle HOL}},
504 %revised version of frost93
506 author = {Jacob Frost},
507 title = {A Case Study of Co-induction in {Isabelle}},
514 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
516 title = {Principles of {OBJ2}},
524 author = {J. H. Gallier},
525 title = {Logic for Computer Science:
526 Foundations of Automatic Theorem Proving},
528 publisher = {Harper \& Row}}
531 author = {Antony Galton},
532 title = {Logic for Information Technology},
536 @Article{Gentzen:1935,
537 author = {G. Gentzen},
538 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
539 journal = {Math. Zeitschrift},
543 @InProceedings{gimenez-codifying,
544 author = {Eduardo Gim{\'e}nez},
545 title = {Codifying Guarded Definitions with Recursive Schemes},
546 crossref = {types94},
551 author = {Jean-Yves Girard},
552 title = {Proofs and Types},
555 note = {Translated by Yves LaFont and Paul Taylor}}
558 editor = {M. J. C. Gordon and T. F. Melham},
559 title = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
564 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
566 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
568 publisher = {Springer},
571 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
572 title={Why we can't have {SML} style datatype declarations in {HOL}},
573 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
574 IFIP TC10/WG10.2 Intl. Workshop, 1992},
575 editor={L.J.M. Claesen and M.J.C. Gordon},
576 publisher=NH,year=1993,pages={561--568}}
578 @InProceedings{gunter-trees,
579 author = {Elsa L. Gunter},
580 title = {A Broader Class of Trees for Recursive Type Definitions for
587 @InProceedings{Haftmann-Wenzel:2006:classes,
588 author = {Florian Haftmann and Makarius Wenzel},
589 title = {Constructive Type Classes in {Isabelle}},
590 editor = {T. Altenkirch and C. McBride},
591 booktitle = {Types for Proofs and Programs, TYPES 2006},
592 publisher = {Springer},
598 @inproceedings{Haftmann-Nipkow:2010:code,
599 author = {Florian Haftmann and Tobias Nipkow},
600 title = {Code Generation via Higher-Order Rewrite Systems},
601 booktitle = {Functional and Logic Programming: 10th International Symposium: FLOPS 2010},
603 publisher = Springer,
605 editor = {Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal},
609 @InProceedings{Haftmann-Wenzel:2009,
610 author = {Florian Haftmann and Makarius Wenzel},
611 title = {Local theory specifications in {Isabelle/Isar}},
612 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
613 booktitle = {Types for Proofs and Programs, TYPES 2008},
614 publisher = {Springer},
620 @manual{isabelle-classes,
621 author = {Florian Haftmann},
622 title = {Haskell-style type classes with {Isabelle}/{Isar}},
624 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
627 @manual{isabelle-codegen,
628 author = {Florian Haftmann},
629 title = {Code generation from Isabelle theories},
631 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
635 author = {Paul R. Halmos},
636 title = {Naive Set Theory},
637 publisher = {Van Nostrand},
640 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
641 title={Dynamic Logic},publisher=MIT,year=2000}
644 author = {Matthew Hennessy},
645 title = {The Semantics of Programming Languages: An Elementary
646 Introduction Using Structural Operational Semantics},
650 @article{waldmeister,
651 author = {Thomas Hillenbrand and Arnim Buch and Rolan Vogt and Bernd L\"ochner},
652 title = "Waldmeister: High-Performance Equational Deduction",
659 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
660 title={Introduction to Automata Theory, Languages, and Computation.},
661 publisher={Addison-Wesley},year=1979}
663 @Article{haskell-report,
664 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
665 title = {Report on the Programming Language {Haskell}: A
666 Non-strict, Purely Functional Language},
672 note = {Version 1.2}}
674 @Article{haskell-tutorial,
675 author = {Paul Hudak and Joseph H. Fasel},
676 title = {A Gentle Introduction to {Haskell}},
684 author = "Kry\v{s}tof Hoder and Andrei Voronkov",
685 title = "Sine Qua Non for Large Theory Reasoning",
686 booktitle = {Automated Deduction --- CADE-23},
687 publisher = Springer,
689 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
693 @book{Hudak-Haskell,author={Paul Hudak},
694 title={The Haskell School of Expression},publisher=CUP,year=2000}
697 author = {G. P. Huet},
698 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
705 author = {G. P. Huet and B. Lang},
706 title = {Proving and Applying Program Transformations Expressed with
707 Second-Order Patterns},
713 @inproceedings{huet88,
714 author = {G{\'e}rard Huet},
715 title = {Induction Principles Formalized in the {Calculus of
717 booktitle = {Programming of Future Generation Computers},
718 editor = {K. Fuchi and M. Nivat},
721 publisher = {Elsevier}}
723 @Book{Huth-Ryan-book,
724 author = {Michael Huth and Mark Ryan},
725 title = {Logic in Computer Science. Modelling and reasoning about systems},
729 @InProceedings{Harrison:1996:MizarHOL,
730 author = {J. Harrison},
731 title = {A {Mizar} Mode for {HOL}},
733 crossref = {tphols96}}
737 title = "Metis Theorem Prover",
738 note = "\url{http://www.gilith.com/software/metis/}"}
742 @article{haskell-revised-report,
743 author = {Simon {Peyton Jones} and others},
744 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
745 journal = {Journal of Functional Programming},
751 note = {\url{http://www.haskell.org/definition/}}}
754 author = "Daniel Jackson",
755 title = "Software Abstractions: Logic, Language, and Analysis",
761 @InProceedings{kammueller-locales,
762 author = {Florian Kamm{\"u}ller and Markus Wenzel and
763 Lawrence C. Paulson},
764 title = {Locales: A Sectioning Concept for {Isabelle}},
765 crossref = {tphols99}}
768 author={Donald E. Knuth},
769 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
770 publisher={Addison-Wesley},
774 author = {R. E. Korf},
775 title = {Depth-First Iterative-Deepening: an Optimal Admissible
782 @InProceedings{krauss2006,
783 author = {Alexander Krauss},
784 title = {Partial Recursive Functions in {Higher-Order Logic}},
785 crossref = {ijcar2006},
788 @PhdThesis{krauss_phd,
789 author = {Alexander Krauss},
790 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
791 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
796 @manual{isabelle-function,
797 author = {Alexander Krauss},
798 title = {Defining Recursive Functions in {Isabelle/HOL}},
800 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
804 author = {Kenneth Kunen},
805 title = {Set Theory: An Introduction to Independence Proofs},
812 author = {Xavier Leroy and others},
813 title = {The Objective Caml system -- Documentation and user's manual},
814 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
816 @incollection{lochbihler-2010,
817 title = "Coinduction",
818 author = "Andreas Lochbihler",
819 booktitle = "The Archive of Formal Proofs",
820 editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
821 publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",
826 author = "D. W. Loveland",
827 title = "Automated Theorem Proving: A Logical Basis",
829 publisher = "North-Holland Publishing Co."}
831 @InProceedings{lowe-fdr,
832 author = {Gavin Lowe},
833 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
834 Protocol using {CSP} and {FDR}},
835 booktitle = {Tools and Algorithms for the Construction and Analysis
836 of Systems: second international workshop, TACAS '96},
837 editor = {T. Margaria and B. Steffen},
838 series = {LNCS 1055},
840 publisher = {Springer},
846 author = {Zohar Manna and Richard Waldinger},
847 title = {Deductive Synthesis of the Unification Algorithm},
854 @InProceedings{martin-nipkow,
855 author = {Ursula Martin and Tobias Nipkow},
856 title = {Ordered Rewriting and Confluence},
861 author = {Per Martin-L{\"o}f},
862 title = {Intuitionistic type theory},
864 publisher = {Bibliopolis}}
866 @incollection{melham89,
867 author = {Thomas F. Melham},
868 title = {Automating Recursive Type Definitions in Higher Order
871 crossref = {birtwistle89}}
873 @Article{Miller:1991,
874 author = {Dale Miller},
875 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
876 and Simple Unification},
877 journal = {Journal of Logic and Computation},
883 @Article{miller-mixed,
884 Author = {Dale Miller},
885 Title = {Unification Under a Mixed Prefix},
893 author = {Robin Milner},
894 title = {A Theory of Type Polymorphism in Programming},
895 journal = "J. Comp.\ Sys.\ Sci.",
900 @TechReport{milner-ind,
901 author = {Robin Milner},
902 title = {How to Derive Inductions in {LCF}},
903 institution = Edinburgh,
907 @Article{milner-coind,
908 author = {Robin Milner and Mads Tofte},
909 title = {Co-induction in Relational Semantics},
916 author = {Robin Milner},
917 title = {Communication and Concurrency},
918 publisher = Prentice,
921 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
922 title="The Definition of Standard ML",publisher=MIT,year=1990}
924 @PhdThesis{monahan84,
925 author = {Brian Q. Monahan},
926 title = {Data Type Proofs using Edinburgh {LCF}},
927 school = {University of Edinburgh},
930 @article{MuellerNvOS99,
932 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
933 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
935 @Manual{Muzalewski:Mizar,
936 title = {An Outline of {PC} {Mizar}},
937 author = {Micha{\l} Muzalewski},
938 organization = {Fondation of Logic, Mathematics and Informatics
939 --- Mizar Users Group},
941 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
946 @InProceedings{NaraschewskiW-TPHOLs98,
947 author = {Wolfgang Naraschewski and Markus Wenzel},
949 {Object-Oriented Verification based on Record Subtyping in
951 crossref = {tphols98}}
953 @inproceedings{nazareth-nipkow,
954 author = {Dieter Nazareth and Tobias Nipkow},
955 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
956 crossref = {tphols96},
960 @Article{needham-schroeder,
961 author = "Roger M. Needham and Michael D. Schroeder",
962 title = "Using Encryption for Authentication in Large Networks
971 @inproceedings{nipkow-W,
972 author = {Wolfgang Naraschewski and Tobias Nipkow},
973 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
974 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
975 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
976 publisher = Springer,
982 @InCollection{nipkow-sorts93,
983 author = {T. Nipkow},
984 title = {Order-Sorted Polymorphism in {Isabelle}},
985 booktitle = {Logical Environments},
988 editor = {G. Huet and G. Plotkin},
992 @Misc{nipkow-types93,
993 author = {Tobias Nipkow},
994 title = {Axiomatic Type Classes (in {I}sabelle)},
995 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
999 @inproceedings{Nipkow-CR,
1000 author = {Tobias Nipkow},
1001 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
1002 booktitle = {Automated Deduction --- CADE-13},
1003 editor = {M. McRobbie and J.K. Slaney},
1004 publisher = Springer,
1010 % WAS Nipkow-LICS-93
1011 @InProceedings{nipkow-patterns,
1012 title = {Functional Unification of Higher-Order Patterns},
1013 author = {Tobias Nipkow},
1016 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
1017 keywords = {unification}}
1019 @article{nipkow-IMP,
1020 author = {Tobias Nipkow},
1021 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
1027 @inproceedings{Nipkow-TYPES02,
1028 author = {Tobias Nipkow},
1029 title = {{Structured Proofs in Isar/HOL}},
1030 booktitle = {Types for Proofs and Programs (TYPES 2002)},
1031 editor = {H. Geuvers and F. Wiedijk},
1033 publisher = Springer,
1038 @manual{isabelle-HOL,
1039 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1040 title = {{Isabelle}'s Logics: {HOL}},
1041 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
1042 M{\"u}nchen and Computer Laboratory, University of Cambridge},
1043 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
1045 @article{nipkow-prehofer,
1046 author = {Tobias Nipkow and Christian Prehofer},
1047 title = {Type Reconstruction for Type Classes},
1054 @InProceedings{Nipkow-Prehofer:1993,
1055 author = {T. Nipkow and C. Prehofer},
1056 title = {Type checking type classes},
1057 booktitle = {ACM Symp.\ Principles of Programming Languages},
1062 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1063 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
1064 publisher = Springer,
1070 author = {Philippe No{\"e}l},
1071 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
1079 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
1080 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
1082 publisher = {Oxford University Press},
1087 @TechReport{scala-overview-tech-report,
1088 author = {Martin Odersky and al.},
1089 title = {An Overview of the Scala Programming Language},
1090 institution = {EPFL Lausanne, Switzerland},
1092 number = {IC/2004/64}
1095 @Manual{pvs-language,
1096 title = {The {PVS} specification language},
1097 author = {S. Owre and N. Shankar and J. M. Rushby},
1098 organization = {Computer Science Laboratory, SRI International},
1099 address = {Menlo Park, CA},
1100 note = {Beta release},
1103 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
1108 @InProceedings{paulin-tlca,
1109 author = {Christine Paulin-Mohring},
1110 title = {Inductive Definitions in the System {Coq}: Rules and
1112 crossref = {tlca93},
1115 @InProceedings{paulson-CADE,
1116 author = {Lawrence C. Paulson},
1117 title = {A Fixedpoint Approach to Implementing (Co)Inductive
1120 crossref = {cade12}}
1122 @InProceedings{paulson-COLOG,
1123 author = {Lawrence C. Paulson},
1124 title = {A Formulation of the Simple Theory of Types (for
1127 crossref = {colog88},
1128 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
1130 @Article{paulson-coind,
1131 author = {Lawrence C. Paulson},
1132 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1141 @manual{isabelle-intro,
1142 author = {Lawrence C. Paulson},
1143 title = {Old Introduction to {Isabelle}},
1145 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1147 @manual{isabelle-logics,
1148 author = {Lawrence C. Paulson},
1149 title = {{Isabelle's} Logics},
1151 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1153 @manual{isabelle-ref,
1154 author = {Lawrence C. Paulson},
1155 title = {The Old {Isabelle} Reference Manual},
1157 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1159 @manual{isabelle-ZF,
1160 author = {Lawrence C. Paulson},
1161 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1163 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1165 @article{paulson-found,
1166 author = {Lawrence C. Paulson},
1167 title = {The Foundation of a Generic Theorem Prover},
1173 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1175 %replaces paulson-final
1176 @Article{paulson-mscs,
1177 author = {Lawrence C. Paulson},
1178 title = {Final Coalgebras as Greatest Fixed Points
1179 in {ZF} Set Theory},
1180 journal = {Mathematical Structures in Computer Science},
1186 @InCollection{paulson-generic,
1187 author = {Lawrence C. Paulson},
1188 title = {Generic Automatic Proof Tools},
1189 crossref = {wos-fest},
1192 @Article{paulson-gr,
1193 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1194 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1203 @InCollection{paulson-fixedpt-milner,
1204 author = {Lawrence C. Paulson},
1205 title = {A Fixedpoint Approach to (Co)inductive and
1206 (Co)datatype Definitions},
1208 crossref = {milner-fest}}
1211 title = {Proof, Language, and Interaction:
1212 Essays in Honor of {Robin Milner}},
1213 booktitle = {Proof, Language, and Interaction:
1214 Essays in Honor of {Robin Milner}},
1217 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1219 @InCollection{paulson-handbook,
1220 author = {Lawrence C. Paulson},
1221 title = {Designing a Theorem Prover},
1222 crossref = {handbk-lics2},
1225 @Book{paulson-isa-book,
1226 author = {Lawrence C. Paulson},
1227 title = {Isabelle: A Generic Theorem Prover},
1228 publisher = {Springer},
1232 @Book{isabelle-hol-book,
1233 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1234 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1235 publisher = {Springer},
1239 @InCollection{paulson-markt,
1240 author = {Lawrence C. Paulson},
1241 title = {Tool Support for Logics of Programs},
1242 booktitle = {Mathematical Methods in Program Development:
1243 Summer School Marktoberdorf 1996},
1244 publisher = {Springer},
1246 year = {Published 1997},
1247 editor = {Manfred Broy},
1248 series = {NATO ASI Series F}}
1250 %replaces Paulson-ML and paulson91
1252 author = {Lawrence C. Paulson},
1253 title = {{ML} for the Working Programmer},
1258 @article{paulson-natural,
1259 author = {Lawrence C. Paulson},
1260 title = {Natural Deduction as Higher-order Resolution},
1265 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1267 @Article{paulson-set-I,
1268 author = {Lawrence C. Paulson},
1269 title = {Set Theory for Verification: {I}. {From}
1270 Foundations to Functions},
1276 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1278 @Article{paulson-set-II,
1279 author = {Lawrence C. Paulson},
1280 title = {Set Theory for Verification: {II}. {Induction} and
1287 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1290 author = {Lawrence C. Paulson},
1291 title = {Verifying the Unification Algorithm in {LCF}},
1297 %replaces Paulson-LCF
1299 author = {Lawrence C. Paulson},
1300 title = {Logic and Computation: Interactive proof with Cambridge
1305 @incollection{paulson700,
1306 author = {Lawrence C. Paulson},
1307 title = {{Isabelle}: The Next 700 Theorem Provers},
1308 crossref = {odifreddi90},
1310 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1312 % replaces paulson-ns and paulson-security
1313 @Article{paulson-jcs,
1314 author = {Lawrence C. Paulson},
1315 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1321 @Article{paulson-tls,
1322 author = {Lawrence C. Paulson},
1323 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1331 @Article{paulson-yahalom,
1332 author = {Lawrence C. Paulson},
1333 title = {Relations Between Secrets:
1334 Two Formal Analyses of the {Yahalom} Protocol},
1341 @article{pelletier86,
1342 author = {F. J. Pelletier},
1343 title = {Seventy-five Problems for Testing Automatic Theorem
1349 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1351 @InCollection{pitts93,
1352 author = {A. Pitts},
1353 title = {The {HOL} Logic},
1354 editor = {M. J. C. Gordon and T. F. Melham},
1355 booktitle = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
1361 author = {Andrew M. Pitts},
1362 title = {A Co-induction Principle for Recursively Defined Domains},
1368 @Article{plaisted90,
1369 author = {David A. Plaisted},
1370 title = {A Sequent-Style Model Elimination Strategy and a Positive
1381 author = {Art Quaife},
1382 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1392 @TechReport{rasmussen95,
1393 author = {Ole Rasmussen},
1394 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1396 institution = {Computer Laboratory, University of Cambridge},
1400 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1403 author = {Steve Reeves and Michael Clarke},
1404 title = {Logic for Computer Science},
1405 publisher = {Addison-Wesley},
1408 @article{riazanov-voronkov-2002,
1409 author = "Alexander Riazanov and Andrei Voronkov",
1410 title = "The Design and Implementation of {Vampire}",
1411 journal = "Journal of AI Communications",
1417 @book{Rosen-DMA,author={Kenneth H. Rosen},
1418 title={Discrete Mathematics and Its Applications},
1419 publisher={McGraw-Hill},year=1998}
1421 @InProceedings{Rudnicki:1992:MizarOverview,
1422 author = {P. Rudnicki},
1423 title = {An Overview of the {MIZAR} Project},
1424 booktitle = {1992 Workshop on Types for Proofs and Programs},
1426 organization = {Chalmers University of Technology},
1427 publisher = {Bastad}
1432 @inproceedings{saaltink-fme,
1433 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1434 Dan Craigen and Irwin Meisels},
1435 title = {An {EVES} Data Abstraction Example},
1439 @Article{Schroeder-Heister:1984,
1440 author = {Peter Schroeder-Heister},
1441 title = {A Natural Extension of Natural Deduction},
1442 journal = {Journal of Symbolic Logic},
1448 @article{schulz-2002,
1449 author = "Stephan Schulz",
1450 title = "E---A Brainiac Theorem Prover",
1451 journal = "Journal of AI Communications",
1457 @misc{sledgehammer-2009,
1458 key = "Sledgehammer",
1459 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1460 Write Your {I}s\-a\-belle Scripts",
1461 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1463 @inproceedings{slind-tfl,
1464 author = {Konrad Slind},
1465 title = {Function Definition in Higher Order Logic},
1466 crossref = {tphols96},
1469 @inproceedings{snark,
1470 author = {M. Stickel and R. Waldinger and M. Lowry and T. Pressburger and I. Underwood},
1471 title = {Deductive composition of astronomical software from subroutine libraries},
1473 crossref = {cade12}}
1476 author = {Patrick Suppes},
1477 title = {Axiomatic Set Theory},
1479 publisher = {Dover}}
1481 @inproceedings{sutcliffe-2000,
1482 author = "Geoff Sutcliffe",
1483 title = "System Description: {SystemOnTPTP}",
1484 editor = "David McAllester",
1485 booktitle = {Automated Deduction --- {CADE}-17 International Conference},
1486 series = "Lecture Notes in Artificial Intelligence",
1490 publisher = Springer}
1493 author = "Geoff Sutcliffe",
1495 note = "\url{http://www.cs.miami.edu/~tptp/ATPSystems/ToFoF/}"}
1497 @Article{Sutter:2005,
1498 author = {H. Sutter},
1499 title = {The Free Lunch Is Over --- A Fundamental Turn Toward Concurrency in Software},
1500 journal = {Dr. Dobb's Journal},
1505 @InCollection{szasz93,
1506 author = {Nora Szasz},
1507 title = {A Machine Checked Proof that {Ackermann's} Function is not
1508 Primitive Recursive},
1509 crossref = {huet-plotkin93},
1512 @TechReport{Syme:1997:DECLARE,
1514 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1515 institution = {University of Cambridge Computer Laboratory},
1520 @PhdThesis{Syme:1998:thesis,
1522 title = {Declarative Theorem Proving for Operational Semantics},
1523 school = {University of Cambridge},
1528 @InProceedings{Syme:1999:TPHOL,
1530 title = {Three Tactic Theorem Proving},
1531 crossref = {tphols99}}
1536 author = {G. Takeuti},
1537 title = {Proof Theory},
1543 author = {Simon Thompson},
1544 title = {Type Theory and Functional Programming},
1545 publisher = {Addison-Wesley},
1548 @book{Thompson-Haskell,author={Simon Thompson},
1549 title={Haskell: The Craft of Functional Programming},
1550 publisher={Addison-Wesley},year=1999}
1553 author = "Emina Torlak",
1554 title = {Kodkod: Constraint Solver for Relational Logic},
1555 note = "\url{http://alloy.mit.edu/kodkod/}"}
1557 @misc{kodkod-2009-options,
1558 author = "Emina Torlak",
1559 title = "Kodkod {API}: Class {Options}",
1560 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1562 @inproceedings{torlak-jackson-2007,
1563 title = "Kodkod: A Relational Model Finder",
1564 author = "Emina Torlak and Daniel Jackson",
1565 editor = "Orna Grumberg and Michael Huth",
1566 booktitle = "TACAS 2007",
1571 publisher = Springer}
1573 @unpublished{traytel-berghofer-nipkow-2011,
1574 author = {D. Traytel and S. Berghofer and T. Nipkow},
1575 title = {Extending Hindley-Milner Type Inference with Coercive
1576 Subtyping (long version)},
1579 \url{http://isabelle.in.tum.de/doc/implementation.pdf}}},
1582 @Unpublished{Trybulec:1993:MizarFeatures,
1583 author = {A. Trybulec},
1584 title = {Some Features of the {Mizar} Language},
1585 note = {Presented at a workshop in Turin, Italy},
1591 @Unpublished{voelker94,
1592 author = {Norbert V{\"o}lker},
1593 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1594 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1600 @inproceedings{wadler89how,
1601 author = {P. Wadler and S. Blott},
1602 title = {How to make ad-hoc polymorphism less ad-hoc},
1603 booktitle = {ACM Symp.\ Principles of Programming Languages},
1607 @phdthesis{weber-2008,
1608 author = "Tjark Weber",
1609 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1610 school = {Dept.\ of Informatics, T.U. M\"unchen},
1611 type = "{Ph.D.}\ thesis",
1615 author = {Christoph Wedler},
1616 title = {Emacs package ``{X-Symbol}''},
1617 note = {\url{http://x-symbol.sourceforge.net}}
1620 @misc{weidenbach-et-al-2009,
1621 author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski",
1622 title = "{SPASS} Version 3.5",
1623 note = {\url{http://www.spass-prover.org/publications/spass.pdf}}}
1625 @manual{isabelle-sys,
1626 author = {Markus Wenzel and Stefan Berghofer},
1627 title = {The {Isabelle} System Manual},
1628 institution = {TU Munich},
1629 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1631 @manual{isabelle-isar-ref,
1632 author = {Makarius Wenzel},
1633 title = {The {Isabelle/Isar} Reference Manual},
1634 institution = {TU Munich},
1635 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1637 @manual{isabelle-implementation,
1638 author = {Makarius Wenzel},
1639 title = {The {Isabelle/Isar} Implementation},
1640 institution = {TU Munich},
1641 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1643 @InProceedings{Wenzel:1999:TPHOL,
1644 author = {Markus Wenzel},
1645 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1646 crossref = {tphols99}}
1648 @InProceedings{Wenzel:1997:TPHOL,
1649 author = {Markus Wenzel},
1650 title = {Type Classes and Overloading in Higher-Order Logic},
1651 crossref = {tphols97}}
1653 @phdthesis{Wenzel-PhD,
1654 author={Markus Wenzel},
1655 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1656 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1658 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1660 @Article{Wenzel-Wiedijk:2002,
1661 author = {Freek Wiedijk and Markus Wenzel},
1662 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1663 journal = {Journal of Automated Reasoning},
1669 @InCollection{Wenzel-Paulson:2006,
1670 author = {Markus Wenzel and Lawrence C. Paulson},
1671 title = {{Isabelle/Isar}},
1672 booktitle = {The Seventeen Provers of the World},
1674 editor = {F. Wiedijk},
1675 series = {LNAI 3600}
1678 @InCollection{Wenzel:2006:Festschrift,
1679 author = {Makarius Wenzel},
1680 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1681 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1682 publisher = {University of Bia{\l}ystok},
1684 editor = {R. Matuszewski and A. Zalewska},
1686 series = {Studies in Logic, Grammar, and Rhetoric},
1687 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1690 @InProceedings{Wenzel-Chaieb:2007b,
1691 author = {Makarius Wenzel and Amine Chaieb},
1692 title = {{SML} with antiquotations embedded into {Isabelle/Isar}},
1693 booktitle = {Workshop on Programming Languages for Mechanized Mathematics
1694 (satellite of CALCULEMUS 2007). Hagenberg, Austria},
1695 editor = {Jacques Carette and Freek Wiedijk},
1700 @InProceedings{Wenzel:2009,
1701 author = {M. Wenzel},
1702 title = {Parallel Proof Checking in {Isabelle/Isar}},
1703 booktitle = {ACM SIGSAM Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009)},
1705 editor = {Dos Reis, G. and L. Th\'ery},
1706 publisher = {ACM Digital Library}}
1709 author = {A. N. Whitehead and B. Russell},
1710 title = {Principia Mathematica},
1713 note = {Paperback edition to *56,
1714 abridged from the 2nd edition (1927)}}
1716 @Misc{Wiedijk:1999:Mizar,
1717 author = {Freek Wiedijk},
1718 title = {Mizar: An Impression},
1719 howpublished = {Unpublished paper},
1721 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1724 @Misc{Wiedijk:2000:MV,
1725 author = {Freek Wiedijk},
1726 title = {The Mathematical Vernacular},
1727 howpublished = {Unpublished paper},
1729 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1732 @misc{wikipedia-2009-aa-trees,
1734 title = "Wikipedia: {AA} Tree",
1735 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
1738 author = {Glynn Winskel},
1739 title = {The Formal Semantics of Programming Languages},
1740 publisher = MIT,year=1993}
1742 @InCollection{wos-bledsoe,
1743 author = {Larry Wos},
1744 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1745 crossref = {bledsoe-fest},
1748 @InProceedings{Zammit:1999:TPHOL,
1749 author = {Vincent Zammit},
1750 title = {On the Implementation of an Extensible Declarative Proof Language},
1751 crossref = {tphols99}}
1757 title = "Z3: An Efficient {SMT} Solver",
1758 note = "\url{http://research.microsoft.com/en-us/um/redmond/projects/z3/}"}
1764 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1765 title = {Handbook of Logic in Computer Science},
1766 booktitle = {Handbook of Logic in Computer Science},
1767 publisher = {Oxford University Press},
1772 editor = {Henk Barendregt and Tobias Nipkow},
1773 title = TYPES # {: International Workshop {TYPES '93}},
1774 booktitle = TYPES # {: International Workshop {TYPES '93}},
1775 year = {published 1994},
1776 publisher = {Springer},
1777 series = {LNCS 806}}
1779 @book{barwise-handbk,
1780 editor = {J. Barwise},
1781 title = {Handbook of Mathematical Logic},
1782 booktitle = {Handbook of Mathematical Logic},
1786 @Proceedings{tlca93,
1787 title = {Typed Lambda Calculi and Applications},
1788 booktitle = {Typed Lambda Calculi and Applications},
1789 editor = {M. Bezem and J.F. Groote},
1791 publisher = {Springer},
1792 series = {LNCS 664}}
1795 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1796 title = {Current Trends in Hardware Verification and Automated
1798 booktitle = {Current Trends in Hardware Verification and Automated
1800 publisher = {Springer},
1804 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1805 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1806 publisher = {Kluwer Academic Publishers},
1808 editor = {Robert S. Boyer}}
1810 @Proceedings{cade12,
1811 editor = {Alan Bundy},
1812 title = {Automated Deduction --- {CADE}-12
1813 International Conference},
1814 booktitle = {Automated Deduction --- {CADE}-12
1815 International Conference},
1817 series = {LNAI 814},
1818 publisher = {Springer}}
1821 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1822 title = TYPES # {: International Workshop {TYPES '94}},
1823 booktitle = TYPES # {: International Workshop {TYPES '94}},
1825 publisher = {Springer},
1826 series = {LNCS 996}}
1828 @book{huet-plotkin91,
1829 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1830 title = {Logical Frameworks},
1831 booktitle = {Logical Frameworks},
1835 @book{huet-plotkin93,
1836 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1837 title = {Logical Environments},
1838 booktitle = {Logical Environments},
1843 editor = {J. Joyce and C. Seger},
1844 title = {Higher Order Logic Theorem Proving and Its
1845 Applications: HUG '93},
1846 booktitle = {Higher Order Logic Theorem Proving and Its
1847 Applications: HUG '93},
1848 year = {Published 1994},
1849 publisher = {Springer},
1850 series = {LNCS 780}}
1852 @proceedings{colog88,
1853 editor = {P. Martin-L{\"o}f and G. Mints},
1854 title = {COLOG-88: International Conference on Computer Logic},
1855 booktitle = {COLOG-88: International Conference on Computer Logic},
1856 year = {Published 1990},
1857 publisher = {Springer},
1858 organization = {Estonian Academy of Sciences},
1859 address = {Tallinn},
1860 series = {LNCS 417}}
1863 editor = {P. Odifreddi},
1864 title = {Logic and Computer Science},
1865 booktitle = {Logic and Computer Science},
1866 publisher = {Academic Press},
1869 @proceedings{extensions91,
1870 editor = {Peter Schroeder-Heister},
1871 title = {Extensions of Logic Programming},
1872 booktitle = {Extensions of Logic Programming},
1874 series = {LNAI 475},
1875 publisher = {Springer}}
1877 @proceedings{cade10,
1878 editor = {Mark E. Stickel},
1879 title = {10th } # CADE,
1880 booktitle = {10th } # CADE,
1882 publisher = {Springer},
1883 series = {LNAI 449}}
1886 editor = {M. Vardi},
1887 title = {Eighth Annual Symposium on Logic in Computer Science},
1888 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1893 title = {Automated Reasoning and its Applications:
1894 Essays in Honor of {Larry Wos}},
1895 booktitle = {Automated Reasoning and its Applications:
1896 Essays in Honor of {Larry Wos}},
1899 editor = {Robert Veroff}}
1902 editor = {J. C. P. Woodcock and P. G. Larsen},
1903 title = {FME '93: Industrial-Strength Formal Methods},
1904 booktitle = {FME '93: Industrial-Strength Formal Methods},
1906 publisher = Springer,
1910 @Proceedings{tphols96,
1911 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1912 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1913 editor = {J. von Wright and J. Grundy and J. Harrison},
1914 publisher = Springer,
1919 @Proceedings{tphols97,
1920 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1921 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1922 editor = {Elsa L. Gunter and Amy Felty},
1923 publisher = Springer,
1928 @Proceedings{tphols98,
1929 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1930 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1931 editor = {Jim Grundy and Malcom Newey},
1932 publisher = Springer,
1937 @Proceedings{tphols99,
1938 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1939 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1940 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1941 Paulin, C. and Thery, L.},
1942 publisher = Springer,
1947 @Proceedings{tphols2000,
1948 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1949 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
1950 editor = {J. Harrison and M. Aagaard},
1951 publisher = Springer,
1956 @Proceedings{tphols2001,
1957 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1958 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
1959 editor = {R. J. Boulton and P. B. Jackson},
1960 publisher = Springer,
1965 @Proceedings{ijcar2006,
1966 title = {Automated Reasoning: {IJCAR} 2006},
1967 booktitle = {Automated Reasoning: {IJCAR} 2006},
1968 editor = {U. Furbach and N. Shankar},
1969 publisher = Springer,
1974 @Proceedings{tphols2007,
1975 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1976 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
1977 editor = {K. Schneider and J. Brandt},
1978 publisher = Springer,
1983 @Proceedings{tphols2008,
1984 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1985 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
1986 publisher = Springer,
1992 @Proceedings{itp2010,
1993 title = {Interactive Theorem Proving: {ITP}-10},
1994 booktitle = {Interactive Theorem Proving: {ITP}-10},
1995 editor = "Matt Kaufmann and Lawrence Paulson",
1996 publisher = Springer,
2000 @unpublished{classes_modules,
2001 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
2002 author = {Stefan Wehr et. al.}