Added TPHOLs2000 paper about proof terms.
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 @InProceedings{Bauer-Wenzel:2000:HB,
130 author = {Gertrud Bauer and Markus Wenzel},
131 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
133 booktitle = {Types for Proofs and Programs: TYPES'99},
134 editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m
140 @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,
141 crossref = "tphols2000",
142 title = "Proof terms for simply typed higher order logic",
143 author = "Stefan Berghofer and Tobias Nipkow",
146 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
147 author = {Stefan Berghofer and Markus Wenzel},
148 title = {Inductive datatypes in {HOL} --- lessons learned in
149 {F}ormal-{L}ogic {E}ngineering},
150 crossref = {tphols99}}
152 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
153 title="Introduction to Functional Programming",publisher=PH,year=1988}
155 @book{Bird-Haskell,author="Richard Bird",
156 title="Introduction to Functional Programming using Haskell",
157 publisher=PH,year=1998}
160 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
161 Overbeek and Mark Stickel and Lawrence Wos},
162 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
171 author = {Robert S. Boyer and J Strother Moore},
172 title = {A Computational Logic},
173 publisher = {Academic Press},
177 author = {Robert S. Boyer and J Strother Moore},
178 title = {A Computational Logic Handbook},
179 publisher = {Academic Press},
183 author = {N. G. de Bruijn},
184 title = {Lambda Calculus Notation with Nameless Dummies,
185 a Tool for Automatic Formula Manipulation,
186 with Application to the {Church-Rosser Theorem}},
187 journal = {Indag. Math.},
193 author = {M. Burrows and M. Abadi and R. M. Needham},
194 title = {A Logic of Authentication},
202 @TechReport{camilleri92,
203 author = {J. Camilleri and T. F. Melham},
204 title = {Reasoning with Inductively Defined Relations in the
205 {HOL} Theorem Prover},
212 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
213 title = {Artificial Intelligence Programming},
214 publisher = {Lawrence Erlbaum Associates},
218 author = "Alonzo Church",
219 title = "A Formulation of the Simple Theory of Types",
225 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
226 title="Model Checking",publisher=MIT,year=1999}
229 author = {Martin D. Coen},
230 title = {Interactive Program Derivation},
231 school = {University of Cambridge},
232 note = {Computer Laboratory Technical Report 272},
237 author = {R. L. Constable and others},
238 title = {Implementing Mathematics with the Nuprl Proof
240 publisher = Prentice,
245 @Book{davey-priestley,
246 author = {B. A. Davey and H. A. Priestley},
247 title = {Introduction to Lattices and Order},
252 author = {Keith J. Devlin},
253 title = {Fundamentals of Contemporary Set Theory},
254 publisher = {Springer},
258 author = {Michael Dummett},
259 title = {Elements of Intuitionism},
261 publisher = {Oxford University Press}}
263 @incollection{dybjer91,
264 author = {Peter Dybjer},
265 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
266 Theory and Their Set-Theoretic Semantics},
267 crossref = {huet-plotkin91},
271 author = {Roy Dyckhoff},
272 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
282 author = {William M. Farmer and Joshua D. Guttman and F. Javier
284 title = {{IMPS}: An Interactive Mathematical Proof System},
291 @InProceedings{felty91a,
292 Author = {Amy Felty},
293 Title = {A Logic Program for Transforming Sequent Proofs to Natural
295 crossref = {extensions91},
298 @Article{fleuriot-jcm,
299 author = {Jacques Fleuriot and Lawrence C. Paulson},
300 title = {Mechanizing Nonstandard Real Analysis},
301 journal = {LMS Journal of Computation and Mathematics},
305 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
309 author = {Jacob Frost},
310 title = {A Case Study of Co-induction in {Isabelle HOL}},
316 %revised version of frost93
318 author = {Jacob Frost},
319 title = {A Case Study of Co-induction in {Isabelle}},
326 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
328 title = {Principles of {OBJ2}},
336 author = {J. H. Gallier},
337 title = {Logic for Computer Science:
338 Foundations of Automatic Theorem Proving},
340 publisher = {Harper \& Row}}
343 author = {Antony Galton},
344 title = {Logic for Information Technology},
348 @InProceedings{gimenez-codifying,
349 author = {Eduardo Gim{\'e}nez},
350 title = {Codifying Guarded Definitions with Recursive Schemes},
351 crossref = {types94},
356 author = {Jean-Yves Girard},
357 title = {Proofs and Types},
360 note = {Translated by Yves LaFont and Paul Taylor}}
363 editor = {M. J. C. Gordon and T. F. Melham},
364 title = {Introduction to {HOL}: A Theorem Proving Environment for
370 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
372 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
374 publisher = {Springer},
377 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
378 title={Why we can't have {SML} style datatype declarations in {HOL}},
379 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
380 IFIP TC10/WG10.2 Intl. Workshop, 1992},
381 editor={L.J.M. Claesen and M.J.C. Gordon},
382 publisher=NH,year=1993,pages={561--568}}
384 @InProceedings{gunter-trees,
385 author = {Elsa L. Gunter},
386 title = {A Broader Class of Trees for Recursive Type Definitions for
394 author = {Paul R. Halmos},
395 title = {Naive Set Theory},
396 publisher = {Van Nostrand},
399 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
400 title={Dynamic Logic},publisher=MIT,year=2000}
403 author = {Matthew Hennessy},
404 title = {The Semantics of Programming Languages: An Elementary
405 Introduction Using Structural Operational Semantics},
409 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
410 title={Introduction to Automata Theory, Languages, and Computation.},
411 publisher={Addison-Wesley},year=1979}
413 @Article{haskell-report,
414 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
415 title = {Report on the Programming Language {Haskell}: A
416 Non-strict, Purely Functional Language},
422 note = {Version 1.2}}
424 @Article{haskell-tutorial,
425 author = {Paul Hudak and Joseph H. Fasel},
426 title = {A Gentle Introduction to {Haskell}},
433 @book{Hudak-Haskell,author={Paul Hudak},
434 title={The Haskell School of Expression},publisher=CUP,year=2000}
437 author = {G. P. Huet},
438 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
445 author = {G. P. Huet and B. Lang},
446 title = {Proving and Applying Program Transformations Expressed with
447 Second-Order Patterns},
453 @inproceedings{huet88,
454 author = {G{\'e}rard Huet},
455 title = {Induction Principles Formalized in the {Calculus of
457 booktitle = {Programming of Future Generation Computers},
458 editor = {K. Fuchi and M. Nivat},
461 publisher = {Elsevier}}
463 @Book{Huth-Ryan-book,
464 author = {Michael Huth and Mark Ryan},
465 title = {Logic in Computer Science. Modelling and reasoning about systems},
469 @InProceedings{Harrison:1996:MizarHOL,
470 author = {J. Harrison},
471 title = {A {Mizar} Mode for {HOL}},
473 crossref = {tphols96}}
477 @InProceedings{kammueller-locales,
478 author = {Florian Kamm{\"u}ller and Markus Wenzel and
479 Lawrence C. Paulson},
480 title = {Locales: A Sectioning Concept for {Isabelle}},
481 crossref = {tphols99}}
484 author={Donald E. Knuth},
485 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
486 publisher={Addison-Wesley},
490 author = {R. E. Korf},
491 title = {Depth-First Iterative-Deepening: an Optimal Admissible
499 author = {Kenneth Kunen},
500 title = {Set Theory: An Introduction to Independence Proofs},
506 @InProceedings{lowe-fdr,
507 author = {Gavin Lowe},
508 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
509 Protocol using {CSP} and {FDR}},
510 booktitle = {Tools and Algorithms for the Construction and Analysis
511 of Systems: second international workshop, TACAS '96},
512 editor = {T. Margaria and B. Steffen},
513 series = {LNCS 1055},
515 publisher = {Springer},
522 author = {Zohar Manna and Richard Waldinger},
523 title = {Deductive Synthesis of the Unification Algorithm},
530 @InProceedings{martin-nipkow,
531 author = {Ursula Martin and Tobias Nipkow},
532 title = {Ordered Rewriting and Confluence},
537 author = {Per Martin-L{\"o}f},
538 title = {Intuitionistic type theory},
540 publisher = {Bibliopolis}}
542 @incollection{melham89,
543 author = {Thomas F. Melham},
544 title = {Automating Recursive Type Definitions in Higher Order
547 crossref = {birtwistle89}}
549 @Article{miller-mixed,
550 Author = {Dale Miller},
551 Title = {Unification Under a Mixed Prefix},
559 author = {Robin Milner},
560 title = {A Theory of Type Polymorphism in Programming},
561 journal = "J. Comp.\ Sys.\ Sci.",
566 @TechReport{milner-ind,
567 author = {Robin Milner},
568 title = {How to Derive Inductions in {LCF}},
569 institution = Edinburgh,
573 @Article{milner-coind,
574 author = {Robin Milner and Mads Tofte},
575 title = {Co-induction in Relational Semantics},
582 author = {Robin Milner},
583 title = {Communication and Concurrency},
584 publisher = Prentice,
587 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
588 title="The Definition of Standard ML",publisher=MIT,year=1990}
590 @PhdThesis{monahan84,
591 author = {Brian Q. Monahan},
592 title = {Data Type Proofs using Edinburgh {LCF}},
593 school = {University of Edinburgh},
596 @article{MuellerNvOS99,
598 {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
599 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
601 @Manual{Muzalewski:Mizar,
602 title = {An Outline of {PC} {Mizar}},
603 author = {Micha{\l} Muzalewski},
604 organization = {Fondation of Logic, Mathematics and Informatics
605 --- Mizar Users Group},
607 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
612 @InProceedings{NaraschewskiW-TPHOLs98,
613 author = {Wolfgang Naraschewski and Markus Wenzel},
615 {Object-Oriented Verification based on Record Subtyping in
617 crossref = {tphols98}}
619 @inproceedings{nazareth-nipkow,
620 author = {Dieter Nazareth and Tobias Nipkow},
621 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
622 crossref = {tphols96},
626 @Article{needham-schroeder,
627 author = "Roger M. Needham and Michael D. Schroeder",
628 title = "Using Encryption for Authentication in Large Networks
637 @inproceedings{nipkow-W,
638 author = {Wolfgang Naraschewski and Tobias Nipkow},
639 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
640 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
641 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
642 publisher = Springer,
648 @InCollection{nipkow-sorts93,
649 author = {T. Nipkow},
650 title = {Order-Sorted Polymorphism in {Isabelle}},
651 booktitle = {Logical Environments},
654 editor = {G. Huet and G. Plotkin},
658 @Misc{nipkow-types93,
659 author = {Tobias Nipkow},
660 title = {Axiomatic Type Classes (in {I}sabelle)},
661 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
665 @inproceedings{Nipkow-CR,
666 author = {Tobias Nipkow},
667 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
668 booktitle = {Automated Deduction --- CADE-13},
669 editor = {M. McRobbie and J.K. Slaney},
670 publisher = Springer,
677 @InProceedings{nipkow-patterns,
678 title = {Functional Unification of Higher-Order Patterns},
679 author = {Tobias Nipkow},
682 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
683 keywords = {unification}}
686 author = {Tobias Nipkow},
687 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
693 @manual{isabelle-HOL,
694 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
695 title = {{Isabelle}'s Logics: {HOL}},
696 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
697 M{\"u}nchen and Computer Laboratory, University of Cambridge},
698 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
700 @article{nipkow-prehofer,
701 author = {Tobias Nipkow and Christian Prehofer},
702 title = {Type Reconstruction for Type Classes},
710 author = {Philippe No{\"e}l},
711 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
719 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
720 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
722 publisher = {Oxford University Press},
727 @Manual{pvs-language,
728 title = {The {PVS} specification language},
729 author = {S. Owre and N. Shankar and J. M. Rushby},
730 organization = {Computer Science Laboratory, SRI International},
731 address = {Menlo Park, CA},
732 note = {Beta release},
735 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
740 @InProceedings{paulin-tlca,
741 author = {Christine Paulin-Mohring},
742 title = {Inductive Definitions in the System {Coq}: Rules and
747 @InProceedings{paulson-CADE,
748 author = {Lawrence C. Paulson},
749 title = {A Fixedpoint Approach to Implementing (Co)Inductive
754 @InProceedings{paulson-COLOG,
755 author = {Lawrence C. Paulson},
756 title = {A Formulation of the Simple Theory of Types (for
759 crossref = {colog88},
760 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
762 @Article{paulson-coind,
763 author = {Lawrence C. Paulson},
764 title = {Mechanizing Coinduction and Corecursion in Higher-Order
773 @manual{isabelle-ref,
774 author = {Lawrence C. Paulson},
775 title = {The {Isabelle} Reference Manual},
777 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
780 author = {Lawrence C. Paulson},
781 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
783 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
785 @article{paulson-found,
786 author = {Lawrence C. Paulson},
787 title = {The Foundation of a Generic Theorem Prover},
793 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
795 %replaces paulson-final
796 @Article{paulson-mscs,
797 author = {Lawrence C. Paulson},
798 title = {Final Coalgebras as Greatest Fixed Points
800 journal = {Mathematical Structures in Computer Science},
805 @InCollection{paulson-generic,
806 author = {Lawrence C. Paulson},
807 title = {Generic Automatic Proof Tools},
808 crossref = {wos-fest},
812 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
813 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
822 @InCollection{paulson-handbook,
823 author = {Lawrence C. Paulson},
824 title = {Designing a Theorem Prover},
825 crossref = {handbk-lics2},
828 @Book{paulson-isa-book,
829 author = {Lawrence C. Paulson},
830 title = {Isabelle: A Generic Theorem Prover},
831 publisher = {Springer},
835 @InCollection{paulson-markt,
836 author = {Lawrence C. Paulson},
837 title = {Tool Support for Logics of Programs},
838 booktitle = {Mathematical Methods in Program Development:
839 Summer School Marktoberdorf 1996},
840 publisher = {Springer},
842 year = {Published 1997},
843 editor = {Manfred Broy},
844 series = {NATO ASI Series F}}
846 %replaces Paulson-ML and paulson91
848 author = {Lawrence C. Paulson},
849 title = {{ML} for the Working Programmer},
854 @article{paulson-natural,
855 author = {Lawrence C. Paulson},
856 title = {Natural Deduction as Higher-order Resolution},
861 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
863 @Article{paulson-set-I,
864 author = {Lawrence C. Paulson},
865 title = {Set Theory for Verification: {I}. {From}
866 Foundations to Functions},
872 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
874 @Article{paulson-set-II,
875 author = {Lawrence C. Paulson},
876 title = {Set Theory for Verification: {II}. {Induction} and
883 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
886 author = {Lawrence C. Paulson},
887 title = {Verifying the Unification Algorithm in {LCF}},
893 %replaces Paulson-LCF
895 author = {Lawrence C. Paulson},
896 title = {Logic and Computation: Interactive proof with Cambridge
901 @incollection{paulson700,
902 author = {Lawrence C. Paulson},
903 title = {{Isabelle}: The Next 700 Theorem Provers},
904 crossref = {odifreddi90},
906 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
908 % replaces paulson-ns and paulson-security
909 @Article{paulson-jcs,
910 author = {Lawrence C. Paulson},
911 title = {The Inductive Approach to Verifying Cryptographic Protocols},
917 @Article{paulson-tls,
918 author = {Lawrence C. Paulson},
919 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
927 @Article{paulson-yahalom,
928 author = {Lawrence C. Paulson},
929 title = {Relations Between Secrets:
930 Two Formal Analyses of the {Yahalom} Protocol},
934 @article{pelletier86,
935 author = {F. J. Pelletier},
936 title = {Seventy-five Problems for Testing Automatic Theorem
942 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
945 author = {Andrew M. Pitts},
946 title = {A Co-induction Principle for Recursively Defined Domains},
953 author = {David A. Plaisted},
954 title = {A Sequent-Style Model Elimination Strategy and a Positive
965 author = {Art Quaife},
966 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
976 @TechReport{rasmussen95,
977 author = {Ole Rasmussen},
978 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
980 institution = {Computer Laboratory, University of Cambridge},
984 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
987 author = {Steve Reeves and Michael Clarke},
988 title = {Logic for Computer Science},
989 publisher = {Addison-Wesley},
992 @book{Rosen-DMA,author={Kenneth H. Rosen},
993 title={Discrete Mathematics and Its Applications},
994 publisher={McGraw-Hill},year=1998}
996 @InProceedings{Rudnicki:1992:MizarOverview,
997 author = {P. Rudnicki},
998 title = {An Overview of the {MIZAR} Project},
999 booktitle = {1992 Workshop on Types for Proofs and Programs},
1001 organization = {Chalmers University of Technology},
1002 publisher = {Bastad}
1007 @inproceedings{saaltink-fme,
1008 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
1009 Dan Craigen and Irwin Meisels},
1010 title = {An {EVES} Data Abstraction Example},
1014 @inproceedings{slind-tfl,
1015 author = {Konrad Slind},
1016 title = {Function Definition in Higher Order Logic},
1017 booktitle = {Theorem Proving in Higher Order Logics},
1018 editor = {J. von Wright and J. Grundy and J. Harrison},
1019 publisher = Springer,
1026 author = {Patrick Suppes},
1027 title = {Axiomatic Set Theory},
1029 publisher = {Dover}}
1031 @InCollection{szasz93,
1032 author = {Nora Szasz},
1033 title = {A Machine Checked Proof that {Ackermann's} Function is not
1034 Primitive Recursive},
1035 crossref = {huet-plotkin93},
1038 @TechReport{Syme:1997:DECLARE,
1040 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1041 institution = {University of Cambridge Computer Laboratory},
1046 @PhdThesis{Syme:1998:thesis,
1048 title = {Declarative Theorem Proving for Operational Semantics},
1049 school = {University of Cambridge},
1054 @InProceedings{Syme:1999:TPHOL,
1056 title = {Three Tactic Theorem Proving},
1057 crossref = {tphols99}}
1062 author = {G. Takeuti},
1063 title = {Proof Theory},
1069 author = {Simon Thompson},
1070 title = {Type Theory and Functional Programming},
1071 publisher = {Addison-Wesley},
1074 @book{Thompson-Haskell,author={Simon Thompson},
1075 title={Haskell: The Craft of Functional Programming},
1076 publisher={Addison-Wesley},year=1999}
1078 @Unpublished{Trybulec:1993:MizarFeatures,
1079 author = {A. Trybulec},
1080 title = {Some Features of the {Mizar} Language},
1081 note = {Presented at a workshop in Turin, Italy},
1087 @Unpublished{voelker94,
1088 author = {Norbert V{\"o}lker},
1089 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1090 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1097 author = {Christoph Wedler},
1098 title = {Emacs package ``{X-Symbol}''},
1099 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1102 @manual{isabelle-sys,
1103 author = {Markus Wenzel and Stefan Berghofer},
1104 title = {The {Isabelle} System Manual},
1105 institution = {TU Munich},
1106 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1108 @manual{isabelle-isar-ref,
1109 author = {Markus Wenzel},
1110 title = {The {Isabelle/Isar} Reference Manual},
1111 institution = {TU Munich},
1112 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1114 @manual{isabelle-axclass,
1115 author = {Markus Wenzel},
1116 title = {Using Axiomatic Type Classes in {I}sabelle},
1117 institution = {TU Munich},
1119 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1122 @InProceedings{Wenzel:1999:TPHOL,
1123 author = {Markus Wenzel},
1124 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1125 crossref = {tphols99}}
1127 @InProceedings{Wenzel:1997:TPHOL,
1128 author = {Markus Wenzel},
1129 title = {Type Classes and Overloading in Higher-Order Logic},
1130 crossref = {tphols97}}
1135 author = {A. N. Whitehead and B. Russell},
1136 title = {Principia Mathematica},
1139 note = {Paperback edition to *56,
1140 abridged from the 2nd edition (1927)}}
1142 @Misc{Wiedijk:1999:Mizar,
1143 author = {Freek Wiedijk},
1144 title = {Mizar: An Impression},
1145 howpublished = {Unpublished paper},
1147 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1150 @Misc{Wiedijk:2000:MV,
1151 author = {Freek Wiedijk},
1152 title = {The Mathematical Vernacular},
1153 howpublished = {Unpublished paper},
1155 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1159 author = {Glynn Winskel},
1160 title = {The Formal Semantics of Programming Languages},
1161 publisher = MIT,year=1993}
1163 @InCollection{wos-bledsoe,
1164 author = {Larry Wos},
1165 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1166 crossref = {bledsoe-fest},
1169 @InProceedings{Zammit:1999:TPHOL,
1170 author = {Vincent Zammit},
1171 title = {On the Implementation of an Extensible Declarative Proof Language},
1172 crossref = {tphols99}}
1180 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1181 title = {Handbook of Logic in Computer Science},
1182 booktitle = {Handbook of Logic in Computer Science},
1183 publisher = {Oxford University Press},
1188 editor = {Henk Barendregt and Tobias Nipkow},
1189 title = TYPES # {: International Workshop {TYPES '93}},
1190 booktitle = TYPES # {: International Workshop {TYPES '93}},
1191 year = {published 1994},
1192 publisher = {Springer},
1193 series = {LNCS 806}}
1195 @book{barwise-handbk,
1196 editor = {J. Barwise},
1197 title = {Handbook of Mathematical Logic},
1198 booktitle = {Handbook of Mathematical Logic},
1202 @Proceedings{tlca93,
1203 title = {Typed Lambda Calculi and Applications},
1204 booktitle = {Typed Lambda Calculi and Applications},
1205 editor = {M. Bezem and J.F. Groote},
1207 publisher = {Springer},
1208 series = {LNCS 664}}
1211 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1212 title = {Current Trends in Hardware Verification and Automated
1214 booktitle = {Current Trends in Hardware Verification and Automated
1216 publisher = {Springer},
1220 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1221 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1222 publisher = {Kluwer Academic Publishers},
1224 editor = {Robert S. Boyer}}
1226 @Proceedings{cade12,
1227 editor = {Alan Bundy},
1228 title = {Automated Deduction --- {CADE}-12
1229 International Conference},
1230 booktitle = {Automated Deduction --- {CADE}-12
1231 International Conference},
1233 series = {LNAI 814},
1234 publisher = {Springer}}
1237 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1238 title = TYPES # {: International Workshop {TYPES '94}},
1239 booktitle = TYPES # {: International Workshop {TYPES '94}},
1241 publisher = {Springer},
1242 series = {LNCS 996}}
1244 @book{huet-plotkin91,
1245 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1246 title = {Logical Frameworks},
1247 booktitle = {Logical Frameworks},
1251 @book{huet-plotkin93,
1252 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1253 title = {Logical Environments},
1254 booktitle = {Logical Environments},
1259 editor = {J. Joyce and C. Seger},
1260 title = {Higher Order Logic Theorem Proving and Its
1261 Applications: HUG '93},
1262 booktitle = {Higher Order Logic Theorem Proving and Its
1263 Applications: HUG '93},
1264 year = {Published 1994},
1265 publisher = {Springer},
1266 series = {LNCS 780}}
1268 @proceedings{colog88,
1269 editor = {P. Martin-L{\"o}f and G. Mints},
1270 title = {COLOG-88: International Conference on Computer Logic},
1271 booktitle = {COLOG-88: International Conference on Computer Logic},
1272 year = {Published 1990},
1273 publisher = {Springer},
1274 organization = {Estonian Academy of Sciences},
1275 address = {Tallinn},
1276 series = {LNCS 417}}
1279 editor = {P. Odifreddi},
1280 title = {Logic and Computer Science},
1281 booktitle = {Logic and Computer Science},
1282 publisher = {Academic Press},
1285 @proceedings{extensions91,
1286 editor = {Peter Schroeder-Heister},
1287 title = {Extensions of Logic Programming},
1288 booktitle = {Extensions of Logic Programming},
1290 series = {LNAI 475},
1291 publisher = {Springer}}
1293 @proceedings{cade10,
1294 editor = {Mark E. Stickel},
1295 title = {10th } # CADE,
1296 booktitle = {10th } # CADE,
1298 publisher = {Springer},
1299 series = {LNAI 449}}
1302 editor = {M. Vardi},
1303 title = {Eighth Annual Symposium on Logic in Computer Science},
1304 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1309 title = {Automated Reasoning and its Applications:
1310 Essays in Honor of {Larry Wos}},
1311 booktitle = {Automated Reasoning and its Applications:
1312 Essays in Honor of {Larry Wos}},
1313 publisher = {MIT Press},
1315 editor = {Robert Veroff}}
1318 editor = {J. C. P. Woodcock and P. G. Larsen},
1319 title = {FME '93: Industrial-Strength Formal Methods},
1320 booktitle = {FME '93: Industrial-Strength Formal Methods},
1322 publisher = {Springer},
1323 series = {LNCS 670}}
1325 @Proceedings{tphols96,
1326 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1327 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1328 editor = {J. von Wright and J. Grundy and J. Harrison},
1329 series = {LNCS 1125},
1332 @Proceedings{tphols97,
1333 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1334 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1335 editor = {Elsa L. Gunter and Amy Felty},
1336 series = {LNCS 1275},
1339 @Proceedings{tphols98,
1340 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1341 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1342 editor = {Jim Grundy and Malcom Newey},
1343 series = {LNCS 1479},
1346 @Proceedings{tphols99,
1347 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1348 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1349 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1350 Paulin, C. and Thery, L.},
1351 series = {LNCS 1690},
1354 @PROCEEDINGS{tphols2000,
1355 editor = "J. Harrison and M. Aagaard",
1356 booktitle = "Theorem Proving in Higher Order Logics:
1357 13th International Conference, TPHOLs 2000",
1358 series = "Lecture Notes in Computer Science",
1361 publisher = "Springer-Verlag"}