Added "Executing higher order logic" paper.
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="Lecture Notes in Computer Science"}
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="Computer Laboratory, University of Cambridge"}
18 @string{Edinburgh="Department of Computer Science, University of Edinburgh"}
21 @string{AI="Artificial Intelligence"}
22 @string{FAC="Formal Aspects of Computing"}
23 @string{JAR="Journal of Automated Reasoning"}
24 @string{JCS="Journal of Computer Security"}
25 @string{JFP="Journal of Functional Programming"}
26 @string{JLC="Journal of Logic and Computation"}
27 @string{JLP="Journal of Logic Programming"}
28 @string{JSC="Journal of Symbolic Computation"}
29 @string{JSL="Journal of Symbolic Logic"}
30 @string{PROYAL="Proceedings of the Royal Society of London"}
31 @string{SIGPLAN="{SIGPLAN} Notices"}
32 @string{TISSEC="ACM Transactions on Information and System Security"}
35 @string{CADE="International Conference on Automated Deduction"}
36 @string{POPL="Symposium on Principles of Programming Languages"}
37 @string{TYPES="Types for Proofs and Programs"}
42 @incollection{abramsky90,
43 author = {Samson Abramsky},
44 title = {The Lazy Lambda Calculus},
46 editor = {David A. Turner},
47 booktitle = {Research Topics in Functional Programming},
48 publisher = {Addison-Wesley},
51 @Unpublished{abrial93,
52 author = {J. R. Abrial and G. Laffitte},
53 title = {Towards the Mechanization of the Proofs of some Classical
54 Theorems of Set Theory},
59 @incollection{aczel77,
60 author = {Peter Aczel},
61 title = {An Introduction to Inductive Definitions},
63 crossref = {barwise-handbk}}
66 author = {Peter Aczel},
67 title = {Non-Well-Founded Sets},
72 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
73 title = {The {ALF} Proof Editor and Its Proof Engine},
78 author = "Peter Andrews",
79 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
82 series = "Computer Science and Applied Mathematics",
85 @InProceedings{Aspinall:2000:eProof,
86 author = {David Aspinall},
87 title = {Protocols for Interactive {e-Proof}},
88 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)},
90 note = {Unpublished work-in-progress paper,
91 \url{http://www.proofgeneral.org/~da/drafts/eproof.ps.gz}}
93 @InProceedings{Aspinall:TACAS:2000,
94 author = {David Aspinall},
95 title = {{P}roof {G}eneral: A Generic Tool for Proof Development},
96 booktitle = {Tools and Algorithms for the Construction and Analysis of
106 author = {David Aspinall},
107 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
108 note = {\url{http://www.proofgeneral.org/~da/Isamode/}}
112 author = {David Aspinall},
113 title = {{P}roof {G}eneral},
114 note = {\url{http://www.proofgeneral.org}}
119 @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},
120 title="Term Rewriting and All That",publisher=CUP,year=1998}
122 @incollection{basin91,
123 author = {David Basin and Matt Kaufmann},
124 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
126 crossref = {huet-plotkin91},
129 @Unpublished{HOL-Library,
130 author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and
131 Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and
133 title = {The Supplemental {Isabelle/HOL} Library},
134 note = {Part of the Isabelle2001 distribution,
135 \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},
139 @InProceedings{Bauer-Wenzel:2000:HB,
140 author = {Gertrud Bauer and Markus Wenzel},
141 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
143 booktitle = {Types for Proofs and Programs: TYPES'99},
144 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
150 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
151 crossref = "tphols2000",
152 title = "Proof terms for simply typed higher order logic",
153 author = "Stefan Berghofer and Tobias Nipkow",
156 @InProceedings{Berghofer-Nipkow:2002,
157 author = {Stefan Berghofer and Tobias Nipkow},
158 title = {Executing Higher Order Logic},
159 booktitle = {Types for Proofs and Programs: TYPES'2000},
160 editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},
162 publisher = Springer,
166 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
167 author = {Stefan Berghofer and Markus Wenzel},
168 title = {Inductive datatypes in {HOL} --- lessons learned in
169 {F}ormal-{L}ogic {E}ngineering},
170 crossref = {tphols99}}
172 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
173 title="Introduction to Functional Programming",publisher=PH,year=1988}
175 @book{Bird-Haskell,author="Richard Bird",
176 title="Introduction to Functional Programming using Haskell",
177 publisher=PH,year=1998}
180 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
181 Overbeek and Mark Stickel and Lawrence Wos},
182 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
191 author = {Robert S. Boyer and J Strother Moore},
192 title = {A Computational Logic},
193 publisher = {Academic Press},
197 author = {Robert S. Boyer and J Strother Moore},
198 title = {A Computational Logic Handbook},
199 publisher = {Academic Press},
203 author = {N. G. de Bruijn},
204 title = {Lambda Calculus Notation with Nameless Dummies,
205 a Tool for Automatic Formula Manipulation,
206 with Application to the {Church-Rosser Theorem}},
207 journal = {Indag. Math.},
213 author = {M. Burrows and M. Abadi and R. M. Needham},
214 title = {A Logic of Authentication},
222 @TechReport{camilleri92,
223 author = {J. Camilleri and T. F. Melham},
224 title = {Reasoning with Inductively Defined Relations in the
225 {HOL} Theorem Prover},
232 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
233 title = {Artificial Intelligence Programming},
234 publisher = {Lawrence Erlbaum Associates},
238 author = "Alonzo Church",
239 title = "A Formulation of the Simple Theory of Types",
245 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
246 title="Model Checking",publisher=MIT,year=1999}
249 author = {Martin D. Coen},
250 title = {Interactive Program Derivation},
251 school = {University of Cambridge},
252 note = {Computer Laboratory Technical Report 272},
257 author = {R. L. Constable and others},
258 title = {Implementing Mathematics with the Nuprl Proof
260 publisher = Prentice,
265 @Book{davey-priestley,
266 author = {B. A. Davey and H. A. Priestley},
267 title = {Introduction to Lattices and Order},
272 author = {Keith J. Devlin},
273 title = {Fundamentals of Contemporary Set Theory},
274 publisher = {Springer},
278 author = {Michael Dummett},
279 title = {Elements of Intuitionism},
281 publisher = {Oxford University Press}}
283 @incollection{dybjer91,
284 author = {Peter Dybjer},
285 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
286 Theory and Their Set-Theoretic Semantics},
287 crossref = {huet-plotkin91},
291 author = {Roy Dyckhoff},
292 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
302 author = {William M. Farmer and Joshua D. Guttman and F. Javier
304 title = {{IMPS}: An Interactive Mathematical Proof System},
311 @InProceedings{felty91a,
312 Author = {Amy Felty},
313 Title = {A Logic Program for Transforming Sequent Proofs to Natural
315 crossref = {extensions91},
318 @Article{fleuriot-jcm,
319 author = {Jacques Fleuriot and Lawrence C. Paulson},
320 title = {Mechanizing Nonstandard Real Analysis},
321 journal = {LMS Journal of Computation and Mathematics},
325 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
329 author = {Jacob Frost},
330 title = {A Case Study of Co-induction in {Isabelle HOL}},
336 %revised version of frost93
338 author = {Jacob Frost},
339 title = {A Case Study of Co-induction in {Isabelle}},
346 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
348 title = {Principles of {OBJ2}},
356 author = {J. H. Gallier},
357 title = {Logic for Computer Science:
358 Foundations of Automatic Theorem Proving},
360 publisher = {Harper \& Row}}
363 author = {Antony Galton},
364 title = {Logic for Information Technology},
368 @InProceedings{gimenez-codifying,
369 author = {Eduardo Gim{\'e}nez},
370 title = {Codifying Guarded Definitions with Recursive Schemes},
371 crossref = {types94},
376 author = {Jean-Yves Girard},
377 title = {Proofs and Types},
380 note = {Translated by Yves LaFont and Paul Taylor}}
383 editor = {M. J. C. Gordon and T. F. Melham},
384 title = {Introduction to {HOL}: A Theorem Proving Environment for
390 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
392 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
394 publisher = {Springer},
397 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
398 title={Why we can't have {SML} style datatype declarations in {HOL}},
399 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
400 IFIP TC10/WG10.2 Intl. Workshop, 1992},
401 editor={L.J.M. Claesen and M.J.C. Gordon},
402 publisher=NH,year=1993,pages={561--568}}
404 @InProceedings{gunter-trees,
405 author = {Elsa L. Gunter},
406 title = {A Broader Class of Trees for Recursive Type Definitions for
414 author = {Paul R. Halmos},
415 title = {Naive Set Theory},
416 publisher = {Van Nostrand},
419 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
420 title={Dynamic Logic},publisher=MIT,year=2000}
423 author = {Matthew Hennessy},
424 title = {The Semantics of Programming Languages: An Elementary
425 Introduction Using Structural Operational Semantics},
429 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
430 title={Introduction to Automata Theory, Languages, and Computation.},
431 publisher={Addison-Wesley},year=1979}
433 @Article{haskell-report,
434 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
435 title = {Report on the Programming Language {Haskell}: A
436 Non-strict, Purely Functional Language},
442 note = {Version 1.2}}
444 @Article{haskell-tutorial,
445 author = {Paul Hudak and Joseph H. Fasel},
446 title = {A Gentle Introduction to {Haskell}},
453 @book{Hudak-Haskell,author={Paul Hudak},
454 title={The Haskell School of Expression},publisher=CUP,year=2000}
457 author = {G. P. Huet},
458 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
465 author = {G. P. Huet and B. Lang},
466 title = {Proving and Applying Program Transformations Expressed with
467 Second-Order Patterns},
473 @inproceedings{huet88,
474 author = {G{\'e}rard Huet},
475 title = {Induction Principles Formalized in the {Calculus of
477 booktitle = {Programming of Future Generation Computers},
478 editor = {K. Fuchi and M. Nivat},
481 publisher = {Elsevier}}
483 @Book{Huth-Ryan-book,
484 author = {Michael Huth and Mark Ryan},
485 title = {Logic in Computer Science. Modelling and reasoning about systems},
489 @InProceedings{Harrison:1996:MizarHOL,
490 author = {J. Harrison},
491 title = {A {Mizar} Mode for {HOL}},
493 crossref = {tphols96}}
497 @InProceedings{kammueller-locales,
498 author = {Florian Kamm{\"u}ller and Markus Wenzel and
499 Lawrence C. Paulson},
500 title = {Locales: A Sectioning Concept for {Isabelle}},
501 crossref = {tphols99}}
504 author={Donald E. Knuth},
505 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
506 publisher={Addison-Wesley},
510 author = {R. E. Korf},
511 title = {Depth-First Iterative-Deepening: an Optimal Admissible
519 author = {Kenneth Kunen},
520 title = {Set Theory: An Introduction to Independence Proofs},
526 @InProceedings{lowe-fdr,
527 author = {Gavin Lowe},
528 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
529 Protocol using {CSP} and {FDR}},
530 booktitle = {Tools and Algorithms for the Construction and Analysis
531 of Systems: second international workshop, TACAS '96},
532 editor = {T. Margaria and B. Steffen},
533 series = {LNCS 1055},
535 publisher = {Springer},
542 author = {Zohar Manna and Richard Waldinger},
543 title = {Deductive Synthesis of the Unification Algorithm},
550 @InProceedings{martin-nipkow,
551 author = {Ursula Martin and Tobias Nipkow},
552 title = {Ordered Rewriting and Confluence},
557 author = {Per Martin-L{\"o}f},
558 title = {Intuitionistic type theory},
560 publisher = {Bibliopolis}}
562 @incollection{melham89,
563 author = {Thomas F. Melham},
564 title = {Automating Recursive Type Definitions in Higher Order
567 crossref = {birtwistle89}}
569 @Article{miller-mixed,
570 Author = {Dale Miller},
571 Title = {Unification Under a Mixed Prefix},
579 author = {Robin Milner},
580 title = {A Theory of Type Polymorphism in Programming},
581 journal = "J. Comp.\ Sys.\ Sci.",
586 @TechReport{milner-ind,
587 author = {Robin Milner},
588 title = {How to Derive Inductions in {LCF}},
589 institution = Edinburgh,
593 @Article{milner-coind,
594 author = {Robin Milner and Mads Tofte},
595 title = {Co-induction in Relational Semantics},
602 author = {Robin Milner},
603 title = {Communication and Concurrency},
604 publisher = Prentice,
607 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
608 title="The Definition of Standard ML",publisher=MIT,year=1990}
610 @PhdThesis{monahan84,
611 author = {Brian Q. Monahan},
612 title = {Data Type Proofs using Edinburgh {LCF}},
613 school = {University of Edinburgh},
616 @article{MuellerNvOS99,
618 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
619 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
621 @Manual{Muzalewski:Mizar,
622 title = {An Outline of {PC} {Mizar}},
623 author = {Micha{\l} Muzalewski},
624 organization = {Fondation of Logic, Mathematics and Informatics
625 --- Mizar Users Group},
627 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
632 @InProceedings{NaraschewskiW-TPHOLs98,
633 author = {Wolfgang Naraschewski and Markus Wenzel},
635 {Object-Oriented Verification based on Record Subtyping in
637 crossref = {tphols98}}
639 @inproceedings{nazareth-nipkow,
640 author = {Dieter Nazareth and Tobias Nipkow},
641 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
642 crossref = {tphols96},
646 @Article{needham-schroeder,
647 author = "Roger M. Needham and Michael D. Schroeder",
648 title = "Using Encryption for Authentication in Large Networks
657 @inproceedings{nipkow-W,
658 author = {Wolfgang Naraschewski and Tobias Nipkow},
659 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
660 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
661 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
662 publisher = Springer,
668 @InCollection{nipkow-sorts93,
669 author = {T. Nipkow},
670 title = {Order-Sorted Polymorphism in {Isabelle}},
671 booktitle = {Logical Environments},
674 editor = {G. Huet and G. Plotkin},
678 @Misc{nipkow-types93,
679 author = {Tobias Nipkow},
680 title = {Axiomatic Type Classes (in {I}sabelle)},
681 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
685 @inproceedings{Nipkow-CR,
686 author = {Tobias Nipkow},
687 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
688 booktitle = {Automated Deduction --- CADE-13},
689 editor = {M. McRobbie and J.K. Slaney},
690 publisher = Springer,
697 @InProceedings{nipkow-patterns,
698 title = {Functional Unification of Higher-Order Patterns},
699 author = {Tobias Nipkow},
702 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
703 keywords = {unification}}
706 author = {Tobias Nipkow},
707 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
713 @manual{isabelle-HOL,
714 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
715 title = {{Isabelle}'s Logics: {HOL}},
716 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
717 M{\"u}nchen and Computer Laboratory, University of Cambridge},
718 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
720 @article{nipkow-prehofer,
721 author = {Tobias Nipkow and Christian Prehofer},
722 title = {Type Reconstruction for Type Classes},
730 author = {Philippe No{\"e}l},
731 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
739 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
740 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
742 publisher = {Oxford University Press},
747 @Manual{pvs-language,
748 title = {The {PVS} specification language},
749 author = {S. Owre and N. Shankar and J. M. Rushby},
750 organization = {Computer Science Laboratory, SRI International},
751 address = {Menlo Park, CA},
752 note = {Beta release},
755 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
760 @InProceedings{paulin-tlca,
761 author = {Christine Paulin-Mohring},
762 title = {Inductive Definitions in the System {Coq}: Rules and
767 @InProceedings{paulson-CADE,
768 author = {Lawrence C. Paulson},
769 title = {A Fixedpoint Approach to Implementing (Co)Inductive
774 @InProceedings{paulson-COLOG,
775 author = {Lawrence C. Paulson},
776 title = {A Formulation of the Simple Theory of Types (for
779 crossref = {colog88},
780 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
782 @Article{paulson-coind,
783 author = {Lawrence C. Paulson},
784 title = {Mechanizing Coinduction and Corecursion in Higher-Order
793 @manual{isabelle-ref,
794 author = {Lawrence C. Paulson},
795 title = {The {Isabelle} Reference Manual},
797 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
800 author = {Lawrence C. Paulson},
801 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
803 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
805 @article{paulson-found,
806 author = {Lawrence C. Paulson},
807 title = {The Foundation of a Generic Theorem Prover},
813 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
815 %replaces paulson-final
816 @Article{paulson-mscs,
817 author = {Lawrence C. Paulson},
818 title = {Final Coalgebras as Greatest Fixed Points
820 journal = {Mathematical Structures in Computer Science},
825 @InCollection{paulson-generic,
826 author = {Lawrence C. Paulson},
827 title = {Generic Automatic Proof Tools},
828 crossref = {wos-fest},
832 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
833 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
842 @InCollection{paulson-handbook,
843 author = {Lawrence C. Paulson},
844 title = {Designing a Theorem Prover},
845 crossref = {handbk-lics2},
848 @Book{paulson-isa-book,
849 author = {Lawrence C. Paulson},
850 title = {Isabelle: A Generic Theorem Prover},
851 publisher = {Springer},
855 @InCollection{paulson-markt,
856 author = {Lawrence C. Paulson},
857 title = {Tool Support for Logics of Programs},
858 booktitle = {Mathematical Methods in Program Development:
859 Summer School Marktoberdorf 1996},
860 publisher = {Springer},
862 year = {Published 1997},
863 editor = {Manfred Broy},
864 series = {NATO ASI Series F}}
866 %replaces Paulson-ML and paulson91
868 author = {Lawrence C. Paulson},
869 title = {{ML} for the Working Programmer},
874 @article{paulson-natural,
875 author = {Lawrence C. Paulson},
876 title = {Natural Deduction as Higher-order Resolution},
881 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
883 @Article{paulson-set-I,
884 author = {Lawrence C. Paulson},
885 title = {Set Theory for Verification: {I}. {From}
886 Foundations to Functions},
892 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
894 @Article{paulson-set-II,
895 author = {Lawrence C. Paulson},
896 title = {Set Theory for Verification: {II}. {Induction} and
903 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
906 author = {Lawrence C. Paulson},
907 title = {Verifying the Unification Algorithm in {LCF}},
913 %replaces Paulson-LCF
915 author = {Lawrence C. Paulson},
916 title = {Logic and Computation: Interactive proof with Cambridge
921 @incollection{paulson700,
922 author = {Lawrence C. Paulson},
923 title = {{Isabelle}: The Next 700 Theorem Provers},
924 crossref = {odifreddi90},
926 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
928 % replaces paulson-ns and paulson-security
929 @Article{paulson-jcs,
930 author = {Lawrence C. Paulson},
931 title = {The Inductive Approach to Verifying Cryptographic Protocols},
937 @Article{paulson-tls,
938 author = {Lawrence C. Paulson},
939 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
947 @Article{paulson-yahalom,
948 author = {Lawrence C. Paulson},
949 title = {Relations Between Secrets:
950 Two Formal Analyses of the {Yahalom} Protocol},
954 @article{pelletier86,
955 author = {F. J. Pelletier},
956 title = {Seventy-five Problems for Testing Automatic Theorem
962 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
965 author = {Andrew M. Pitts},
966 title = {A Co-induction Principle for Recursively Defined Domains},
973 author = {David A. Plaisted},
974 title = {A Sequent-Style Model Elimination Strategy and a Positive
985 author = {Art Quaife},
986 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
996 @TechReport{rasmussen95,
997 author = {Ole Rasmussen},
998 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
1000 institution = {Computer Laboratory, University of Cambridge},
1004 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
1007 author = {Steve Reeves and Michael Clarke},
1008 title = {Logic for Computer Science},
1009 publisher = {Addison-Wesley},
1012 @book{Rosen-DMA,author={Kenneth H. Rosen},
1013 title={Discrete Mathematics and Its Applications},
1014 publisher={McGraw-Hill},year=1998}
1016 @InProceedings{Rudnicki:1992:MizarOverview,
1017 author = {P. Rudnicki},
1018 title = {An Overview of the {MIZAR} Project},
1019 booktitle = {1992 Workshop on Types for Proofs and Programs},
1021 organization = {Chalmers University of Technology},
1022 publisher = {Bastad}
1027 @inproceedings{saaltink-fme,
1028 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1029 Dan Craigen and Irwin Meisels},
1030 title = {An {EVES} Data Abstraction Example},
1034 @inproceedings{slind-tfl,
1035 author = {Konrad Slind},
1036 title = {Function Definition in Higher Order Logic},
1037 booktitle = {Theorem Proving in Higher Order Logics},
1038 editor = {J. von Wright and J. Grundy and J. Harrison},
1039 publisher = Springer,
1046 author = {Patrick Suppes},
1047 title = {Axiomatic Set Theory},
1049 publisher = {Dover}}
1051 @InCollection{szasz93,
1052 author = {Nora Szasz},
1053 title = {A Machine Checked Proof that {Ackermann's} Function is not
1054 Primitive Recursive},
1055 crossref = {huet-plotkin93},
1058 @TechReport{Syme:1997:DECLARE,
1060 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1061 institution = {University of Cambridge Computer Laboratory},
1066 @PhdThesis{Syme:1998:thesis,
1068 title = {Declarative Theorem Proving for Operational Semantics},
1069 school = {University of Cambridge},
1074 @InProceedings{Syme:1999:TPHOL,
1076 title = {Three Tactic Theorem Proving},
1077 crossref = {tphols99}}
1082 author = {G. Takeuti},
1083 title = {Proof Theory},
1089 author = {Simon Thompson},
1090 title = {Type Theory and Functional Programming},
1091 publisher = {Addison-Wesley},
1094 @book{Thompson-Haskell,author={Simon Thompson},
1095 title={Haskell: The Craft of Functional Programming},
1096 publisher={Addison-Wesley},year=1999}
1098 @Unpublished{Trybulec:1993:MizarFeatures,
1099 author = {A. Trybulec},
1100 title = {Some Features of the {Mizar} Language},
1101 note = {Presented at a workshop in Turin, Italy},
1107 @Unpublished{voelker94,
1108 author = {Norbert V{\"o}lker},
1109 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1110 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1117 author = {Christoph Wedler},
1118 title = {Emacs package ``{X-Symbol}''},
1119 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1122 @manual{isabelle-sys,
1123 author = {Markus Wenzel and Stefan Berghofer},
1124 title = {The {Isabelle} System Manual},
1125 institution = {TU Munich},
1126 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1128 @manual{isabelle-isar-ref,
1129 author = {Markus Wenzel},
1130 title = {The {Isabelle/Isar} Reference Manual},
1131 institution = {TU Munich},
1132 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1134 @manual{isabelle-axclass,
1135 author = {Markus Wenzel},
1136 title = {Using Axiomatic Type Classes in {I}sabelle},
1137 institution = {TU Munich},
1139 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1142 @InProceedings{Wenzel:1999:TPHOL,
1143 author = {Markus Wenzel},
1144 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1145 crossref = {tphols99}}
1147 @InProceedings{Wenzel:1997:TPHOL,
1148 author = {Markus Wenzel},
1149 title = {Type Classes and Overloading in Higher-Order Logic},
1150 crossref = {tphols97}}
1152 @phdthesis{Wenzel-PhD,author={Markus Wenzel},title={Isabelle/Isar ---
1153 a versatile environment for human-readable formal proof documents},
1154 school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},year=2002}
1158 author = {A. N. Whitehead and B. Russell},
1159 title = {Principia Mathematica},
1162 note = {Paperback edition to *56,
1163 abridged from the 2nd edition (1927)}}
1165 @Misc{Wiedijk:1999:Mizar,
1166 author = {Freek Wiedijk},
1167 title = {Mizar: An Impression},
1168 howpublished = {Unpublished paper},
1170 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1173 @Misc{Wiedijk:2000:MV,
1174 author = {Freek Wiedijk},
1175 title = {The Mathematical Vernacular},
1176 howpublished = {Unpublished paper},
1178 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1182 author = {Glynn Winskel},
1183 title = {The Formal Semantics of Programming Languages},
1184 publisher = MIT,year=1993}
1186 @InCollection{wos-bledsoe,
1187 author = {Larry Wos},
1188 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1189 crossref = {bledsoe-fest},
1192 @InProceedings{Zammit:1999:TPHOL,
1193 author = {Vincent Zammit},
1194 title = {On the Implementation of an Extensible Declarative Proof Language},
1195 crossref = {tphols99}}
1203 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1204 title = {Handbook of Logic in Computer Science},
1205 booktitle = {Handbook of Logic in Computer Science},
1206 publisher = {Oxford University Press},
1211 editor = {Henk Barendregt and Tobias Nipkow},
1212 title = TYPES # {: International Workshop {TYPES '93}},
1213 booktitle = TYPES # {: International Workshop {TYPES '93}},
1214 year = {published 1994},
1215 publisher = {Springer},
1216 series = {LNCS 806}}
1218 @book{barwise-handbk,
1219 editor = {J. Barwise},
1220 title = {Handbook of Mathematical Logic},
1221 booktitle = {Handbook of Mathematical Logic},
1225 @Proceedings{tlca93,
1226 title = {Typed Lambda Calculi and Applications},
1227 booktitle = {Typed Lambda Calculi and Applications},
1228 editor = {M. Bezem and J.F. Groote},
1230 publisher = {Springer},
1231 series = {LNCS 664}}
1234 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1235 title = {Current Trends in Hardware Verification and Automated
1237 booktitle = {Current Trends in Hardware Verification and Automated
1239 publisher = {Springer},
1243 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1244 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1245 publisher = {Kluwer Academic Publishers},
1247 editor = {Robert S. Boyer}}
1249 @Proceedings{cade12,
1250 editor = {Alan Bundy},
1251 title = {Automated Deduction --- {CADE}-12
1252 International Conference},
1253 booktitle = {Automated Deduction --- {CADE}-12
1254 International Conference},
1256 series = {LNAI 814},
1257 publisher = {Springer}}
1260 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1261 title = TYPES # {: International Workshop {TYPES '94}},
1262 booktitle = TYPES # {: International Workshop {TYPES '94}},
1264 publisher = {Springer},
1265 series = {LNCS 996}}
1267 @book{huet-plotkin91,
1268 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1269 title = {Logical Frameworks},
1270 booktitle = {Logical Frameworks},
1274 @book{huet-plotkin93,
1275 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1276 title = {Logical Environments},
1277 booktitle = {Logical Environments},
1282 editor = {J. Joyce and C. Seger},
1283 title = {Higher Order Logic Theorem Proving and Its
1284 Applications: HUG '93},
1285 booktitle = {Higher Order Logic Theorem Proving and Its
1286 Applications: HUG '93},
1287 year = {Published 1994},
1288 publisher = {Springer},
1289 series = {LNCS 780}}
1291 @proceedings{colog88,
1292 editor = {P. Martin-L{\"o}f and G. Mints},
1293 title = {COLOG-88: International Conference on Computer Logic},
1294 booktitle = {COLOG-88: International Conference on Computer Logic},
1295 year = {Published 1990},
1296 publisher = {Springer},
1297 organization = {Estonian Academy of Sciences},
1298 address = {Tallinn},
1299 series = {LNCS 417}}
1302 editor = {P. Odifreddi},
1303 title = {Logic and Computer Science},
1304 booktitle = {Logic and Computer Science},
1305 publisher = {Academic Press},
1308 @proceedings{extensions91,
1309 editor = {Peter Schroeder-Heister},
1310 title = {Extensions of Logic Programming},
1311 booktitle = {Extensions of Logic Programming},
1313 series = {LNAI 475},
1314 publisher = {Springer}}
1316 @proceedings{cade10,
1317 editor = {Mark E. Stickel},
1318 title = {10th } # CADE,
1319 booktitle = {10th } # CADE,
1321 publisher = {Springer},
1322 series = {LNAI 449}}
1325 editor = {M. Vardi},
1326 title = {Eighth Annual Symposium on Logic in Computer Science},
1327 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1332 title = {Automated Reasoning and its Applications:
1333 Essays in Honor of {Larry Wos}},
1334 booktitle = {Automated Reasoning and its Applications:
1335 Essays in Honor of {Larry Wos}},
1336 publisher = {MIT Press},
1338 editor = {Robert Veroff}}
1341 editor = {J. C. P. Woodcock and P. G. Larsen},
1342 title = {FME '93: Industrial-Strength Formal Methods},
1343 booktitle = {FME '93: Industrial-Strength Formal Methods},
1345 publisher = {Springer},
1346 series = {LNCS 670}}
1348 @Proceedings{tphols96,
1349 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1350 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1351 editor = {J. von Wright and J. Grundy and J. Harrison},
1352 series = {LNCS 1125},
1355 @Proceedings{tphols97,
1356 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1357 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1358 editor = {Elsa L. Gunter and Amy Felty},
1359 series = {LNCS 1275},
1362 @Proceedings{tphols98,
1363 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1364 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1365 editor = {Jim Grundy and Malcom Newey},
1366 series = {LNCS 1479},
1369 @Proceedings{tphols99,
1370 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1371 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1372 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1373 Paulin, C. and Thery, L.},
1374 series = {LNCS 1690},
1377 @PROCEEDINGS{tphols2000,
1378 editor = "J. Harrison and M. Aagaard",
1379 booktitle = "Theorem Proving in Higher Order Logics:
1380 13th International Conference, TPHOLs 2000",
1381 series = "Lecture Notes in Computer Science",
1384 publisher = "Springer-Verlag"}