1 % BibTeX database for the Isabelle documentation
3 % Lawrence C Paulson $Id$
6 @string{AP="Academic Press"}
7 @string{CUP="Cambridge University Press"}
8 @string{IEEE="{\sc ieee} Computer Society Press"}
9 @string{LNCS="Lect.\ Notes in Comp.\ Sci."}
10 @string{MIT="MIT Press"}
11 @string{NH="North-Holland"}
12 @string{Prentice="Prentice-Hall"}
13 @string{PH="Prentice-Hall"}
14 @string{Springer="Springer-Verlag"}
17 @string{CUCL="Comp. Lab., Univ. Camb."}
18 @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"}
21 @string{AI="Artificial Intelligence"}
22 @string{FAC="Formal Aspects Comput."}
23 @string{JAR="J. Auto. Reas."}
24 @string{JCS="J. Comput. Secur."}
25 @string{JFP="J. Func. Prog."}
26 @string{JLC="J. Logic and Comput."}
27 @string{JLP="J. Logic Prog."}
28 @string{JSC="J. Symb. Comput."}
29 @string{JSL="J. Symb. Logic"}
30 @string{SIGPLAN="{SIGPLAN} Notices"}
33 @string{CADE="International Conference on Automated Deduction"}
34 @string{POPL="Symposium on Principles of Programming Languages"}
35 @string{TYPES="Types for Proofs and Programs"}
40 @incollection{abramsky90,
41 author = {Samson Abramsky},
42 title = {The Lazy Lambda Calculus},
44 editor = {David A. Turner},
45 booktitle = {Research Topics in Functional Programming},
46 publisher = {Addison-Wesley},
49 @Unpublished{abrial93,
50 author = {J. R. Abrial and G. Laffitte},
51 title = {Towards the Mechanization of the Proofs of some Classical
52 Theorems of Set Theory},
57 @incollection{aczel77,
58 author = {Peter Aczel},
59 title = {An Introduction to Inductive Definitions},
61 crossref = {barwise-handbk}}
64 author = {Peter Aczel},
65 title = {Non-Well-Founded Sets},
70 author = {Lena Magnusson and Bengt {Nordstr\"{o}m}},
71 title = {The {ALF} Proof Editor and Its Proof Engine},
76 author = "Peter Andrews",
77 title = "An Introduction to Mathematical Logic and Type Theory: to Truth
80 series = "Computer Science and Applied Mathematics",
83 @InProceedings{Aspinall:TACAS:2000,
84 author = {David Aspinall},
85 title = {Proof General: A Generic Tool for Proof Development},
86 booktitle = {ETAPS / TACAS},
92 author = {David Aspinall},
93 title = {Isamode --- {U}sing {I}sabelle with {E}macs},
94 note = {\url{http://www.dcs.ed.ac.uk/home/da/Isamode/}}
98 author = {David Aspinall and others},
99 title = {{P}roof {G}eneral --- {O}rganize your proofs!},
100 note = {\url{http://www.dcs.ed.ac.uk/home/proofgen/}}
105 @incollection{basin91,
106 author = {David Basin and Matt Kaufmann},
107 title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental
109 crossref = {huet-plotkin91},
112 @InProceedings{Bauer-Wenzel:2000:HB,
113 author = {Gertrud Bauer and Markus Wenzel},
114 title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in
116 booktitle = {Types for Proofs and Programs: TYPES'99},
122 @InProceedings{Berghofer-Wenzel:1999:TPHOL,
123 author = {Stefan Berghofer and Markus Wenzel},
124 title = {Inductive datatypes in {HOL} --- lessons learned in
125 {F}ormal-{L}ogic {E}ngineering},
126 crossref = {tphols99}}
128 @book{Bird-Wadler,author="Richard Bird and Philip Wadler",
129 title="Introduction to Functional Programming",publisher=PH,year=1988}
132 author = {Robert Boyer and Ewing Lusk and William McCune and Ross
133 Overbeek and Mark Stickel and Lawrence Wos},
134 title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}
143 author = {Robert S. Boyer and J Strother Moore},
144 title = {A Computational Logic},
145 publisher = {Academic Press},
149 author = {Robert S. Boyer and J Strother Moore},
150 title = {A Computational Logic Handbook},
151 publisher = {Academic Press},
155 author = {N. G. de Bruijn},
156 title = {Lambda Calculus Notation with Nameless Dummies,
157 a Tool for Automatic Formula Manipulation,
158 with Application to the {Church-Rosser Theorem}},
159 journal = {Indag. Math.},
166 @TechReport{camilleri92,
167 author = {J. Camilleri and T. F. Melham},
168 title = {Reasoning with Inductively Defined Relations in the
169 {HOL} Theorem Prover},
176 author = {E. Charniak and C. K. Riesbeck and D. V. McDermott},
177 title = {Artificial Intelligence Programming},
178 publisher = {Lawrence Erlbaum Associates},
182 author = "Alonzo Church",
183 title = "A Formulation of the Simple Theory of Types",
190 author = {Martin D. Coen},
191 title = {Interactive Program Derivation},
192 school = {University of Cambridge},
193 note = {Computer Laboratory Technical Report 272},
198 author = {R. L. Constable and others},
199 title = {Implementing Mathematics with the Nuprl Proof
201 publisher = Prentice,
206 @Book{davey-priestley,
207 author = {B. A. Davey and H. A. Priestley},
208 title = {Introduction to Lattices and Order},
213 author = {Keith J. Devlin},
214 title = {Fundamentals of Contemporary Set Theory},
215 publisher = {Springer},
219 author = {Michael Dummett},
220 title = {Elements of Intuitionism},
222 publisher = {Oxford University Press}}
224 @incollection{dybjer91,
225 author = {Peter Dybjer},
226 title = {Inductive Sets and Families in {Martin-L\"of's} Type
227 Theory and Their Set-Theoretic Semantics},
228 crossref = {huet-plotkin91},
232 author = {Roy Dyckhoff},
233 title = {Contraction-Free Sequent Calculi for Intuitionistic Logic},
243 author = {William M. Farmer and Joshua D. Guttman and F. Javier
245 title = {{IMPS}: An Interactive Mathematical Proof System},
252 @InProceedings{felty91a,
253 Author = {Amy Felty},
254 Title = {A Logic Program for Transforming Sequent Proofs to Natural
256 crossref = {extensions91},
260 author = {Jacob Frost},
261 title = {A Case Study of Co-induction in {Isabelle HOL}},
267 %revised version of frost93
269 author = {Jacob Frost},
270 title = {A Case Study of Co-induction in {Isabelle}},
277 author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud
279 title = {Principles of {OBJ2}},
287 author = {J. H. Gallier},
288 title = {Logic for Computer Science:
289 Foundations of Automatic Theorem Proving},
291 publisher = {Harper \& Row}}
294 author = {Antony Galton},
295 title = {Logic for Information Technology},
299 @InProceedings{gimenez-codifying,
300 author = {Eduardo Gim{\'e}nez},
301 title = {Codifying Guarded Definitions with Recursive Schemes},
302 crossref = {types94},
307 author = {M. J. C. Gordon and T. F. Melham},
308 title = {Introduction to {HOL}: A Theorem Proving Environment for
314 author = {Michael J. C. Gordon and Robin Milner and Christopher P.
316 title = {Edinburgh {LCF}: A Mechanised Logic of Computation},
318 publisher = {Springer},
321 @inproceedings{Gunter-HOL92,author={Elsa L. Gunter},
322 title={Why we can't have {SML} style datatype declarations in {HOL}},
323 booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\
324 IFIP TC10/WG10.2 Intl. Workshop, 1992},
325 editor={L.J.M. Claesen and M.J.C. Gordon},
326 publisher=NH,year=1993,pages={561--568}}
328 @InProceedings{gunter-trees,
329 author = {Elsa L. Gunter},
330 title = {A Broader Class of Trees for Recursive Type Definitions for
338 author = {Paul R. Halmos},
339 title = {Naive Set Theory},
340 publisher = {Van Nostrand},
344 author = {Matthew Hennessy},
345 title = {The Semantics of Programming Languages: An Elementary
346 Introduction Using Structural Operational Semantics},
350 @Article{haskell-report,
351 author = {Paul Hudak and Simon Peyton Jones and Philip Wadler},
352 title = {Report on the Programming Language {Haskell}: A
353 Non-strict, Purely Functional Language},
359 note = {Version 1.2}}
361 @Article{haskell-tutorial,
362 author = {Paul Hudak and Joseph H. Fasel},
363 title = {A Gentle Introduction to {Haskell}},
371 author = {G. P. Huet},
372 title = {A Unification Algorithm for Typed $\lambda$-Calculus},
379 author = {G. P. Huet and B. Lang},
380 title = {Proving and Applying Program Transformations Expressed with
381 Second-Order Patterns},
387 @inproceedings{huet88,
388 author = {G\'erard Huet},
389 title = {Induction Principles Formalized in the {Calculus of
391 booktitle = {Programming of Future Generation Computers},
392 editor = {K. Fuchi and M. Nivat},
395 publisher = {Elsevier}}
397 @InProceedings{Harrison:1996:MizarHOL,
398 author = {J. Harrison},
399 title = {A {Mizar} Mode for {HOL}},
401 crossref = {tphols96}}
405 @InProceedings{kammueller-locales,
406 author = {Florian Kamm{\"u}ller and Markus Wenzel and
407 Lawrence C. Paulson},
408 title = {Locales: A Sectioning Concept for {Isabelle}},
409 crossref = {tphols99}}
412 author={Donald E. Knuth},
413 title={The Art of Computer Programming, Volume 3: Sorting and Searching},
414 publisher={Addison-Wesley},
418 author = {R. E. Korf},
419 title = {Depth-First Iterative-Deepening: an Optimal Admissible
427 author = {Kenneth Kunen},
428 title = {Set Theory: An Introduction to Independence Proofs},
435 author = {Zohar Manna and Richard Waldinger},
436 title = {Deductive Synthesis of the Unification Algorithm},
443 @InProceedings{martin-nipkow,
444 author = {Ursula Martin and Tobias Nipkow},
445 title = {Ordered Rewriting and Confluence},
450 author = {Per Martin-L\"of},
451 title = {Intuitionistic type theory},
453 publisher = {Bibliopolis}}
455 @incollection{melham89,
456 author = {Thomas F. Melham},
457 title = {Automating Recursive Type Definitions in Higher Order
460 crossref = {birtwistle89}}
462 @Article{miller-mixed,
463 Author = {Dale Miller},
464 Title = {Unification Under a Mixed Prefix},
472 author = {Robin Milner},
473 title = {A Theory of Type Polymorphism in Programming},
474 journal = "J. Comp.\ Sys.\ Sci.",
479 @TechReport{milner-ind,
480 author = {Robin Milner},
481 title = {How to Derive Inductions in {LCF}},
482 institution = Edinburgh,
486 @Article{milner-coind,
487 author = {Robin Milner and Mads Tofte},
488 title = {Co-induction in Relational Semantics},
495 author = {Robin Milner},
496 title = {Communication and Concurrency},
497 publisher = Prentice,
500 @PhdThesis{monahan84,
501 author = {Brian Q. Monahan},
502 title = {Data Type Proofs using Edinburgh {LCF}},
503 school = {University of Edinburgh},
506 @article{MuellerNvOS99,
508 {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},
509 title={{HOLCF = HOL + LCF}},journal=JFP,year=1999}
513 @InProceedings{NaraschewskiW-TPHOLs98,
514 author = {Wolfgang Naraschewski and Markus Wenzel},
516 {Object-Oriented Verification based on Record Subtyping in
518 crossref = {tphols98}}
520 @inproceedings{nazareth-nipkow,
521 author = {Dieter Nazareth and Tobias Nipkow},
522 title = {Formal Verification of Algorithm {W}: The Monomorphic Case},
523 crossref = {tphols96},
527 @inproceedings{nipkow-W,
528 author = {Wolfgang Naraschewski and Tobias Nipkow},
529 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},
530 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96},
531 editor = {E. Gim\'enez and C. Paulin-Mohring},
532 publisher = Springer,
538 @InCollection{nipkow-sorts93,
539 author = {T. Nipkow},
540 title = {Order-Sorted Polymorphism in {Isabelle}},
541 booktitle = {Logical Environments},
544 editor = {G. Huet and G. Plotkin},
548 @Misc{nipkow-types93,
549 author = {Tobias Nipkow},
550 title = {Axiomatic Type Classes (in {I}sabelle)},
551 howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},
555 @inproceedings{Nipkow-CR,
556 author = {Tobias Nipkow},
557 title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})},
558 booktitle = {Automated Deduction --- CADE-13},
559 editor = {M. McRobbie and J.K. Slaney},
560 publisher = Springer,
567 @InProceedings{nipkow-patterns,
568 title = {Functional Unification of Higher-Order Patterns},
569 author = {Tobias Nipkow},
572 url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},
573 keywords = {unification}}
576 author = {Tobias Nipkow},
577 title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},
583 @manual{isabelle-HOL,
584 author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
585 title = {{Isabelle}'s Logics: {HOL}},
586 institution = {Institut f\"ur Informatik, Technische Universi\"at
587 M\"unchen and Computer Laboratory, University of Cambridge},
588 note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}
590 @article{nipkow-prehofer,
591 author = {Tobias Nipkow and Christian Prehofer},
592 title = {Type Reconstruction for Type Classes},
600 author = {Philippe No{\"e}l},
601 title = {Experimenting with {Isabelle} in {ZF} Set Theory},
609 author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith},
610 title = {Programming in {Martin-L\"of}'s Type Theory. An
612 publisher = {Oxford University Press},
617 @Manual{pvs-language,
618 title = {The {PVS} specification language},
619 author = {S. Owre and N. Shankar and J. M. Rushby},
620 organization = {Computer Science Laboratory, SRI International},
621 address = {Menlo Park, CA},
622 note = {Beta release},
625 url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}
630 @InProceedings{paulin-tlca,
631 author = {Christine Paulin-Mohring},
632 title = {Inductive Definitions in the System {Coq}: Rules and
637 @InProceedings{paulson-CADE,
638 author = {Lawrence C. Paulson},
639 title = {A Fixedpoint Approach to Implementing (Co)Inductive
644 @InProceedings{paulson-COLOG,
645 author = {Lawrence C. Paulson},
646 title = {A Formulation of the Simple Theory of Types (for
649 crossref = {colog88},
650 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}
652 @Article{paulson-coind,
653 author = {Lawrence C. Paulson},
654 title = {Mechanizing Coinduction and Corecursion in Higher-Order
663 @manual{isabelle-ref,
664 author = {Lawrence C. Paulson},
665 title = {The {Isabelle} Reference Manual},
667 note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}}
670 author = {Lawrence C. Paulson},
671 title = {{Isabelle}'s Logics: {FOL} and {ZF}},
673 note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}}
675 @article{paulson-found,
676 author = {Lawrence C. Paulson},
677 title = {The Foundation of a Generic Theorem Prover},
683 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}}
685 %replaces paulson-final
686 @Article{paulson-mscs,
687 author = {Lawrence C. Paulson},
688 title = {Final Coalgebras as Greatest Fixed Points
690 journal = {Mathematical Structures in Computer Science},
695 @InCollection{paulson-generic,
696 author = {Lawrence C. Paulson},
697 title = {Generic Automatic Proof Tools},
698 crossref = {wos-fest},
702 author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski},
703 title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of
712 @InCollection{paulson-handbook,
713 author = {Lawrence C. Paulson},
714 title = {Designing a Theorem Prover},
715 crossref = {handbk-lics2},
718 @Book{paulson-isa-book,
719 author = {Lawrence C. Paulson},
720 title = {Isabelle: A Generic Theorem Prover},
721 publisher = {Springer},
725 @InCollection{paulson-markt,
726 author = {Lawrence C. Paulson},
727 title = {Tool Support for Logics of Programs},
728 booktitle = {Mathematical Methods in Program Development:
729 Summer School Marktoberdorf 1996},
730 publisher = {Springer},
732 year = {Published 1997},
733 editor = {Manfred Broy},
734 series = {NATO ASI Series F}}
736 %replaces Paulson-ML and paulson91
738 author = {Lawrence C. Paulson},
739 title = {{ML} for the Working Programmer},
744 @article{paulson-natural,
745 author = {Lawrence C. Paulson},
746 title = {Natural Deduction as Higher-order Resolution},
751 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}}
753 @Article{paulson-set-I,
754 author = {Lawrence C. Paulson},
755 title = {Set Theory for Verification: {I}. {From}
756 Foundations to Functions},
762 url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}}
764 @Article{paulson-set-II,
765 author = {Lawrence C. Paulson},
766 title = {Set Theory for Verification: {II}. {Induction} and
773 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}}
776 author = {Lawrence C. Paulson},
777 title = {Verifying the Unification Algorithm in {LCF}},
783 %replqces Paulson-LCF
785 author = {Lawrence C. Paulson},
786 title = {Logic and Computation: Interactive proof with Cambridge
791 @incollection{paulson700,
792 author = {Lawrence C. Paulson},
793 title = {{Isabelle}: The Next 700 Theorem Provers},
794 crossref = {odifreddi90},
796 url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}}
798 % replaces paulson-ns and paulson-security
799 @Article{paulson-jcs,
800 author = {Lawrence C. Paulson},
801 title = {The Inductive Approach to Verifying Cryptographic Protocols},
807 @article{pelletier86,
808 author = {F. J. Pelletier},
809 title = {Seventy-five Problems for Testing Automatic Theorem
815 note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}}
818 author = {Andrew M. Pitts},
819 title = {A Co-induction Principle for Recursively Defined Domains},
826 author = {David A. Plaisted},
827 title = {A Sequent-Style Model Elimination Strategy and a Positive
838 author = {Art Quaife},
839 title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set
849 @TechReport{rasmussen95,
850 author = {Ole Rasmussen},
851 title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting
853 institution = {Computer Laboratory, University of Cambridge},
857 url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}}
860 author = {Steve Reeves and Michael Clarke},
861 title = {Logic for Computer Science},
862 publisher = {Addison-Wesley},
865 @InProceedings{Rudnicki:1992:MizarOverview,
866 author = {P. Rudnicki},
867 title = {An Overview of the {MIZAR} Project},
868 booktitle = {1992 Workshop on Types for Proofs and Programs},
870 organization = {Chalmers University of Technology},
876 @inproceedings{saaltink-fme,
877 author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and
878 Dan Craigen and Irwin Meisels},
879 title = {An {EVES} Data Abstraction Example},
883 @inproceedings{slind-tfl,
884 author = {Konrad Slind},
885 title = {Function Definition in Higher Order Logic},
886 booktitle = {Theorem Proving in Higher Order Logics},
887 editor = {J. von Wright and J. Grundy and J. Harrison},
888 publisher = Springer,
895 author = {Patrick Suppes},
896 title = {Axiomatic Set Theory},
900 @InCollection{szasz93,
901 author = {Nora Szasz},
902 title = {A Machine Checked Proof that {Ackermann's} Function is not
903 Primitive Recursive},
904 crossref = {huet-plotkin93},
907 @TechReport{Syme:1997:DECLARE,
909 title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic},
910 institution = {University of Cambridge Computer Laboratory},
915 @PhdThesis{Syme:1998:thesis,
917 title = {Declarative Theorem Proving for Operational Semantics},
918 school = {University of Cambridge},
923 @InProceedings{Syme:1999:TPHOL,
925 title = {Three Tactic Theorem Proving},
926 crossref = {tphols99}}
931 author = {G. Takeuti},
932 title = {Proof Theory},
938 author = {Simon Thompson},
939 title = {Type Theory and Functional Programming},
940 publisher = {Addison-Wesley},
943 @Unpublished{Trybulec:1993:MizarFeatures,
944 author = {A. Trybulec},
945 title = {Some Features of the {Mizar} Language},
946 note = {Presented at a workshop in Turin, Italy},
952 @Unpublished{voelker94,
953 author = {Norbert V\"olker},
954 title = {The Verification of a Timer Program using {Isabelle/HOL}},
955 url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}},
962 author = {Christoph Wedler},
963 title = {Emacs package ``{X-Symbol}''},
964 note = {\url{http://www.fmi.uni-passau.de/~wedler/x-symbol/}}
967 @manual{isabelle-sys,
968 author = {Markus Wenzel and Stefan Berghofer},
969 title = {The {Isabelle} System Manual},
970 institution = {TU Munich},
971 note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}}
973 @manual{isabelle-isar-ref,
974 author = {Markus Wenzel},
975 title = {The {Isabelle/Isar} Reference Manual},
976 institution = {TU Munich},
977 note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}}
979 @manual{isabelle-axclass,
980 author = {Markus Wenzel},
981 title = {Using Axiomatic Type Classes in {I}sabelle},
982 institution = {TU Munich},
984 note = {\url{http://isabelle.in.tum.de/doc/axclass.pdf}}}
987 @InProceedings{Wenzel:1999:TPHOL,
988 author = {Markus Wenzel},
989 title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents},
990 crossref = {tphols99}}
992 @InProceedings{Wenzel:1997:TPHOL,
993 author = {Markus Wenzel},
994 title = {Type Classes and Overloading in Higher-Order Logic},
995 crossref = {tphols97}}
1000 author = {A. N. Whitehead and B. Russell},
1001 title = {Principia Mathematica},
1004 note = {Paperback edition to *56,
1005 abridged from the 2nd edition (1927)}}
1008 author = {Glynn Winskel},
1009 title = {The Formal Semantics of Programming Languages},
1010 publisher = MIT,year=1993}
1012 @InCollection{wos-bledsoe,
1013 author = {Larry Wos},
1014 title = {Automated Reasoning and {Bledsoe's} Dream for the Field},
1015 crossref = {bledsoe-fest},
1018 @InProceedings{Zammit:1999:TPHOL,
1019 author = {Vincent Zammit},
1020 title = {On the Implementation of an Extensible Declarative Proof Language},
1021 crossref = {tphols99}}
1029 editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum},
1030 title = {Handbook of Logic in Computer Science},
1031 booktitle = {Handbook of Logic in Computer Science},
1032 publisher = {Oxford University Press},
1037 editor = {Henk Barendregt and Tobias Nipkow},
1038 title = TYPES # {: International Workshop {TYPES '93}},
1039 booktitle = TYPES # {: International Workshop {TYPES '93}},
1040 year = {published 1994},
1041 publisher = {Springer},
1042 series = {LNCS 806}}
1044 @book{barwise-handbk,
1045 editor = {J. Barwise},
1046 title = {Handbook of Mathematical Logic},
1047 booktitle = {Handbook of Mathematical Logic},
1051 @Proceedings{tlca93,
1052 title = {Typed Lambda Calculi and Applications},
1053 booktitle = {Typed Lambda Calculi and Applications},
1054 editor = {M. Bezem and J.F. Groote},
1056 publisher = {Springer},
1057 series = {LNCS 664}}
1060 editor = {Graham Birtwistle and P. A. Subrahmanyam},
1061 title = {Current Trends in Hardware Verification and Automated
1063 booktitle = {Current Trends in Hardware Verification and Automated
1065 publisher = {Springer},
1069 title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1070 booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}},
1071 publisher = {Kluwer Academic Publishers},
1073 editor = {Robert S. Boyer}}
1075 @Proceedings{cade12,
1076 editor = {Alan Bundy},
1077 title = {Automated Deduction --- {CADE}-12
1078 International Conference},
1079 booktitle = {Automated Deduction --- {CADE}-12
1080 International Conference},
1082 series = {LNAI 814},
1083 publisher = {Springer}}
1086 editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith},
1087 title = TYPES # {: International Workshop {TYPES '94}},
1088 booktitle = TYPES # {: International Workshop {TYPES '94}},
1090 publisher = {Springer},
1091 series = {LNCS 996}}
1093 @book{huet-plotkin91,
1094 editor = {{G\'erard} Huet and Gordon Plotkin},
1095 title = {Logical Frameworks},
1096 booktitle = {Logical Frameworks},
1100 @book{huet-plotkin93,
1101 editor = {{G\'erard} Huet and Gordon Plotkin},
1102 title = {Logical Environments},
1103 booktitle = {Logical Environments},
1108 editor = {J. Joyce and C. Seger},
1109 title = {Higher Order Logic Theorem Proving and Its
1110 Applications: HUG '93},
1111 booktitle = {Higher Order Logic Theorem Proving and Its
1112 Applications: HUG '93},
1113 year = {Published 1994},
1114 publisher = {Springer},
1115 series = {LNCS 780}}
1117 @proceedings{colog88,
1118 editor = {P. Martin-L\"of and G. Mints},
1119 title = {COLOG-88: International Conference on Computer Logic},
1120 booktitle = {COLOG-88: International Conference on Computer Logic},
1121 year = {Published 1990},
1122 publisher = {Springer},
1123 organization = {Estonian Academy of Sciences},
1124 address = {Tallinn},
1125 series = {LNCS 417}}
1128 editor = {P. Odifreddi},
1129 title = {Logic and Computer Science},
1130 booktitle = {Logic and Computer Science},
1131 publisher = {Academic Press},
1134 @proceedings{extensions91,
1135 editor = {Peter Schroeder-Heister},
1136 title = {Extensions of Logic Programming},
1137 booktitle = {Extensions of Logic Programming},
1139 series = {LNAI 475},
1140 publisher = {Springer}}
1142 @proceedings{cade10,
1143 editor = {Mark E. Stickel},
1144 title = {10th } # CADE,
1145 booktitle = {10th } # CADE,
1147 publisher = {Springer},
1148 series = {LNAI 449}}
1151 editor = {M. Vardi},
1152 title = {Eighth Annual Symposium on Logic in Computer Science},
1153 booktitle = {Eighth Annual Symposium on Logic in Computer Science},
1158 title = {Automated Reasoning and its Applications:
1159 Essays in Honor of {Larry Wos}},
1160 booktitle = {Automated Reasoning and its Applications:
1161 Essays in Honor of {Larry Wos}},
1162 publisher = {MIT Press},
1164 editor = {Robert Veroff}}
1167 editor = {J. C. P. Woodcock and P. G. Larsen},
1168 title = {FME '93: Industrial-Strength Formal Methods},
1169 booktitle = {FME '93: Industrial-Strength Formal Methods},
1171 publisher = {Springer},
1172 series = {LNCS 670}}
1174 @Proceedings{tphols96,
1175 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1176 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96},
1177 editor = {J. von Wright and J. Grundy and J. Harrison},
1178 series = {LNCS 1125},
1181 @Proceedings{tphols97,
1182 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1183 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97},
1184 editor = {Elsa L. Gunter and Amy Felty},
1185 series = {LNCS 1275},
1188 @Proceedings{tphols98,
1189 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1190 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98},
1191 editor = {Jim Grundy and Malcom Newey},
1192 series = {LNCS 1479},
1195 @Proceedings{tphols99,
1196 title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1197 booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99},
1198 editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and
1199 Paulin, C. and Thery, L.},
1200 series = {LNCS 1690},