paulson@6592: % BibTeX database for the Isabelle documentation paulson@6592: % paulson@6592: % Lawrence C Paulson $Id$ paulson@6592: paulson@6592: %publishers paulson@6592: @string{AP="Academic Press"} paulson@6592: @string{CUP="Cambridge University Press"} paulson@6592: @string{IEEE="{\sc ieee} Computer Society Press"} paulson@6592: @string{LNCS="Lect.\ Notes in Comp.\ Sci."} paulson@6592: @string{MIT="MIT Press"} paulson@6592: @string{NH="North-Holland"} paulson@6592: @string{Prentice="Prentice-Hall"} nipkow@6607: @string{PH="Prentice-Hall"} paulson@6592: @string{Springer="Springer-Verlag"} paulson@6592: paulson@6592: %institutions paulson@6613: @string{CUCL="Comp. Lab., Univ. Camb."} paulson@6613: @string{Edinburgh="Dept. Comp. Sci., Univ. Edinburgh"} paulson@6592: paulson@6592: %journals paulson@6592: @string{FAC="Formal Aspects Comput."} paulson@6592: @string{JAR="J. Auto. Reas."} paulson@6592: @string{JCS="J. Comput. Secur."} paulson@6592: @string{JFP="J. Func. Prog."} paulson@6592: @string{JLC="J. Logic and Comput."} paulson@6592: @string{JLP="J. Logic Prog."} paulson@6592: @string{JSC="J. Symb. Comput."} paulson@6592: @string{JSL="J. Symb. Logic"} paulson@6592: @string{SIGPLAN="{SIGPLAN} Notices"} paulson@6592: paulson@6592: %conferences paulson@6592: @string{CADE="International Conference on Automated Deduction"} paulson@6592: @string{POPL="Symposium on Principles of Programming Languages"} paulson@6592: @string{TYPES="Types for Proofs and Programs"} paulson@6592: paulson@6592: paulson@6592: %A paulson@6592: paulson@6592: @incollection{abramsky90, paulson@6592: author = {Samson Abramsky}, paulson@6592: title = {The Lazy Lambda Calculus}, paulson@6592: pages = {65-116}, paulson@6592: editor = {David A. Turner}, paulson@6592: booktitle = {Research Topics in Functional Programming}, paulson@6592: publisher = {Addison-Wesley}, paulson@6592: year = 1990} paulson@6592: paulson@6592: @Unpublished{abrial93, paulson@6592: author = {J. R. Abrial and G. Laffitte}, paulson@6592: title = {Towards the Mechanization of the Proofs of some Classical paulson@6592: Theorems of Set Theory}, paulson@6592: note = {preprint}, paulson@6592: year = 1993, paulson@6592: month = Feb} paulson@6592: paulson@6592: @incollection{aczel77, paulson@6592: author = {Peter Aczel}, paulson@6592: title = {An Introduction to Inductive Definitions}, paulson@6592: pages = {739-782}, paulson@6592: crossref = {barwise-handbk}} paulson@6592: paulson@6592: @Book{aczel88, paulson@6592: author = {Peter Aczel}, paulson@6592: title = {Non-Well-Founded Sets}, paulson@6592: publisher = {CSLI}, paulson@6592: year = 1988} paulson@6592: paulson@6592: @InProceedings{alf, paulson@6592: author = {Lena Magnusson and Bengt {Nordstr\"{o}m}}, paulson@6592: title = {The {ALF} Proof Editor and Its Proof Engine}, paulson@6592: crossref = {types93}, paulson@6592: pages = {213-237}} paulson@6592: paulson@6592: @book{andrews86, paulson@6592: author = "Peter Andrews", paulson@6592: title = "An Introduction to Mathematical Logic and Type Theory: to Truth paulson@6592: through Proof", paulson@6592: publisher = AP, paulson@6592: series = "Computer Science and Applied Mathematics", paulson@6592: year = 1986} paulson@6592: wenzelm@7209: @Misc{isamode, wenzelm@7209: author = {David Aspinall}, wenzelm@7209: title = {Isamode}, wenzelm@7209: note = {\url{http://www.dcs.ed.ac.uk/home/da/Isamode/}} wenzelm@7209: } wenzelm@7209: wenzelm@7209: @Misc{proofgeneral, wenzelm@7209: author = {David Aspinall and others}, wenzelm@7209: title = {{P}roof {G}eneral --- {O}rganize your proofs!}, wenzelm@7209: note = {\url{http://www.dcs.ed.ac.uk/home/proofgen/}} wenzelm@7209: } wenzelm@7209: paulson@6592: %B paulson@6592: paulson@6592: @incollection{basin91, paulson@6592: author = {David Basin and Matt Kaufmann}, paulson@6592: title = {The {Boyer-Moore} Prover and {Nuprl}: An Experimental paulson@6592: Comparison}, paulson@6592: crossref = {huet-plotkin91}, paulson@6592: pages = {89-119}} paulson@6592: wenzelm@6624: wenzelm@6624: @InProceedings{Berghofer-Wenzel:1999:TPHOL, wenzelm@6624: author = {Stefan Berghofer and Markus Wenzel}, wenzelm@7041: title = {Inductive datatypes in {HOL} --- lessons learned in wenzelm@7041: {F}ormal-{L}ogic {E}ngineering}, wenzelm@7041: crossref = {tphols99}} wenzelm@6624: nipkow@6607: @book{Bird-Wadler,author="Richard Bird and Philip Wadler", nipkow@6607: title="Introduction to Functional Programming",publisher=PH,year=1988} nipkow@6607: paulson@6592: @Article{boyer86, paulson@6592: author = {Robert Boyer and Ewing Lusk and William McCune and Ross paulson@6592: Overbeek and Mark Stickel and Lawrence Wos}, paulson@6592: title = {Set Theory in First-Order Logic: Clauses for {G\"{o}del's} paulson@6592: Axioms}, paulson@6592: journal = JAR, paulson@6592: year = 1986, paulson@6592: volume = 2, paulson@6592: number = 3, paulson@6592: pages = {287-327}} paulson@6592: paulson@6592: @book{bm79, paulson@6592: author = {Robert S. Boyer and J Strother Moore}, paulson@6592: title = {A Computational Logic}, paulson@6592: publisher = {Academic Press}, paulson@6592: year = 1979} paulson@6592: paulson@6592: @book{bm88book, paulson@6592: author = {Robert S. Boyer and J Strother Moore}, paulson@6592: title = {A Computational Logic Handbook}, paulson@6592: publisher = {Academic Press}, paulson@6592: year = 1988} paulson@6592: paulson@6592: @Article{debruijn72, paulson@6592: author = {N. G. de Bruijn}, paulson@6592: title = {Lambda Calculus Notation with Nameless Dummies, paulson@6592: a Tool for Automatic Formula Manipulation, paulson@6592: with Application to the {Church-Rosser Theorem}}, paulson@6592: journal = {Indag. Math.}, paulson@6592: volume = 34, paulson@6592: pages = {381-392}, paulson@6592: year = 1972} paulson@6592: paulson@6592: %C paulson@6592: paulson@6592: @TechReport{camilleri92, paulson@6592: author = {J. Camilleri and T. F. Melham}, paulson@6592: title = {Reasoning with Inductively Defined Relations in the paulson@6592: {HOL} Theorem Prover}, paulson@6592: institution = CUCL, paulson@6592: year = 1992, paulson@6592: number = 265, paulson@6592: month = Aug} paulson@6592: paulson@6592: @Book{charniak80, paulson@6592: author = {E. Charniak and C. K. Riesbeck and D. V. McDermott}, paulson@6592: title = {Artificial Intelligence Programming}, paulson@6592: publisher = {Lawrence Erlbaum Associates}, paulson@6592: year = 1980} paulson@6592: paulson@6592: @article{church40, paulson@6592: author = "Alonzo Church", paulson@6592: title = "A Formulation of the Simple Theory of Types", paulson@6592: journal = JSL, paulson@6592: year = 1940, paulson@6592: volume = 5, paulson@6592: pages = "56-68"} paulson@6592: paulson@6592: @PhdThesis{coen92, paulson@6592: author = {Martin D. Coen}, paulson@6592: title = {Interactive Program Derivation}, paulson@6592: school = {University of Cambridge}, paulson@6592: note = {Computer Laboratory Technical Report 272}, paulson@6592: month = nov, paulson@6592: year = 1992} paulson@6592: paulson@6592: @book{constable86, paulson@6592: author = {R. L. Constable and others}, paulson@6592: title = {Implementing Mathematics with the Nuprl Proof paulson@6592: Development System}, paulson@6592: publisher = Prentice, paulson@6592: year = 1986} paulson@6592: paulson@6592: %D paulson@6592: wenzelm@6745: @Book{davey-priestley, paulson@6592: author = {B. A. Davey and H. A. Priestley}, paulson@6592: title = {Introduction to Lattices and Order}, paulson@6592: publisher = CUP, paulson@6592: year = 1990} paulson@6592: paulson@6592: @Book{devlin79, paulson@6592: author = {Keith J. Devlin}, paulson@6592: title = {Fundamentals of Contemporary Set Theory}, paulson@6592: publisher = {Springer}, paulson@6592: year = 1979} paulson@6592: paulson@6592: @book{dummett, paulson@6592: author = {Michael Dummett}, paulson@6592: title = {Elements of Intuitionism}, paulson@6592: year = 1977, paulson@6592: publisher = {Oxford University Press}} paulson@6592: paulson@6592: @incollection{dybjer91, paulson@6592: author = {Peter Dybjer}, paulson@6592: title = {Inductive Sets and Families in {Martin-L\"of's} Type paulson@6592: Theory and Their Set-Theoretic Semantics}, paulson@6592: crossref = {huet-plotkin91}, paulson@6592: pages = {280-306}} paulson@6592: paulson@6592: @Article{dyckhoff, paulson@6592: author = {Roy Dyckhoff}, paulson@6592: title = {Contraction-Free Sequent Calculi for Intuitionistic Logic}, paulson@6592: journal = JSL, paulson@6592: year = 1992, paulson@6592: volume = 57, paulson@6592: number = 3, paulson@6592: pages = {795-807}} paulson@6592: paulson@6592: %F paulson@6592: paulson@6613: @Article{IMPS, paulson@6613: author = {William M. Farmer and Joshua D. Guttman and F. Javier paulson@6613: Thayer}, paulson@6613: title = {{IMPS}: An Interactive Mathematical Proof System}, paulson@6613: journal = JAR, paulson@6613: volume = 11, paulson@6613: number = 2, paulson@6613: year = 1993, paulson@6613: pages = {213-248}} paulson@6613: paulson@6592: @InProceedings{felty91a, paulson@6592: Author = {Amy Felty}, paulson@6592: Title = {A Logic Program for Transforming Sequent Proofs to Natural paulson@6592: Deduction Proofs}, paulson@6592: crossref = {extensions91}, paulson@6592: pages = {157-178}} paulson@6592: paulson@6592: @TechReport{frost93, paulson@6592: author = {Jacob Frost}, paulson@6592: title = {A Case Study of Co-induction in {Isabelle HOL}}, paulson@6592: institution = CUCL, paulson@6592: number = 308, paulson@6592: year = 1993, paulson@6592: month = Aug} paulson@6592: paulson@6592: %revised version of frost93 paulson@6592: @TechReport{frost95, paulson@6592: author = {Jacob Frost}, paulson@6592: title = {A Case Study of Co-induction in {Isabelle}}, paulson@6592: institution = CUCL, paulson@6592: number = 359, paulson@6592: year = 1995, paulson@6592: month = Feb} paulson@6592: paulson@6592: @inproceedings{OBJ, paulson@6592: author = {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud paulson@6592: and J. Meseguer}, paulson@6592: title = {Principles of {OBJ2}}, paulson@6592: booktitle = POPL, paulson@6592: year = 1985, paulson@6592: pages = {52-66}} paulson@6592: paulson@6592: %G paulson@6592: paulson@6592: @book{gallier86, paulson@6592: author = {J. H. Gallier}, paulson@6592: title = {Logic for Computer Science: paulson@6592: Foundations of Automatic Theorem Proving}, paulson@6592: year = 1986, paulson@6592: publisher = {Harper \& Row}} paulson@6592: paulson@6592: @Book{galton90, paulson@6592: author = {Antony Galton}, paulson@6592: title = {Logic for Information Technology}, paulson@6592: publisher = {Wiley}, paulson@6592: year = 1990} paulson@6592: paulson@6592: @InProceedings{gimenez-codifying, paulson@6592: author = {Eduardo Gim{\'e}nez}, paulson@6592: title = {Codifying Guarded Definitions with Recursive Schemes}, paulson@6592: crossref = {types94}, paulson@6592: pages = {39-59} paulson@6592: } paulson@6592: paulson@6592: @Book{mgordon-hol, paulson@6592: author = {M. J. C. Gordon and T. F. Melham}, paulson@6592: title = {Introduction to {HOL}: A Theorem Proving Environment for paulson@6592: Higher Order Logic}, paulson@6592: publisher = CUP, paulson@6592: year = 1993} paulson@6592: paulson@6592: @book{mgordon79, paulson@6592: author = {Michael J. C. Gordon and Robin Milner and Christopher P. paulson@6592: Wadsworth}, paulson@6592: title = {Edinburgh {LCF}: A Mechanised Logic of Computation}, paulson@6592: year = 1979, paulson@6592: publisher = {Springer}, paulson@6592: series = {LNCS 78}} paulson@6592: nipkow@6607: @inproceedings{Gunter-HOL92,author={Elsa L. Gunter}, nipkow@6607: title={Why we can't have {SML} style datatype declarations in {HOL}}, nipkow@6607: booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\ nipkow@6607: IFIP TC10/WG10.2 Intl. Workshop, 1992}, nipkow@6607: editor={L.J.M. Claesen and M.J.C. Gordon}, nipkow@6607: publisher=NH,year=1993,pages={561--568}} nipkow@6607: paulson@6592: @InProceedings{gunter-trees, paulson@6592: author = {Elsa L. Gunter}, paulson@6592: title = {A Broader Class of Trees for Recursive Type Definitions for paulson@6592: {HOL}}, paulson@6592: crossref = {hug93}, paulson@6592: pages = {141-154}} paulson@6592: paulson@6592: %H paulson@6592: paulson@6592: @Book{halmos60, paulson@6592: author = {Paul R. Halmos}, paulson@6592: title = {Naive Set Theory}, paulson@6592: publisher = {Van Nostrand}, paulson@6592: year = 1960} paulson@6592: paulson@6592: @Book{hennessy90, paulson@6592: author = {Matthew Hennessy}, paulson@6592: title = {The Semantics of Programming Languages: An Elementary paulson@6592: Introduction Using Structural Operational Semantics}, paulson@6592: publisher = {Wiley}, paulson@6592: year = 1990} paulson@6592: paulson@6592: @Article{haskell-report, paulson@6592: author = {Paul Hudak and Simon Peyton Jones and Philip Wadler}, paulson@6592: title = {Report on the Programming Language {Haskell}: A paulson@6592: Non-strict, Purely Functional Language}, paulson@6592: journal = SIGPLAN, paulson@6592: year = 1992, paulson@6592: volume = 27, paulson@6592: number = 5, paulson@6592: month = May, paulson@6592: note = {Version 1.2}} paulson@6592: paulson@6592: @Article{haskell-tutorial, paulson@6592: author = {Paul Hudak and Joseph H. Fasel}, paulson@6592: title = {A Gentle Introduction to {Haskell}}, paulson@6592: journal = SIGPLAN, paulson@6592: year = 1992, paulson@6592: volume = 27, paulson@6592: number = 5, paulson@6592: month = May} paulson@6592: paulson@6592: @article{huet75, paulson@6592: author = {G. P. Huet}, paulson@6592: title = {A Unification Algorithm for Typed $\lambda$-Calculus}, paulson@6592: journal = TCS, paulson@6592: volume = 1, paulson@6592: year = 1975, paulson@6592: pages = {27-57}} paulson@6592: paulson@6592: @article{huet78, paulson@6592: author = {G. P. Huet and B. Lang}, paulson@6592: title = {Proving and Applying Program Transformations Expressed with paulson@6592: Second-Order Patterns}, paulson@6592: journal = acta, paulson@6592: volume = 11, paulson@6592: year = 1978, paulson@6592: pages = {31-55}} paulson@6592: paulson@6592: @inproceedings{huet88, paulson@6592: author = {G\'erard Huet}, paulson@6592: title = {Induction Principles Formalized in the {Calculus of paulson@6592: Constructions}}, paulson@6592: booktitle = {Programming of Future Generation Computers}, paulson@6592: editor = {K. Fuchi and M. Nivat}, paulson@6592: year = 1988, paulson@6592: pages = {205-216}, paulson@6592: publisher = {Elsevier}} paulson@6592: wenzelm@7041: @InProceedings{Harrison:1996:MizarHOL, wenzelm@7041: author = {J. Harrison}, wenzelm@7041: title = {A {Mizar} Mode for {HOL}}, wenzelm@7041: pages = {203--220}, wenzelm@7041: crossref = {tphols96}} wenzelm@7041: paulson@6592: %K paulson@6592: paulson@6670: @InProceedings{kammueller-locales, paulson@6670: author = {Florian Kamm{\"u}ller and Markus Wenzel and paulson@6670: Lawrence C. Paulson}, paulson@6670: title = {Locales: A Sectioning Concept for {Isabelle}}, paulson@6670: crossref = {tphols99}} paulson@6670: nipkow@6607: @book{Knuth3-75,author={Donald E. Knuth}, nipkow@6607: title={The Art of Computer Programming, Volume 3: Sorting and Searching}, nipkow@6607: publisher={Addison-Wesley},year=1975} nipkow@6607: paulson@6592: @Book{kunen80, paulson@6592: author = {Kenneth Kunen}, paulson@6592: title = {Set Theory: An Introduction to Independence Proofs}, paulson@6592: publisher = NH, paulson@6592: year = 1980} paulson@6592: paulson@6592: %M paulson@6592: paulson@6592: @Article{mw81, paulson@6592: author = {Zohar Manna and Richard Waldinger}, paulson@6592: title = {Deductive Synthesis of the Unification Algorithm}, paulson@6592: journal = SCP, paulson@6592: year = 1981, paulson@6592: volume = 1, paulson@6592: number = 1, paulson@6592: pages = {5-48}} paulson@6592: paulson@6592: @InProceedings{martin-nipkow, paulson@6592: author = {Ursula Martin and Tobias Nipkow}, paulson@6592: title = {Ordered Rewriting and Confluence}, paulson@6592: crossref = {cade10}, paulson@6592: pages = {366-380}} paulson@6592: paulson@6592: @book{martinlof84, paulson@6592: author = {Per Martin-L\"of}, paulson@6592: title = {Intuitionistic type theory}, paulson@6592: year = 1984, paulson@6592: publisher = {Bibliopolis}} paulson@6592: paulson@6592: @incollection{melham89, paulson@6592: author = {Thomas F. Melham}, paulson@6592: title = {Automating Recursive Type Definitions in Higher Order paulson@6592: Logic}, paulson@6592: pages = {341-386}, paulson@6592: crossref = {birtwistle89}} paulson@6592: paulson@6592: @Article{miller-mixed, paulson@6592: Author = {Dale Miller}, paulson@6592: Title = {Unification Under a Mixed Prefix}, paulson@6592: journal = JSC, paulson@6592: volume = 14, paulson@6592: number = 4, paulson@6592: pages = {321-358}, paulson@6592: Year = 1992} paulson@6592: paulson@6592: @Article{milner78, paulson@6592: author = {Robin Milner}, paulson@6592: title = {A Theory of Type Polymorphism in Programming}, paulson@6592: journal = "J. Comp.\ Sys.\ Sci.", paulson@6592: year = 1978, paulson@6592: volume = 17, paulson@6592: pages = {348-375}} paulson@6592: paulson@6592: @TechReport{milner-ind, paulson@6592: author = {Robin Milner}, paulson@6592: title = {How to Derive Inductions in {LCF}}, paulson@6592: institution = Edinburgh, paulson@6592: year = 1980, paulson@6592: type = {note}} paulson@6592: paulson@6592: @Article{milner-coind, paulson@6592: author = {Robin Milner and Mads Tofte}, paulson@6592: title = {Co-induction in Relational Semantics}, paulson@6592: journal = TCS, paulson@6592: year = 1991, paulson@6592: volume = 87, paulson@6592: pages = {209-220}} paulson@6592: paulson@6592: @Book{milner89, paulson@6592: author = {Robin Milner}, paulson@6592: title = {Communication and Concurrency}, paulson@6592: publisher = Prentice, paulson@6592: year = 1989} paulson@6592: paulson@6592: @PhdThesis{monahan84, paulson@6592: author = {Brian Q. Monahan}, paulson@6592: title = {Data Type Proofs using Edinburgh {LCF}}, paulson@6592: school = {University of Edinburgh}, paulson@6592: year = 1984} paulson@6592: nipkow@6607: @article{MuellerNvOS99, nipkow@6607: author= wenzelm@6745: {Olaf M\"uller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, nipkow@6607: title={{HOLCF = HOL + LCF}},journal=JFP,year=1999} nipkow@6607: paulson@6592: %N paulson@6592: paulson@6592: @InProceedings{NaraschewskiW-TPHOLs98, paulson@6592: author = {Wolfgang Naraschewski and Markus Wenzel}, paulson@6592: title = wenzelm@7041: {Object-Oriented Verification based on Record Subtyping in wenzelm@7041: Higher-Order Logic}, wenzelm@7041: crossref = {tphols98}} paulson@6592: paulson@6592: @inproceedings{nazareth-nipkow, paulson@6592: author = {Dieter Nazareth and Tobias Nipkow}, paulson@6592: title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, paulson@6592: crossref = {tphols96}, paulson@6592: pages = {331-345}, paulson@6592: year = 1996} paulson@6592: paulson@6592: @inproceedings{nipkow-W, paulson@6592: author = {Wolfgang Naraschewski and Tobias Nipkow}, paulson@6592: title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, paulson@6592: booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, paulson@6592: editor = {E. Gim\'enez and C. Paulin-Mohring}, paulson@6592: publisher = Springer, paulson@6592: series = LNCS, paulson@6592: volume = 1512, paulson@6592: pages = {317-332}, paulson@6592: year = 1998} paulson@6592: paulson@6592: @inproceedings{Nipkow-CR, paulson@6592: author = {Tobias Nipkow}, paulson@6592: title = {More {Church-Rosser} Proofs (in {Isabelle/HOL})}, paulson@6592: booktitle = {Automated Deduction --- CADE-13}, paulson@6592: editor = {M. McRobbie and J.K. Slaney}, paulson@6592: publisher = Springer, paulson@6592: series = LNCS, paulson@6592: volume = 1104, paulson@6592: pages = {733-747}, paulson@6592: year = 1996} paulson@6592: paulson@6592: % WAS Nipkow-LICS-93 paulson@6592: @InProceedings{nipkow-patterns, paulson@6592: title = {Functional Unification of Higher-Order Patterns}, paulson@6592: author = {Tobias Nipkow}, paulson@6592: pages = {64-74}, paulson@6592: crossref = {lics8}, wenzelm@6745: url = {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}}, paulson@6592: keywords = {unification}} paulson@6592: paulson@6592: @article{nipkow-IMP, paulson@6592: author = {Tobias Nipkow}, paulson@6592: title = {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook}, paulson@6592: journal = FAC, paulson@6592: volume = 10, paulson@6592: pages = {171-186}, paulson@6592: year = 1998} paulson@6592: nipkow@6607: @manual{isabelle-HOL, nipkow@6607: author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, nipkow@6607: title = {{Isabelle}'s Logics: {HOL}}, nipkow@6607: institution = {Institut f\"ur Informatik, Technische Universi\"at nipkow@6607: M\"unchen and Computer Laboratory, University of Cambridge}} nipkow@6607: paulson@6592: @article{nipkow-prehofer, paulson@6592: author = {Tobias Nipkow and Christian Prehofer}, paulson@6592: title = {Type Reconstruction for Type Classes}, paulson@6592: journal = JFP, paulson@6592: volume = 5, paulson@6592: number = 2, paulson@6592: year = 1995, paulson@6592: pages = {201-224}} paulson@6592: paulson@6592: @Article{noel, paulson@6592: author = {Philippe No{\"e}l}, paulson@6592: title = {Experimenting with {Isabelle} in {ZF} Set Theory}, paulson@6592: journal = JAR, paulson@6592: volume = 10, paulson@6592: number = 1, paulson@6592: pages = {15-58}, paulson@6592: year = 1993} paulson@6592: paulson@6592: @book{nordstrom90, paulson@6592: author = {Bengt {Nordstr\"om} and Kent Petersson and Jan Smith}, paulson@6592: title = {Programming in {Martin-L\"of}'s Type Theory. An paulson@6592: Introduction}, paulson@6592: publisher = {Oxford University Press}, paulson@6592: year = 1990} paulson@6592: paulson@6592: %O paulson@6592: paulson@6592: @Manual{pvs-language, paulson@6592: title = {The {PVS} specification language}, paulson@6592: author = {S. Owre and N. Shankar and J. M. Rushby}, paulson@6592: organization = {Computer Science Laboratory, SRI International}, paulson@6592: address = {Menlo Park, CA}, wenzelm@6745: note = {Beta release}, paulson@6592: year = 1993, paulson@6592: month = apr, wenzelm@6619: url = {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}} paulson@6592: paulson@6592: %P paulson@6592: paulson@6592: % replaces paulin92 paulson@6592: @InProceedings{paulin-tlca, paulson@6592: author = {Christine Paulin-Mohring}, paulson@6592: title = {Inductive Definitions in the System {Coq}: Rules and paulson@6592: Properties}, paulson@6592: crossref = {tlca93}, paulson@6592: pages = {328-345}} paulson@6592: paulson@6592: @InProceedings{paulson-CADE, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {A Fixedpoint Approach to Implementing (Co)Inductive paulson@6592: Definitions}, paulson@6592: pages = {148-161}, paulson@6592: crossref = {cade12}} paulson@6592: paulson@6592: @InProceedings{paulson-COLOG, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {A Formulation of the Simple Theory of Types (for paulson@6592: {Isabelle})}, paulson@6592: pages = {246-274}, paulson@6592: crossref = {colog88}, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}} paulson@6592: paulson@6592: @Article{paulson-coind, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Mechanizing Coinduction and Corecursion in Higher-Order paulson@6592: Logic}, paulson@6592: journal = JLC, paulson@6592: year = 1997, paulson@6592: volume = 7, paulson@6592: number = 2, paulson@6592: month = mar, paulson@6592: pages = {175-204}} paulson@6592: paulson@6613: @manual{isabelle-ref, paulson@6613: author = {Lawrence C. Paulson}, paulson@6613: title = {The {Isabelle} Reference Manual}, paulson@6613: institution = CUCL} nipkow@6607: nipkow@6607: @manual{isabelle-ZF, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {{Isabelle}'s Logics: {FOL} and {ZF}}, nipkow@6607: institution = CUCL} paulson@6592: paulson@6592: @article{paulson-found, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {The Foundation of a Generic Theorem Prover}, paulson@6592: journal = JAR, paulson@6592: volume = 5, paulson@6592: number = 3, paulson@6592: pages = {363-397}, paulson@6592: year = 1989, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR130-lcp-generic-theorem-prover.dvi.gz}}} paulson@6592: paulson@6592: %replaces paulson-final paulson@6592: @Article{paulson-mscs, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Final Coalgebras as Greatest Fixed Points in ZF Set Theory}, paulson@6592: journal = {Mathematical Structures in Computer Science}, paulson@6592: year = 1999, paulson@6592: volume = 9, paulson@6592: note = {in press}} paulson@6592: paulson@6592: @InCollection{paulson-generic, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Generic Automatic Proof Tools}, paulson@6592: crossref = {wos-fest}, paulson@6592: chapter = 3} paulson@6592: paulson@6592: @Article{paulson-gr, paulson@6592: author = {Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski}, paulson@6592: title = {Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of paulson@6592: Choice}, paulson@6592: journal = JAR, paulson@6592: year = 1996, paulson@6592: volume = 17, paulson@6592: number = 3, paulson@6592: month = dec, paulson@6592: pages = {291-323}} paulson@6592: paulson@6592: @InCollection{paulson-handbook, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Designing a Theorem Prover}, paulson@6592: crossref = {handbk-lics2}, paulson@6592: pages = {415-475}} paulson@6592: paulson@6592: @Book{paulson-isa-book, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Isabelle: A Generic Theorem Prover}, paulson@6592: publisher = {Springer}, paulson@6592: year = 1994, paulson@6592: note = {LNCS 828}} paulson@6592: paulson@6592: @InCollection{paulson-markt, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Tool Support for Logics of Programs}, paulson@6592: booktitle = {Mathematical Methods in Program Development: paulson@6592: Summer School Marktoberdorf 1996}, paulson@6592: publisher = {Springer}, paulson@6592: pages = {461-498}, paulson@6592: year = {Published 1997}, paulson@6592: editor = {Manfred Broy}, paulson@6592: series = {NATO ASI Series F}} paulson@6592: paulson@6592: %replaces Paulson-ML and paulson91 paulson@6592: @book{paulson-ml2, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {{ML} for the Working Programmer}, paulson@6592: year = 1996, paulson@6592: edition = {2nd}, paulson@6592: publisher = CUP} paulson@6592: paulson@6592: @article{paulson-natural, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Natural Deduction as Higher-order Resolution}, paulson@6592: journal = JLP, paulson@6592: volume = 3, paulson@6592: pages = {237-258}, paulson@6592: year = 1986, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR82-lcp-higher-order-resolution.dvi.gz}}} paulson@6592: paulson@6592: @Article{paulson-set-I, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Set Theory for Verification: {I}. {From} paulson@6592: Foundations to Functions}, paulson@6592: journal = JAR, paulson@6592: volume = 11, paulson@6592: number = 3, paulson@6592: pages = {353-389}, paulson@6592: year = 1993, wenzelm@6745: url = {\url{ftp://ftp.cl.cam.ac.uk/ml/set-I.ps.gz}}} paulson@6592: paulson@6592: @Article{paulson-set-II, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Set Theory for Verification: {II}. {Induction} and paulson@6592: Recursion}, paulson@6592: journal = JAR, paulson@6592: volume = 15, paulson@6592: number = 2, paulson@6592: pages = {167-215}, paulson@6592: year = 1995, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR312-lcp-set-II.ps.gz}}} paulson@6592: paulson@6592: @article{paulson85, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Verifying the Unification Algorithm in {LCF}}, paulson@6592: journal = SCP, paulson@6592: volume = 5, paulson@6592: pages = {143-170}, paulson@6592: year = 1985} paulson@6592: paulson@6592: %replqces Paulson-LCF paulson@6592: @book{paulson87, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {Logic and Computation: Interactive proof with Cambridge paulson@6592: LCF}, paulson@6592: year = 1987, paulson@6592: publisher = CUP} paulson@6592: paulson@6592: @incollection{paulson700, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {{Isabelle}: The Next 700 Theorem Provers}, paulson@6592: crossref = {odifreddi90}, paulson@6592: pages = {361-386}, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk/Research/Reports/TR143-lcp-experience.dvi.gz}}} paulson@6592: paulson@6592: % replaces paulson-ns and paulson-security paulson@6592: @Article{paulson-jcs, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {The Inductive Approach to Verifying Cryptographic Protocols}, paulson@6592: journal = JCS, paulson@6592: year = 1998, paulson@6592: volume = 6, paulson@6592: pages = {85-128}} paulson@6592: paulson@6592: @article{pelletier86, paulson@6592: author = {F. J. Pelletier}, paulson@6592: title = {Seventy-five Problems for Testing Automatic Theorem paulson@6592: Provers}, paulson@6592: journal = JAR, paulson@6592: volume = 2, paulson@6592: pages = {191-216}, paulson@6592: year = 1986, paulson@6592: note = {Errata, JAR 4 (1988), 235--236 and JAR 18 (1997), 135}} paulson@6592: paulson@6592: @Article{pitts94, paulson@6592: author = {Andrew M. Pitts}, paulson@6592: title = {A Co-induction Principle for Recursively Defined Domains}, paulson@6592: journal = TCS, paulson@6592: volume = 124, paulson@6592: pages = {195-219}, paulson@6592: year = 1994} paulson@6592: paulson@6592: @Article{plaisted90, paulson@6592: author = {David A. Plaisted}, paulson@6592: title = {A Sequent-Style Model Elimination Strategy and a Positive paulson@6592: Refinement}, paulson@6592: journal = JAR, paulson@6592: year = 1990, paulson@6592: volume = 6, paulson@6592: number = 4, paulson@6592: pages = {389-402}} paulson@6592: paulson@6592: %Q paulson@6592: paulson@6592: @Article{quaife92, paulson@6592: author = {Art Quaife}, paulson@6592: title = {Automated Deduction in {von Neumann-Bernays-G\"{o}del} Set paulson@6592: Theory}, paulson@6592: journal = JAR, paulson@6592: year = 1992, paulson@6592: volume = 8, paulson@6592: number = 1, paulson@6592: pages = {91-147}} paulson@6592: paulson@6592: %R paulson@6592: paulson@6592: @TechReport{rasmussen95, paulson@6592: author = {Ole Rasmussen}, paulson@6592: title = {The {Church-Rosser} Theorem in {Isabelle}: A Proof Porting paulson@6592: Experiment}, paulson@6592: institution = {Computer Laboratory, University of Cambridge}, paulson@6592: year = 1995, paulson@6592: number = 364, paulson@6592: month = may, wenzelm@6619: url = {\url{http://www.cl.cam.ac.uk:80/ftp/papers/reports/TR364-or200-church-rosser-isabelle.ps.gz}}} paulson@6592: paulson@6592: @Book{reeves90, paulson@6592: author = {Steve Reeves and Michael Clarke}, paulson@6592: title = {Logic for Computer Science}, paulson@6592: publisher = {Addison-Wesley}, paulson@6592: year = 1990} paulson@6592: wenzelm@7041: @InProceedings{Rudnicki:1992:MizarOverview, wenzelm@7041: author = {P. Rudnicki}, wenzelm@7041: title = {An Overview of the {MIZAR} Project}, wenzelm@7041: booktitle = {1992 Workshop on Types for Proofs and Programs}, wenzelm@7041: year = 1992, wenzelm@7041: organization = {Chalmers University of Technology}, wenzelm@7041: publisher = {Bastad} wenzelm@7041: } wenzelm@7041: paulson@6592: %S paulson@6592: paulson@6592: @inproceedings{saaltink-fme, paulson@6592: author = {Mark Saaltink and Sentot Kromodimoeljo and Bill Pase and paulson@6592: Dan Craigen and Irwin Meisels}, paulson@6592: title = {An {EVES} Data Abstraction Example}, paulson@6592: pages = {578-596}, paulson@6592: crossref = {fme93}} paulson@6592: paulson@6592: @inproceedings{slind-tfl, paulson@6592: author = {Konrad Slind}, paulson@6592: title = {Function Definition in Higher Order Logic}, paulson@6592: booktitle = {Theorem Proving in Higher Order Logics}, paulson@6592: editor = {J. von Wright and J. Grundy and J. Harrison}, paulson@6592: publisher = Springer, paulson@6592: series = LNCS, paulson@6592: volume = 1125, paulson@6592: pages = {381-397}, paulson@6592: year = 1996} paulson@6592: paulson@6592: @book{suppes72, paulson@6592: author = {Patrick Suppes}, paulson@6592: title = {Axiomatic Set Theory}, paulson@6592: year = 1972, paulson@6592: publisher = {Dover}} paulson@6592: paulson@6592: @InCollection{szasz93, paulson@6592: author = {Nora Szasz}, paulson@6592: title = {A Machine Checked Proof that {Ackermann's} Function is not paulson@6592: Primitive Recursive}, paulson@6592: crossref = {huet-plotkin93}, paulson@6592: pages = {317-338}} paulson@6592: wenzelm@7041: @TechReport{Syme:1997:DECLARE, wenzelm@7041: author = {D. Syme}, wenzelm@7041: title = {{DECLARE}: A Prototype Declarative Proof System for Higher Order Logic}, wenzelm@7041: institution = {University of Cambridge Computer Laboratory}, wenzelm@7041: year = 1997, wenzelm@7041: number = 416 wenzelm@7041: } wenzelm@7041: wenzelm@7041: @PhdThesis{Syme:1998:thesis, wenzelm@7041: author = {D. Syme}, wenzelm@7041: title = {Declarative Theorem Proving for Operational Semantics}, wenzelm@7041: school = {University of Cambridge}, wenzelm@7041: year = 1998, wenzelm@7041: note = {Submitted} wenzelm@7041: } wenzelm@7041: wenzelm@7041: @InProceedings{Syme:1999:TPHOL, wenzelm@7041: author = {D. Syme}, wenzelm@7041: title = {Three Tactic Theorem Proving}, wenzelm@7041: crossref = {tphols99}} wenzelm@7041: paulson@6592: %T paulson@6592: paulson@6592: @book{takeuti87, paulson@6592: author = {G. Takeuti}, paulson@6592: title = {Proof Theory}, paulson@6592: year = 1987, paulson@6592: publisher = NH, paulson@6592: edition = {2nd}} paulson@6592: paulson@6592: @Book{thompson91, paulson@6592: author = {Simon Thompson}, paulson@6592: title = {Type Theory and Functional Programming}, paulson@6592: publisher = {Addison-Wesley}, paulson@6592: year = 1991} paulson@6592: wenzelm@7041: @Unpublished{Trybulec:1993:MizarFeatures, wenzelm@7041: author = {A. Trybulec}, wenzelm@7041: title = {Some Features of the {Mizar} Language}, wenzelm@7041: note = {Presented at a workshop in Turin, Italy}, wenzelm@7041: year = 1993 wenzelm@7041: } wenzelm@7041: paulson@6592: %V paulson@6592: paulson@6592: @Unpublished{voelker94, paulson@6592: author = {Norbert V\"olker}, paulson@6592: title = {The Verification of a Timer Program using {Isabelle/HOL}}, wenzelm@6745: url = {\url{ftp://ftp.fernuni-hagen.de/pub/fachb/et/dvt/projects/verification/timer.tar.gz}}, paulson@6592: year = 1994, paulson@6592: month = aug} paulson@6592: paulson@6592: %W paulson@6592: wenzelm@7858: @manual{isabelle-sys, wenzelm@7858: author = {Markus Wenzel and Stefan Berghofer}, wenzelm@7858: title = {The {Isabelle} System Manual}, wenzelm@7858: institution = TUM} wenzelm@7858: wenzelm@7858: @manual{isabelle-isar-ref, wenzelm@7858: author = {Markus Wenzel}, wenzelm@7966: title = {The {Isabelle/Isar} Reference Manual}, wenzelm@7858: institution = TUM} wenzelm@7858: wenzelm@7858: wenzelm@7041: @InProceedings{Wenzel:1999:TPHOL, wenzelm@7041: author = {Markus Wenzel}, wenzelm@7041: title = {{Isar} --- a Generic Interpretative Approach to Readable Formal Proof Documents}, wenzelm@7041: crossref = {tphols99}} wenzelm@6624: wenzelm@6624: @InProceedings{Wenzel:1997:TPHOL, wenzelm@6624: author = {Markus Wenzel}, wenzelm@6624: title = {Type Classes and Overloading in Higher-Order Logic}, wenzelm@7041: crossref = {tphols97}} wenzelm@7041: wenzelm@7041: wenzelm@6624: paulson@6592: @book{principia, paulson@6592: author = {A. N. Whitehead and B. Russell}, paulson@6592: title = {Principia Mathematica}, paulson@6592: year = 1962, paulson@6592: publisher = CUP, paulson@6592: note = {Paperback edition to *56, paulson@6592: abridged from the 2nd edition (1927)}} paulson@6592: paulson@6592: @book{winskel93, paulson@6592: author = {Glynn Winskel}, paulson@6592: title = {The Formal Semantics of Programming Languages}, paulson@6592: publisher = MIT,year=1993} paulson@6592: paulson@6592: @InCollection{wos-bledsoe, paulson@6592: author = {Larry Wos}, paulson@6592: title = {Automated Reasoning and {Bledsoe's} Dream for the Field}, paulson@6592: crossref = {bledsoe-fest}, paulson@6592: pages = {297-342}} paulson@6592: wenzelm@7989: @InProceedings{Zammit:1999:TPHOL, wenzelm@7989: author = {Vincent Zammit}, wenzelm@7989: title = {On the Implementation of an Extensible Declarative Proof Language}, wenzelm@7989: crossref = {tphols99}} wenzelm@7989: wenzelm@7989: %Z wenzelm@7989: paulson@6592: paulson@6592: % CROSS REFERENCES paulson@6592: paulson@6592: @book{handbk-lics2, paulson@6592: editor = {S. Abramsky and D. M. Gabbay and T. S. E. Maibaum}, paulson@6592: title = {Handbook of Logic in Computer Science}, paulson@6592: booktitle = {Handbook of Logic in Computer Science}, paulson@6592: publisher = {Oxford University Press}, paulson@6592: year = 1992, paulson@6592: volume = 2} paulson@6592: paulson@6592: @book{types93, paulson@6592: editor = {Henk Barendregt and Tobias Nipkow}, paulson@6592: title = TYPES # {: International Workshop {TYPES '93}}, paulson@6592: booktitle = TYPES # {: International Workshop {TYPES '93}}, paulson@6592: year = {published 1994}, paulson@6592: publisher = {Springer}, paulson@6592: series = {LNCS 806}} paulson@6592: paulson@6613: @book{barwise-handbk, paulson@6613: editor = {J. Barwise}, paulson@6613: title = {Handbook of Mathematical Logic}, paulson@6613: booktitle = {Handbook of Mathematical Logic}, paulson@6613: year = 1977, paulson@6613: publisher = NH} paulson@6613: paulson@6592: @Proceedings{tlca93, paulson@6592: title = {Typed Lambda Calculi and Applications}, paulson@6592: booktitle = {Typed Lambda Calculi and Applications}, paulson@6592: editor = {M. Bezem and J.F. Groote}, paulson@6592: year = 1993, paulson@6592: publisher = {Springer}, paulson@6592: series = {LNCS 664}} paulson@6592: paulson@6613: @book{birtwistle89, paulson@6613: editor = {Graham Birtwistle and P. A. Subrahmanyam}, paulson@6613: title = {Current Trends in Hardware Verification and Automated paulson@6613: Theorem Proving}, paulson@6613: booktitle = {Current Trends in Hardware Verification and Automated paulson@6613: Theorem Proving}, paulson@6613: publisher = {Springer}, paulson@6613: year = 1989} paulson@6613: paulson@6592: @book{bledsoe-fest, paulson@6592: title = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, paulson@6592: booktitle = {Automated Reasoning: Essays in Honor of {Woody Bledsoe}}, paulson@6592: publisher = {Kluwer Academic Publishers}, paulson@6592: year = 1991, paulson@6592: editor = {Robert S. Boyer}} paulson@6592: paulson@6592: @Proceedings{cade12, paulson@6592: editor = {Alan Bundy}, paulson@6592: title = {Automated Deduction --- {CADE}-12 paulson@6592: International Conference}, paulson@6592: booktitle = {Automated Deduction --- {CADE}-12 paulson@6592: International Conference}, paulson@6592: year = 1994, paulson@6592: series = {LNAI 814}, paulson@6592: publisher = {Springer}} paulson@6592: paulson@6592: @book{types94, paulson@6592: editor = {Peter Dybjer and Bengt Nordstr{\"om} and Jan Smith}, paulson@6592: title = TYPES # {: International Workshop {TYPES '94}}, paulson@6592: booktitle = TYPES # {: International Workshop {TYPES '94}}, paulson@6592: year = 1995, paulson@6592: publisher = {Springer}, paulson@6592: series = {LNCS 996}} paulson@6592: paulson@6592: @book{huet-plotkin91, paulson@6592: editor = {{G\'erard} Huet and Gordon Plotkin}, paulson@6592: title = {Logical Frameworks}, paulson@6592: booktitle = {Logical Frameworks}, paulson@6592: publisher = CUP, paulson@6592: year = 1991} paulson@6592: paulson@6613: @book{huet-plotkin93, paulson@6613: editor = {{G\'erard} Huet and Gordon Plotkin}, paulson@6613: title = {Logical Environments}, paulson@6613: booktitle = {Logical Environments}, paulson@6613: publisher = CUP, paulson@6613: year = 1993} paulson@6613: paulson@6613: @Proceedings{hug93, paulson@6613: editor = {J. Joyce and C. Seger}, paulson@6613: title = {Higher Order Logic Theorem Proving and Its paulson@6613: Applications: HUG '93}, paulson@6613: booktitle = {Higher Order Logic Theorem Proving and Its paulson@6613: Applications: HUG '93}, paulson@6613: year = {Published 1994}, paulson@6613: publisher = {Springer}, paulson@6613: series = {LNCS 780}} paulson@6613: paulson@6592: @proceedings{colog88, paulson@6592: editor = {P. Martin-L\"of and G. Mints}, paulson@6592: title = {COLOG-88: International Conference on Computer Logic}, paulson@6592: booktitle = {COLOG-88: International Conference on Computer Logic}, paulson@6592: year = {Published 1990}, paulson@6592: publisher = {Springer}, paulson@6592: organization = {Estonian Academy of Sciences}, paulson@6592: address = {Tallinn}, paulson@6592: series = {LNCS 417}} paulson@6592: paulson@6592: @book{odifreddi90, paulson@6592: editor = {P. Odifreddi}, paulson@6592: title = {Logic and Computer Science}, paulson@6592: booktitle = {Logic and Computer Science}, paulson@6592: publisher = {Academic Press}, paulson@6592: year = 1990} paulson@6592: paulson@6592: @proceedings{extensions91, paulson@6592: editor = {Peter Schroeder-Heister}, paulson@6592: title = {Extensions of Logic Programming}, paulson@6592: booktitle = {Extensions of Logic Programming}, paulson@6592: year = 1991, paulson@6592: series = {LNAI 475}, paulson@6592: publisher = {Springer}} paulson@6592: paulson@6592: @proceedings{cade10, paulson@6592: editor = {Mark E. Stickel}, paulson@6592: title = {10th } # CADE, paulson@6592: booktitle = {10th } # CADE, paulson@6592: year = 1990, paulson@6592: publisher = {Springer}, paulson@6592: series = {LNAI 449}} paulson@6592: paulson@6592: @Proceedings{lics8, paulson@6592: editor = {M. Vardi}, paulson@6592: title = {Eighth Annual Symposium on Logic in Computer Science}, paulson@6592: booktitle = {Eighth Annual Symposium on Logic in Computer Science}, paulson@6592: publisher = IEEE, paulson@6592: year = 1993} paulson@6592: paulson@6592: @book{wos-fest, paulson@6592: title = {Automated Reasoning and its Applications: paulson@6592: Essays in Honor of {Larry Wos}}, paulson@6592: booktitle = {Automated Reasoning and its Applications: paulson@6592: Essays in Honor of {Larry Wos}}, paulson@6592: publisher = {MIT Press}, paulson@6592: year = 1997, paulson@6592: editor = {Robert Veroff}} paulson@6592: paulson@6613: @proceedings{fme93, paulson@6613: editor = {J. C. P. Woodcock and P. G. Larsen}, paulson@6613: title = {FME '93: Industrial-Strength Formal Methods}, paulson@6613: booktitle = {FME '93: Industrial-Strength Formal Methods}, paulson@6613: year = 1993, paulson@6613: publisher = {Springer}, paulson@6613: series = {LNCS 670}} paulson@6613: paulson@6592: @Proceedings{tphols96, paulson@6592: title = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, paulson@6592: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '96}, paulson@6592: editor = {J. von Wright and J. Grundy and J. Harrison}, paulson@6592: series = {LNCS 1125}, paulson@6592: year = 1996} paulson@6670: wenzelm@7041: @Proceedings{tphols97, wenzelm@7041: title = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, wenzelm@7041: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '97}, wenzelm@7041: editor = {Elsa L. Gunter and Amy Felty}, wenzelm@7041: series = {LNCS 1275}, wenzelm@7041: year = 1997} wenzelm@7041: wenzelm@7041: @Proceedings{tphols98, wenzelm@7041: title = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, wenzelm@7041: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '98}, wenzelm@7041: editor = {Jim Grundy and Malcom Newey}, wenzelm@7041: series = {LNCS 1479}, wenzelm@7041: year = 1998} wenzelm@7041: paulson@6670: @Proceedings{tphols99, paulson@6670: title = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, paulson@6670: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} '99}, wenzelm@7350: editor = {Bertot, Y. and Dowek, G. and Hirschowitz, A. and wenzelm@7350: Paulin, C. and Thery, L.}, wenzelm@7350: series = {LNCS 1690}, paulson@6670: year = 1999} paulson@6670: