1 % BibTeX database for the Isabelle documentation
3 % Lawrence C Paulson $Id$
6 @string{AP="Academic Press"}
7 @string{CUP="Cambridge University Press"}
8 @string{IEEE="{\sc ieee} Computer Society Press"}
9 @string{LNCS="Lect.\ Notes in Comp.\ Sci."}
10 @string{MIT="MIT Press"}
11 @string{NH="North-Holland"}
12 @string{Prentice="Prentice-Hall"}
13 @string{PH="Prentice-Hall"}
14 @string{Springer="Springer-Verlag"}
17 @string{CUCL="Comp. Lab., Univ. Camb."}
18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"}
21 @string{AI="Artificial Intelligence"}
22 @string{FAC="Formal Aspects Comput."}
23 @string{JAR="J. Auto. Reas."}
24 @string{JCS="J. Comput. Secur."}
25 @string{JFP="J. Func. Prog."}
26 @string{JLC="J. Logic and Comput."}
27 @string{JLP="J. Logic Prog."}
28 @string{JSC="J. Symb. Comput."}
29 @string{JSL="J. Symb. Logic"}
30 @string{SIGPLAN="{SIGPLAN} Notices"}
33 @string{CADE="International Conference on Automated Deduction"}
34 @string{POPL="Symposium on Principles of Programming Languages"}
35 @string{TYPES="Types for Proofs and Programs"}
40 @incollection{abramsky90,
41 author = {Samson Abramsky},
42 title = {The Lazy Lambda Calculus},
44 editor = {David A. Turner},
45 booktitle = {Research Topics in Functional Programming},
46 publisher = {Addison-Wesley},
49 @Unpublished{abrial93,
50 author = {J. R. Abrial and G. Laffitte},
51 title = {Towards the Mechanization of the Proofs of some Classical
52 Theorems of Set Theory},
57 @incollection{aczel77,
58 author = {Peter Aczel},
59 title = {An Introduction to Inductive Definitions},
61 crossref = {barwise-handbk}}
64 author = {Peter Aczel},
65 title = {Non-Well-Founded Sets},
70 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
71 title = {The {ALF} Proof Editor and Its Proof Engine},
76 author = "Peter Andrews",
77 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
80 series = "Computer Science and Applied Mathematics",
83 @InProceedings{Aspinall:2000:eProof,
84 author = {David Aspinall},
85 title = {Protocols for Interactive {e-Proof}},
86 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
88 note = {Unpublished work-in-progress paper,
89 \url{http://www.proofgeneral.org/~da/drafts/eproof.ps.gz}}
91 @InProceedings{Aspinall:TACAS:2000,
92 author = {David Aspinall},
93 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
94 booktitle = {ETAPS / TACAS},
99 author = {David Aspinall},
100 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
101 note = {\url{http://www.proofgeneral.org/~da/Isamode/}}
105 author = {David Aspinall and others},
106 title = {{P}roof {G}eneral --- {O}rganize your proofs!},
107 note = {\url{http://www.proofgeneral.org}}
112 @incollection{basin91,
113 author = {David Basin and Matt Kaufmann},
114 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
116 crossref = {huet-plotkin91},
119 @InProceedings{Bauer-Wenzel:2000:HB,
120 author = {Gertrud Bauer and Markus Wenzel},
121 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
123 booktitle = {Types for Proofs and Programs: TYPES'99},
124 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
130 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
131 author = {Stefan Berghofer and Markus Wenzel},
132 title = {Inductive datatypes in {HOL} --- lessons learned in
133 {F}ormal-{L}ogic {E}ngineering},
134 crossref = {tphols99}}
136 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
137 title="Introduction to Functional Programming",publisher=PH,year=1988}
140 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
141 Overbeek and Mark Stickel and Lawrence Wos},
142 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
151 author = {Robert S. Boyer and J Strother Moore},
152 title = {A Computational Logic},
153 publisher = {Academic Press},
157 author = {Robert S. Boyer and J Strother Moore},
158 title = {A Computational Logic Handbook},
159 publisher = {Academic Press},
163 author = {N. G. de Bruijn},
164 title = {Lambda Calculus Notation with Nameless Dummies,
165 a Tool for Automatic Formula Manipulation,
166 with Application to the {Church-Rosser Theorem}},
167 journal = {Indag. Math.},
174 @TechReport{camilleri92,
175 author = {J. Camilleri and T. F. Melham},
176 title = {Reasoning with Inductively Defined Relations in the
177 {HOL} Theorem Prover},
184 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
185 title = {Artificial Intelligence Programming},
186 publisher = {Lawrence Erlbaum Associates},
190 author = "Alonzo Church",
191 title = "A Formulation of the Simple Theory of Types",
198 author = {Martin D. Coen},
199 title = {Interactive Program Derivation},
200 school = {University of Cambridge},
201 note = {Computer Laboratory Technical Report 272},
206 author = {R. L. Constable and others},
207 title = {Implementing Mathematics with the Nuprl Proof
209 publisher = Prentice,
214 @Book{davey-priestley,
215 author = {B. A. Davey and H. A. Priestley},
216 title = {Introduction to Lattices and Order},
221 author = {Keith J. Devlin},
222 title = {Fundamentals of Contemporary Set Theory},
223 publisher = {Springer},
227 author = {Michael Dummett},
228 title = {Elements of Intuitionism},
230 publisher = {Oxford University Press}}
232 @incollection{dybjer91,
233 author = {Peter Dybjer},
234 title = {Inductive Sets and Families in {Martin-L\"of's} Type
235 Theory and Their Set-Theoretic Semantics},
236 crossref = {huet-plotkin91},
240 author = {Roy Dyckhoff},
241 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
251 author = {William M. Farmer and Joshua D. Guttman and F. Javier
253 title = {{IMPS}: An Interactive Mathematical Proof System},
260 @InProceedings{felty91a,
261 Author = {Amy Felty},
262 Title = {A Logic Program for Transforming Sequent Proofs to Natural
264 crossref = {extensions91},
268 author = {Jacob Frost},
269 title = {A Case Study of Co-induction in {Isabelle HOL}},
275 %revised version of frost93
277 author = {Jacob Frost},
278 title = {A Case Study of Co-induction in {Isabelle}},
285 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
287 title = {Principles of {OBJ2}},
295 author = {J. H. Gallier},
296 title = {Logic for Computer Science:
297 Foundations of Automatic Theorem Proving},
299 publisher = {Harper \& Row}}
302 author = {Antony Galton},
303 title = {Logic for Information Technology},
307 @InProceedings{gimenez-codifying,
308 author = {Eduardo Gim{\'e}nez},
309 title = {Codifying Guarded Definitions with Recursive Schemes},
310 crossref = {types94},
315 author = {Jean-Yves Girard},
316 title = {Proofs and Types},
319 note = {Translated by Yves LaFont and Paul Taylor}}
322 author = {M. J. C. Gordon and T. F. Melham},
323 title = {Introduction to {HOL}: A Theorem Proving Environment for
329 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
331 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
333 publisher = {Springer},
336 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
337 title={Why we can't have {SML} style datatype declarations in {HOL}},
338 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
339 IFIP TC10/WG10.2 Intl. Workshop, 1992},
340 editor={L.J.M. Claesen and M.J.C. Gordon},
341 publisher=NH,year=1993,pages={561--568}}
343 @InProceedings{gunter-trees,
344 author = {Elsa L. Gunter},
345 title = {A Broader Class of Trees for Recursive Type Definitions for
353 author = {Paul R. Halmos},
354 title = {Naive Set Theory},
355 publisher = {Van Nostrand},
359 author = {Matthew Hennessy},
360 title = {The Semantics of Programming Languages: An Elementary
361 Introduction Using Structural Operational Semantics},
365 @Article{haskell-report,
366 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
367 title = {Report on the Programming Language {Haskell}: A
368 Non-strict, Purely Functional Language},
374 note = {Version 1.2}}
376 @Article{haskell-tutorial,
377 author = {Paul Hudak and Joseph H. Fasel},
378 title = {A Gentle Introduction to {Haskell}},
386 author = {G. P. Huet},
387 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
394 author = {G. P. Huet and B. Lang},
395 title = {Proving and Applying Program Transformations Expressed with
396 Second-Order Patterns},
402 @inproceedings{huet88,
403 author = {G\'erard Huet},
404 title = {Induction Principles Formalized in the {Calculus of
406 booktitle = {Programming of Future Generation Computers},
407 editor = {K. Fuchi and M. Nivat},
410 publisher = {Elsevier}}
412 @InProceedings{Harrison:1996:MizarHOL,
413 author = {J. Harrison},
414 title = {A {Mizar} Mode for {HOL}},
416 crossref = {tphols96}}
420 @InProceedings{kammueller-locales,
421 author = {Florian Kamm{\"u}ller and Markus Wenzel and
422 Lawrence C. Paulson},
423 title = {Locales: A Sectioning Concept for {Isabelle}},
424 crossref = {tphols99}}
427 author={Donald E. Knuth},
428 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
429 publisher={Addison-Wesley},
433 author = {R. E. Korf},
434 title = {Depth-First Iterative-Deepening: an Optimal Admissible
442 author = {Kenneth Kunen},
443 title = {Set Theory: An Introduction to Independence Proofs},
450 author = {Zohar Manna and Richard Waldinger},
451 title = {Deductive Synthesis of the Unification Algorithm},
458 @InProceedings{martin-nipkow,
459 author = {Ursula Martin and Tobias Nipkow},
460 title = {Ordered Rewriting and Confluence},
465 author = {Per Martin-L\"of},
466 title = {Intuitionistic type theory},
468 publisher = {Bibliopolis}}
470 @incollection{melham89,
471 author = {Thomas F. Melham},
472 title = {Automating Recursive Type Definitions in Higher Order
475 crossref = {birtwistle89}}
477 @Article{miller-mixed,
478 Author = {Dale Miller},
479 Title = {Unification Under a Mixed Prefix},
487 author = {Robin Milner},
488 title = {A Theory of Type Polymorphism in Programming},
489 journal = "J. Comp.\ Sys.\ Sci.",
494 @TechReport{milner-ind,
495 author = {Robin Milner},
496 title = {How to Derive Inductions in {LCF}},
497 institution = Edinburgh,
501 @Article{milner-coind,
502 author = {Robin Milner and Mads Tofte},
503 title = {Co-induction in Relational Semantics},
510 author = {Robin Milner},
511 title = {Communication and Concurrency},
512 publisher = Prentice,
515 @PhdThesis{monahan84,
516 author = {Brian Q. Monahan},
517 title = {Data Type Proofs using Edinburgh {LCF}},
518 school = {University of Edinburgh},
521 @article{MuellerNvOS99,
523 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
524 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
526 @Manual{Muzalewski:Mizar,
527 title = {An Outline of {PC} {Mizar}},
528 author = {Micha{\l} Muzalewski},
529 organization = {Fondation of Logic, Mathematics and Informatics
530 --- Mizar Users Group},
532 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
537 @InProceedings{NaraschewskiW-TPHOLs98,
538 author = {Wolfgang Naraschewski and Markus Wenzel},
540 {Object-Oriented Verification based on Record Subtyping in
542 crossref = {tphols98}}
544 @inproceedings{nazareth-nipkow,
545 author = {Dieter Nazareth and Tobias Nipkow},
546 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
547 crossref = {tphols96},
551 @inproceedings{nipkow-W,
552 author = {Wolfgang Naraschewski and Tobias Nipkow},
553 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
554 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
555 editor = {E. Gim\'enez and C. Paulin-Mohring},
556 publisher = Springer,
562 @InCollection{nipkow-sorts93,
563 author = {T. Nipkow},
564 title = {Order-Sorted Polymorphism in {Isabelle}},
565 booktitle = {Logical Environments},
568 editor = {G. Huet and G. Plotkin},
572 @Misc{nipkow-types93,
573 author = {Tobias Nipkow},
574 title = {Axiomatic Type Classes (in {I}sabelle)},
575 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
579 @inproceedings{Nipkow-CR,
580 author = {Tobias Nipkow},
581 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
582 booktitle = {Automated Deduction --- CADE-13},
583 editor = {M. McRobbie and J.K. Slaney},
584 publisher = Springer,
591 @InProceedings{nipkow-patterns,
592 title = {Functional Unification of Higher-Order Patterns},
593 author = {Tobias Nipkow},
596 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
597 keywords = {unification}}
600 author = {Tobias Nipkow},
601 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
607 @manual{isabelle-HOL,
608 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
609 title = {{Isabelle}'s Logics: {HOL}},
610 institution = {Institut f\"ur Informatik, Technische Universi\"at
611 M\"unchen and Computer Laboratory, University of Cambridge},
612 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
614 @article{nipkow-prehofer,
615 author = {Tobias Nipkow and Christian Prehofer},
616 title = {Type Reconstruction for Type Classes},
624 author = {Philippe No{\"e}l},
625 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
633 author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},
634 title = {Programming in {Martin-L\"of}'s Type Theory. An
636 publisher = {Oxford University Press},
641 @Manual{pvs-language,
642 title = {The {PVS} specification language},
643 author = {S. Owre and N. Shankar and J. M. Rushby},
644 organization = {Computer Science Laboratory, SRI International},
645 address = {Menlo Park, CA},
646 note = {Beta release},
649 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
654 @InProceedings{paulin-tlca,
655 author = {Christine Paulin-Mohring},
656 title = {Inductive Definitions in the System {Coq}: Rules and
661 @InProceedings{paulson-CADE,
662 author = {Lawrence C. Paulson},
663 title = {A Fixedpoint Approach to Implementing (Co)Inductive
668 @InProceedings{paulson-COLOG,
669 author = {Lawrence C. Paulson},
670 title = {A Formulation of the Simple Theory of Types (for
673 crossref = {colog88},
674 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
676 @Article{paulson-coind,
677 author = {Lawrence C. Paulson},
678 title = {Mechanizing Coinduction and Corecursion in Higher-Order
687 @manual{isabelle-ref,
688 author = {Lawrence C. Paulson},
689 title = {The {Isabelle} Reference Manual},
691 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
694 author = {Lawrence C. Paulson},
695 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
697 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
699 @article{paulson-found,
700 author = {Lawrence C. Paulson},
701 title = {The Foundation of a Generic Theorem Prover},
707 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
709 %replaces paulson-final
710 @Article{paulson-mscs,
711 author = {Lawrence C. Paulson},
712 title = {Final Coalgebras as Greatest Fixed Points
714 journal = {Mathematical Structures in Computer Science},
719 @InCollection{paulson-generic,
720 author = {Lawrence C. Paulson},
721 title = {Generic Automatic Proof Tools},
722 crossref = {wos-fest},
726 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
727 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
736 @InCollection{paulson-handbook,
737 author = {Lawrence C. Paulson},
738 title = {Designing a Theorem Prover},
739 crossref = {handbk-lics2},
742 @Book{paulson-isa-book,
743 author = {Lawrence C. Paulson},
744 title = {Isabelle: A Generic Theorem Prover},
745 publisher = {Springer},
749 @InCollection{paulson-markt,
750 author = {Lawrence C. Paulson},
751 title = {Tool Support for Logics of Programs},
752 booktitle = {Mathematical Methods in Program Development:
753 Summer School Marktoberdorf 1996},
754 publisher = {Springer},
756 year = {Published 1997},
757 editor = {Manfred Broy},
758 series = {NATO ASI Series F}}
760 %replaces Paulson-ML and paulson91
762 author = {Lawrence C. Paulson},
763 title = {{ML} for the Working Programmer},
768 @article{paulson-natural,
769 author = {Lawrence C. Paulson},
770 title = {Natural Deduction as Higher-order Resolution},
775 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
777 @Article{paulson-set-I,
778 author = {Lawrence C. Paulson},
779 title = {Set Theory for Verification: {I}. {From}
780 Foundations to Functions},
786 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
788 @Article{paulson-set-II,
789 author = {Lawrence C. Paulson},
790 title = {Set Theory for Verification: {II}. {Induction} and
797 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
800 author = {Lawrence C. Paulson},
801 title = {Verifying the Unification Algorithm in {LCF}},
807 %replqces Paulson-LCF
809 author = {Lawrence C. Paulson},
810 title = {Logic and Computation: Interactive proof with Cambridge
815 @incollection{paulson700,
816 author = {Lawrence C. Paulson},
817 title = {{Isabelle}: The Next 700 Theorem Provers},
818 crossref = {odifreddi90},
820 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
822 % replaces paulson-ns and paulson-security
823 @Article{paulson-jcs,
824 author = {Lawrence C. Paulson},
825 title = {The Inductive Approach to Verifying Cryptographic Protocols},
831 @article{pelletier86,
832 author = {F. J. Pelletier},
833 title = {Seventy-five Problems for Testing Automatic Theorem
839 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
842 author = {Andrew M. Pitts},
843 title = {A Co-induction Principle for Recursively Defined Domains},
850 author = {David A. Plaisted},
851 title = {A Sequent-Style Model Elimination Strategy and a Positive
862 author = {Art Quaife},
863 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
873 @TechReport{rasmussen95,
874 author = {Ole Rasmussen},
875 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
877 institution = {Computer Laboratory, University of Cambridge},
881 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
884 author = {Steve Reeves and Michael Clarke},
885 title = {Logic for Computer Science},
886 publisher = {Addison-Wesley},
889 @InProceedings{Rudnicki:1992:MizarOverview,
890 author = {P. Rudnicki},
891 title = {An Overview of the {MIZAR} Project},
892 booktitle = {1992 Workshop on Types for Proofs and Programs},
894 organization = {Chalmers University of Technology},
900 @inproceedings{saaltink-fme,
901 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
902 Dan Craigen and Irwin Meisels},
903 title = {An {EVES} Data Abstraction Example},
907 @inproceedings{slind-tfl,
908 author = {Konrad Slind},
909 title = {Function Definition in Higher Order Logic},
910 booktitle = {Theorem Proving in Higher Order Logics},
911 editor = {J. von Wright and J. Grundy and J. Harrison},
912 publisher = Springer,
919 author = {Patrick Suppes},
920 title = {Axiomatic Set Theory},
924 @InCollection{szasz93,
925 author = {Nora Szasz},
926 title = {A Machine Checked Proof that {Ackermann's} Function is not
927 Primitive Recursive},
928 crossref = {huet-plotkin93},
931 @TechReport{Syme:1997:DECLARE,
933 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
934 institution = {University of Cambridge Computer Laboratory},
939 @PhdThesis{Syme:1998:thesis,
941 title = {Declarative Theorem Proving for Operational Semantics},
942 school = {University of Cambridge},
947 @InProceedings{Syme:1999:TPHOL,
949 title = {Three Tactic Theorem Proving},
950 crossref = {tphols99}}
955 author = {G. Takeuti},
956 title = {Proof Theory},
962 author = {Simon Thompson},
963 title = {Type Theory and Functional Programming},
964 publisher = {Addison-Wesley},
967 @Unpublished{Trybulec:1993:MizarFeatures,
968 author = {A. Trybulec},
969 title = {Some Features of the {Mizar} Language},
970 note = {Presented at a workshop in Turin, Italy},
976 @Unpublished{voelker94,
977 author = {Norbert V\"olker},
978 title = {The Verification of a Timer Program using {Isabelle/HOL}},
979 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
986 author = {Christoph Wedler},
987 title = {Emacs package ``{X-Symbol}''},
988 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
991 @manual{isabelle-sys,
992 author = {Markus Wenzel and Stefan Berghofer},
993 title = {The {Isabelle} System Manual},
994 institution = {TU Munich},
995 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
997 @manual{isabelle-isar-ref,
998 author = {Markus Wenzel},
999 title = {The {Isabelle/Isar} Reference Manual},
1000 institution = {TU Munich},
1001 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1003 @manual{isabelle-axclass,
1004 author = {Markus Wenzel},
1005 title = {Using Axiomatic Type Classes in {I}sabelle},
1006 institution = {TU Munich},
1008 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1011 @InProceedings{Wenzel:1999:TPHOL,
1012 author = {Markus Wenzel},
1013 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1014 crossref = {tphols99}}
1016 @InProceedings{Wenzel:1997:TPHOL,
1017 author = {Markus Wenzel},
1018 title = {Type Classes and Overloading in Higher-Order Logic},
1019 crossref = {tphols97}}
1024 author = {A. N. Whitehead and B. Russell},
1025 title = {Principia Mathematica},
1028 note = {Paperback edition to *56,
1029 abridged from the 2nd edition (1927)}}
1031 @Misc{Wiedijk:1999:Mizar,
1032 author = {Freek Wiedijk},
1033 title = {Mizar: An Impression},
1034 howpublished = {Unpublished paper},
1036 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1039 @Misc{Wiedijk:2000:MV,
1040 author = {Freek Wiedijk},
1041 title = {The Mathematical Vernacular},
1042 howpublished = {Unpublished paper},
1044 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1048 author = {Glynn Winskel},
1049 title = {The Formal Semantics of Programming Languages},
1050 publisher = MIT,year=1993}
1052 @InCollection{wos-bledsoe,
1053 author = {Larry Wos},
1054 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1055 crossref = {bledsoe-fest},
1058 @InProceedings{Zammit:1999:TPHOL,
1059 author = {Vincent Zammit},
1060 title = {On the Implementation of an Extensible Declarative Proof Language},
1061 crossref = {tphols99}}
1069 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1070 title = {Handbook of Logic in Computer Science},
1071 booktitle = {Handbook of Logic in Computer Science},
1072 publisher = {Oxford University Press},
1077 editor = {Henk Barendregt and Tobias Nipkow},
1078 title = TYPES # {: International Workshop {TYPES '93}},
1079 booktitle = TYPES # {: International Workshop {TYPES '93}},
1080 year = {published 1994},
1081 publisher = {Springer},
1082 series = {LNCS 806}}
1084 @book{barwise-handbk,
1085 editor = {J. Barwise},
1086 title = {Handbook of Mathematical Logic},
1087 booktitle = {Handbook of Mathematical Logic},
1091 @Proceedings{tlca93,
1092 title = {Typed Lambda Calculi and Applications},
1093 booktitle = {Typed Lambda Calculi and Applications},
1094 editor = {M. Bezem and J.F. Groote},
1096 publisher = {Springer},
1097 series = {LNCS 664}}
1100 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1101 title = {Current Trends in Hardware Verification and Automated
1103 booktitle = {Current Trends in Hardware Verification and Automated
1105 publisher = {Springer},
1109 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1110 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1111 publisher = {Kluwer Academic Publishers},
1113 editor = {Robert S. Boyer}}
1115 @Proceedings{cade12,
1116 editor = {Alan Bundy},
1117 title = {Automated Deduction --- {CADE}-12
1118 International Conference},
1119 booktitle = {Automated Deduction --- {CADE}-12
1120 International Conference},
1122 series = {LNAI 814},
1123 publisher = {Springer}}
1126 editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},
1127 title = TYPES # {: International Workshop {TYPES '94}},
1128 booktitle = TYPES # {: International Workshop {TYPES '94}},
1130 publisher = {Springer},
1131 series = {LNCS 996}}
1133 @book{huet-plotkin91,
1134 editor = {{G\'erard} Huet and Gordon Plotkin},
1135 title = {Logical Frameworks},
1136 booktitle = {Logical Frameworks},
1140 @book{huet-plotkin93,
1141 editor = {{G\'erard} Huet and Gordon Plotkin},
1142 title = {Logical Environments},
1143 booktitle = {Logical Environments},
1148 editor = {J. Joyce and C. Seger},
1149 title = {Higher Order Logic Theorem Proving and Its
1150 Applications: HUG '93},
1151 booktitle = {Higher Order Logic Theorem Proving and Its
1152 Applications: HUG '93},
1153 year = {Published 1994},
1154 publisher = {Springer},
1155 series = {LNCS 780}}
1157 @proceedings{colog88,
1158 editor = {P. Martin-L\"of and G. Mints},
1159 title = {COLOG-88: International Conference on Computer Logic},
1160 booktitle = {COLOG-88: International Conference on Computer Logic},
1161 year = {Published 1990},
1162 publisher = {Springer},
1163 organization = {Estonian Academy of Sciences},
1164 address = {Tallinn},
1165 series = {LNCS 417}}
1168 editor = {P. Odifreddi},
1169 title = {Logic and Computer Science},
1170 booktitle = {Logic and Computer Science},
1171 publisher = {Academic Press},
1174 @proceedings{extensions91,
1175 editor = {Peter Schroeder-Heister},
1176 title = {Extensions of Logic Programming},
1177 booktitle = {Extensions of Logic Programming},
1179 series = {LNAI 475},
1180 publisher = {Springer}}
1182 @proceedings{cade10,
1183 editor = {Mark E. Stickel},
1184 title = {10th } # CADE,
1185 booktitle = {10th } # CADE,
1187 publisher = {Springer},
1188 series = {LNAI 449}}
1191 editor = {M. Vardi},
1192 title = {Eighth Annual Symposium on Logic in Computer Science},
1193 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1198 title = {Automated Reasoning and its Applications:
1199 Essays in Honor of {Larry Wos}},
1200 booktitle = {Automated Reasoning and its Applications:
1201 Essays in Honor of {Larry Wos}},
1202 publisher = {MIT Press},
1204 editor = {Robert Veroff}}
1207 editor = {J. C. P. Woodcock and P. G. Larsen},
1208 title = {FME '93: Industrial-Strength Formal Methods},
1209 booktitle = {FME '93: Industrial-Strength Formal Methods},
1211 publisher = {Springer},
1212 series = {LNCS 670}}
1214 @Proceedings{tphols96,
1215 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1216 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1217 editor = {J. von Wright and J. Grundy and J. Harrison},
1218 series = {LNCS 1125},
1221 @Proceedings{tphols97,
1222 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1223 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1224 editor = {Elsa L. Gunter and Amy Felty},
1225 series = {LNCS 1275},
1228 @Proceedings{tphols98,
1229 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1230 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1231 editor = {Jim Grundy and Malcom Newey},
1232 series = {LNCS 1479},
1235 @Proceedings{tphols99,
1236 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1237 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1238 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1239 Paulin, C. and Thery, L.},
1240 series = {LNCS 1690},