merged, using src/HOL/Tools/Sledgehammer/sledgehammer_isar.ML and src/HOL/Tools/Sledgehammer/sledgehammer_run.ML from 347c3b0cab44;
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 @article{Ballarin2013,
165 author = {Ballarin, Clemens},
167 note = {Online version; to appear in print.},
168 publisher = Springer,
169 title = {Locales: A Module System for Mathematical Theories},
170 url = {http://dx.doi.org/10.1007/s10817-013-9284-7},
173 @InCollection{Barendregt-Geuvers:2001,
174 author = {H. Barendregt and H. Geuvers},
175 title = {Proof Assistants using Dependent Type Systems},
176 booktitle = {Handbook of Automated Reasoning},
177 publisher = {Elsevier},
179 editor = {A. Robinson and A. Voronkov}
183 author = {Clark Barrett and Cesare Tinelli},
186 editor = {Werner Damm and Holger Hermanns},
190 publisher = {Springer},
194 @incollection{basin91,
195 author = {David Basin and Matt Kaufmann},
196 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
198 crossref = {huet-plotkin91},
201 @Unpublished{HOL-Library,
202 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
203 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
205 title = {The Supplemental {Isabelle/HOL} Library},
206 note = {Part of the Isabelle distribution,
207 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
211 @InProceedings{Bauer-Wenzel:2000:HB,
212 author = {Gertrud Bauer and Markus Wenzel},
213 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
215 booktitle = {Types for Proofs and Programs: TYPES'99},
216 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
222 @InProceedings{Bauer-Wenzel:2001,
223 author = {Gertrud Bauer and Markus Wenzel},
224 title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience},
225 crossref = {tphols2001}}
228 author = "Christoph Benzm{\"u}ller and Lawrence C. Paulson and Frank Theiss and Arnaud Fietzke",
229 title = "{LEO-II}---A Cooperative Automatic Theorem Prover for Higher-Order Logic",
230 editor = "Alessandro Armando and Peter Baumgartner and Gilles Dowek",
231 booktitle = "Automated Reasoning: IJCAR 2008",
232 publisher = Springer,
238 @inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL,
239 author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian},
240 booktitle = {Theorem Proving in Higher Order Logics},
242 title = {Turning Inductive into Equational Specifications},
246 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
247 crossref = "tphols2000",
248 title = "Proof terms for simply typed higher order logic",
249 author = "Stefan Berghofer and Tobias Nipkow",
252 @inproceedings{berghofer-nipkow-2004,
253 author = {Stefan Berghofer and Tobias Nipkow},
254 title = {Random Testing in {I}sabelle/{HOL}},
256 editor = "J. Cuellar and Z. Liu",
257 booktitle = {{SEFM} 2004},
261 @InProceedings{Berghofer-Nipkow:2002,
262 author = {Stefan Berghofer and Tobias Nipkow},
263 title = {Executing Higher Order Logic},
264 booktitle = {Types for Proofs and Programs: TYPES'2000},
265 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
267 publisher = Springer,
271 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
272 author = {Stefan Berghofer and Markus Wenzel},
273 title = {Inductive datatypes in {HOL} --- lessons learned in
274 {F}ormal-{L}ogic {E}ngineering},
275 crossref = {tphols99}}
278 @InProceedings{Bezem-Coquand:2005,
279 author = {M.A. Bezem and T. Coquand},
280 title = {Automating {Coherent Logic}},
281 booktitle = {LPAR-12},
282 editor = {G. Sutcliffe and A. Voronkov},
285 publisher = Springer}
287 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
288 title="Introduction to Functional Programming",publisher=PH,year=1988}
290 @book{Bird-Haskell,author="Richard Bird",
291 title="Introduction to Functional Programming using Haskell",
292 publisher=PH,year=1998}
294 @manual{isabelle-nitpick,
295 author = {Jasmin Christian Blanchette},
296 title = {Picking Nits: A User's Guide to {N}itpick for {I}sabelle\slash {HOL}},
298 note = {\url{http://isabelle.in.tum.de/doc/nitpick.pdf}}
301 @manual{isabelle-sledgehammer,
302 author = {Jasmin Christian Blanchette},
303 title = {Hammering Away: A User's Guide to {S}ledgehammer for {I}sabelle\slash {HOL}},
305 note = {\url{http://isabelle.in.tum.de/doc/sledgehammer.pdf}}
308 @inproceedings{blanchette-nipkow-2010,
309 title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder",
310 author = "Jasmin Christian Blanchette and Tobias Nipkow",
311 crossref = {itp2010}}
313 @unpublished{blanchette-et-al-wit,
314 author = {J. C. Blanchette and A. Popescu and D. Traytel},
315 title = {Witnessing (Co)datatypes},
317 note = {\url{http://www21.in.tum.de/~traytel/papers/witness/wit.pdf}}}
320 author = {Fran\c{c}ois Bobot and Jean-Christophe Filli\^atre and Claude March\'e and Andrei Paskevich},
321 title = {{Why3}: Shepherd Your Herd of Provers},
322 editor = "K. Rustan M. Leino and Micha\l{} Moskal",
323 booktitle = {Boogie 2011},
328 @inproceedings{alt-ergo,
329 author = {Fran\c{c}ois Bobot and Sylvain Conchon and Evelyne Contejean and St\'ephane Lescuyer},
330 title = {Implementing Polymorphism in {SMT} Solvers},
331 booktitle = {SMT '08},
336 editor = {Clark Barrett and Leonardo de Moura}}
338 % and Domagoj Babic and Amit Goel
340 @inproceedings{boehme-nipkow-2010,
341 author={Sascha B\"ohme and Tobias Nipkow},
342 title={Sledgehammer: Judgement Day},
343 booktitle={Automated Reasoning: IJCAR 2010},
344 editor={J. Giesl and R. H\"ahnle},
352 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
353 Overbeek and Mark Stickel and Lawrence Wos},
354 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
363 author = {Robert S. Boyer and J Strother Moore},
364 title = {A Computational Logic},
365 publisher = {Academic Press},
369 author = {Robert S. Boyer and J Strother Moore},
370 title = {A Computational Logic Handbook},
371 publisher = {Academic Press},
374 @inproceedings{satallax,
375 author = "Chad E. Brown",
376 title = "Reducing Higher-Order Theorem Proving to a Sequence of {SAT} Problems",
377 booktitle = {Automated Deduction --- CADE-23},
378 publisher = Springer,
382 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
386 author = {N. G. de Bruijn},
387 title = {Lambda Calculus Notation with Nameless Dummies,
388 a Tool for Automatic Formula Manipulation,
389 with Application to the {Church-Rosser Theorem}},
390 journal = {Indag. Math.},
395 @InProceedings{bulwahnKN07,
396 author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},
397 title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},
398 crossref = {tphols2007},
402 @InProceedings{bulwahn-et-al:2008:imperative,
403 author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},
404 title = {Imperative Functional Programming with {Isabelle/HOL}},
405 crossref = {tphols2008},
410 author = {M. Burrows and M. Abadi and R. M. Needham},
411 title = {A Logic of Authentication},
419 @PhdThesis{Chaieb-thesis,
420 author = {Amine Chaieb},
421 title = {Automated methods for formal proofs in simple arithmetics and algebra},
422 school = {Technische Universit\"at M\"unchen},
424 note = {\url{http://www4.in.tum.de/~chaieb/pubs/pdf/diss.pdf}}}
426 @InProceedings{Chaieb-Wenzel:2007,
427 author = {Amine Chaieb and Makarius Wenzel},
428 title = {Context aware Calculation and Deduction ---
429 Ring Equalities via {Gr\"obner Bases} in {Isabelle}},
430 booktitle = {Towards Mechanized Mathematical Assistants (CALCULEMUS 2007)},
431 editor = {Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger},
438 @TechReport{camilleri92,
439 author = {J. Camilleri and T. F. Melham},
440 title = {Reasoning with Inductively Defined Relations in the
441 {HOL} Theorem Prover},
448 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
449 title = {Artificial Intelligence Programming},
450 publisher = {Lawrence Erlbaum Associates},
454 author = "Alonzo Church",
455 title = "A Formulation of the Simple Theory of Types",
461 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
462 title="Model Checking",publisher=MIT,year=1999}
465 author = {Martin D. Coen},
466 title = {Interactive Program Derivation},
467 school = {University of Cambridge},
468 note = {Computer Laboratory Technical Report 272},
473 author = {R. L. Constable and others},
474 title = {Implementing Mathematics with the Nuprl Proof
476 publisher = Prentice,
481 @Book{davey-priestley,
482 author = {B. A. Davey and H. A. Priestley},
483 title = {Introduction to Lattices and Order},
488 author = {Keith J. Devlin},
489 title = {Fundamentals of Contemporary Set Theory},
490 publisher = {Springer},
494 author = {Michael Dummett},
495 title = {Elements of Intuitionism},
497 publisher = {Oxford University Press}}
500 author = {Bruno Dutertre and Leonardo de Moura},
501 title = {The {Yices} {SMT} Solver},
502 howpublished = "\url{http://yices.csl.sri.com/tool-paper.pdf}",
505 @incollection{dybjer91,
506 author = {Peter Dybjer},
507 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
508 Theory and Their Set-Theoretic Semantics},
509 crossref = {huet-plotkin91},
513 author = {Roy Dyckhoff},
514 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
524 author = {William M. Farmer and Joshua D. Guttman and F. Javier
526 title = {{IMPS}: An Interactive Mathematical Proof System},
533 @InProceedings{felty91a,
534 Author = {Amy Felty},
535 Title = {A Logic Program for Transforming Sequent Proofs to Natural
537 crossref = {extensions91},
540 @Article{fleuriot-jcm,
541 author = {Jacques Fleuriot and Lawrence C. Paulson},
542 title = {Mechanizing Nonstandard Real Analysis},
543 journal = {LMS Journal of Computation and Mathematics},
547 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
551 author = {Jacob Frost},
552 title = {A Case Study of Co-induction in {Isabelle HOL}},
558 %revised version of frost93
560 author = {Jacob Frost},
561 title = {A Case Study of Co-induction in {Isabelle}},
568 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
570 title = {Principles of {OBJ2}},
578 author = {J. H. Gallier},
579 title = {Logic for Computer Science:
580 Foundations of Automatic Theorem Proving},
582 publisher = {Harper \& Row}}
585 author = {Antony Galton},
586 title = {Logic for Information Technology},
590 @Article{Gentzen:1935,
591 author = {G. Gentzen},
592 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
593 journal = {Math. Zeitschrift},
597 @InProceedings{gimenez-codifying,
598 author = {Eduardo Gim{\'e}nez},
599 title = {Codifying Guarded Definitions with Recursive Schemes},
600 crossref = {types94},
605 author = {Jean-Yves Girard},
606 title = {Proofs and Types},
609 note = {Translated by Yves LaFont and Paul Taylor}}
612 editor = {M. J. C. Gordon and T. F. Melham},
613 title = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
618 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
620 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
622 publisher = {Springer},
625 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
626 title={Why we can't have {SML} style datatype declarations in {HOL}},
627 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
628 IFIP TC10/WG10.2 Intl. Workshop, 1992},
629 editor={L.J.M. Claesen and M.J.C. Gordon},
630 publisher=NH,year=1993,pages={561--568}}
632 @InProceedings{gunter-trees,
633 author = {Elsa L. Gunter},
634 title = {A Broader Class of Trees for Recursive Type Definitions for
641 @inproceedings{Haftmann-Kraus-Kuncar-Nipkow:2013:data_refinement,
642 author = {Florian Haftmann and Alexander Krauss and Ond\v{r}ej Kun\v{c}ar and Tobias Nipkow},
643 title = {Data Refinement in Isabelle/HOL},
644 booktitle = {Interactive Theorem Proving (ITP 2013)},
647 publisher = Springer,
648 series = {Lecture Notes in Computer Science},
650 editor = {S. Blazy and C. Paulin-Mohring and D. Pichardie}
653 @inproceedings{Haftmann-Nipkow:2010:code,
654 author = {Florian Haftmann and Tobias Nipkow},
655 title = {Code Generation via Higher-Order Rewrite Systems},
656 booktitle = {Functional and Logic Programming: 10th International Symposium: FLOPS 2010},
658 publisher = Springer,
660 editor = {Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal},
664 @InProceedings{Haftmann-Wenzel:2006:classes,
665 author = {Florian Haftmann and Makarius Wenzel},
666 title = {Constructive Type Classes in {Isabelle}},
667 editor = {T. Altenkirch and C. McBride},
668 booktitle = {Types for Proofs and Programs, TYPES 2006},
669 publisher = {Springer},
675 @InProceedings{Haftmann-Wenzel:2009,
676 author = {Florian Haftmann and Makarius Wenzel},
677 title = {Local theory specifications in {Isabelle/Isar}},
678 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
679 booktitle = {Types for Proofs and Programs, TYPES 2008},
680 publisher = {Springer},
686 @inproceedings{hindleymilner,
687 author = {L. Damas and H. Milner},
688 title = {Principal type schemes for functional programs},
689 booktitle = {ACM Symp. Principles of Programming Languages},
693 @manual{isabelle-classes,
694 author = {Florian Haftmann},
695 title = {Haskell-style type classes with {Isabelle}/{Isar}},
697 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
700 @manual{isabelle-codegen,
701 author = {Florian Haftmann},
702 title = {Code generation from Isabelle theories},
704 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
708 author = {Paul R. Halmos},
709 title = {Naive Set Theory},
710 publisher = {Van Nostrand},
713 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
714 title={Dynamic Logic},publisher=MIT,year=2000}
717 author = {Matthew Hennessy},
718 title = {The Semantics of Programming Languages: An Elementary
719 Introduction Using Structural Operational Semantics},
723 @article{waldmeister,
724 author = {Thomas Hillenbrand and Arnim Buch and Rolan Vogt and Bernd L\"ochner},
725 title = "Waldmeister: High-Performance Equational Deduction",
732 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
733 title={Introduction to Automata Theory, Languages, and Computation.},
734 publisher={Addison-Wesley},year=1979}
736 @Article{haskell-report,
737 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
738 title = {Report on the Programming Language {Haskell}: A
739 Non-strict, Purely Functional Language},
745 note = {Version 1.2}}
747 @Article{haskell-tutorial,
748 author = {Paul Hudak and Joseph H. Fasel},
749 title = {A Gentle Introduction to {Haskell}},
757 author = "Kry\v{s}tof Hoder and Andrei Voronkov",
758 title = "Sine Qua Non for Large Theory Reasoning",
759 booktitle = {Automated Deduction --- CADE-23},
760 publisher = Springer,
764 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
767 @book{Hudak-Haskell,author={Paul Hudak},
768 title={The Haskell School of Expression},publisher=CUP,year=2000}
771 author = {G. P. Huet},
772 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
779 author = {G. P. Huet and B. Lang},
780 title = {Proving and Applying Program Transformations Expressed with
781 Second-Order Patterns},
787 @inproceedings{huet88,
788 author = {G{\'e}rard Huet},
789 title = {Induction Principles Formalized in the {Calculus of
791 booktitle = {Programming of Future Generation Computers},
792 editor = {K. Fuchi and M. Nivat},
795 publisher = {Elsevier}}
797 @inproceedings{Huffman-Kuncar:2013:lifting_transfer,
798 author = {Brian Huffman and Ond\v{r}ej Kun\v{c}ar},
799 title = {{Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL}},
800 booktitle = {Certified Programs and Proofs (CPP 2013)},
802 publisher = Springer,
803 series = {Lecture Notes in Computer Science},
807 @Book{Huth-Ryan-book,
808 author = {Michael Huth and Mark Ryan},
809 title = {Logic in Computer Science. Modelling and reasoning about systems},
813 @InProceedings{Harrison:1996:MizarHOL,
814 author = {J. Harrison},
815 title = {A {Mizar} Mode for {HOL}},
817 crossref = {tphols96}}
821 title = "Metis Theorem Prover",
822 note = "\url{http://www.gilith.com/software/metis/}"}
826 @article{haskell-revised-report,
827 author = {Simon {Peyton Jones} and others},
828 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
829 journal = {Journal of Functional Programming},
835 note = {\url{http://www.haskell.org/definition/}}}
838 author = "Daniel Jackson",
839 title = "Software Abstractions: Logic, Language, and Analysis",
845 @InProceedings{kammueller-locales,
846 author = {Florian Kamm{\"u}ller and Markus Wenzel and
847 Lawrence C. Paulson},
848 title = {Locales: A Sectioning Concept for {Isabelle}},
849 crossref = {tphols99}}
852 author={Donald E. Knuth},
853 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
854 publisher={Addison-Wesley},
858 author = {R. E. Korf},
859 title = {Depth-First Iterative-Deepening: an Optimal Admissible
866 @inproceedings{korovin-2009,
867 title = "Instantiation-Based Automated Reasoning: From Theory to Practice",
868 author = "Konstantin Korovin",
869 editor = "Renate A. Schmidt",
870 booktitle = {Automated Deduction --- CADE-22},
875 publisher = "Springer"}
877 @inproceedings{korovin-sticksel-2010,
878 author = {Konstantin Korovin and
880 title = {{iP}rover-{E}q: An Instantiation-Based Theorem Prover with Equality},
882 booktitle={Automated Reasoning: IJCAR 2010},
883 editor={J. Giesl and R. H\"ahnle},
884 publisher = Springer,
889 @InProceedings{krauss2006,
890 author = {Alexander Krauss},
891 title = {Partial Recursive Functions in {Higher-Order Logic}},
892 crossref = {ijcar2006},
895 @PhdThesis{krauss_phd,
896 author = {Alexander Krauss},
897 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
898 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
903 @manual{isabelle-function,
904 author = {Alexander Krauss},
905 title = {Defining Recursive Functions in {Isabelle/HOL}},
907 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
911 author = {Kenneth Kunen},
912 title = {Set Theory: An Introduction to Independence Proofs},
919 author = {Xavier Leroy and others},
920 title = {The Objective Caml system -- Documentation and user's manual},
921 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
924 author = "Fredrik Lindblad",
926 note = "\url{https://github.com/frelindb/agsyHOL}"}
928 @incollection{lochbihler-2010,
929 title = "Coinductive",
930 author = "Andreas Lochbihler",
931 booktitle = "The Archive of Formal Proofs",
932 editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
933 publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",
938 author = "D. W. Loveland",
939 title = "Automated Theorem Proving: A Logical Basis",
941 publisher = "North-Holland Publishing Co."}
943 @InProceedings{lowe-fdr,
944 author = {Gavin Lowe},
945 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
946 Protocol using {CSP} and {FDR}},
947 booktitle = {Tools and Algorithms for the Construction and Analysis
948 of Systems: second international workshop, TACAS '96},
949 editor = {T. Margaria and B. Steffen},
950 series = {LNCS 1055},
952 publisher = {Springer},
958 author = {Zohar Manna and Richard Waldinger},
959 title = {Deductive Synthesis of the Unification Algorithm},
966 @InProceedings{martin-nipkow,
967 author = {Ursula Martin and Tobias Nipkow},
968 title = {Ordered Rewriting and Confluence},
973 author = {Per Martin-L{\"o}f},
974 title = {Intuitionistic type theory},
976 publisher = {Bibliopolis}}
978 @incollection{melham89,
979 author = {Thomas F. Melham},
980 title = {Automating Recursive Type Definitions in Higher Order
983 crossref = {birtwistle89}}
985 @Article{Miller:1991,
986 author = {Dale Miller},
987 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
988 and Simple Unification},
989 journal = {Journal of Logic and Computation},
995 @Article{miller-mixed,
996 Author = {Dale Miller},
997 Title = {Unification Under a Mixed Prefix},
1005 author = {Robin Milner},
1006 title = {A Theory of Type Polymorphism in Programming},
1007 journal = "J. Comp.\ Sys.\ Sci.",
1012 @TechReport{milner-ind,
1013 author = {Robin Milner},
1014 title = {How to Derive Inductions in {LCF}},
1015 institution = Edinburgh,
1019 @Article{milner-coind,
1020 author = {Robin Milner and Mads Tofte},
1021 title = {Co-induction in Relational Semantics},
1028 author = {Robin Milner},
1029 title = {Communication and Concurrency},
1030 publisher = Prentice,
1033 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
1034 title="The Definition of Standard ML",publisher=MIT,year=1990}
1036 @PhdThesis{monahan84,
1037 author = {Brian Q. Monahan},
1038 title = {Data Type Proofs using Edinburgh {LCF}},
1039 school = {University of Edinburgh},
1042 @article{MuellerNvOS99,
1044 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
1045 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
1047 @Manual{Muzalewski:Mizar,
1048 title = {An Outline of {PC} {Mizar}},
1049 author = {Micha{\l} Muzalewski},
1050 organization = {Fondation of Logic, Mathematics and Informatics
1051 --- Mizar Users Group},
1053 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
1058 @InProceedings{NaraschewskiW-TPHOLs98,
1059 author = {Wolfgang Naraschewski and Markus Wenzel},
1061 {Object-Oriented Verification based on Record Subtyping in
1062 Higher-Order Logic},
1063 crossref = {tphols98}}
1065 @inproceedings{nazareth-nipkow,
1066 author = {Dieter Nazareth and Tobias Nipkow},
1067 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
1068 crossref = {tphols96},
1072 @Article{needham-schroeder,
1073 author = "Roger M. Needham and Michael D. Schroeder",
1074 title = "Using Encryption for Authentication in Large Networks
1083 @inproceedings{nipkow-W,
1084 author = {Wolfgang Naraschewski and Tobias Nipkow},
1085 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
1086 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
1087 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
1088 publisher = Springer,
1094 @InCollection{nipkow-sorts93,
1095 author = {T. Nipkow},
1096 title = {Order-Sorted Polymorphism in {Isabelle}},
1097 booktitle = {Logical Environments},
1100 editor = {G. Huet and G. Plotkin},
1104 @Misc{nipkow-types93,
1105 author = {Tobias Nipkow},
1106 title = {Axiomatic Type Classes (in {I}sabelle)},
1107 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
1111 @inproceedings{Nipkow-CR,
1112 author = {Tobias Nipkow},
1113 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
1114 booktitle = {Automated Deduction --- CADE-13},
1115 editor = {M. McRobbie and J.K. Slaney},
1116 publisher = Springer,
1122 % WAS Nipkow-LICS-93
1123 @InProceedings{nipkow-patterns,
1124 title = {Functional Unification of Higher-Order Patterns},
1125 author = {Tobias Nipkow},
1128 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
1129 keywords = {unification}}
1131 @article{nipkow-IMP,
1132 author = {Tobias Nipkow},
1133 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
1139 @inproceedings{Nipkow-TYPES02,
1140 author = {Tobias Nipkow},
1141 title = {{Structured Proofs in Isar/HOL}},
1142 booktitle = {Types for Proofs and Programs (TYPES 2002)},
1143 editor = {H. Geuvers and F. Wiedijk},
1145 publisher = Springer,
1150 @manual{isabelle-HOL,
1151 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1152 title = {{Isabelle}'s Logics: {HOL}},
1153 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
1154 M{\"u}nchen and Computer Laboratory, University of Cambridge},
1155 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
1157 @article{nipkow-prehofer,
1158 author = {Tobias Nipkow and Christian Prehofer},
1159 title = {Type Reconstruction for Type Classes},
1166 @InProceedings{Nipkow-Prehofer:1993,
1167 author = {T. Nipkow and C. Prehofer},
1168 title = {Type checking type classes},
1169 booktitle = {ACM Symp.\ Principles of Programming Languages},
1174 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1175 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
1176 publisher = Springer,
1182 author = {Philippe No{\"e}l},
1183 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
1191 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
1192 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
1194 publisher = {Oxford University Press},
1199 @TechReport{scala-overview-tech-report,
1200 author = {Martin Odersky and al.},
1201 title = {An Overview of the Scala Programming Language},
1202 institution = {EPFL Lausanne, Switzerland},
1204 number = {IC/2004/64}
1207 @Article{Oppen:1980,
1208 author = {D. C. Oppen},
1209 title = {Pretty Printing},
1210 journal = {ACM Transactions on Programming Languages and Systems},
1215 @Manual{pvs-language,
1216 title = {The {PVS} specification language},
1217 author = {S. Owre and N. Shankar and J. M. Rushby},
1218 organization = {Computer Science Laboratory, SRI International},
1219 address = {Menlo Park, CA},
1220 note = {Beta release},
1223 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
1228 @InProceedings{paulin-tlca,
1229 author = {Christine Paulin-Mohring},
1230 title = {Inductive Definitions in the System {Coq}: Rules and
1232 crossref = {tlca93},
1235 @Article{paulson:1983,
1236 author = {L. C. Paulson},
1237 title = {A higher-order implementation of rewriting},
1238 journal = {Science of Computer Programming},
1242 note = {\url{http://www.cl.cam.ac.uk/~lp15/papers/Reports/TR035-lcp-rewriting.pdf}}}
1244 @InProceedings{paulson-CADE,
1245 author = {Lawrence C. Paulson},
1246 title = {A Fixedpoint Approach to Implementing (Co)Inductive
1249 crossref = {cade12}}
1251 @InProceedings{paulson-COLOG,
1252 author = {Lawrence C. Paulson},
1253 title = {A Formulation of the Simple Theory of Types (for
1256 crossref = {colog88},
1257 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
1259 @Article{paulson-coind,
1260 author = {Lawrence C. Paulson},
1261 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1270 @manual{isabelle-intro,
1271 author = {Lawrence C. Paulson},
1272 title = {Old Introduction to {Isabelle}},
1274 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1276 @manual{isabelle-logics,
1277 author = {Lawrence C. Paulson},
1278 title = {{Isabelle's} Logics},
1280 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1282 @manual{isabelle-ref,
1283 author = {Lawrence C. Paulson},
1284 title = {The Old {Isabelle} Reference Manual},
1286 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1288 @manual{isabelle-ZF,
1289 author = {Lawrence C. Paulson},
1290 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1292 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1294 @article{paulson-found,
1295 author = {Lawrence C. Paulson},
1296 title = {The Foundation of a Generic Theorem Prover},
1302 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1304 %replaces paulson-final
1305 @Article{paulson-mscs,
1306 author = {Lawrence C. Paulson},
1307 title = {Final Coalgebras as Greatest Fixed Points
1308 in {ZF} Set Theory},
1309 journal = {Mathematical Structures in Computer Science},
1315 @InCollection{paulson-generic,
1316 author = {Lawrence C. Paulson},
1317 title = {Generic Automatic Proof Tools},
1318 crossref = {wos-fest},
1321 @Article{paulson-gr,
1322 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1323 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1332 @InCollection{paulson-fixedpt-milner,
1333 author = {Lawrence C. Paulson},
1334 title = {A Fixedpoint Approach to (Co)inductive and
1335 (Co)datatype Definitions},
1337 crossref = {milner-fest}}
1340 title = {Proof, Language, and Interaction:
1341 Essays in Honor of {Robin Milner}},
1342 booktitle = {Proof, Language, and Interaction:
1343 Essays in Honor of {Robin Milner}},
1346 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1348 @InCollection{paulson-handbook,
1349 author = {Lawrence C. Paulson},
1350 title = {Designing a Theorem Prover},
1351 crossref = {handbk-lics2},
1354 @Book{paulson-isa-book,
1355 author = {Lawrence C. Paulson},
1356 title = {Isabelle: A Generic Theorem Prover},
1357 publisher = {Springer},
1361 @Book{isabelle-hol-book,
1362 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1363 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1364 publisher = {Springer},
1368 @InCollection{paulson-markt,
1369 author = {Lawrence C. Paulson},
1370 title = {Tool Support for Logics of Programs},
1371 booktitle = {Mathematical Methods in Program Development:
1372 Summer School Marktoberdorf 1996},
1373 publisher = {Springer},
1375 year = {Published 1997},
1376 editor = {Manfred Broy},
1377 series = {NATO ASI Series F}}
1379 %replaces Paulson-ML and paulson91
1381 author = {Lawrence C. Paulson},
1382 title = {{ML} for the Working Programmer},
1387 @article{paulson-natural,
1388 author = {Lawrence C. Paulson},
1389 title = {Natural Deduction as Higher-order Resolution},
1394 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1396 @Article{paulson-set-I,
1397 author = {Lawrence C. Paulson},
1398 title = {Set Theory for Verification: {I}. {From}
1399 Foundations to Functions},
1405 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1407 @Article{paulson-set-II,
1408 author = {Lawrence C. Paulson},
1409 title = {Set Theory for Verification: {II}. {Induction} and
1416 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1419 author = {Lawrence C. Paulson},
1420 title = {Verifying the Unification Algorithm in {LCF}},
1426 %replaces Paulson-LCF
1428 author = {Lawrence C. Paulson},
1429 title = {Logic and Computation: Interactive proof with Cambridge
1434 @incollection{paulson700,
1435 author = {Lawrence C. Paulson},
1436 title = {{Isabelle}: The Next 700 Theorem Provers},
1437 crossref = {odifreddi90},
1439 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1441 % replaces paulson-ns and paulson-security
1442 @Article{paulson-jcs,
1443 author = {Lawrence C. Paulson},
1444 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1450 @Article{paulson-tls,
1451 author = {Lawrence C. Paulson},
1452 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1460 @Article{paulson-yahalom,
1461 author = {Lawrence C. Paulson},
1462 title = {Relations Between Secrets:
1463 Two Formal Analyses of the {Yahalom} Protocol},
1470 @article{pelletier86,
1471 author = {F. J. Pelletier},
1472 title = {Seventy-five Problems for Testing Automatic Theorem
1478 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1480 @InCollection{pitts93,
1481 author = {A. Pitts},
1482 title = {The {HOL} Logic},
1483 editor = {M. J. C. Gordon and T. F. Melham},
1484 booktitle = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
1490 author = {Andrew M. Pitts},
1491 title = {A Co-induction Principle for Recursively Defined Domains},
1497 @Article{plaisted90,
1498 author = {David A. Plaisted},
1499 title = {A Sequent-Style Model Elimination Strategy and a Positive
1510 author = {Art Quaife},
1511 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1521 @TechReport{rasmussen95,
1522 author = {Ole Rasmussen},
1523 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1525 institution = {Computer Laboratory, University of Cambridge},
1529 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1532 author = {Steve Reeves and Michael Clarke},
1533 title = {Logic for Computer Science},
1534 publisher = {Addison-Wesley},
1537 @article{riazanov-voronkov-2002,
1538 author = "Alexander Riazanov and Andrei Voronkov",
1539 title = "The Design and Implementation of {Vampire}",
1540 journal = "Journal of AI Communications",
1546 @book{Rosen-DMA,author={Kenneth H. Rosen},
1547 title={Discrete Mathematics and Its Applications},
1548 publisher={McGraw-Hill},year=1998}
1550 @InProceedings{Rudnicki:1992:MizarOverview,
1551 author = {P. Rudnicki},
1552 title = {An Overview of the {MIZAR} Project},
1553 booktitle = {1992 Workshop on Types for Proofs and Programs},
1555 organization = {Chalmers University of Technology},
1556 publisher = {Bastad}
1561 @inproceedings{saaltink-fme,
1562 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1563 Dan Craigen and Irwin Meisels},
1564 title = {An {EVES} Data Abstraction Example},
1568 @Article{Schroeder-Heister:1984,
1569 author = {Peter Schroeder-Heister},
1570 title = {A Natural Extension of Natural Deduction},
1571 journal = {Journal of Symbolic Logic},
1577 @article{schulz-2002,
1578 author = "Stephan Schulz",
1579 title = "E---A Brainiac Theorem Prover",
1580 journal = "Journal of AI Communications",
1586 @inproceedings{slind-tfl,
1587 author = {Konrad Slind},
1588 title = {Function Definition in Higher Order Logic},
1589 crossref = {tphols96},
1592 @inproceedings{snark,
1593 author = {M. Stickel and R. Waldinger and M. Lowry and T. Pressburger and I. Underwood},
1594 title = {Deductive composition of astronomical software from subroutine libraries},
1596 crossref = {cade12}}
1599 author = {Patrick Suppes},
1600 title = {Axiomatic Set Theory},
1602 publisher = {Dover}}
1604 @inproceedings{sutcliffe-2000,
1605 author = "Geoff Sutcliffe",
1606 title = "System Description: {SystemOnTPTP}",
1607 editor = "David McAllester",
1608 booktitle = {Automated Deduction --- {CADE}-17 International Conference},
1609 series = "Lecture Notes in Artificial Intelligence",
1613 publisher = Springer}
1616 author = "Geoff Sutcliffe",
1618 note = "\url{http://www.cs.miami.edu/~tptp/ATPSystems/ToFoF/}"}
1620 @Article{Sutter:2005,
1621 author = {H. Sutter},
1622 title = {The Free Lunch Is Over --- A Fundamental Turn Toward Concurrency in Software},
1623 journal = {Dr. Dobb's Journal},
1628 @InCollection{szasz93,
1629 author = {Nora Szasz},
1630 title = {A Machine Checked Proof that {Ackermann's} Function is not
1631 Primitive Recursive},
1632 crossref = {huet-plotkin93},
1635 @TechReport{Syme:1997:DECLARE,
1637 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1638 institution = {University of Cambridge Computer Laboratory},
1643 @PhdThesis{Syme:1998:thesis,
1645 title = {Declarative Theorem Proving for Operational Semantics},
1646 school = {University of Cambridge},
1651 @InProceedings{Syme:1999:TPHOL,
1653 title = {Three Tactic Theorem Proving},
1654 crossref = {tphols99}}
1659 author = {G. Takeuti},
1660 title = {Proof Theory},
1666 author = {Simon Thompson},
1667 title = {Type Theory and Functional Programming},
1668 publisher = {Addison-Wesley},
1671 @book{Thompson-Haskell,author={Simon Thompson},
1672 title={Haskell: The Craft of Functional Programming},
1673 publisher={Addison-Wesley},year=1999}
1676 author = "Emina Torlak",
1677 title = {Kodkod: Constraint Solver for Relational Logic},
1678 note = "\url{http://alloy.mit.edu/kodkod/}"}
1680 @misc{kodkod-2009-options,
1681 author = "Emina Torlak",
1682 title = "Kodkod {API}: Class {Options}",
1683 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1685 @inproceedings{torlak-jackson-2007,
1686 title = "Kodkod: A Relational Model Finder",
1687 author = "Emina Torlak and Daniel Jackson",
1688 editor = "Orna Grumberg and Michael Huth",
1689 booktitle = "TACAS 2007",
1694 publisher = Springer}
1696 @inproceedings{traytel-berghofer-nipkow-2011,
1697 author = {Dmitriy Traytel and Stefan Berghofer and Tobias Nipkow},
1698 title = {{Extending Hindley-Milner Type Inference with Coercive Structural Subtyping}},
1700 editor = {Hongseok Yang},
1701 booktitle = "APLAS 2011",
1706 @inproceedings{traytel-et-al-2012,
1707 author = "Dmitriy Traytel and Andrei Popescu and Jasmin Christian Blanchette",
1708 title = {Foundational, Compositional (Co)datatypes for Higher-Order
1709 Logic---{C}ategory Theory Applied to Theorem Proving},
1712 booktitle = {LICS 2012},
1716 @Unpublished{Trybulec:1993:MizarFeatures,
1717 author = {A. Trybulec},
1718 title = {Some Features of the {Mizar} Language},
1719 note = {Presented at a workshop in Turin, Italy},
1725 @Unpublished{voelker94,
1726 author = {Norbert V{\"o}lker},
1727 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1728 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1734 @inproceedings{wadler89how,
1735 author = {P. Wadler and S. Blott},
1736 title = {How to make ad-hoc polymorphism less ad-hoc},
1737 booktitle = {ACM Symp.\ Principles of Programming Languages},
1741 @phdthesis{weber-2008,
1742 author = "Tjark Weber",
1743 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1744 school = {Dept.\ of Informatics, T.U. M\"unchen},
1745 type = "{Ph.D.}\ thesis",
1749 author = {Christoph Wedler},
1750 title = {Emacs package ``{X-Symbol}''},
1751 note = {\url{http://x-symbol.sourceforge.net}}
1754 @misc{weidenbach-et-al-2009,
1755 author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski",
1756 title = "{SPASS} Version 3.5",
1757 note = {\url{http://www.spass-prover.org/publications/spass.pdf}}}
1759 @manual{isabelle-sys,
1760 author = {Markus Wenzel and Stefan Berghofer},
1761 title = {The {Isabelle} System Manual},
1762 institution = {TU Munich},
1763 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1765 @manual{isabelle-isar-ref,
1766 author = {Makarius Wenzel},
1767 title = {The {Isabelle/Isar} Reference Manual},
1768 institution = {TU Munich},
1769 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1771 @manual{isabelle-implementation,
1772 author = {Makarius Wenzel},
1773 title = {The {Isabelle/Isar} Implementation},
1774 institution = {TU Munich},
1775 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1777 @InProceedings{Wenzel:1999:TPHOL,
1778 author = {Markus Wenzel},
1779 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1780 crossref = {tphols99}}
1782 @InProceedings{Wenzel:1997:TPHOL,
1783 author = {Markus Wenzel},
1784 title = {Type Classes and Overloading in Higher-Order Logic},
1785 crossref = {tphols97}}
1787 @phdthesis{Wenzel-PhD,
1788 author={Markus Wenzel},
1789 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1790 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1792 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1794 @Article{Wenzel-Wiedijk:2002,
1795 author = {Freek Wiedijk and Markus Wenzel},
1796 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1797 journal = {Journal of Automated Reasoning},
1803 @InCollection{Wenzel-Paulson:2006,
1804 author = {Markus Wenzel and Lawrence C. Paulson},
1805 title = {{Isabelle/Isar}},
1806 booktitle = {The Seventeen Provers of the World},
1808 editor = {F. Wiedijk},
1809 series = {LNAI 3600}
1812 @InCollection{Wenzel:2006:Festschrift,
1813 author = {Makarius Wenzel},
1814 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1815 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1816 publisher = {University of Bia{\l}ystok},
1818 editor = {R. Matuszewski and A. Zalewska},
1820 series = {Studies in Logic, Grammar, and Rhetoric},
1821 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1824 @InProceedings{Wenzel-Chaieb:2007b,
1825 author = {Makarius Wenzel and Amine Chaieb},
1826 title = {{SML} with antiquotations embedded into {Isabelle/Isar}},
1827 booktitle = {Workshop on Programming Languages for Mechanized Mathematics
1828 (satellite of CALCULEMUS 2007). Hagenberg, Austria},
1829 editor = {Jacques Carette and Freek Wiedijk},
1834 @InProceedings{Wenzel:2009,
1835 author = {M. Wenzel},
1836 title = {Parallel Proof Checking in {Isabelle/Isar}},
1837 booktitle = {ACM SIGSAM Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009)},
1839 editor = {Dos Reis, G. and L. Th\'ery},
1840 publisher = {ACM Digital Library}}
1842 @InProceedings{Wenzel:2010,
1843 author = {Makarius Wenzel},
1844 title = {Asynchronous Proof Processing with {Isabelle/Scala} and {Isabelle/jEdit}},
1845 booktitle = {User Interfaces for Theorem Provers (UITP 2010), FLOC 2010 Satellite Workshop},
1847 editor = {C. Sacerdoti Coen and D. Aspinall},
1850 publisher = {Elsevier},
1851 url = {http://www.lri.fr/~wenzel/papers/async-isabelle-scala.pdf}}
1853 @InProceedings{Wenzel:2011:CICM,
1854 author = {M. Wenzel},
1855 title = {Isabelle as Document-oriented Proof Assistant},
1856 editor = {J. H. Davenport and W. M. Farmer and F. Rabe and J. Urban},
1857 booktitle = {Conference on Intelligent Computer Mathematics / Mathematical Knowledge Management (CICM/MKM 2011)},
1861 publisher = {Springer}}
1863 @InProceedings{Wenzel:2012,
1864 author = {Makarius Wenzel},
1865 title = {{Isabelle/jEdit} --- a {Prover IDE} within the {PIDE} framework},
1866 booktitle = {Conference on Intelligent Computer Mathematics (CICM 2012)},
1868 editor = {J. Jeuring and others},
1871 publisher = {Springer}}
1873 @InProceedings{Wenzel:2012:UITP-EPTCS,
1874 author = {Makarius Wenzel},
1875 title = {{READ-EVAL-PRINT} in Parallel and Asynchronous Proof-checking},
1876 booktitle = {User Interfaces for Theorem Provers (UITP 2012)},
1881 @inproceedings{Wenzel:2013:ITP,
1882 author = {Makarius Wenzel},
1883 title = {Shared-Memory Multiprocessing for Interactive Theorem Proving},
1884 booktitle = {Interactive Theorem Proving - 4th International Conference,
1885 ITP 2013, Rennes, France, July 22-26, 2013. Proceedings},
1886 editor = {Sandrine Blazy and
1887 Christine Paulin-Mohring and
1890 ee = {http://dx.doi.org/10.1007/978-3-642-39634-2_30},
1891 publisher = {Springer},
1892 series = {Lecture Notes in Computer Science},
1897 author = {A. N. Whitehead and B. Russell},
1898 title = {Principia Mathematica},
1901 note = {Paperback edition to *56,
1902 abridged from the 2nd edition (1927)}}
1904 @Misc{Wiedijk:1999:Mizar,
1905 author = {Freek Wiedijk},
1906 title = {Mizar: An Impression},
1907 howpublished = {Unpublished paper},
1909 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1912 @Misc{Wiedijk:2000:MV,
1913 author = {Freek Wiedijk},
1914 title = {The Mathematical Vernacular},
1915 howpublished = {Unpublished paper},
1917 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1920 @misc{wikipedia-2009-aa-trees,
1922 title = "Wikipedia: {AA} Tree",
1923 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
1926 author = {Glynn Winskel},
1927 title = {The Formal Semantics of Programming Languages},
1928 publisher = MIT,year=1993}
1930 @InCollection{wos-bledsoe,
1931 author = {Larry Wos},
1932 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1933 crossref = {bledsoe-fest},
1936 @InProceedings{Zammit:1999:TPHOL,
1937 author = {Vincent Zammit},
1938 title = {On the Implementation of an Extensible Declarative Proof Language},
1939 crossref = {tphols99}}
1945 title = "Z3: An Efficient {SMT} Solver",
1946 note = "\url{http://research.microsoft.com/en-us/um/redmond/projects/z3/}"}
1952 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1953 title = {Handbook of Logic in Computer Science},
1954 booktitle = {Handbook of Logic in Computer Science},
1955 publisher = {Oxford University Press},
1960 editor = {Henk Barendregt and Tobias Nipkow},
1961 title = TYPES # {: International Workshop {TYPES '93}},
1962 booktitle = TYPES # {: International Workshop {TYPES '93}},
1963 year = {published 1994},
1964 publisher = {Springer},
1965 series = {LNCS 806}}
1967 @book{barwise-handbk,
1968 editor = {J. Barwise},
1969 title = {Handbook of Mathematical Logic},
1970 booktitle = {Handbook of Mathematical Logic},
1974 @Proceedings{tlca93,
1975 title = {Typed Lambda Calculi and Applications},
1976 booktitle = {Typed Lambda Calculi and Applications},
1977 editor = {M. Bezem and J.F. Groote},
1979 publisher = {Springer},
1980 series = {LNCS 664}}
1983 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1984 title = {Current Trends in Hardware Verification and Automated
1986 booktitle = {Current Trends in Hardware Verification and Automated
1988 publisher = {Springer},
1992 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1993 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1994 publisher = {Kluwer Academic Publishers},
1996 editor = {Robert S. Boyer}}
1998 @Proceedings{cade12,
1999 editor = {Alan Bundy},
2000 title = {Automated Deduction --- {CADE}-12
2001 International Conference},
2002 booktitle = {Automated Deduction --- {CADE}-12
2003 International Conference},
2005 series = {LNAI 814},
2006 publisher = {Springer}}
2009 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
2010 title = TYPES # {: International Workshop {TYPES '94}},
2011 booktitle = TYPES # {: International Workshop {TYPES '94}},
2013 publisher = {Springer},
2014 series = {LNCS 996}}
2016 @book{huet-plotkin91,
2017 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
2018 title = {Logical Frameworks},
2019 booktitle = {Logical Frameworks},
2023 @book{huet-plotkin93,
2024 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
2025 title = {Logical Environments},
2026 booktitle = {Logical Environments},
2031 editor = {J. Joyce and C. Seger},
2032 title = {Higher Order Logic Theorem Proving and Its
2033 Applications: HUG '93},
2034 booktitle = {Higher Order Logic Theorem Proving and Its
2035 Applications: HUG '93},
2036 year = {Published 1994},
2037 publisher = {Springer},
2038 series = {LNCS 780}}
2040 @proceedings{colog88,
2041 editor = {P. Martin-L{\"o}f and G. Mints},
2042 title = {COLOG-88: International Conference on Computer Logic},
2043 booktitle = {COLOG-88: International Conference on Computer Logic},
2044 year = {Published 1990},
2045 publisher = {Springer},
2046 organization = {Estonian Academy of Sciences},
2047 address = {Tallinn},
2048 series = {LNCS 417}}
2051 editor = {P. Odifreddi},
2052 title = {Logic and Computer Science},
2053 booktitle = {Logic and Computer Science},
2054 publisher = {Academic Press},
2057 @proceedings{extensions91,
2058 editor = {Peter Schroeder-Heister},
2059 title = {Extensions of Logic Programming},
2060 booktitle = {Extensions of Logic Programming},
2062 series = {LNAI 475},
2063 publisher = {Springer}}
2065 @proceedings{cade10,
2066 editor = {Mark E. Stickel},
2067 title = {10th } # CADE,
2068 booktitle = {10th } # CADE,
2070 publisher = {Springer},
2071 series = {LNAI 449}}
2074 editor = {M. Vardi},
2075 title = {Eighth Annual Symposium on Logic in Computer Science},
2076 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
2081 title = {Automated Reasoning and its Applications:
2082 Essays in Honor of {Larry Wos}},
2083 booktitle = {Automated Reasoning and its Applications:
2084 Essays in Honor of {Larry Wos}},
2087 editor = {Robert Veroff}}
2090 editor = {J. C. P. Woodcock and P. G. Larsen},
2091 title = {FME '93: Industrial-Strength Formal Methods},
2092 booktitle = {FME '93: Industrial-Strength Formal Methods},
2094 publisher = Springer,
2098 @Proceedings{tphols96,
2099 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
2100 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
2101 editor = {J. von Wright and J. Grundy and J. Harrison},
2102 publisher = Springer,
2107 @Proceedings{tphols97,
2108 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
2109 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
2110 editor = {Elsa L. Gunter and Amy Felty},
2111 publisher = Springer,
2116 @Proceedings{tphols98,
2117 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2118 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2119 editor = {Jim Grundy and Malcom Newey},
2120 publisher = Springer,
2125 @Proceedings{tphols99,
2126 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2127 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2128 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
2129 Paulin, C. and Thery, L.},
2130 publisher = Springer,
2135 @Proceedings{tphols2000,
2136 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2137 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2138 editor = {J. Harrison and M. Aagaard},
2139 publisher = Springer,
2144 @Proceedings{tphols2001,
2145 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2146 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2147 editor = {R. J. Boulton and P. B. Jackson},
2148 publisher = Springer,
2153 @Proceedings{ijcar2006,
2154 title = {Automated Reasoning: {IJCAR} 2006},
2155 booktitle = {Automated Reasoning: {IJCAR} 2006},
2156 editor = {U. Furbach and N. Shankar},
2157 publisher = Springer,
2162 @Proceedings{tphols2007,
2163 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2164 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2165 editor = {K. Schneider and J. Brandt},
2166 publisher = Springer,
2171 @Proceedings{tphols2008,
2172 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2173 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2174 publisher = Springer,
2180 @Proceedings{itp2010,
2181 title = {Interactive Theorem Proving: {ITP}-10},
2182 booktitle = {Interactive Theorem Proving: {ITP}-10},
2183 editor = "Matt Kaufmann and Lawrence Paulson",
2184 publisher = Springer,
2188 @unpublished{classes_modules,
2189 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
2190 author = {Stefan Wehr et. al.}