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 @PhdThesis{Chaieb-thesis,
405 author = {Amine Chaieb},
406 title = {Automated methods for formal proofs in simple arithmetics and algebra},
407 school = {Technische Universit\"at M\"unchen},
409 note = {\url{http://www4.in.tum.de/~chaieb/pubs/pdf/diss.pdf}}}
411 @InProceedings{Chaieb-Wenzel:2007,
412 author = {Amine Chaieb and Makarius Wenzel},
413 title = {Context aware Calculation and Deduction ---
414 Ring Equalities via {Gr\"obner Bases} in {Isabelle}},
415 booktitle = {Towards Mechanized Mathematical Assistants (CALCULEMUS 2007)},
416 editor = {Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger},
423 @TechReport{camilleri92,
424 author = {J. Camilleri and T. F. Melham},
425 title = {Reasoning with Inductively Defined Relations in the
426 {HOL} Theorem Prover},
433 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
434 title = {Artificial Intelligence Programming},
435 publisher = {Lawrence Erlbaum Associates},
439 author = "Alonzo Church",
440 title = "A Formulation of the Simple Theory of Types",
446 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
447 title="Model Checking",publisher=MIT,year=1999}
450 author = {Martin D. Coen},
451 title = {Interactive Program Derivation},
452 school = {University of Cambridge},
453 note = {Computer Laboratory Technical Report 272},
458 author = {R. L. Constable and others},
459 title = {Implementing Mathematics with the Nuprl Proof
461 publisher = Prentice,
466 @Book{davey-priestley,
467 author = {B. A. Davey and H. A. Priestley},
468 title = {Introduction to Lattices and Order},
473 author = {Keith J. Devlin},
474 title = {Fundamentals of Contemporary Set Theory},
475 publisher = {Springer},
479 author = {Michael Dummett},
480 title = {Elements of Intuitionism},
482 publisher = {Oxford University Press}}
485 author = {Bruno Dutertre and Leonardo de Moura},
486 title = {The {Yices} {SMT} Solver},
487 howpublished = "\url{http://yices.csl.sri.com/tool-paper.pdf}",
490 @incollection{dybjer91,
491 author = {Peter Dybjer},
492 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
493 Theory and Their Set-Theoretic Semantics},
494 crossref = {huet-plotkin91},
498 author = {Roy Dyckhoff},
499 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
509 author = {William M. Farmer and Joshua D. Guttman and F. Javier
511 title = {{IMPS}: An Interactive Mathematical Proof System},
518 @InProceedings{felty91a,
519 Author = {Amy Felty},
520 Title = {A Logic Program for Transforming Sequent Proofs to Natural
522 crossref = {extensions91},
525 @Article{fleuriot-jcm,
526 author = {Jacques Fleuriot and Lawrence C. Paulson},
527 title = {Mechanizing Nonstandard Real Analysis},
528 journal = {LMS Journal of Computation and Mathematics},
532 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
536 author = {Jacob Frost},
537 title = {A Case Study of Co-induction in {Isabelle HOL}},
543 %revised version of frost93
545 author = {Jacob Frost},
546 title = {A Case Study of Co-induction in {Isabelle}},
553 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
555 title = {Principles of {OBJ2}},
563 author = {J. H. Gallier},
564 title = {Logic for Computer Science:
565 Foundations of Automatic Theorem Proving},
567 publisher = {Harper \& Row}}
570 author = {Antony Galton},
571 title = {Logic for Information Technology},
575 @Article{Gentzen:1935,
576 author = {G. Gentzen},
577 title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},
578 journal = {Math. Zeitschrift},
582 @InProceedings{gimenez-codifying,
583 author = {Eduardo Gim{\'e}nez},
584 title = {Codifying Guarded Definitions with Recursive Schemes},
585 crossref = {types94},
590 author = {Jean-Yves Girard},
591 title = {Proofs and Types},
594 note = {Translated by Yves LaFont and Paul Taylor}}
597 editor = {M. J. C. Gordon and T. F. Melham},
598 title = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
603 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
605 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
607 publisher = {Springer},
610 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
611 title={Why we can't have {SML} style datatype declarations in {HOL}},
612 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
613 IFIP TC10/WG10.2 Intl. Workshop, 1992},
614 editor={L.J.M. Claesen and M.J.C. Gordon},
615 publisher=NH,year=1993,pages={561--568}}
617 @InProceedings{gunter-trees,
618 author = {Elsa L. Gunter},
619 title = {A Broader Class of Trees for Recursive Type Definitions for
626 @InProceedings{Haftmann-Wenzel:2006:classes,
627 author = {Florian Haftmann and Makarius Wenzel},
628 title = {Constructive Type Classes in {Isabelle}},
629 editor = {T. Altenkirch and C. McBride},
630 booktitle = {Types for Proofs and Programs, TYPES 2006},
631 publisher = {Springer},
637 @inproceedings{Haftmann-Nipkow:2010:code,
638 author = {Florian Haftmann and Tobias Nipkow},
639 title = {Code Generation via Higher-Order Rewrite Systems},
640 booktitle = {Functional and Logic Programming: 10th International Symposium: FLOPS 2010},
642 publisher = Springer,
644 editor = {Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal},
648 @InProceedings{Haftmann-Wenzel:2009,
649 author = {Florian Haftmann and Makarius Wenzel},
650 title = {Local theory specifications in {Isabelle/Isar}},
651 editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},
652 booktitle = {Types for Proofs and Programs, TYPES 2008},
653 publisher = {Springer},
659 @inproceedings{hindleymilner,
660 author = {L. Damas and H. Milner},
661 title = {Principal type schemes for functional programs},
662 booktitle = {ACM Symp. Principles of Programming Languages},
666 @manual{isabelle-classes,
667 author = {Florian Haftmann},
668 title = {Haskell-style type classes with {Isabelle}/{Isar}},
670 note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}
673 @manual{isabelle-codegen,
674 author = {Florian Haftmann},
675 title = {Code generation from Isabelle theories},
677 note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}
681 author = {Paul R. Halmos},
682 title = {Naive Set Theory},
683 publisher = {Van Nostrand},
686 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
687 title={Dynamic Logic},publisher=MIT,year=2000}
690 author = {Matthew Hennessy},
691 title = {The Semantics of Programming Languages: An Elementary
692 Introduction Using Structural Operational Semantics},
696 @article{waldmeister,
697 author = {Thomas Hillenbrand and Arnim Buch and Rolan Vogt and Bernd L\"ochner},
698 title = "Waldmeister: High-Performance Equational Deduction",
705 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
706 title={Introduction to Automata Theory, Languages, and Computation.},
707 publisher={Addison-Wesley},year=1979}
709 @Article{haskell-report,
710 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
711 title = {Report on the Programming Language {Haskell}: A
712 Non-strict, Purely Functional Language},
718 note = {Version 1.2}}
720 @Article{haskell-tutorial,
721 author = {Paul Hudak and Joseph H. Fasel},
722 title = {A Gentle Introduction to {Haskell}},
730 author = "Kry\v{s}tof Hoder and Andrei Voronkov",
731 title = "Sine Qua Non for Large Theory Reasoning",
732 booktitle = {Automated Deduction --- CADE-23},
733 publisher = Springer,
737 editor = "Nikolaj Bj{\o}rner and Viorica Sofronie-Stokkermans",
740 @book{Hudak-Haskell,author={Paul Hudak},
741 title={The Haskell School of Expression},publisher=CUP,year=2000}
744 author = {G. P. Huet},
745 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
752 author = {G. P. Huet and B. Lang},
753 title = {Proving and Applying Program Transformations Expressed with
754 Second-Order Patterns},
760 @inproceedings{huet88,
761 author = {G{\'e}rard Huet},
762 title = {Induction Principles Formalized in the {Calculus of
764 booktitle = {Programming of Future Generation Computers},
765 editor = {K. Fuchi and M. Nivat},
768 publisher = {Elsevier}}
770 @Book{Huth-Ryan-book,
771 author = {Michael Huth and Mark Ryan},
772 title = {Logic in Computer Science. Modelling and reasoning about systems},
776 @InProceedings{Harrison:1996:MizarHOL,
777 author = {J. Harrison},
778 title = {A {Mizar} Mode for {HOL}},
780 crossref = {tphols96}}
784 title = "Metis Theorem Prover",
785 note = "\url{http://www.gilith.com/software/metis/}"}
789 @article{haskell-revised-report,
790 author = {Simon {Peyton Jones} and others},
791 title = {The {Haskell} 98 Language and Libraries: The Revised Report},
792 journal = {Journal of Functional Programming},
798 note = {\url{http://www.haskell.org/definition/}}}
801 author = "Daniel Jackson",
802 title = "Software Abstractions: Logic, Language, and Analysis",
808 @InProceedings{kammueller-locales,
809 author = {Florian Kamm{\"u}ller and Markus Wenzel and
810 Lawrence C. Paulson},
811 title = {Locales: A Sectioning Concept for {Isabelle}},
812 crossref = {tphols99}}
815 author={Donald E. Knuth},
816 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
817 publisher={Addison-Wesley},
821 author = {R. E. Korf},
822 title = {Depth-First Iterative-Deepening: an Optimal Admissible
829 @inproceedings{korovin-2009,
830 title = "Instantiation-Based Automated Reasoning: From Theory to Practice",
831 author = "Konstantin Korovin",
832 editor = "Renate A. Schmidt",
833 booktitle = {Automated Deduction --- CADE-22},
838 publisher = "Springer"}
840 @inproceedings{korovin-sticksel-2010,
841 author = {Konstantin Korovin and
843 title = {{iP}rover-{E}q: An Instantiation-Based Theorem Prover with Equality},
845 booktitle={Automated Reasoning: IJCAR 2010},
846 editor={J. Giesl and R. H\"ahnle},
847 publisher = Springer,
852 @InProceedings{krauss2006,
853 author = {Alexander Krauss},
854 title = {Partial Recursive Functions in {Higher-Order Logic}},
855 crossref = {ijcar2006},
858 @PhdThesis{krauss_phd,
859 author = {Alexander Krauss},
860 title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},
861 school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
866 @manual{isabelle-function,
867 author = {Alexander Krauss},
868 title = {Defining Recursive Functions in {Isabelle/HOL}},
870 note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}
874 author = {Kenneth Kunen},
875 title = {Set Theory: An Introduction to Independence Proofs},
882 author = {Xavier Leroy and others},
883 title = {The Objective Caml system -- Documentation and user's manual},
884 note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}
886 @incollection{lochbihler-2010,
887 title = "Coinduction",
888 author = "Andreas Lochbihler",
889 booktitle = "The Archive of Formal Proofs",
890 editor = "Gerwin Klein and Tobias Nipkow and Lawrence C. Paulson",
891 publisher = "\url{http://afp.sourceforge.net/entries/Coinductive.shtml}",
896 author = "D. W. Loveland",
897 title = "Automated Theorem Proving: A Logical Basis",
899 publisher = "North-Holland Publishing Co."}
901 @InProceedings{lowe-fdr,
902 author = {Gavin Lowe},
903 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
904 Protocol using {CSP} and {FDR}},
905 booktitle = {Tools and Algorithms for the Construction and Analysis
906 of Systems: second international workshop, TACAS '96},
907 editor = {T. Margaria and B. Steffen},
908 series = {LNCS 1055},
910 publisher = {Springer},
916 author = {Zohar Manna and Richard Waldinger},
917 title = {Deductive Synthesis of the Unification Algorithm},
924 @InProceedings{martin-nipkow,
925 author = {Ursula Martin and Tobias Nipkow},
926 title = {Ordered Rewriting and Confluence},
931 author = {Per Martin-L{\"o}f},
932 title = {Intuitionistic type theory},
934 publisher = {Bibliopolis}}
936 @incollection{melham89,
937 author = {Thomas F. Melham},
938 title = {Automating Recursive Type Definitions in Higher Order
941 crossref = {birtwistle89}}
943 @Article{Miller:1991,
944 author = {Dale Miller},
945 title = {A Logic Programming Language with Lambda-Abstraction, Function Variables,
946 and Simple Unification},
947 journal = {Journal of Logic and Computation},
953 @Article{miller-mixed,
954 Author = {Dale Miller},
955 Title = {Unification Under a Mixed Prefix},
963 author = {Robin Milner},
964 title = {A Theory of Type Polymorphism in Programming},
965 journal = "J. Comp.\ Sys.\ Sci.",
970 @TechReport{milner-ind,
971 author = {Robin Milner},
972 title = {How to Derive Inductions in {LCF}},
973 institution = Edinburgh,
977 @Article{milner-coind,
978 author = {Robin Milner and Mads Tofte},
979 title = {Co-induction in Relational Semantics},
986 author = {Robin Milner},
987 title = {Communication and Concurrency},
988 publisher = Prentice,
991 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
992 title="The Definition of Standard ML",publisher=MIT,year=1990}
994 @PhdThesis{monahan84,
995 author = {Brian Q. Monahan},
996 title = {Data Type Proofs using Edinburgh {LCF}},
997 school = {University of Edinburgh},
1000 @article{MuellerNvOS99,
1002 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
1003 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
1005 @Manual{Muzalewski:Mizar,
1006 title = {An Outline of {PC} {Mizar}},
1007 author = {Micha{\l} Muzalewski},
1008 organization = {Fondation of Logic, Mathematics and Informatics
1009 --- Mizar Users Group},
1011 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
1016 @InProceedings{NaraschewskiW-TPHOLs98,
1017 author = {Wolfgang Naraschewski and Markus Wenzel},
1019 {Object-Oriented Verification based on Record Subtyping in
1020 Higher-Order Logic},
1021 crossref = {tphols98}}
1023 @inproceedings{nazareth-nipkow,
1024 author = {Dieter Nazareth and Tobias Nipkow},
1025 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
1026 crossref = {tphols96},
1030 @Article{needham-schroeder,
1031 author = "Roger M. Needham and Michael D. Schroeder",
1032 title = "Using Encryption for Authentication in Large Networks
1041 @inproceedings{nipkow-W,
1042 author = {Wolfgang Naraschewski and Tobias Nipkow},
1043 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
1044 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
1045 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
1046 publisher = Springer,
1052 @InCollection{nipkow-sorts93,
1053 author = {T. Nipkow},
1054 title = {Order-Sorted Polymorphism in {Isabelle}},
1055 booktitle = {Logical Environments},
1058 editor = {G. Huet and G. Plotkin},
1062 @Misc{nipkow-types93,
1063 author = {Tobias Nipkow},
1064 title = {Axiomatic Type Classes (in {I}sabelle)},
1065 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
1069 @inproceedings{Nipkow-CR,
1070 author = {Tobias Nipkow},
1071 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
1072 booktitle = {Automated Deduction --- CADE-13},
1073 editor = {M. McRobbie and J.K. Slaney},
1074 publisher = Springer,
1080 % WAS Nipkow-LICS-93
1081 @InProceedings{nipkow-patterns,
1082 title = {Functional Unification of Higher-Order Patterns},
1083 author = {Tobias Nipkow},
1086 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
1087 keywords = {unification}}
1089 @article{nipkow-IMP,
1090 author = {Tobias Nipkow},
1091 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
1097 @inproceedings{Nipkow-TYPES02,
1098 author = {Tobias Nipkow},
1099 title = {{Structured Proofs in Isar/HOL}},
1100 booktitle = {Types for Proofs and Programs (TYPES 2002)},
1101 editor = {H. Geuvers and F. Wiedijk},
1103 publisher = Springer,
1108 @manual{isabelle-HOL,
1109 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1110 title = {{Isabelle}'s Logics: {HOL}},
1111 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
1112 M{\"u}nchen and Computer Laboratory, University of Cambridge},
1113 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
1115 @article{nipkow-prehofer,
1116 author = {Tobias Nipkow and Christian Prehofer},
1117 title = {Type Reconstruction for Type Classes},
1124 @InProceedings{Nipkow-Prehofer:1993,
1125 author = {T. Nipkow and C. Prehofer},
1126 title = {Type checking type classes},
1127 booktitle = {ACM Symp.\ Principles of Programming Languages},
1132 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1133 title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
1134 publisher = Springer,
1140 author = {Philippe No{\"e}l},
1141 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
1149 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
1150 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
1152 publisher = {Oxford University Press},
1157 @TechReport{scala-overview-tech-report,
1158 author = {Martin Odersky and al.},
1159 title = {An Overview of the Scala Programming Language},
1160 institution = {EPFL Lausanne, Switzerland},
1162 number = {IC/2004/64}
1165 @Article{Oppen:1980,
1166 author = {D. C. Oppen},
1167 title = {Pretty Printing},
1168 journal = {ACM Transactions on Programming Languages and Systems},
1173 @Manual{pvs-language,
1174 title = {The {PVS} specification language},
1175 author = {S. Owre and N. Shankar and J. M. Rushby},
1176 organization = {Computer Science Laboratory, SRI International},
1177 address = {Menlo Park, CA},
1178 note = {Beta release},
1181 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
1186 @InProceedings{paulin-tlca,
1187 author = {Christine Paulin-Mohring},
1188 title = {Inductive Definitions in the System {Coq}: Rules and
1190 crossref = {tlca93},
1193 @Article{paulson:1983,
1194 author = {L. C. Paulson},
1195 title = {A higher-order implementation of rewriting},
1196 journal = {Science of Computer Programming},
1200 note = {\url{http://www.cl.cam.ac.uk/~lp15/papers/Reports/TR035-lcp-rewriting.pdf}}}
1202 @InProceedings{paulson-CADE,
1203 author = {Lawrence C. Paulson},
1204 title = {A Fixedpoint Approach to Implementing (Co)Inductive
1207 crossref = {cade12}}
1209 @InProceedings{paulson-COLOG,
1210 author = {Lawrence C. Paulson},
1211 title = {A Formulation of the Simple Theory of Types (for
1214 crossref = {colog88},
1215 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
1217 @Article{paulson-coind,
1218 author = {Lawrence C. Paulson},
1219 title = {Mechanizing Coinduction and Corecursion in Higher-Order
1228 @manual{isabelle-intro,
1229 author = {Lawrence C. Paulson},
1230 title = {Old Introduction to {Isabelle}},
1232 note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}}
1234 @manual{isabelle-logics,
1235 author = {Lawrence C. Paulson},
1236 title = {{Isabelle's} Logics},
1238 note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}}
1240 @manual{isabelle-ref,
1241 author = {Lawrence C. Paulson},
1242 title = {The Old {Isabelle} Reference Manual},
1244 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
1246 @manual{isabelle-ZF,
1247 author = {Lawrence C. Paulson},
1248 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
1250 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
1252 @article{paulson-found,
1253 author = {Lawrence C. Paulson},
1254 title = {The Foundation of a Generic Theorem Prover},
1260 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
1262 %replaces paulson-final
1263 @Article{paulson-mscs,
1264 author = {Lawrence C. Paulson},
1265 title = {Final Coalgebras as Greatest Fixed Points
1266 in {ZF} Set Theory},
1267 journal = {Mathematical Structures in Computer Science},
1273 @InCollection{paulson-generic,
1274 author = {Lawrence C. Paulson},
1275 title = {Generic Automatic Proof Tools},
1276 crossref = {wos-fest},
1279 @Article{paulson-gr,
1280 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
1281 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
1290 @InCollection{paulson-fixedpt-milner,
1291 author = {Lawrence C. Paulson},
1292 title = {A Fixedpoint Approach to (Co)inductive and
1293 (Co)datatype Definitions},
1295 crossref = {milner-fest}}
1298 title = {Proof, Language, and Interaction:
1299 Essays in Honor of {Robin Milner}},
1300 booktitle = {Proof, Language, and Interaction:
1301 Essays in Honor of {Robin Milner}},
1304 editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}}
1306 @InCollection{paulson-handbook,
1307 author = {Lawrence C. Paulson},
1308 title = {Designing a Theorem Prover},
1309 crossref = {handbk-lics2},
1312 @Book{paulson-isa-book,
1313 author = {Lawrence C. Paulson},
1314 title = {Isabelle: A Generic Theorem Prover},
1315 publisher = {Springer},
1319 @Book{isabelle-hol-book,
1320 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
1321 title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic},
1322 publisher = {Springer},
1326 @InCollection{paulson-markt,
1327 author = {Lawrence C. Paulson},
1328 title = {Tool Support for Logics of Programs},
1329 booktitle = {Mathematical Methods in Program Development:
1330 Summer School Marktoberdorf 1996},
1331 publisher = {Springer},
1333 year = {Published 1997},
1334 editor = {Manfred Broy},
1335 series = {NATO ASI Series F}}
1337 %replaces Paulson-ML and paulson91
1339 author = {Lawrence C. Paulson},
1340 title = {{ML} for the Working Programmer},
1345 @article{paulson-natural,
1346 author = {Lawrence C. Paulson},
1347 title = {Natural Deduction as Higher-order Resolution},
1352 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
1354 @Article{paulson-set-I,
1355 author = {Lawrence C. Paulson},
1356 title = {Set Theory for Verification: {I}. {From}
1357 Foundations to Functions},
1363 url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}}
1365 @Article{paulson-set-II,
1366 author = {Lawrence C. Paulson},
1367 title = {Set Theory for Verification: {II}. {Induction} and
1374 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
1377 author = {Lawrence C. Paulson},
1378 title = {Verifying the Unification Algorithm in {LCF}},
1384 %replaces Paulson-LCF
1386 author = {Lawrence C. Paulson},
1387 title = {Logic and Computation: Interactive proof with Cambridge
1392 @incollection{paulson700,
1393 author = {Lawrence C. Paulson},
1394 title = {{Isabelle}: The Next 700 Theorem Provers},
1395 crossref = {odifreddi90},
1397 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
1399 % replaces paulson-ns and paulson-security
1400 @Article{paulson-jcs,
1401 author = {Lawrence C. Paulson},
1402 title = {The Inductive Approach to Verifying Cryptographic Protocols},
1408 @Article{paulson-tls,
1409 author = {Lawrence C. Paulson},
1410 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
1418 @Article{paulson-yahalom,
1419 author = {Lawrence C. Paulson},
1420 title = {Relations Between Secrets:
1421 Two Formal Analyses of the {Yahalom} Protocol},
1428 @article{pelletier86,
1429 author = {F. J. Pelletier},
1430 title = {Seventy-five Problems for Testing Automatic Theorem
1436 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
1438 @InCollection{pitts93,
1439 author = {A. Pitts},
1440 title = {The {HOL} Logic},
1441 editor = {M. J. C. Gordon and T. F. Melham},
1442 booktitle = {Introduction to {HOL}: A Theorem Proving Environment for Higher Order Logic},
1448 author = {Andrew M. Pitts},
1449 title = {A Co-induction Principle for Recursively Defined Domains},
1455 @Article{plaisted90,
1456 author = {David A. Plaisted},
1457 title = {A Sequent-Style Model Elimination Strategy and a Positive
1468 author = {Art Quaife},
1469 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
1479 @TechReport{rasmussen95,
1480 author = {Ole Rasmussen},
1481 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1483 institution = {Computer Laboratory, University of Cambridge},
1487 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1490 author = {Steve Reeves and Michael Clarke},
1491 title = {Logic for Computer Science},
1492 publisher = {Addison-Wesley},
1495 @article{riazanov-voronkov-2002,
1496 author = "Alexander Riazanov and Andrei Voronkov",
1497 title = "The Design and Implementation of {Vampire}",
1498 journal = "Journal of AI Communications",
1504 @book{Rosen-DMA,author={Kenneth H. Rosen},
1505 title={Discrete Mathematics and Its Applications},
1506 publisher={McGraw-Hill},year=1998}
1508 @InProceedings{Rudnicki:1992:MizarOverview,
1509 author = {P. Rudnicki},
1510 title = {An Overview of the {MIZAR} Project},
1511 booktitle = {1992 Workshop on Types for Proofs and Programs},
1513 organization = {Chalmers University of Technology},
1514 publisher = {Bastad}
1519 @inproceedings{saaltink-fme,
1520 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1521 Dan Craigen and Irwin Meisels},
1522 title = {An {EVES} Data Abstraction Example},
1526 @Article{Schroeder-Heister:1984,
1527 author = {Peter Schroeder-Heister},
1528 title = {A Natural Extension of Natural Deduction},
1529 journal = {Journal of Symbolic Logic},
1535 @article{schulz-2002,
1536 author = "Stephan Schulz",
1537 title = "E---A Brainiac Theorem Prover",
1538 journal = "Journal of AI Communications",
1544 @misc{sledgehammer-2009,
1545 key = "Sledgehammer",
1546 title = "The {S}ledgehammer: Let Automatic Theorem Provers
1547 Write Your {I}s\-a\-belle Scripts",
1548 note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"}
1550 @inproceedings{slind-tfl,
1551 author = {Konrad Slind},
1552 title = {Function Definition in Higher Order Logic},
1553 crossref = {tphols96},
1556 @inproceedings{snark,
1557 author = {M. Stickel and R. Waldinger and M. Lowry and T. Pressburger and I. Underwood},
1558 title = {Deductive composition of astronomical software from subroutine libraries},
1560 crossref = {cade12}}
1563 author = {Patrick Suppes},
1564 title = {Axiomatic Set Theory},
1566 publisher = {Dover}}
1568 @inproceedings{sutcliffe-2000,
1569 author = "Geoff Sutcliffe",
1570 title = "System Description: {SystemOnTPTP}",
1571 editor = "David McAllester",
1572 booktitle = {Automated Deduction --- {CADE}-17 International Conference},
1573 series = "Lecture Notes in Artificial Intelligence",
1577 publisher = Springer}
1580 author = "Geoff Sutcliffe",
1582 note = "\url{http://www.cs.miami.edu/~tptp/ATPSystems/ToFoF/}"}
1584 @Article{Sutter:2005,
1585 author = {H. Sutter},
1586 title = {The Free Lunch Is Over --- A Fundamental Turn Toward Concurrency in Software},
1587 journal = {Dr. Dobb's Journal},
1592 @InCollection{szasz93,
1593 author = {Nora Szasz},
1594 title = {A Machine Checked Proof that {Ackermann's} Function is not
1595 Primitive Recursive},
1596 crossref = {huet-plotkin93},
1599 @TechReport{Syme:1997:DECLARE,
1601 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1602 institution = {University of Cambridge Computer Laboratory},
1607 @PhdThesis{Syme:1998:thesis,
1609 title = {Declarative Theorem Proving for Operational Semantics},
1610 school = {University of Cambridge},
1615 @InProceedings{Syme:1999:TPHOL,
1617 title = {Three Tactic Theorem Proving},
1618 crossref = {tphols99}}
1623 author = {G. Takeuti},
1624 title = {Proof Theory},
1630 author = {Simon Thompson},
1631 title = {Type Theory and Functional Programming},
1632 publisher = {Addison-Wesley},
1635 @book{Thompson-Haskell,author={Simon Thompson},
1636 title={Haskell: The Craft of Functional Programming},
1637 publisher={Addison-Wesley},year=1999}
1640 author = "Emina Torlak",
1641 title = {Kodkod: Constraint Solver for Relational Logic},
1642 note = "\url{http://alloy.mit.edu/kodkod/}"}
1644 @misc{kodkod-2009-options,
1645 author = "Emina Torlak",
1646 title = "Kodkod {API}: Class {Options}",
1647 note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"}
1649 @inproceedings{torlak-jackson-2007,
1650 title = "Kodkod: A Relational Model Finder",
1651 author = "Emina Torlak and Daniel Jackson",
1652 editor = "Orna Grumberg and Michael Huth",
1653 booktitle = "TACAS 2007",
1658 publisher = Springer}
1660 @unpublished{traytel-berghofer-nipkow-2011,
1661 author = {D. Traytel and S. Berghofer and T. Nipkow},
1662 title = {Extending Hindley-Milner Type Inference with Coercive
1663 Subtyping (long version)},
1666 \url{http://isabelle.in.tum.de/doc/implementation.pdf}}},
1669 @Unpublished{Trybulec:1993:MizarFeatures,
1670 author = {A. Trybulec},
1671 title = {Some Features of the {Mizar} Language},
1672 note = {Presented at a workshop in Turin, Italy},
1678 @Unpublished{voelker94,
1679 author = {Norbert V{\"o}lker},
1680 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1681 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1687 @inproceedings{wadler89how,
1688 author = {P. Wadler and S. Blott},
1689 title = {How to make ad-hoc polymorphism less ad-hoc},
1690 booktitle = {ACM Symp.\ Principles of Programming Languages},
1694 @phdthesis{weber-2008,
1695 author = "Tjark Weber",
1696 title = "SAT-Based Finite Model Generation for Higher-Order Logic",
1697 school = {Dept.\ of Informatics, T.U. M\"unchen},
1698 type = "{Ph.D.}\ thesis",
1702 author = {Christoph Wedler},
1703 title = {Emacs package ``{X-Symbol}''},
1704 note = {\url{http://x-symbol.sourceforge.net}}
1707 @misc{weidenbach-et-al-2009,
1708 author = "Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski",
1709 title = "{SPASS} Version 3.5",
1710 note = {\url{http://www.spass-prover.org/publications/spass.pdf}}}
1712 @manual{isabelle-sys,
1713 author = {Markus Wenzel and Stefan Berghofer},
1714 title = {The {Isabelle} System Manual},
1715 institution = {TU Munich},
1716 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1718 @manual{isabelle-isar-ref,
1719 author = {Makarius Wenzel},
1720 title = {The {Isabelle/Isar} Reference Manual},
1721 institution = {TU Munich},
1722 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1724 @manual{isabelle-implementation,
1725 author = {Makarius Wenzel},
1726 title = {The {Isabelle/Isar} Implementation},
1727 institution = {TU Munich},
1728 note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}}
1730 @InProceedings{Wenzel:1999:TPHOL,
1731 author = {Markus Wenzel},
1732 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1733 crossref = {tphols99}}
1735 @InProceedings{Wenzel:1997:TPHOL,
1736 author = {Markus Wenzel},
1737 title = {Type Classes and Overloading in Higher-Order Logic},
1738 crossref = {tphols97}}
1740 @phdthesis{Wenzel-PhD,
1741 author={Markus Wenzel},
1742 title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents},
1743 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},
1745 note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}}
1747 @Article{Wenzel-Wiedijk:2002,
1748 author = {Freek Wiedijk and Markus Wenzel},
1749 title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.},
1750 journal = {Journal of Automated Reasoning},
1756 @InCollection{Wenzel-Paulson:2006,
1757 author = {Markus Wenzel and Lawrence C. Paulson},
1758 title = {{Isabelle/Isar}},
1759 booktitle = {The Seventeen Provers of the World},
1761 editor = {F. Wiedijk},
1762 series = {LNAI 3600}
1765 @InCollection{Wenzel:2006:Festschrift,
1766 author = {Makarius Wenzel},
1767 title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents},
1768 booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec},
1769 publisher = {University of Bia{\l}ystok},
1771 editor = {R. Matuszewski and A. Zalewska},
1773 series = {Studies in Logic, Grammar, and Rhetoric},
1774 note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}}
1777 @InProceedings{Wenzel-Chaieb:2007b,
1778 author = {Makarius Wenzel and Amine Chaieb},
1779 title = {{SML} with antiquotations embedded into {Isabelle/Isar}},
1780 booktitle = {Workshop on Programming Languages for Mechanized Mathematics
1781 (satellite of CALCULEMUS 2007). Hagenberg, Austria},
1782 editor = {Jacques Carette and Freek Wiedijk},
1787 @InProceedings{Wenzel:2009,
1788 author = {M. Wenzel},
1789 title = {Parallel Proof Checking in {Isabelle/Isar}},
1790 booktitle = {ACM SIGSAM Workshop on Programming Languages for Mechanized Mathematics Systems (PLMMS 2009)},
1792 editor = {Dos Reis, G. and L. Th\'ery},
1793 publisher = {ACM Digital Library}}
1795 @InProceedings{Wenzel:2012,
1796 author = {Makarius Wenzel},
1797 title = {{Isabelle/jEdit} --- a {Prover IDE} within the {PIDE} framework},
1798 booktitle = {Conference on Intelligent Computer Mathematics (CICM 2012)},
1800 editor = {J. Jeuring and others},
1803 publisher = {Springer}}
1806 author = {A. N. Whitehead and B. Russell},
1807 title = {Principia Mathematica},
1810 note = {Paperback edition to *56,
1811 abridged from the 2nd edition (1927)}}
1813 @Misc{Wiedijk:1999:Mizar,
1814 author = {Freek Wiedijk},
1815 title = {Mizar: An Impression},
1816 howpublished = {Unpublished paper},
1818 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1821 @Misc{Wiedijk:2000:MV,
1822 author = {Freek Wiedijk},
1823 title = {The Mathematical Vernacular},
1824 howpublished = {Unpublished paper},
1826 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1829 @misc{wikipedia-2009-aa-trees,
1831 title = "Wikipedia: {AA} Tree",
1832 note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}
1835 author = {Glynn Winskel},
1836 title = {The Formal Semantics of Programming Languages},
1837 publisher = MIT,year=1993}
1839 @InCollection{wos-bledsoe,
1840 author = {Larry Wos},
1841 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1842 crossref = {bledsoe-fest},
1845 @InProceedings{Zammit:1999:TPHOL,
1846 author = {Vincent Zammit},
1847 title = {On the Implementation of an Extensible Declarative Proof Language},
1848 crossref = {tphols99}}
1854 title = "Z3: An Efficient {SMT} Solver",
1855 note = "\url{http://research.microsoft.com/en-us/um/redmond/projects/z3/}"}
1861 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1862 title = {Handbook of Logic in Computer Science},
1863 booktitle = {Handbook of Logic in Computer Science},
1864 publisher = {Oxford University Press},
1869 editor = {Henk Barendregt and Tobias Nipkow},
1870 title = TYPES # {: International Workshop {TYPES '93}},
1871 booktitle = TYPES # {: International Workshop {TYPES '93}},
1872 year = {published 1994},
1873 publisher = {Springer},
1874 series = {LNCS 806}}
1876 @book{barwise-handbk,
1877 editor = {J. Barwise},
1878 title = {Handbook of Mathematical Logic},
1879 booktitle = {Handbook of Mathematical Logic},
1883 @Proceedings{tlca93,
1884 title = {Typed Lambda Calculi and Applications},
1885 booktitle = {Typed Lambda Calculi and Applications},
1886 editor = {M. Bezem and J.F. Groote},
1888 publisher = {Springer},
1889 series = {LNCS 664}}
1892 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1893 title = {Current Trends in Hardware Verification and Automated
1895 booktitle = {Current Trends in Hardware Verification and Automated
1897 publisher = {Springer},
1901 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1902 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1903 publisher = {Kluwer Academic Publishers},
1905 editor = {Robert S. Boyer}}
1907 @Proceedings{cade12,
1908 editor = {Alan Bundy},
1909 title = {Automated Deduction --- {CADE}-12
1910 International Conference},
1911 booktitle = {Automated Deduction --- {CADE}-12
1912 International Conference},
1914 series = {LNAI 814},
1915 publisher = {Springer}}
1918 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1919 title = TYPES # {: International Workshop {TYPES '94}},
1920 booktitle = TYPES # {: International Workshop {TYPES '94}},
1922 publisher = {Springer},
1923 series = {LNCS 996}}
1925 @book{huet-plotkin91,
1926 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1927 title = {Logical Frameworks},
1928 booktitle = {Logical Frameworks},
1932 @book{huet-plotkin93,
1933 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1934 title = {Logical Environments},
1935 booktitle = {Logical Environments},
1940 editor = {J. Joyce and C. Seger},
1941 title = {Higher Order Logic Theorem Proving and Its
1942 Applications: HUG '93},
1943 booktitle = {Higher Order Logic Theorem Proving and Its
1944 Applications: HUG '93},
1945 year = {Published 1994},
1946 publisher = {Springer},
1947 series = {LNCS 780}}
1949 @proceedings{colog88,
1950 editor = {P. Martin-L{\"o}f and G. Mints},
1951 title = {COLOG-88: International Conference on Computer Logic},
1952 booktitle = {COLOG-88: International Conference on Computer Logic},
1953 year = {Published 1990},
1954 publisher = {Springer},
1955 organization = {Estonian Academy of Sciences},
1956 address = {Tallinn},
1957 series = {LNCS 417}}
1960 editor = {P. Odifreddi},
1961 title = {Logic and Computer Science},
1962 booktitle = {Logic and Computer Science},
1963 publisher = {Academic Press},
1966 @proceedings{extensions91,
1967 editor = {Peter Schroeder-Heister},
1968 title = {Extensions of Logic Programming},
1969 booktitle = {Extensions of Logic Programming},
1971 series = {LNAI 475},
1972 publisher = {Springer}}
1974 @proceedings{cade10,
1975 editor = {Mark E. Stickel},
1976 title = {10th } # CADE,
1977 booktitle = {10th } # CADE,
1979 publisher = {Springer},
1980 series = {LNAI 449}}
1983 editor = {M. Vardi},
1984 title = {Eighth Annual Symposium on Logic in Computer Science},
1985 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1990 title = {Automated Reasoning and its Applications:
1991 Essays in Honor of {Larry Wos}},
1992 booktitle = {Automated Reasoning and its Applications:
1993 Essays in Honor of {Larry Wos}},
1996 editor = {Robert Veroff}}
1999 editor = {J. C. P. Woodcock and P. G. Larsen},
2000 title = {FME '93: Industrial-Strength Formal Methods},
2001 booktitle = {FME '93: Industrial-Strength Formal Methods},
2003 publisher = Springer,
2007 @Proceedings{tphols96,
2008 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
2009 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
2010 editor = {J. von Wright and J. Grundy and J. Harrison},
2011 publisher = Springer,
2016 @Proceedings{tphols97,
2017 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
2018 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
2019 editor = {Elsa L. Gunter and Amy Felty},
2020 publisher = Springer,
2025 @Proceedings{tphols98,
2026 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2027 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
2028 editor = {Jim Grundy and Malcom Newey},
2029 publisher = Springer,
2034 @Proceedings{tphols99,
2035 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2036 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
2037 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
2038 Paulin, C. and Thery, L.},
2039 publisher = Springer,
2044 @Proceedings{tphols2000,
2045 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2046 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000},
2047 editor = {J. Harrison and M. Aagaard},
2048 publisher = Springer,
2053 @Proceedings{tphols2001,
2054 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2055 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001},
2056 editor = {R. J. Boulton and P. B. Jackson},
2057 publisher = Springer,
2062 @Proceedings{ijcar2006,
2063 title = {Automated Reasoning: {IJCAR} 2006},
2064 booktitle = {Automated Reasoning: {IJCAR} 2006},
2065 editor = {U. Furbach and N. Shankar},
2066 publisher = Springer,
2071 @Proceedings{tphols2007,
2072 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2073 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007},
2074 editor = {K. Schneider and J. Brandt},
2075 publisher = Springer,
2080 @Proceedings{tphols2008,
2081 title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2082 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008},
2083 publisher = Springer,
2089 @Proceedings{itp2010,
2090 title = {Interactive Theorem Proving: {ITP}-10},
2091 booktitle = {Interactive Theorem Proving: {ITP}-10},
2092 editor = "Matt Kaufmann and Lawrence Paulson",
2093 publisher = Springer,
2097 @unpublished{classes_modules,
2098 title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison},
2099 author = {Stefan Wehr et. al.}