1 % BibTeX database for the Isabelle documentation
3 % Lawrence C Paulson $Id$
6 @string{AP="Academic Press"}
7 @string{CUP="Cambridge University Press"}
8 @string{IEEE="{\sc ieee} Computer Society Press"}
9 @string{LNCS="Lect.\ Notes in Comp.\ Sci."}
10 @string{MIT="MIT Press"}
11 @string{NH="North-Holland"}
12 @string{Prentice="Prentice-Hall"}
13 @string{Springer="Springer-Verlag"}
16 @string{CUCL="Computer Laboratory, University of Cambridge"}
19 @string{FAC="Formal Aspects Comput."}
20 @string{JAR="J. Auto. Reas."}
21 @string{JCS="J. Comput. Secur."}
22 @string{JFP="J. Func. Prog."}
23 @string{JLC="J. Logic and Comput."}
24 @string{JLP="J. Logic Prog."}
25 @string{JSC="J. Symb. Comput."}
26 @string{JSL="J. Symb. Logic"}
27 @string{SIGPLAN="{SIGPLAN} Notices"}
30 @string{CADE="International Conference on Automated Deduction"}
31 @string{POPL="Symposium on Principles of Programming Languages"}
32 @string{TYPES="Types for Proofs and Programs"}
37 @incollection{abramsky90,
38 author = {Samson Abramsky},
39 title = {The Lazy Lambda Calculus},
41 editor = {David A. Turner},
42 booktitle = {Research Topics in Functional Programming},
43 publisher = {Addison-Wesley},
46 @Unpublished{abrial93,
47 author = {J. R. Abrial and G. Laffitte},
48 title = {Towards the Mechanization of the Proofs of some Classical
49 Theorems of Set Theory},
54 @incollection{aczel77,
55 author = {Peter Aczel},
56 title = {An Introduction to Inductive Definitions},
58 crossref = {barwise-handbk}}
61 author = {Peter Aczel},
62 title = {Non-Well-Founded Sets},
67 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
68 title = {The {ALF} Proof Editor and Its Proof Engine},
73 author = "Peter Andrews",
74 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
77 series = "Computer Science and Applied Mathematics",
82 @incollection{basin91,
83 author = {David Basin and Matt Kaufmann},
84 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
86 crossref = {huet-plotkin91},
90 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
91 Overbeek and Mark Stickel and Lawrence Wos},
92 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
101 author = {Robert S. Boyer and J Strother Moore},
102 title = {A Computational Logic},
103 publisher = {Academic Press},
107 author = {Robert S. Boyer and J Strother Moore},
108 title = {A Computational Logic Handbook},
109 publisher = {Academic Press},
113 author = {N. G. de Bruijn},
114 title = {Lambda Calculus Notation with Nameless Dummies,
115 a Tool for Automatic Formula Manipulation,
116 with Application to the {Church-Rosser Theorem}},
117 journal = {Indag. Math.},
124 @TechReport{camilleri92,
125 author = {J. Camilleri and T. F. Melham},
126 title = {Reasoning with Inductively Defined Relations in the
127 {HOL} Theorem Prover},
134 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
135 title = {Artificial Intelligence Programming},
136 publisher = {Lawrence Erlbaum Associates},
140 author = "Alonzo Church",
141 title = "A Formulation of the Simple Theory of Types",
148 author = {Martin D. Coen},
149 title = {Interactive Program Derivation},
150 school = {University of Cambridge},
151 note = {Computer Laboratory Technical Report 272},
156 author = {R. L. Constable and others},
157 title = {Implementing Mathematics with the Nuprl Proof
159 publisher = Prentice,
164 @Book{davey&priestley,
165 author = {B. A. Davey and H. A. Priestley},
166 title = {Introduction to Lattices and Order},
171 author = {Keith J. Devlin},
172 title = {Fundamentals of Contemporary Set Theory},
173 publisher = {Springer},
177 author = {Michael Dummett},
178 title = {Elements of Intuitionism},
180 publisher = {Oxford University Press}}
182 @incollection{dybjer91,
183 author = {Peter Dybjer},
184 title = {Inductive Sets and Families in {Martin-L\"of's} Type
185 Theory and Their Set-Theoretic Semantics},
186 crossref = {huet-plotkin91},
190 author = {Roy Dyckhoff},
191 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
200 @InProceedings{felty91a,
201 Author = {Amy Felty},
202 Title = {A Logic Program for Transforming Sequent Proofs to Natural
204 crossref = {extensions91},
208 author = {Jacob Frost},
209 title = {A Case Study of Co-induction in {Isabelle HOL}},
215 %revised version of frost93
217 author = {Jacob Frost},
218 title = {A Case Study of Co-induction in {Isabelle}},
225 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
227 title = {Principles of {OBJ2}},
235 author = {J. H. Gallier},
236 title = {Logic for Computer Science:
237 Foundations of Automatic Theorem Proving},
239 publisher = {Harper \& Row}}
242 author = {Antony Galton},
243 title = {Logic for Information Technology},
247 @InProceedings{gimenez-codifying,
248 author = {Eduardo Gim{\'e}nez},
249 title = {Codifying Guarded Definitions with Recursive Schemes},
250 crossref = {types94},
255 author = {M. J. C. Gordon and T. F. Melham},
256 title = {Introduction to {HOL}: A Theorem Proving Environment for
262 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
264 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
266 publisher = {Springer},
269 @InProceedings{gunter-trees,
270 author = {Elsa L. Gunter},
271 title = {A Broader Class of Trees for Recursive Type Definitions for
279 author = {Paul R. Halmos},
280 title = {Naive Set Theory},
281 publisher = {Van Nostrand},
285 author = {Matthew Hennessy},
286 title = {The Semantics of Programming Languages: An Elementary
287 Introduction Using Structural Operational Semantics},
291 @Article{haskell-report,
292 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
293 title = {Report on the Programming Language {Haskell}: A
294 Non-strict, Purely Functional Language},
300 note = {Version 1.2}}
302 @Article{haskell-tutorial,
303 author = {Paul Hudak and Joseph H. Fasel},
304 title = {A Gentle Introduction to {Haskell}},
312 author = {G. P. Huet},
313 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
320 author = {G. P. Huet and B. Lang},
321 title = {Proving and Applying Program Transformations Expressed with
322 Second-Order Patterns},
328 @inproceedings{huet88,
329 author = {G\'erard Huet},
330 title = {Induction Principles Formalized in the {Calculus of
332 booktitle = {Programming of Future Generation Computers},
333 editor = {K. Fuchi and M. Nivat},
336 publisher = {Elsevier}}
341 author = {Kenneth Kunen},
342 title = {Set Theory: An Introduction to Independence Proofs},
349 author = {Zohar Manna and Richard Waldinger},
350 title = {Deductive Synthesis of the Unification Algorithm},
357 @InProceedings{martin-nipkow,
358 author = {Ursula Martin and Tobias Nipkow},
359 title = {Ordered Rewriting and Confluence},
364 author = {Per Martin-L\"of},
365 title = {Intuitionistic type theory},
367 publisher = {Bibliopolis}}
369 @incollection{melham89,
370 author = {Thomas F. Melham},
371 title = {Automating Recursive Type Definitions in Higher Order
374 crossref = {birtwistle89}}
376 @Article{miller-mixed,
377 Author = {Dale Miller},
378 Title = {Unification Under a Mixed Prefix},
386 author = {Robin Milner},
387 title = {A Theory of Type Polymorphism in Programming},
388 journal = "J. Comp.\ Sys.\ Sci.",
393 @TechReport{milner-ind,
394 author = {Robin Milner},
395 title = {How to Derive Inductions in {LCF}},
396 institution = Edinburgh,
400 @Article{milner-coind,
401 author = {Robin Milner and Mads Tofte},
402 title = {Co-induction in Relational Semantics},
409 author = {Robin Milner},
410 title = {Communication and Concurrency},
411 publisher = Prentice,
414 @PhdThesis{monahan84,
415 author = {Brian Q. Monahan},
416 title = {Data Type Proofs using Edinburgh {LCF}},
417 school = {University of Edinburgh},
422 @InProceedings{NaraschewskiW-TPHOLs98,
423 author = {Wolfgang Naraschewski and Markus Wenzel},
425 {Object-Oriented Verification based on Record Subtyping in Higher-Order Logic},
426 booktitle = {Theorem Proving in Higher Order Logics (TPHOLs'98)},
427 publisher = Springer,
432 @inproceedings{nazareth-nipkow,
433 author = {Dieter Nazareth and Tobias Nipkow},
434 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
435 crossref = {tphols96},
439 @inproceedings{nipkow-W,
440 author = {Wolfgang Naraschewski and Tobias Nipkow},
441 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
442 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
443 editor = {E. Gim\'enez and C. Paulin-Mohring},
444 publisher = Springer,
450 @inproceedings{Nipkow-CR,
451 author = {Tobias Nipkow},
452 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
453 booktitle = {Automated Deduction --- CADE-13},
454 editor = {M. McRobbie and J.K. Slaney},
455 publisher = Springer,
462 @InProceedings{nipkow-patterns,
463 title = {Functional Unification of Higher-Order Patterns},
464 author = {Tobias Nipkow},
467 url = {ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html},
468 keywords = {unification}}
471 author = {Tobias Nipkow},
472 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
478 @article{nipkow-prehofer,
479 author = {Tobias Nipkow and Christian Prehofer},
480 title = {Type Reconstruction for Type Classes},
488 author = {Philippe No{\"e}l},
489 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
497 author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},
498 title = {Programming in {Martin-L\"of}'s Type Theory. An
500 publisher = {Oxford University Press},
505 @Manual{pvs-language,
506 title = {The {PVS} specification language},
507 author = {S. Owre and N. Shankar and J. M. Rushby},
508 organization = {Computer Science Laboratory, SRI International},
509 address = {Menlo Park, CA},
510 note = {Beta release},
513 url = {\verb|http://www.csl.sri.com/reports/pvs-language.dvi.Z|}}
518 @InProceedings{paulin-tlca,
519 author = {Christine Paulin-Mohring},
520 title = {Inductive Definitions in the System {Coq}: Rules and
525 @InProceedings{paulson-CADE,
526 author = {Lawrence C. Paulson},
527 title = {A Fixedpoint Approach to Implementing (Co)Inductive
532 @InProceedings{paulson-COLOG,
533 author = {Lawrence C. Paulson},
534 title = {A Formulation of the Simple Theory of Types (for
537 crossref = {colog88},
538 url = {http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}
540 @Article{paulson-coind,
541 author = {Lawrence C. Paulson},
542 title = {Mechanizing Coinduction and Corecursion in Higher-Order
551 @techreport{isabelle-ZF,
552 author = {Lawrence C. Paulson},
553 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
557 @article{paulson-found,
558 author = {Lawrence C. Paulson},
559 title = {The Foundation of a Generic Theorem Prover},
565 url = {http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}
567 %replaces paulson-final
568 @Article{paulson-mscs,
569 author = {Lawrence C. Paulson},
570 title = {Final Coalgebras as Greatest Fixed Points in ZF Set Theory},
571 journal = {Mathematical Structures in Computer Science},
576 @InCollection{paulson-generic,
577 author = {Lawrence C. Paulson},
578 title = {Generic Automatic Proof Tools},
579 crossref = {wos-fest},
583 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
584 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
593 @InCollection{paulson-handbook,
594 author = {Lawrence C. Paulson},
595 title = {Designing a Theorem Prover},
596 crossref = {handbk-lics2},
599 @Book{paulson-isa-book,
600 author = {Lawrence C. Paulson},
601 title = {Isabelle: A Generic Theorem Prover},
602 publisher = {Springer},
606 @InCollection{paulson-markt,
607 author = {Lawrence C. Paulson},
608 title = {Tool Support for Logics of Programs},
609 booktitle = {Mathematical Methods in Program Development:
610 Summer School Marktoberdorf 1996},
611 publisher = {Springer},
613 year = {Published 1997},
614 editor = {Manfred Broy},
615 series = {NATO ASI Series F}}
617 %replaces Paulson-ML and paulson91
619 author = {Lawrence C. Paulson},
620 title = {{ML} for the Working Programmer},
625 @article{paulson-natural,
626 author = {Lawrence C. Paulson},
627 title = {Natural Deduction as Higher-order Resolution},
632 url = {http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}
634 @Article{paulson-set-I,
635 author = {Lawrence C. Paulson},
636 title = {Set Theory for Verification: {I}. {From}
637 Foundations to Functions},
643 url = {ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}
645 @Article{paulson-set-II,
646 author = {Lawrence C. Paulson},
647 title = {Set Theory for Verification: {II}. {Induction} and
654 url = {http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}
657 author = {Lawrence C. Paulson},
658 title = {Verifying the Unification Algorithm in {LCF}},
664 %replqces Paulson-LCF
666 author = {Lawrence C. Paulson},
667 title = {Logic and Computation: Interactive proof with Cambridge
672 @incollection{paulson700,
673 author = {Lawrence C. Paulson},
674 title = {{Isabelle}: The Next 700 Theorem Provers},
675 crossref = {odifreddi90},
677 url = {http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}
679 % replaces paulson-ns and paulson-security
680 @Article{paulson-jcs,
681 author = {Lawrence C. Paulson},
682 title = {The Inductive Approach to Verifying Cryptographic Protocols},
688 @article{pelletier86,
689 author = {F. J. Pelletier},
690 title = {Seventy-five Problems for Testing Automatic Theorem
696 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
699 author = {Andrew M. Pitts},
700 title = {A Co-induction Principle for Recursively Defined Domains},
707 author = {David A. Plaisted},
708 title = {A Sequent-Style Model Elimination Strategy and a Positive
719 author = {Art Quaife},
720 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
730 @TechReport{rasmussen95,
731 author = {Ole Rasmussen},
732 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
734 institution = {Computer Laboratory, University of Cambridge},
738 url = {http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}
741 author = {Steve Reeves and Michael Clarke},
742 title = {Logic for Computer Science},
743 publisher = {Addison-Wesley},
748 @inproceedings{saaltink-fme,
749 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
750 Dan Craigen and Irwin Meisels},
751 title = {An {EVES} Data Abstraction Example},
755 @inproceedings{slind-tfl,
756 author = {Konrad Slind},
757 title = {Function Definition in Higher Order Logic},
758 booktitle = {Theorem Proving in Higher Order Logics},
759 editor = {J. von Wright and J. Grundy and J. Harrison},
760 publisher = Springer,
767 author = {Patrick Suppes},
768 title = {Axiomatic Set Theory},
772 @InCollection{szasz93,
773 author = {Nora Szasz},
774 title = {A Machine Checked Proof that {Ackermann's} Function is not
775 Primitive Recursive},
776 crossref = {huet-plotkin93},
782 author = {G. Takeuti},
783 title = {Proof Theory},
789 author = {Simon Thompson},
790 title = {Type Theory and Functional Programming},
791 publisher = {Addison-Wesley},
796 @Unpublished{voelker94,
797 author = {Norbert V\"olker},
798 title = {The Verification of a Timer Program using {Isabelle/HOL}},
799 url = {ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz},
806 author = {A. N. Whitehead and B. Russell},
807 title = {Principia Mathematica},
810 note = {Paperback edition to *56,
811 abridged from the 2nd edition (1927)}}
814 author = {Glynn Winskel},
815 title = {The Formal Semantics of Programming Languages},
816 publisher = MIT,year=1993}
818 @InCollection{wos-bledsoe,
819 author = {Larry Wos},
820 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
821 crossref = {bledsoe-fest},
828 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
829 title = {Handbook of Logic in Computer Science},
830 booktitle = {Handbook of Logic in Computer Science},
831 publisher = {Oxford University Press},
836 editor = {Henk Barendregt and Tobias Nipkow},
837 title = TYPES # {: International Workshop {TYPES '93}},
838 booktitle = TYPES # {: International Workshop {TYPES '93}},
839 year = {published 1994},
840 publisher = {Springer},
844 title = {Typed Lambda Calculi and Applications},
845 booktitle = {Typed Lambda Calculi and Applications},
846 editor = {M. Bezem and J.F. Groote},
848 publisher = {Springer},
852 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
853 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
854 publisher = {Kluwer Academic Publishers},
856 editor = {Robert S. Boyer}}
859 editor = {Alan Bundy},
860 title = {Automated Deduction --- {CADE}-12
861 International Conference},
862 booktitle = {Automated Deduction --- {CADE}-12
863 International Conference},
866 publisher = {Springer}}
869 editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},
870 title = TYPES # {: International Workshop {TYPES '94}},
871 booktitle = TYPES # {: International Workshop {TYPES '94}},
873 publisher = {Springer},
876 @book{huet-plotkin91,
877 editor = {{G\'erard} Huet and Gordon Plotkin},
878 title = {Logical Frameworks},
879 booktitle = {Logical Frameworks},
883 @proceedings{colog88,
884 editor = {P. Martin-L\"of and G. Mints},
885 title = {COLOG-88: International Conference on Computer Logic},
886 booktitle = {COLOG-88: International Conference on Computer Logic},
887 year = {Published 1990},
888 publisher = {Springer},
889 organization = {Estonian Academy of Sciences},
894 editor = {P. Odifreddi},
895 title = {Logic and Computer Science},
896 booktitle = {Logic and Computer Science},
897 publisher = {Academic Press},
900 @proceedings{extensions91,
901 editor = {Peter Schroeder-Heister},
902 title = {Extensions of Logic Programming},
903 booktitle = {Extensions of Logic Programming},
906 publisher = {Springer}}
909 editor = {Mark E. Stickel},
910 title = {10th } # CADE,
911 booktitle = {10th } # CADE,
913 publisher = {Springer},
918 title = {Eighth Annual Symposium on Logic in Computer Science},
919 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
924 title = {Automated Reasoning and its Applications:
925 Essays in Honor of {Larry Wos}},
926 booktitle = {Automated Reasoning and its Applications:
927 Essays in Honor of {Larry Wos}},
928 publisher = {MIT Press},
930 editor = {Robert Veroff}}
932 @Proceedings{tphols96,
933 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
934 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
935 editor = {J. von Wright and J. Grundy and J. Harrison},
936 series = {LNCS 1125},