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{backes-brown-2010,
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}}
305 author = {Fran\c{c}ois Bobot and Jean-Christophe Filli\^atre and Claude March\'e and Andrei Paskevich},
306 title = {{Why3}: Shepherd Your Herd of Provers},
307 editor = "K. Rustan M. Leino and Micha\l{} Moskal",
308 booktitle = {Boogie 2011},
313 @inproceedings{alt-ergo,
314 author = {Fran\c{c}ois Bobot and Sylvain Conchon and Evelyne Contejean and St\'ephane Lescuyer},
315 title = {Implementing Polymorphism in {SMT} Solvers},
316 booktitle = {SMT '08},
321 editor = {Clark Barrett and Leonardo de Moura}}
323 % and Domagoj Babic and Amit Goel
325 @inproceedings{boehme-nipkow-2010,
326 author={Sascha B\"ohme and Tobias Nipkow},
327 title={Sledgehammer: Judgement Day},
328 booktitle={Automated Reasoning: IJCAR 2010},
329 editor={J. Giesl and R. H\"ahnle},
337 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
338 Overbeek and Mark Stickel and Lawrence Wos},
339 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
348 author = {Robert S. Boyer and J Strother Moore},
349 title = {A Computational Logic},
350 publisher = {Academic Press},
354 author = {Robert S. Boyer and J Strother Moore},
355 title = {A Computational Logic Handbook},
356 publisher = {Academic Press},
359 @inproceedings{satallax,
360 author = "Chad E. Brown",
361 title = "Reducing Higher-Order Theorem Proving to a Sequence of {SAT} Problems",
362 booktitle = {Automated Deduction --- CADE-23},
363 publisher = Springer,
367 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
371 author = {N. G. de Bruijn},
372 title = {Lambda Calculus Notation with Nameless Dummies,
373 a Tool for Automatic Formula Manipulation,
374 with Application to the {Church-Rosser Theorem}},
375 journal = {Indag. Math.},
380 @InProceedings{bulwahnKN07,
381 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
382 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
383 crossref = {tphols2007},
387 @InProceedings{bulwahn-et-al:2008:imperative,
388 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
389 title = {Imperative Functional Programming with {Isabelle/HOL}},
390 crossref = {tphols2008},
395 author = {M. Burrows and M. Abadi and R. M. Needham},
396 title = {A Logic of Authentication},
404 @InProceedings{Chaieb-Wenzel:2007,
405 author = {Amine Chaieb and Makarius Wenzel},
406 title = {Context aware Calculation and Deduction ---
407 Ring Equalities via {Gr\"obner Bases} in {Isabelle}},
408 booktitle = {Towards Mechanized Mathematical Assistants (CALCULEMUS 2007)},
409 editor = {Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger},
416 @TechReport{camilleri92,
417 author = {J. Camilleri and T. F. Melham},
418 title = {Reasoning with Inductively Defined Relations in the
419 {HOL} Theorem Prover},
426 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
427 title = {Artificial Intelligence Programming},
428 publisher = {Lawrence Erlbaum Associates},
432 author = "Alonzo Church",
433 title = "A Formulation of the Simple Theory of Types",
439 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
440 title="Model Checking",publisher=MIT,year=1999}
443 author = {Martin D. Coen},
444 title = {Interactive Program Derivation},
445 school = {University of Cambridge},
446 note = {Computer Laboratory Technical Report 272},
451 author = {R. L. Constable and others},
452 title = {Implementing Mathematics with the Nuprl Proof
454 publisher = Prentice,
459 @Book{davey-priestley,
460 author = {B. A. Davey and H. A. Priestley},
461 title = {Introduction to Lattices and Order},
466 author = {Keith J. Devlin},
467 title = {Fundamentals of Contemporary Set Theory},
468 publisher = {Springer},
472 author = {Michael Dummett},
473 title = {Elements of Intuitionism},
475 publisher = {Oxford University Press}}
478 author = {Bruno Dutertre and Leonardo de Moura},
479 title = {The {Yices} {SMT} Solver},
480 howpublished = "\url{http://yices.csl.sri.com/tool-paper.pdf}",
483 @incollection{dybjer91,
484 author = {Peter Dybjer},
485 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
486 Theory and Their Set-Theoretic Semantics},
487 crossref = {huet-plotkin91},
491 author = {Roy Dyckhoff},
492 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
502 author = {William M. Farmer and Joshua D. Guttman and F. Javier
504 title = {{IMPS}: An Interactive Mathematical Proof System},
511 @InProceedings{felty91a,
512 Author = {Amy Felty},
513 Title = {A Logic Program for Transforming Sequent Proofs to Natural
515 crossref = {extensions91},
518 @Article{fleuriot-jcm,
519 author = {Jacques Fleuriot and Lawrence C. Paulson},
520 title = {Mechanizing Nonstandard Real Analysis},
521 journal = {LMS Journal of Computation and Mathematics},
525 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
529 author = {Jacob Frost},
530 title = {A Case Study of Co-induction in {Isabelle HOL}},
536 %revised version of frost93
538 author = {Jacob Frost},
539 title = {A Case Study of Co-induction in {Isabelle}},
546 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
548 title = {Principles of {OBJ2}},
556 author = {J. H. Gallier},
557 title = {Logic for Computer Science:
558 Foundations of Automatic Theorem Proving},
560 publisher = {Harper \& Row}}
563 author = {Antony Galton},
564 title = {Logic for Information Technology},
568 @Article{Gentzen:1935,
569 author = {G. Gentzen},
570 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
571 journal = {Math. Zeitschrift},
575 @InProceedings{gimenez-codifying,
576 author = {Eduardo Gim{\'e}nez},
577 title = {Codifying Guarded Definitions with Recursive Schemes},
578 crossref = {types94},
583 author = {Jean-Yves Girard},
584 title = {Proofs and Types},
587 note = {Translated by Yves LaFont and Paul Taylor}}
590 editor = {M. J. C. Gordon and T. F. Melham},
591 title = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
596 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
598 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
600 publisher = {Springer},
603 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
604 title={Why we can't have {SML} style datatype declarations in {HOL}},
605 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
606 IFIP TC10/WG10.2 Intl. Workshop, 1992},
607 editor={L.J.M. Claesen and M.J.C. Gordon},
608 publisher=NH,year=1993,pages={561--568}}
610 @InProceedings{gunter-trees,
611 author = {Elsa L. Gunter},
612 title = {A Broader Class of Trees for Recursive Type Definitions for
619 @InProceedings{Haftmann-Wenzel:2006:classes,
620 author = {Florian Haftmann and Makarius Wenzel},
621 title = {Constructive Type Classes in {Isabelle}},
622 editor = {T. Altenkirch and C. McBride},
623 booktitle = {Types for Proofs and Programs, TYPES 2006},
624 publisher = {Springer},
630 @inproceedings{Haftmann-Nipkow:2010:code,
631 author = {Florian Haftmann and Tobias Nipkow},
632 title = {Code Generation via Higher-Order Rewrite Systems},
633 booktitle = {Functional and Logic Programming: 10th International Symposium: FLOPS 2010},
635 publisher = Springer,
637 editor = {Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal},
641 @InProceedings{Haftmann-Wenzel:2009,
642 author = {Florian Haftmann and Makarius Wenzel},
643 title = {Local theory specifications in {Isabelle/Isar}},
644 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
645 booktitle = {Types for Proofs and Programs, TYPES 2008},
646 publisher = {Springer},
652 @inproceedings{hindleymilner,
653 author = {L. Damas and H. Milner},
654 title = {Principal type schemes for functional programs},
655 booktitle = {ACM Symp. Principles of Programming Languages},
659 @manual{isabelle-classes,
660 author = {Florian Haftmann},
661 title = {Haskell-style type classes with {Isabelle}/{Isar}},
663 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
666 @manual{isabelle-codegen,
667 author = {Florian Haftmann},
668 title = {Code generation from Isabelle theories},
670 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
674 author = {Paul R. Halmos},
675 title = {Naive Set Theory},
676 publisher = {Van Nostrand},
679 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
680 title={Dynamic Logic},publisher=MIT,year=2000}
683 author = {Matthew Hennessy},
684 title = {The Semantics of Programming Languages: An Elementary
685 Introduction Using Structural Operational Semantics},
689 @article{waldmeister,
690 author = {Thomas Hillenbrand and Arnim Buch and Rolan Vogt and Bernd L\"ochner},
691 title = "Waldmeister: High-Performance Equational Deduction",
698 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
699 title={Introduction to Automata Theory, Languages, and Computation.},
700 publisher={Addison-Wesley},year=1979}
702 @Article{haskell-report,
703 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
704 title = {Report on the Programming Language {Haskell}: A
705 Non-strict, Purely Functional Language},
711 note = {Version 1.2}}
713 @Article{haskell-tutorial,
714 author = {Paul Hudak and Joseph H. Fasel},
715 title = {A Gentle Introduction to {Haskell}},
723 author = "Kry\v{s}tof Hoder and Andrei Voronkov",
724 title = "Sine Qua Non for Large Theory Reasoning",
725 booktitle = {Automated Deduction --- CADE-23},
726 publisher = Springer,
730 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
733 @book{Hudak-Haskell,author={Paul Hudak},
734 title={The Haskell School of Expression},publisher=CUP,year=2000}
737 author = {G. P. Huet},
738 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
745 author = {G. P. Huet and B. Lang},
746 title = {Proving and Applying Program Transformations Expressed with
747 Second-Order Patterns},
753 @inproceedings{huet88,
754 author = {G{\'e}rard Huet},
755 title = {Induction Principles Formalized in the {Calculus of
757 booktitle = {Programming of Future Generation Computers},
758 editor = {K. Fuchi and M. Nivat},
761 publisher = {Elsevier}}
763 @Book{Huth-Ryan-book,
764 author = {Michael Huth and Mark Ryan},
765 title = {Logic in Computer Science. Modelling and reasoning about systems},
769 @InProceedings{Harrison:1996:MizarHOL,
770 author = {J. Harrison},
771 title = {A {Mizar} Mode for {HOL}},
773 crossref = {tphols96}}
777 title = "Metis Theorem Prover",
778 note = "\url{http://www.gilith.com/software/metis/}"}
782 @article{haskell-revised-report,
783 author = {Simon {Peyton Jones} and others},
784 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
785 journal = {Journal of Functional Programming},
791 note = {\url{http://www.haskell.org/definition/}}}
794 author = "Daniel Jackson",
795 title = "Software Abstractions: Logic, Language, and Analysis",
801 @InProceedings{kammueller-locales,
802 author = {Florian Kamm{\"u}ller and Markus Wenzel and
803 Lawrence C. Paulson},
804 title = {Locales: A Sectioning Concept for {Isabelle}},
805 crossref = {tphols99}}
808 author={Donald E. Knuth},
809 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
810 publisher={Addison-Wesley},
814 author = {R. E. Korf},
815 title = {Depth-First Iterative-Deepening: an Optimal Admissible
822 @inproceedings{korovin-2009,
823 title = "Instantiation-Based Automated Reasoning: From Theory to Practice",
824 author = "Konstantin Korovin",
825 editor = "Renate A. Schmidt",
826 booktitle = {Automated Deduction --- CADE-22},
831 publisher = "Springer"}
833 @inproceedings{korovin-sticksel-2010,
834 author = {Konstantin Korovin and
836 title = {{iP}rover-{E}q: An Instantiation-Based Theorem Prover with Equality},
838 booktitle={Automated Reasoning: IJCAR 2010},
839 editor={J. Giesl and R. H\"ahnle},
840 publisher = Springer,
845 @InProceedings{krauss2006,
846 author = {Alexander Krauss},
847 title = {Partial Recursive Functions in {Higher-Order Logic}},
848 crossref = {ijcar2006},
851 @PhdThesis{krauss_phd,
852 author = {Alexander Krauss},
853 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
854 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
859 @manual{isabelle-function,
860 author = {Alexander Krauss},
861 title = {Defining Recursive Functions in {Isabelle/HOL}},
863 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
867 author = {Kenneth Kunen},
868 title = {Set Theory: An Introduction to Independence Proofs},
875 author = {Xavier Leroy and others},
876 title = {The Objective Caml system -- Documentation and user's manual},
877 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
879 @incollection{lochbihler-2010,
880 title = "Coinduction",
881 author = "Andreas Lochbihler",
882 booktitle = "The Archive of Formal Proofs",
883 editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
884 publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",
889 author = "D. W. Loveland",
890 title = "Automated Theorem Proving: A Logical Basis",
892 publisher = "North-Holland Publishing Co."}
894 @InProceedings{lowe-fdr,
895 author = {Gavin Lowe},
896 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
897 Protocol using {CSP} and {FDR}},
898 booktitle = {Tools and Algorithms for the Construction and Analysis
899 of Systems: second international workshop, TACAS '96},
900 editor = {T. Margaria and B. Steffen},
901 series = {LNCS 1055},
903 publisher = {Springer},
909 author = {Zohar Manna and Richard Waldinger},
910 title = {Deductive Synthesis of the Unification Algorithm},
917 @InProceedings{martin-nipkow,
918 author = {Ursula Martin and Tobias Nipkow},
919 title = {Ordered Rewriting and Confluence},
924 author = {Per Martin-L{\"o}f},
925 title = {Intuitionistic type theory},
927 publisher = {Bibliopolis}}
929 @incollection{melham89,
930 author = {Thomas F. Melham},
931 title = {Automating Recursive Type Definitions in Higher Order
934 crossref = {birtwistle89}}
936 @Article{Miller:1991,
937 author = {Dale Miller},
938 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
939 and Simple Unification},
940 journal = {Journal of Logic and Computation},
946 @Article{miller-mixed,
947 Author = {Dale Miller},
948 Title = {Unification Under a Mixed Prefix},
956 author = {Robin Milner},
957 title = {A Theory of Type Polymorphism in Programming},
958 journal = "J. Comp.\ Sys.\ Sci.",
963 @TechReport{milner-ind,
964 author = {Robin Milner},
965 title = {How to Derive Inductions in {LCF}},
966 institution = Edinburgh,
970 @Article{milner-coind,
971 author = {Robin Milner and Mads Tofte},
972 title = {Co-induction in Relational Semantics},
979 author = {Robin Milner},
980 title = {Communication and Concurrency},
981 publisher = Prentice,
984 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
985 title="The Definition of Standard ML",publisher=MIT,year=1990}
987 @PhdThesis{monahan84,
988 author = {Brian Q. Monahan},
989 title = {Data Type Proofs using Edinburgh {LCF}},
990 school = {University of Edinburgh},
993 @article{MuellerNvOS99,
995 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
996 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
998 @Manual{Muzalewski:Mizar,
999 title = {An Outline of {PC} {Mizar}},
1000 author = {Micha{\l} Muzalewski},
1001 organization = {Fondation of Logic, Mathematics and Informatics
1002 --- Mizar Users Group},
1004 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
1009 @InProceedings{NaraschewskiW-TPHOLs98,
1010 author = {Wolfgang Naraschewski and Markus Wenzel},
1012 {Object-Oriented Verification based on Record Subtyping in
1013 Higher-Order Logic},
1014 crossref = {tphols98}}
1016 @inproceedings{nazareth-nipkow,
1017 author = {Dieter Nazareth and Tobias Nipkow},
1018 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
1019 crossref = {tphols96},
1023 @Article{needham-schroeder,
1024 author = "Roger M. Needham and Michael D. Schroeder",
1025 title = "Using Encryption for Authentication in Large Networks
1034 @inproceedings{nipkow-W,
1035 author = {Wolfgang Naraschewski and Tobias Nipkow},
1036 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
1037 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
1038 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
1039 publisher = Springer,
1045 @InCollection{nipkow-sorts93,
1046 author = {T. Nipkow},
1047 title = {Order-Sorted Polymorphism in {Isabelle}},
1048 booktitle = {Logical Environments},
1051 editor = {G. Huet and G. Plotkin},
1055 @Misc{nipkow-types93,
1056 author = {Tobias Nipkow},
1057 title = {Axiomatic Type Classes (in {I}sabelle)},
1058 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
1062 @inproceedings{Nipkow-CR,
1063 author = {Tobias Nipkow},
1064 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
1065 booktitle = {Automated Deduction --- CADE-13},
1066 editor = {M. McRobbie and J.K. Slaney},
1067 publisher = Springer,
1073 % WAS Nipkow-LICS-93
1074 @InProceedings{nipkow-patterns,
1075 title = {Functional Unification of Higher-Order Patterns},
1076 author = {Tobias Nipkow},
1079 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
1080 keywords = {unification}}
1082 @article{nipkow-IMP,
1083 author = {Tobias Nipkow},
1084 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
1090 @inproceedings{Nipkow-TYPES02,
1091 author = {Tobias Nipkow},
1092 title = {{Structured Proofs in Isar/HOL}},
1093 booktitle = {Types for Proofs and Programs (TYPES 2002)},
1094 editor = {H. Geuvers and F. Wiedijk},
1096 publisher = Springer,
1101 @manual{isabelle-HOL,
1102 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1103 title = {{Isabelle}'s Logics: {HOL}},
1104 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
1105 M{\"u}nchen and Computer Laboratory, University of Cambridge},
1106 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
1108 @article{nipkow-prehofer,
1109 author = {Tobias Nipkow and Christian Prehofer},
1110 title = {Type Reconstruction for Type Classes},
1117 @InProceedings{Nipkow-Prehofer:1993,
1118 author = {T. Nipkow and C. Prehofer},
1119 title = {Type checking type classes},
1120 booktitle = {ACM Symp.\ Principles of Programming Languages},
1125 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1126 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
1127 publisher = Springer,
1133 author = {Philippe No{\"e}l},
1134 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
1142 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
1143 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
1145 publisher = {Oxford University Press},
1150 @TechReport{scala-overview-tech-report,
1151 author = {Martin Odersky and al.},
1152 title = {An Overview of the Scala Programming Language},
1153 institution = {EPFL Lausanne, Switzerland},
1155 number = {IC/2004/64}
1158 @Article{Oppen:1980,
1159 author = {D. C. Oppen},
1160 title = {Pretty Printing},
1161 journal = {ACM Transactions on Programming Languages and Systems},
1166 @Manual{pvs-language,
1167 title = {The {PVS} specification language},
1168 author = {S. Owre and N. Shankar and J. M. Rushby},
1169 organization = {Computer Science Laboratory, SRI International},
1170 address = {Menlo Park, CA},
1171 note = {Beta release},
1174 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
1179 @InProceedings{paulin-tlca,
1180 author = {Christine Paulin-Mohring},
1181 title = {Inductive Definitions in the System {Coq}: Rules and
1183 crossref = {tlca93},
1186 @InProceedings{paulson-CADE,
1187 author = {Lawrence C. Paulson},
1188 title = {A Fixedpoint Approach to Implementing (Co)Inductive
1191 crossref = {cade12}}
1193 @InProceedings{paulson-COLOG,
1194 author = {Lawrence C. Paulson},
1195 title = {A Formulation of the Simple Theory of Types (for
1198 crossref = {colog88},
1199 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
1201 @Article{paulson-coind,
1202 author = {Lawrence C. Paulson},
1203 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1212 @manual{isabelle-intro,
1213 author = {Lawrence C. Paulson},
1214 title = {Old Introduction to {Isabelle}},
1216 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1218 @manual{isabelle-logics,
1219 author = {Lawrence C. Paulson},
1220 title = {{Isabelle's} Logics},
1222 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1224 @manual{isabelle-ref,
1225 author = {Lawrence C. Paulson},
1226 title = {The Old {Isabelle} Reference Manual},
1228 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1230 @manual{isabelle-ZF,
1231 author = {Lawrence C. Paulson},
1232 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1234 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1236 @article{paulson-found,
1237 author = {Lawrence C. Paulson},
1238 title = {The Foundation of a Generic Theorem Prover},
1244 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1246 %replaces paulson-final
1247 @Article{paulson-mscs,
1248 author = {Lawrence C. Paulson},
1249 title = {Final Coalgebras as Greatest Fixed Points
1250 in {ZF} Set Theory},
1251 journal = {Mathematical Structures in Computer Science},
1257 @InCollection{paulson-generic,
1258 author = {Lawrence C. Paulson},
1259 title = {Generic Automatic Proof Tools},
1260 crossref = {wos-fest},
1263 @Article{paulson-gr,
1264 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1265 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1274 @InCollection{paulson-fixedpt-milner,
1275 author = {Lawrence C. Paulson},
1276 title = {A Fixedpoint Approach to (Co)inductive and
1277 (Co)datatype Definitions},
1279 crossref = {milner-fest}}
1282 title = {Proof, Language, and Interaction:
1283 Essays in Honor of {Robin Milner}},
1284 booktitle = {Proof, Language, and Interaction:
1285 Essays in Honor of {Robin Milner}},
1288 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1290 @InCollection{paulson-handbook,
1291 author = {Lawrence C. Paulson},
1292 title = {Designing a Theorem Prover},
1293 crossref = {handbk-lics2},
1296 @Book{paulson-isa-book,
1297 author = {Lawrence C. Paulson},
1298 title = {Isabelle: A Generic Theorem Prover},
1299 publisher = {Springer},
1303 @Book{isabelle-hol-book,
1304 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1305 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1306 publisher = {Springer},
1310 @InCollection{paulson-markt,
1311 author = {Lawrence C. Paulson},
1312 title = {Tool Support for Logics of Programs},
1313 booktitle = {Mathematical Methods in Program Development:
1314 Summer School Marktoberdorf 1996},
1315 publisher = {Springer},
1317 year = {Published 1997},
1318 editor = {Manfred Broy},
1319 series = {NATO ASI Series F}}
1321 %replaces Paulson-ML and paulson91
1323 author = {Lawrence C. Paulson},
1324 title = {{ML} for the Working Programmer},
1329 @article{paulson-natural,
1330 author = {Lawrence C. Paulson},
1331 title = {Natural Deduction as Higher-order Resolution},
1336 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1338 @Article{paulson-set-I,
1339 author = {Lawrence C. Paulson},
1340 title = {Set Theory for Verification: {I}. {From}
1341 Foundations to Functions},
1347 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1349 @Article{paulson-set-II,
1350 author = {Lawrence C. Paulson},
1351 title = {Set Theory for Verification: {II}. {Induction} and
1358 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1361 author = {Lawrence C. Paulson},
1362 title = {Verifying the Unification Algorithm in {LCF}},
1368 %replaces Paulson-LCF
1370 author = {Lawrence C. Paulson},
1371 title = {Logic and Computation: Interactive proof with Cambridge
1376 @incollection{paulson700,
1377 author = {Lawrence C. Paulson},
1378 title = {{Isabelle}: The Next 700 Theorem Provers},
1379 crossref = {odifreddi90},
1381 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1383 % replaces paulson-ns and paulson-security
1384 @Article{paulson-jcs,
1385 author = {Lawrence C. Paulson},
1386 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1392 @Article{paulson-tls,
1393 author = {Lawrence C. Paulson},
1394 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1402 @Article{paulson-yahalom,
1403 author = {Lawrence C. Paulson},
1404 title = {Relations Between Secrets:
1405 Two Formal Analyses of the {Yahalom} Protocol},
1412 @article{pelletier86,
1413 author = {F. J. Pelletier},
1414 title = {Seventy-five Problems for Testing Automatic Theorem
1420 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1422 @InCollection{pitts93,
1423 author = {A. Pitts},
1424 title = {The {HOL} Logic},
1425 editor = {M. J. C. Gordon and T. F. Melham},
1426 booktitle = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
1432 author = {Andrew M. Pitts},
1433 title = {A Co-induction Principle for Recursively Defined Domains},
1439 @Article{plaisted90,
1440 author = {David A. Plaisted},
1441 title = {A Sequent-Style Model Elimination Strategy and a Positive
1452 author = {Art Quaife},
1453 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1463 @TechReport{rasmussen95,
1464 author = {Ole Rasmussen},
1465 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1467 institution = {Computer Laboratory, University of Cambridge},
1471 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1474 author = {Steve Reeves and Michael Clarke},
1475 title = {Logic for Computer Science},
1476 publisher = {Addison-Wesley},
1479 @article{riazanov-voronkov-2002,
1480 author = "Alexander Riazanov and Andrei Voronkov",
1481 title = "The Design and Implementation of {Vampire}",
1482 journal = "Journal of AI Communications",
1488 @book{Rosen-DMA,author={Kenneth H. Rosen},
1489 title={Discrete Mathematics and Its Applications},
1490 publisher={McGraw-Hill},year=1998}
1492 @InProceedings{Rudnicki:1992:MizarOverview,
1493 author = {P. Rudnicki},
1494 title = {An Overview of the {MIZAR} Project},
1495 booktitle = {1992 Workshop on Types for Proofs and Programs},
1497 organization = {Chalmers University of Technology},
1498 publisher = {Bastad}
1503 @inproceedings{saaltink-fme,
1504 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1505 Dan Craigen and Irwin Meisels},
1506 title = {An {EVES} Data Abstraction Example},
1510 @Article{Schroeder-Heister:1984,
1511 author = {Peter Schroeder-Heister},
1512 title = {A Natural Extension of Natural Deduction},
1513 journal = {Journal of Symbolic Logic},
1519 @article{schulz-2002,
1520 author = "Stephan Schulz",
1521 title = "E---A Brainiac Theorem Prover",
1522 journal = "Journal of AI Communications",
1528 @misc{sledgehammer-2009,
1529 key = "Sledgehammer",
1530 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1531 Write Your {I}s\-a\-belle Scripts",
1532 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1534 @inproceedings{slind-tfl,
1535 author = {Konrad Slind},
1536 title = {Function Definition in Higher Order Logic},
1537 crossref = {tphols96},
1540 @inproceedings{snark,
1541 author = {M. Stickel and R. Waldinger and M. Lowry and T. Pressburger and I. Underwood},
1542 title = {Deductive composition of astronomical software from subroutine libraries},
1544 crossref = {cade12}}
1547 author = {Patrick Suppes},
1548 title = {Axiomatic Set Theory},
1550 publisher = {Dover}}
1552 @inproceedings{sutcliffe-2000,
1553 author = "Geoff Sutcliffe",
1554 title = "System Description: {SystemOnTPTP}",
1555 editor = "David McAllester",
1556 booktitle = {Automated Deduction --- {CADE}-17 International Conference},
1557 series = "Lecture Notes in Artificial Intelligence",
1561 publisher = Springer}
1564 author = "Geoff Sutcliffe",
1566 note = "\url{http://www.cs.miami.edu/~tptp/ATPSystems/ToFoF/}"}
1568 @Article{Sutter:2005,
1569 author = {H. Sutter},
1570 title = {The Free Lunch Is Over --- A Fundamental Turn Toward Concurrency in Software},
1571 journal = {Dr. Dobb's Journal},
1576 @InCollection{szasz93,
1577 author = {Nora Szasz},
1578 title = {A Machine Checked Proof that {Ackermann's} Function is not
1579 Primitive Recursive},
1580 crossref = {huet-plotkin93},
1583 @TechReport{Syme:1997:DECLARE,
1585 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1586 institution = {University of Cambridge Computer Laboratory},
1591 @PhdThesis{Syme:1998:thesis,
1593 title = {Declarative Theorem Proving for Operational Semantics},
1594 school = {University of Cambridge},
1599 @InProceedings{Syme:1999:TPHOL,
1601 title = {Three Tactic Theorem Proving},
1602 crossref = {tphols99}}
1607 author = {G. Takeuti},
1608 title = {Proof Theory},
1614 author = {Simon Thompson},
1615 title = {Type Theory and Functional Programming},
1616 publisher = {Addison-Wesley},
1619 @book{Thompson-Haskell,author={Simon Thompson},
1620 title={Haskell: The Craft of Functional Programming},
1621 publisher={Addison-Wesley},year=1999}
1624 author = "Emina Torlak",
1625 title = {Kodkod: Constraint Solver for Relational Logic},
1626 note = "\url{http://alloy.mit.edu/kodkod/}"}
1628 @misc{kodkod-2009-options,
1629 author = "Emina Torlak",
1630 title = "Kodkod {API}: Class {Options}",
1631 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1633 @inproceedings{torlak-jackson-2007,
1634 title = "Kodkod: A Relational Model Finder",
1635 author = "Emina Torlak and Daniel Jackson",
1636 editor = "Orna Grumberg and Michael Huth",
1637 booktitle = "TACAS 2007",
1642 publisher = Springer}
1644 @unpublished{traytel-berghofer-nipkow-2011,
1645 author = {D. Traytel and S. Berghofer and T. Nipkow},
1646 title = {Extending Hindley-Milner Type Inference with Coercive
1647 Subtyping (long version)},
1650 \url{http://isabelle.in.tum.de/doc/implementation.pdf}}},
1653 @Unpublished{Trybulec:1993:MizarFeatures,
1654 author = {A. Trybulec},
1655 title = {Some Features of the {Mizar} Language},
1656 note = {Presented at a workshop in Turin, Italy},
1662 @Unpublished{voelker94,
1663 author = {Norbert V{\"o}lker},
1664 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1665 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1671 @inproceedings{wadler89how,
1672 author = {P. Wadler and S. Blott},
1673 title = {How to make ad-hoc polymorphism less ad-hoc},
1674 booktitle = {ACM Symp.\ Principles of Programming Languages},
1678 @phdthesis{weber-2008,
1679 author = "Tjark Weber",
1680 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1681 school = {Dept.\ of Informatics, T.U. M\"unchen},
1682 type = "{Ph.D.}\ thesis",
1686 author = {Christoph Wedler},
1687 title = {Emacs package ``{X-Symbol}''},
1688 note = {\url{http://x-symbol.sourceforge.net}}
1691 @misc{weidenbach-et-al-2009,
1692 author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski",
1693 title = "{SPASS} Version 3.5",
1694 note = {\url{http://www.spass-prover.org/publications/spass.pdf}}}
1696 @manual{isabelle-sys,
1697 author = {Markus Wenzel and Stefan Berghofer},
1698 title = {The {Isabelle} System Manual},
1699 institution = {TU Munich},
1700 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1702 @manual{isabelle-isar-ref,
1703 author = {Makarius Wenzel},
1704 title = {The {Isabelle/Isar} Reference Manual},
1705 institution = {TU Munich},
1706 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1708 @manual{isabelle-implementation,
1709 author = {Makarius Wenzel},
1710 title = {The {Isabelle/Isar} Implementation},
1711 institution = {TU Munich},
1712 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1714 @InProceedings{Wenzel:1999:TPHOL,
1715 author = {Markus Wenzel},
1716 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1717 crossref = {tphols99}}
1719 @InProceedings{Wenzel:1997:TPHOL,
1720 author = {Markus Wenzel},
1721 title = {Type Classes and Overloading in Higher-Order Logic},
1722 crossref = {tphols97}}
1724 @phdthesis{Wenzel-PhD,
1725 author={Markus Wenzel},
1726 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1727 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1729 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1731 @Article{Wenzel-Wiedijk:2002,
1732 author = {Freek Wiedijk and Markus Wenzel},
1733 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1734 journal = {Journal of Automated Reasoning},
1740 @InCollection{Wenzel-Paulson:2006,
1741 author = {Markus Wenzel and Lawrence C. Paulson},
1742 title = {{Isabelle/Isar}},
1743 booktitle = {The Seventeen Provers of the World},
1745 editor = {F. Wiedijk},
1746 series = {LNAI 3600}
1749 @InCollection{Wenzel:2006:Festschrift,
1750 author = {Makarius Wenzel},
1751 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1752 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1753 publisher = {University of Bia{\l}ystok},
1755 editor = {R. Matuszewski and A. Zalewska},
1757 series = {Studies in Logic, Grammar, and Rhetoric},
1758 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1761 @InProceedings{Wenzel-Chaieb:2007b,
1762 author = {Makarius Wenzel and Amine Chaieb},
1763 title = {{SML} with antiquotations embedded into {Isabelle/Isar}},
1764 booktitle = {Workshop on Programming Languages for Mechanized Mathematics
1765 (satellite of CALCULEMUS 2007). Hagenberg, Austria},
1766 editor = {Jacques Carette and Freek Wiedijk},
1771 @InProceedings{Wenzel:2009,
1772 author = {M. Wenzel},
1773 title = {Parallel Proof Checking in {Isabelle/Isar}},
1774 booktitle = {ACM SIGSAM Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009)},
1776 editor = {Dos Reis, G. and L. Th\'ery},
1777 publisher = {ACM Digital Library}}
1780 author = {A. N. Whitehead and B. Russell},
1781 title = {Principia Mathematica},
1784 note = {Paperback edition to *56,
1785 abridged from the 2nd edition (1927)}}
1787 @Misc{Wiedijk:1999:Mizar,
1788 author = {Freek Wiedijk},
1789 title = {Mizar: An Impression},
1790 howpublished = {Unpublished paper},
1792 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1795 @Misc{Wiedijk:2000:MV,
1796 author = {Freek Wiedijk},
1797 title = {The Mathematical Vernacular},
1798 howpublished = {Unpublished paper},
1800 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1803 @misc{wikipedia-2009-aa-trees,
1805 title = "Wikipedia: {AA} Tree",
1806 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
1809 author = {Glynn Winskel},
1810 title = {The Formal Semantics of Programming Languages},
1811 publisher = MIT,year=1993}
1813 @InCollection{wos-bledsoe,
1814 author = {Larry Wos},
1815 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1816 crossref = {bledsoe-fest},
1819 @InProceedings{Zammit:1999:TPHOL,
1820 author = {Vincent Zammit},
1821 title = {On the Implementation of an Extensible Declarative Proof Language},
1822 crossref = {tphols99}}
1828 title = "Z3: An Efficient {SMT} Solver",
1829 note = "\url{http://research.microsoft.com/en-us/um/redmond/projects/z3/}"}
1835 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1836 title = {Handbook of Logic in Computer Science},
1837 booktitle = {Handbook of Logic in Computer Science},
1838 publisher = {Oxford University Press},
1843 editor = {Henk Barendregt and Tobias Nipkow},
1844 title = TYPES # {: International Workshop {TYPES '93}},
1845 booktitle = TYPES # {: International Workshop {TYPES '93}},
1846 year = {published 1994},
1847 publisher = {Springer},
1848 series = {LNCS 806}}
1850 @book{barwise-handbk,
1851 editor = {J. Barwise},
1852 title = {Handbook of Mathematical Logic},
1853 booktitle = {Handbook of Mathematical Logic},
1857 @Proceedings{tlca93,
1858 title = {Typed Lambda Calculi and Applications},
1859 booktitle = {Typed Lambda Calculi and Applications},
1860 editor = {M. Bezem and J.F. Groote},
1862 publisher = {Springer},
1863 series = {LNCS 664}}
1866 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1867 title = {Current Trends in Hardware Verification and Automated
1869 booktitle = {Current Trends in Hardware Verification and Automated
1871 publisher = {Springer},
1875 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1876 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1877 publisher = {Kluwer Academic Publishers},
1879 editor = {Robert S. Boyer}}
1881 @Proceedings{cade12,
1882 editor = {Alan Bundy},
1883 title = {Automated Deduction --- {CADE}-12
1884 International Conference},
1885 booktitle = {Automated Deduction --- {CADE}-12
1886 International Conference},
1888 series = {LNAI 814},
1889 publisher = {Springer}}
1892 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1893 title = TYPES # {: International Workshop {TYPES '94}},
1894 booktitle = TYPES # {: International Workshop {TYPES '94}},
1896 publisher = {Springer},
1897 series = {LNCS 996}}
1899 @book{huet-plotkin91,
1900 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1901 title = {Logical Frameworks},
1902 booktitle = {Logical Frameworks},
1906 @book{huet-plotkin93,
1907 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1908 title = {Logical Environments},
1909 booktitle = {Logical Environments},
1914 editor = {J. Joyce and C. Seger},
1915 title = {Higher Order Logic Theorem Proving and Its
1916 Applications: HUG '93},
1917 booktitle = {Higher Order Logic Theorem Proving and Its
1918 Applications: HUG '93},
1919 year = {Published 1994},
1920 publisher = {Springer},
1921 series = {LNCS 780}}
1923 @proceedings{colog88,
1924 editor = {P. Martin-L{\"o}f and G. Mints},
1925 title = {COLOG-88: International Conference on Computer Logic},
1926 booktitle = {COLOG-88: International Conference on Computer Logic},
1927 year = {Published 1990},
1928 publisher = {Springer},
1929 organization = {Estonian Academy of Sciences},
1930 address = {Tallinn},
1931 series = {LNCS 417}}
1934 editor = {P. Odifreddi},
1935 title = {Logic and Computer Science},
1936 booktitle = {Logic and Computer Science},
1937 publisher = {Academic Press},
1940 @proceedings{extensions91,
1941 editor = {Peter Schroeder-Heister},
1942 title = {Extensions of Logic Programming},
1943 booktitle = {Extensions of Logic Programming},
1945 series = {LNAI 475},
1946 publisher = {Springer}}
1948 @proceedings{cade10,
1949 editor = {Mark E. Stickel},
1950 title = {10th } # CADE,
1951 booktitle = {10th } # CADE,
1953 publisher = {Springer},
1954 series = {LNAI 449}}
1957 editor = {M. Vardi},
1958 title = {Eighth Annual Symposium on Logic in Computer Science},
1959 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1964 title = {Automated Reasoning and its Applications:
1965 Essays in Honor of {Larry Wos}},
1966 booktitle = {Automated Reasoning and its Applications:
1967 Essays in Honor of {Larry Wos}},
1970 editor = {Robert Veroff}}
1973 editor = {J. C. P. Woodcock and P. G. Larsen},
1974 title = {FME '93: Industrial-Strength Formal Methods},
1975 booktitle = {FME '93: Industrial-Strength Formal Methods},
1977 publisher = Springer,
1981 @Proceedings{tphols96,
1982 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1983 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1984 editor = {J. von Wright and J. Grundy and J. Harrison},
1985 publisher = Springer,
1990 @Proceedings{tphols97,
1991 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1992 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1993 editor = {Elsa L. Gunter and Amy Felty},
1994 publisher = Springer,
1999 @Proceedings{tphols98,
2000 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2001 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2002 editor = {Jim Grundy and Malcom Newey},
2003 publisher = Springer,
2008 @Proceedings{tphols99,
2009 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2010 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2011 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
2012 Paulin, C. and Thery, L.},
2013 publisher = Springer,
2018 @Proceedings{tphols2000,
2019 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2020 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2021 editor = {J. Harrison and M. Aagaard},
2022 publisher = Springer,
2027 @Proceedings{tphols2001,
2028 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2029 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2030 editor = {R. J. Boulton and P. B. Jackson},
2031 publisher = Springer,
2036 @Proceedings{ijcar2006,
2037 title = {Automated Reasoning: {IJCAR} 2006},
2038 booktitle = {Automated Reasoning: {IJCAR} 2006},
2039 editor = {U. Furbach and N. Shankar},
2040 publisher = Springer,
2045 @Proceedings{tphols2007,
2046 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2047 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2048 editor = {K. Schneider and J. Brandt},
2049 publisher = Springer,
2054 @Proceedings{tphols2008,
2055 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2056 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2057 publisher = Springer,
2063 @Proceedings{itp2010,
2064 title = {Interactive Theorem Proving: {ITP}-10},
2065 booktitle = {Interactive Theorem Proving: {ITP}-10},
2066 editor = "Matt Kaufmann and Lawrence Paulson",
2067 publisher = Springer,
2071 @unpublished{classes_modules,
2072 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
2073 author = {Stefan Wehr et. al.}