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-Wenzel:1999:TPHOL,
141 author = {Stefan Berghofer and Markus Wenzel},
142 title = {Inductive datatypes in {HOL} --- lessons learned in
143 {F}ormal-{L}ogic {E}ngineering},
144 crossref = {tphols99}}
146 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
147 title="Introduction to Functional Programming",publisher=PH,year=1988}
149 @book{Bird-Haskell,author="Richard Bird",
150 title="Introduction to Functional Programming using Haskell",
151 publisher=PH,year=1998}
154 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
155 Overbeek and Mark Stickel and Lawrence Wos},
156 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
165 author = {Robert S. Boyer and J Strother Moore},
166 title = {A Computational Logic},
167 publisher = {Academic Press},
171 author = {Robert S. Boyer and J Strother Moore},
172 title = {A Computational Logic Handbook},
173 publisher = {Academic Press},
177 author = {N. G. de Bruijn},
178 title = {Lambda Calculus Notation with Nameless Dummies,
179 a Tool for Automatic Formula Manipulation,
180 with Application to the {Church-Rosser Theorem}},
181 journal = {Indag. Math.},
187 author = {M. Burrows and M. Abadi and R. M. Needham},
188 title = {A Logic of Authentication},
196 @TechReport{camilleri92,
197 author = {J. Camilleri and T. F. Melham},
198 title = {Reasoning with Inductively Defined Relations in the
199 {HOL} Theorem Prover},
206 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
207 title = {Artificial Intelligence Programming},
208 publisher = {Lawrence Erlbaum Associates},
212 author = "Alonzo Church",
213 title = "A Formulation of the Simple Theory of Types",
219 @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",
220 title="Model Checking",publisher=MIT,year=1999}
223 author = {Martin D. Coen},
224 title = {Interactive Program Derivation},
225 school = {University of Cambridge},
226 note = {Computer Laboratory Technical Report 272},
231 author = {R. L. Constable and others},
232 title = {Implementing Mathematics with the Nuprl Proof
234 publisher = Prentice,
239 @Book{davey-priestley,
240 author = {B. A. Davey and H. A. Priestley},
241 title = {Introduction to Lattices and Order},
246 author = {Keith J. Devlin},
247 title = {Fundamentals of Contemporary Set Theory},
248 publisher = {Springer},
252 author = {Michael Dummett},
253 title = {Elements of Intuitionism},
255 publisher = {Oxford University Press}}
257 @incollection{dybjer91,
258 author = {Peter Dybjer},
259 title = {Inductive Sets and Families in {Martin-L{\"o}f's} Type
260 Theory and Their Set-Theoretic Semantics},
261 crossref = {huet-plotkin91},
265 author = {Roy Dyckhoff},
266 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
276 author = {William M. Farmer and Joshua D. Guttman and F. Javier
278 title = {{IMPS}: An Interactive Mathematical Proof System},
285 @InProceedings{felty91a,
286 Author = {Amy Felty},
287 Title = {A Logic Program for Transforming Sequent Proofs to Natural
289 crossref = {extensions91},
292 @Article{fleuriot-jcm,
293 author = {Jacques Fleuriot and Lawrence C. Paulson},
294 title = {Mechanizing Nonstandard Real Analysis},
295 journal = {LMS Journal of Computation and Mathematics},
299 note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}
303 author = {Jacob Frost},
304 title = {A Case Study of Co-induction in {Isabelle HOL}},
310 %revised version of frost93
312 author = {Jacob Frost},
313 title = {A Case Study of Co-induction in {Isabelle}},
320 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
322 title = {Principles of {OBJ2}},
330 author = {J. H. Gallier},
331 title = {Logic for Computer Science:
332 Foundations of Automatic Theorem Proving},
334 publisher = {Harper \& Row}}
337 author = {Antony Galton},
338 title = {Logic for Information Technology},
342 @InProceedings{gimenez-codifying,
343 author = {Eduardo Gim{\'e}nez},
344 title = {Codifying Guarded Definitions with Recursive Schemes},
345 crossref = {types94},
350 author = {Jean-Yves Girard},
351 title = {Proofs and Types},
354 note = {Translated by Yves LaFont and Paul Taylor}}
357 editor = {M. J. C. Gordon and T. F. Melham},
358 title = {Introduction to {HOL}: A Theorem Proving Environment for
364 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
366 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
368 publisher = {Springer},
371 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
372 title={Why we can't have {SML} style datatype declarations in {HOL}},
373 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
374 IFIP TC10/WG10.2 Intl. Workshop, 1992},
375 editor={L.J.M. Claesen and M.J.C. Gordon},
376 publisher=NH,year=1993,pages={561--568}}
378 @InProceedings{gunter-trees,
379 author = {Elsa L. Gunter},
380 title = {A Broader Class of Trees for Recursive Type Definitions for
388 author = {Paul R. Halmos},
389 title = {Naive Set Theory},
390 publisher = {Van Nostrand},
393 @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},
394 title={Dynamic Logic},publisher=MIT,year=2000}
397 author = {Matthew Hennessy},
398 title = {The Semantics of Programming Languages: An Elementary
399 Introduction Using Structural Operational Semantics},
403 @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},
404 title={Introduction to Automata Theory, Languages, and Computation.},
405 publisher={Addison-Wesley},year=1979}
407 @Article{haskell-report,
408 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
409 title = {Report on the Programming Language {Haskell}: A
410 Non-strict, Purely Functional Language},
416 note = {Version 1.2}}
418 @Article{haskell-tutorial,
419 author = {Paul Hudak and Joseph H. Fasel},
420 title = {A Gentle Introduction to {Haskell}},
427 @book{Hudak-Haskell,author={Paul Hudak},
428 title={The Haskell School of Expression},publisher=CUP,year=2000}
431 author = {G. P. Huet},
432 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
439 author = {G. P. Huet and B. Lang},
440 title = {Proving and Applying Program Transformations Expressed with
441 Second-Order Patterns},
447 @inproceedings{huet88,
448 author = {G{\'e}rard Huet},
449 title = {Induction Principles Formalized in the {Calculus of
451 booktitle = {Programming of Future Generation Computers},
452 editor = {K. Fuchi and M. Nivat},
455 publisher = {Elsevier}}
457 @Book{Huth-Ryan-book,
458 author = {Michael Huth and Mark Ryan},
459 title = {Logic in Computer Science. Modelling and reasoning about systems},
463 @InProceedings{Harrison:1996:MizarHOL,
464 author = {J. Harrison},
465 title = {A {Mizar} Mode for {HOL}},
467 crossref = {tphols96}}
471 @InProceedings{kammueller-locales,
472 author = {Florian Kamm{\"u}ller and Markus Wenzel and
473 Lawrence C. Paulson},
474 title = {Locales: A Sectioning Concept for {Isabelle}},
475 crossref = {tphols99}}
478 author={Donald E. Knuth},
479 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
480 publisher={Addison-Wesley},
484 author = {R. E. Korf},
485 title = {Depth-First Iterative-Deepening: an Optimal Admissible
493 author = {Kenneth Kunen},
494 title = {Set Theory: An Introduction to Independence Proofs},
500 @InProceedings{lowe-fdr,
501 author = {Gavin Lowe},
502 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key
503 Protocol using {CSP} and {FDR}},
504 booktitle = {Tools and Algorithms for the Construction and Analysis
505 of Systems: second international workshop, TACAS '96},
506 editor = {T. Margaria and B. Steffen},
507 series = {LNCS 1055},
509 publisher = {Springer},
516 author = {Zohar Manna and Richard Waldinger},
517 title = {Deductive Synthesis of the Unification Algorithm},
524 @InProceedings{martin-nipkow,
525 author = {Ursula Martin and Tobias Nipkow},
526 title = {Ordered Rewriting and Confluence},
531 author = {Per Martin-L{\"o}f},
532 title = {Intuitionistic type theory},
534 publisher = {Bibliopolis}}
536 @incollection{melham89,
537 author = {Thomas F. Melham},
538 title = {Automating Recursive Type Definitions in Higher Order
541 crossref = {birtwistle89}}
543 @Article{miller-mixed,
544 Author = {Dale Miller},
545 Title = {Unification Under a Mixed Prefix},
553 author = {Robin Milner},
554 title = {A Theory of Type Polymorphism in Programming},
555 journal = "J. Comp.\ Sys.\ Sci.",
560 @TechReport{milner-ind,
561 author = {Robin Milner},
562 title = {How to Derive Inductions in {LCF}},
563 institution = Edinburgh,
567 @Article{milner-coind,
568 author = {Robin Milner and Mads Tofte},
569 title = {Co-induction in Relational Semantics},
576 author = {Robin Milner},
577 title = {Communication and Concurrency},
578 publisher = Prentice,
581 @book{SML,author="Robin Milner and Mads Tofte and Robert Harper",
582 title="The Definition of Standard ML",publisher=MIT,year=1990}
584 @PhdThesis{monahan84,
585 author = {Brian Q. Monahan},
586 title = {Data Type Proofs using Edinburgh {LCF}},
587 school = {University of Edinburgh},
590 @article{MuellerNvOS99,
592 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oskar Slotosch},
593 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}
595 @Manual{Muzalewski:Mizar,
596 title = {An Outline of {PC} {Mizar}},
597 author = {Micha{\l} Muzalewski},
598 organization = {Fondation of Logic, Mathematics and Informatics
599 --- Mizar Users Group},
601 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}
606 @InProceedings{NaraschewskiW-TPHOLs98,
607 author = {Wolfgang Naraschewski and Markus Wenzel},
609 {Object-Oriented Verification based on Record Subtyping in
611 crossref = {tphols98}}
613 @inproceedings{nazareth-nipkow,
614 author = {Dieter Nazareth and Tobias Nipkow},
615 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
616 crossref = {tphols96},
620 @Article{needham-schroeder,
621 author = "Roger M. Needham and Michael D. Schroeder",
622 title = "Using Encryption for Authentication in Large Networks
631 @inproceedings{nipkow-W,
632 author = {Wolfgang Naraschewski and Tobias Nipkow},
633 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
634 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
635 editor = {E. Gim{\'e}nez and C. Paulin-Mohring},
636 publisher = Springer,
642 @InCollection{nipkow-sorts93,
643 author = {T. Nipkow},
644 title = {Order-Sorted Polymorphism in {Isabelle}},
645 booktitle = {Logical Environments},
648 editor = {G. Huet and G. Plotkin},
652 @Misc{nipkow-types93,
653 author = {Tobias Nipkow},
654 title = {Axiomatic Type Classes (in {I}sabelle)},
655 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
659 @inproceedings{Nipkow-CR,
660 author = {Tobias Nipkow},
661 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
662 booktitle = {Automated Deduction --- CADE-13},
663 editor = {M. McRobbie and J.K. Slaney},
664 publisher = Springer,
671 @InProceedings{nipkow-patterns,
672 title = {Functional Unification of Higher-Order Patterns},
673 author = {Tobias Nipkow},
676 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
677 keywords = {unification}}
680 author = {Tobias Nipkow},
681 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
687 @manual{isabelle-HOL,
688 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
689 title = {{Isabelle}'s Logics: {HOL}},
690 institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t
691 M{\"u}nchen and Computer Laboratory, University of Cambridge},
692 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
694 @article{nipkow-prehofer,
695 author = {Tobias Nipkow and Christian Prehofer},
696 title = {Type Reconstruction for Type Classes},
704 author = {Philippe No{\"e}l},
705 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
713 author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},
714 title = {Programming in {Martin-L{\"o}f}'s Type Theory. An
716 publisher = {Oxford University Press},
721 @Manual{pvs-language,
722 title = {The {PVS} specification language},
723 author = {S. Owre and N. Shankar and J. M. Rushby},
724 organization = {Computer Science Laboratory, SRI International},
725 address = {Menlo Park, CA},
726 note = {Beta release},
729 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
734 @InProceedings{paulin-tlca,
735 author = {Christine Paulin-Mohring},
736 title = {Inductive Definitions in the System {Coq}: Rules and
741 @InProceedings{paulson-CADE,
742 author = {Lawrence C. Paulson},
743 title = {A Fixedpoint Approach to Implementing (Co)Inductive
748 @InProceedings{paulson-COLOG,
749 author = {Lawrence C. Paulson},
750 title = {A Formulation of the Simple Theory of Types (for
753 crossref = {colog88},
754 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
756 @Article{paulson-coind,
757 author = {Lawrence C. Paulson},
758 title = {Mechanizing Coinduction and Corecursion in Higher-Order
767 @manual{isabelle-ref,
768 author = {Lawrence C. Paulson},
769 title = {The {Isabelle} Reference Manual},
771 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
774 author = {Lawrence C. Paulson},
775 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
777 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
779 @article{paulson-found,
780 author = {Lawrence C. Paulson},
781 title = {The Foundation of a Generic Theorem Prover},
787 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
789 %replaces paulson-final
790 @Article{paulson-mscs,
791 author = {Lawrence C. Paulson},
792 title = {Final Coalgebras as Greatest Fixed Points
794 journal = {Mathematical Structures in Computer Science},
799 @InCollection{paulson-generic,
800 author = {Lawrence C. Paulson},
801 title = {Generic Automatic Proof Tools},
802 crossref = {wos-fest},
806 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
807 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
816 @InCollection{paulson-handbook,
817 author = {Lawrence C. Paulson},
818 title = {Designing a Theorem Prover},
819 crossref = {handbk-lics2},
822 @Book{paulson-isa-book,
823 author = {Lawrence C. Paulson},
824 title = {Isabelle: A Generic Theorem Prover},
825 publisher = {Springer},
829 @InCollection{paulson-markt,
830 author = {Lawrence C. Paulson},
831 title = {Tool Support for Logics of Programs},
832 booktitle = {Mathematical Methods in Program Development:
833 Summer School Marktoberdorf 1996},
834 publisher = {Springer},
836 year = {Published 1997},
837 editor = {Manfred Broy},
838 series = {NATO ASI Series F}}
840 %replaces Paulson-ML and paulson91
842 author = {Lawrence C. Paulson},
843 title = {{ML} for the Working Programmer},
848 @article{paulson-natural,
849 author = {Lawrence C. Paulson},
850 title = {Natural Deduction as Higher-order Resolution},
855 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
857 @Article{paulson-set-I,
858 author = {Lawrence C. Paulson},
859 title = {Set Theory for Verification: {I}. {From}
860 Foundations to Functions},
866 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
868 @Article{paulson-set-II,
869 author = {Lawrence C. Paulson},
870 title = {Set Theory for Verification: {II}. {Induction} and
877 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
880 author = {Lawrence C. Paulson},
881 title = {Verifying the Unification Algorithm in {LCF}},
887 %replqces Paulson-LCF
889 author = {Lawrence C. Paulson},
890 title = {Logic and Computation: Interactive proof with Cambridge
895 @incollection{paulson700,
896 author = {Lawrence C. Paulson},
897 title = {{Isabelle}: The Next 700 Theorem Provers},
898 crossref = {odifreddi90},
900 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
902 % replaces paulson-ns and paulson-security
903 @Article{paulson-jcs,
904 author = {Lawrence C. Paulson},
905 title = {The Inductive Approach to Verifying Cryptographic Protocols},
911 @Article{paulson-tls,
912 author = {Lawrence C. Paulson},
913 title = {Inductive Analysis of the {Internet} Protocol {TLS}},
922 @article{pelletier86,
923 author = {F. J. Pelletier},
924 title = {Seventy-five Problems for Testing Automatic Theorem
930 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
933 author = {Andrew M. Pitts},
934 title = {A Co-induction Principle for Recursively Defined Domains},
941 author = {David A. Plaisted},
942 title = {A Sequent-Style Model Elimination Strategy and a Positive
953 author = {Art Quaife},
954 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
964 @TechReport{rasmussen95,
965 author = {Ole Rasmussen},
966 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
968 institution = {Computer Laboratory, University of Cambridge},
972 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
975 author = {Steve Reeves and Michael Clarke},
976 title = {Logic for Computer Science},
977 publisher = {Addison-Wesley},
980 @book{Rosen-DMA,author={Kenneth H. Rosen},
981 title={Discrete Mathematics and Its Applications},
982 publisher={McGraw-Hill},year=1998}
984 @InProceedings{Rudnicki:1992:MizarOverview,
985 author = {P. Rudnicki},
986 title = {An Overview of the {MIZAR} Project},
987 booktitle = {1992 Workshop on Types for Proofs and Programs},
989 organization = {Chalmers University of Technology},
995 @inproceedings{saaltink-fme,
996 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
997 Dan Craigen and Irwin Meisels},
998 title = {An {EVES} Data Abstraction Example},
1002 @inproceedings{slind-tfl,
1003 author = {Konrad Slind},
1004 title = {Function Definition in Higher Order Logic},
1005 booktitle = {Theorem Proving in Higher Order Logics},
1006 editor = {J. von Wright and J. Grundy and J. Harrison},
1007 publisher = Springer,
1014 author = {Patrick Suppes},
1015 title = {Axiomatic Set Theory},
1017 publisher = {Dover}}
1019 @InCollection{szasz93,
1020 author = {Nora Szasz},
1021 title = {A Machine Checked Proof that {Ackermann's} Function is not
1022 Primitive Recursive},
1023 crossref = {huet-plotkin93},
1026 @TechReport{Syme:1997:DECLARE,
1028 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
1029 institution = {University of Cambridge Computer Laboratory},
1034 @PhdThesis{Syme:1998:thesis,
1036 title = {Declarative Theorem Proving for Operational Semantics},
1037 school = {University of Cambridge},
1042 @InProceedings{Syme:1999:TPHOL,
1044 title = {Three Tactic Theorem Proving},
1045 crossref = {tphols99}}
1050 author = {G. Takeuti},
1051 title = {Proof Theory},
1057 author = {Simon Thompson},
1058 title = {Type Theory and Functional Programming},
1059 publisher = {Addison-Wesley},
1062 @book{Thompson-Haskell,author={Simon Thompson},
1063 title={Haskell: The Craft of Functional Programming},
1064 publisher={Addison-Wesley},year=1999}
1066 @Unpublished{Trybulec:1993:MizarFeatures,
1067 author = {A. Trybulec},
1068 title = {Some Features of the {Mizar} Language},
1069 note = {Presented at a workshop in Turin, Italy},
1075 @Unpublished{voelker94,
1076 author = {Norbert V{\"o}lker},
1077 title = {The Verification of a Timer Program using {Isabelle/HOL}},
1078 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
1085 author = {Christoph Wedler},
1086 title = {Emacs package ``{X-Symbol}''},
1087 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
1090 @manual{isabelle-sys,
1091 author = {Markus Wenzel and Stefan Berghofer},
1092 title = {The {Isabelle} System Manual},
1093 institution = {TU Munich},
1094 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
1096 @manual{isabelle-isar-ref,
1097 author = {Markus Wenzel},
1098 title = {The {Isabelle/Isar} Reference Manual},
1099 institution = {TU Munich},
1100 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
1102 @manual{isabelle-axclass,
1103 author = {Markus Wenzel},
1104 title = {Using Axiomatic Type Classes in {I}sabelle},
1105 institution = {TU Munich},
1107 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
1110 @InProceedings{Wenzel:1999:TPHOL,
1111 author = {Markus Wenzel},
1112 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
1113 crossref = {tphols99}}
1115 @InProceedings{Wenzel:1997:TPHOL,
1116 author = {Markus Wenzel},
1117 title = {Type Classes and Overloading in Higher-Order Logic},
1118 crossref = {tphols97}}
1123 author = {A. N. Whitehead and B. Russell},
1124 title = {Principia Mathematica},
1127 note = {Paperback edition to *56,
1128 abridged from the 2nd edition (1927)}}
1130 @Misc{Wiedijk:1999:Mizar,
1131 author = {Freek Wiedijk},
1132 title = {Mizar: An Impression},
1133 howpublished = {Unpublished paper},
1135 note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}}
1138 @Misc{Wiedijk:2000:MV,
1139 author = {Freek Wiedijk},
1140 title = {The Mathematical Vernacular},
1141 howpublished = {Unpublished paper},
1143 note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}}
1147 author = {Glynn Winskel},
1148 title = {The Formal Semantics of Programming Languages},
1149 publisher = MIT,year=1993}
1151 @InCollection{wos-bledsoe,
1152 author = {Larry Wos},
1153 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1154 crossref = {bledsoe-fest},
1157 @InProceedings{Zammit:1999:TPHOL,
1158 author = {Vincent Zammit},
1159 title = {On the Implementation of an Extensible Declarative Proof Language},
1160 crossref = {tphols99}}
1168 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1169 title = {Handbook of Logic in Computer Science},
1170 booktitle = {Handbook of Logic in Computer Science},
1171 publisher = {Oxford University Press},
1176 editor = {Henk Barendregt and Tobias Nipkow},
1177 title = TYPES # {: International Workshop {TYPES '93}},
1178 booktitle = TYPES # {: International Workshop {TYPES '93}},
1179 year = {published 1994},
1180 publisher = {Springer},
1181 series = {LNCS 806}}
1183 @book{barwise-handbk,
1184 editor = {J. Barwise},
1185 title = {Handbook of Mathematical Logic},
1186 booktitle = {Handbook of Mathematical Logic},
1190 @Proceedings{tlca93,
1191 title = {Typed Lambda Calculi and Applications},
1192 booktitle = {Typed Lambda Calculi and Applications},
1193 editor = {M. Bezem and J.F. Groote},
1195 publisher = {Springer},
1196 series = {LNCS 664}}
1199 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1200 title = {Current Trends in Hardware Verification and Automated
1202 booktitle = {Current Trends in Hardware Verification and Automated
1204 publisher = {Springer},
1208 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1209 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1210 publisher = {Kluwer Academic Publishers},
1212 editor = {Robert S. Boyer}}
1214 @Proceedings{cade12,
1215 editor = {Alan Bundy},
1216 title = {Automated Deduction --- {CADE}-12
1217 International Conference},
1218 booktitle = {Automated Deduction --- {CADE}-12
1219 International Conference},
1221 series = {LNAI 814},
1222 publisher = {Springer}}
1225 editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} and Jan Smith},
1226 title = TYPES # {: International Workshop {TYPES '94}},
1227 booktitle = TYPES # {: International Workshop {TYPES '94}},
1229 publisher = {Springer},
1230 series = {LNCS 996}}
1232 @book{huet-plotkin91,
1233 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1234 title = {Logical Frameworks},
1235 booktitle = {Logical Frameworks},
1239 @book{huet-plotkin93,
1240 editor = {{G{\'e}rard} Huet and Gordon Plotkin},
1241 title = {Logical Environments},
1242 booktitle = {Logical Environments},
1247 editor = {J. Joyce and C. Seger},
1248 title = {Higher Order Logic Theorem Proving and Its
1249 Applications: HUG '93},
1250 booktitle = {Higher Order Logic Theorem Proving and Its
1251 Applications: HUG '93},
1252 year = {Published 1994},
1253 publisher = {Springer},
1254 series = {LNCS 780}}
1256 @proceedings{colog88,
1257 editor = {P. Martin-L{\"o}f and G. Mints},
1258 title = {COLOG-88: International Conference on Computer Logic},
1259 booktitle = {COLOG-88: International Conference on Computer Logic},
1260 year = {Published 1990},
1261 publisher = {Springer},
1262 organization = {Estonian Academy of Sciences},
1263 address = {Tallinn},
1264 series = {LNCS 417}}
1267 editor = {P. Odifreddi},
1268 title = {Logic and Computer Science},
1269 booktitle = {Logic and Computer Science},
1270 publisher = {Academic Press},
1273 @proceedings{extensions91,
1274 editor = {Peter Schroeder-Heister},
1275 title = {Extensions of Logic Programming},
1276 booktitle = {Extensions of Logic Programming},
1278 series = {LNAI 475},
1279 publisher = {Springer}}
1281 @proceedings{cade10,
1282 editor = {Mark E. Stickel},
1283 title = {10th } # CADE,
1284 booktitle = {10th } # CADE,
1286 publisher = {Springer},
1287 series = {LNAI 449}}
1290 editor = {M. Vardi},
1291 title = {Eighth Annual Symposium on Logic in Computer Science},
1292 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1297 title = {Automated Reasoning and its Applications:
1298 Essays in Honor of {Larry Wos}},
1299 booktitle = {Automated Reasoning and its Applications:
1300 Essays in Honor of {Larry Wos}},
1301 publisher = {MIT Press},
1303 editor = {Robert Veroff}}
1306 editor = {J. C. P. Woodcock and P. G. Larsen},
1307 title = {FME '93: Industrial-Strength Formal Methods},
1308 booktitle = {FME '93: Industrial-Strength Formal Methods},
1310 publisher = {Springer},
1311 series = {LNCS 670}}
1313 @Proceedings{tphols96,
1314 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1315 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1316 editor = {J. von Wright and J. Grundy and J. Harrison},
1317 series = {LNCS 1125},
1320 @Proceedings{tphols97,
1321 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1322 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1323 editor = {Elsa L. Gunter and Amy Felty},
1324 series = {LNCS 1275},
1327 @Proceedings{tphols98,
1328 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1329 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1330 editor = {Jim Grundy and Malcom Newey},
1331 series = {LNCS 1479},
1334 @Proceedings{tphols99,
1335 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1336 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1337 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1338 Paulin, C. and Thery, L.},
1339 series = {LNCS 1690},