paulson@6592: % BibTeX database for the Isabelle documentation paulson@6592: paulson@6592: %publishers paulson@6592: @string{AP="Academic Press"} paulson@6592: @string{CUP="Cambridge University Press"} blanchet@35078: @string{IEEE="IEEE Computer Society Press"} paulson@11199: @string{LNCS="Lecture Notes in Computer Science"} 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@11199: @string{CUCL="Computer Laboratory, University of Cambridge"} paulson@11199: @string{Edinburgh="Department of Computer Science, University of Edinburgh"} haftmann@21074: @string{TUM="Department of Informatics, Technical University of Munich"} paulson@6592: paulson@6592: %journals paulson@8284: @string{AI="Artificial Intelligence"} paulson@11199: @string{FAC="Formal Aspects of Computing"} paulson@11199: @string{JAR="Journal of Automated Reasoning"} paulson@11199: @string{JCS="Journal of Computer Security"} paulson@11199: @string{JFP="Journal of Functional Programming"} paulson@11199: @string{JLC="Journal of Logic and Computation"} paulson@11199: @string{JLP="Journal of Logic Programming"} paulson@11199: @string{JSC="Journal of Symbolic Computation"} paulson@11199: @string{JSL="Journal of Symbolic Logic"} paulson@11246: @string{PROYAL="Proceedings of the Royal Society of London"} paulson@6592: @string{SIGPLAN="{SIGPLAN} Notices"} paulson@11246: @string{TISSEC="ACM Transactions on Information and System Security"} 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}, blanchet@33191: 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: blanchet@33191: @inproceedings{andersson-1993, blanchet@33191: author = "Arne Andersson", blanchet@33191: title = "Balanced Search Trees Made Simple", blanchet@33191: editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides", blanchet@33191: booktitle = "WADS 1993", blanchet@33191: series = LNCS, blanchet@33191: volume = {709}, blanchet@33191: pages = "61--70", blanchet@33191: year = 1993, blanchet@33191: publisher = Springer} blanchet@33191: 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@9599: @InProceedings{Aspinall:2000:eProof, wenzelm@9599: author = {David Aspinall}, wenzelm@9599: title = {Protocols for Interactive {e-Proof}}, wenzelm@9599: booktitle = {Theorem Proving in Higher Order Logics (TPHOLs)}, wenzelm@9599: year = 2000, wenzelm@9599: note = {Unpublished work-in-progress paper, paulson@14296: \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}} wenzelm@9599: } paulson@14296: wenzelm@8505: @InProceedings{Aspinall:TACAS:2000, wenzelm@8505: author = {David Aspinall}, wenzelm@10160: title = {{P}roof {G}eneral: A Generic Tool for Proof Development}, nipkow@11205: booktitle = {Tools and Algorithms for the Construction and Analysis of nipkow@11205: Systems (TACAS)}, nipkow@11205: year = 2000, nipkow@11205: publisher = Springer, nipkow@11205: series = LNCS, nipkow@11205: volume = 1785, nipkow@11205: pages = "38--42" wenzelm@8505: } wenzelm@8505: wenzelm@7209: @Misc{isamode, wenzelm@7209: author = {David Aspinall}, wenzelm@8062: title = {Isamode --- {U}sing {I}sabelle with {E}macs}, paulson@14296: note = {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}} wenzelm@7209: } wenzelm@7209: wenzelm@7209: @Misc{proofgeneral, nipkow@11197: author = {David Aspinall}, nipkow@11197: title = {{P}roof {G}eneral}, paulson@14296: note = {\url{http://proofgeneral.inf.ed.ac.uk/}} wenzelm@7209: } wenzelm@7209: paulson@6592: %B paulson@6592: nipkow@10186: @book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow}, nipkow@10186: title="Term Rewriting and All That",publisher=CUP,year=1998} nipkow@10186: wenzelm@20482: @InCollection{Barendregt-Geuvers:2001, wenzelm@20482: author = {H. Barendregt and H. Geuvers}, wenzelm@20482: title = {Proof Assistants using Dependent Type Systems}, wenzelm@20482: booktitle = {Handbook of Automated Reasoning}, wenzelm@20482: publisher = {Elsevier}, wenzelm@20482: year = 2001, wenzelm@20482: editor = {A. Robinson and A. Voronkov} wenzelm@20482: } wenzelm@20482: 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@12466: @Unpublished{HOL-Library, wenzelm@12466: author = {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and wenzelm@12466: Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and wenzelm@12466: Markus Wenzel}, wenzelm@12466: title = {The Supplemental {Isabelle/HOL} Library}, wenzelm@12660: note = {Part of the Isabelle distribution, wenzelm@12466: \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}}, wenzelm@12660: year = 2002 wenzelm@12466: } wenzelm@12466: wenzelm@9567: @InProceedings{Bauer-Wenzel:2000:HB, wenzelm@9567: author = {Gertrud Bauer and Markus Wenzel}, wenzelm@9567: title = {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in wenzelm@9567: {I}sabelle/{I}sar}, wenzelm@9567: booktitle = {Types for Proofs and Programs: TYPES'99}, wenzelm@9599: editor = {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m wenzelm@9599: and Jan Smith}, wenzelm@9567: series = {LNCS}, wenzelm@9599: year = 2000 wenzelm@9567: } wenzelm@6624: wenzelm@12878: @InProceedings{Bauer-Wenzel:2001, wenzelm@12878: author = {Gertrud Bauer and Markus Wenzel}, wenzelm@12878: title = {Calculational reasoning revisited --- an {Isabelle/Isar} experience}, wenzelm@12878: crossref = {tphols2001}} wenzelm@12878: bulwahn@33926: @inProceedings{Berghofer-Bulwahn-Haftmann:2009:TPHOL, bulwahn@33926: author = {Berghofer, Stefan and Bulwahn, Lukas and Haftmann, Florian}, bulwahn@33926: booktitle = {Theorem Proving in Higher Order Logics}, bulwahn@33926: pages = {131--146}, bulwahn@33926: title = {Turning Inductive into Equational Specifications}, bulwahn@33926: year = {2009} bulwahn@33926: } bulwahn@33926: berghofe@11619: @INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL, berghofe@11619: crossref = "tphols2000", berghofe@11619: title = "Proof terms for simply typed higher order logic", berghofe@11619: author = "Stefan Berghofer and Tobias Nipkow", berghofe@11619: pages = "38--52"} berghofe@11619: blanchet@33191: @inproceedings{berghofer-nipkow-2004, blanchet@33191: author = {Stefan Berghofer and Tobias Nipkow}, blanchet@33191: title = {Random Testing in {I}sabelle/{HOL}}, blanchet@33191: pages = {230--239}, blanchet@33191: editor = "J. Cuellar and Z. Liu", blanchet@33191: booktitle = {{SEFM} 2004}, blanchet@33191: publisher = IEEE, blanchet@33191: year = 2004} blanchet@33191: berghofe@12612: @InProceedings{Berghofer-Nipkow:2002, berghofe@12612: author = {Stefan Berghofer and Tobias Nipkow}, berghofe@12612: title = {Executing Higher Order Logic}, berghofe@12612: booktitle = {Types for Proofs and Programs: TYPES'2000}, berghofe@12612: editor = {P. Callaghan and Z. Luo and J. McKinna and R. Pollack}, berghofe@12612: series = LNCS, berghofe@12612: publisher = Springer, berghofe@13009: volume = 2277, berghofe@12612: year = 2002} berghofe@12612: 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: wenzelm@30170: wenzelm@30170: @InProceedings{Bezem-Coquand:2005, wenzelm@30170: author = {M.A. Bezem and T. Coquand}, wenzelm@30170: title = {Automating {Coherent Logic}}, wenzelm@30170: booktitle = {LPAR-12}, wenzelm@30170: editor = {G. Sutcliffe and A. Voronkov}, wenzelm@30170: volume = 3835, wenzelm@30170: series = LNCS, wenzelm@30170: publisher = Springer} wenzelm@30170: nipkow@6607: @book{Bird-Wadler,author="Richard Bird and Philip Wadler", nipkow@6607: title="Introduction to Functional Programming",publisher=PH,year=1988} nipkow@6607: nipkow@11209: @book{Bird-Haskell,author="Richard Bird", nipkow@11209: title="Introduction to Functional Programming using Haskell", nipkow@11209: publisher=PH,year=1998} nipkow@11209: blanchet@33191: @inproceedings{blanchette-nipkow-2009, blanchet@33191: title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)", blanchet@33191: author = "Jasmin Christian Blanchette and Tobias Nipkow", blanchet@33191: booktitle = "{TAP} 2009: Short Papers", blanchet@33191: editor = "Catherine Dubois", blanchet@33191: publisher = "ETH Technical Report 630", blanchet@33191: year = 2009} blanchet@33191: 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: krauss@23187: @InProceedings{bulwahnKN07, krauss@25093: author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow}, krauss@25093: title = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}}, krauss@25093: crossref = {tphols2007}, krauss@25093: pages = {38--53} krauss@25093: } krauss@23187: haftmann@28593: @InProceedings{bulwahn-et-al:2008:imperative, blanchet@33191: author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews}, haftmann@28593: title = {Imperative Functional Programming with {Isabelle/HOL}}, haftmann@28593: crossref = {tphols2008}, haftmann@28593: } haftmann@28593: % pages = {38--53} haftmann@28593: paulson@11246: @Article{ban89, paulson@11246: author = {M. Burrows and M. Abadi and R. M. Needham}, paulson@11246: title = {A Logic of Authentication}, paulson@11246: journal = PROYAL, paulson@11246: year = 1989, paulson@11246: volume = 426, paulson@11246: pages = {233-271}} paulson@11246: 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: nipkow@10191: @book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled", nipkow@10191: title="Model Checking",publisher=MIT,year=1999} nipkow@10191: 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}, nipkow@10186: title = {Inductive Sets and Families in {Martin-L{\"o}f'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@10796: @Article{fleuriot-jcm, paulson@10796: author = {Jacques Fleuriot and Lawrence C. Paulson}, paulson@10796: title = {Mechanizing Nonstandard Real Analysis}, paulson@10796: journal = {LMS Journal of Computation and Mathematics}, paulson@10796: year = 2000, paulson@10796: volume = 3, paulson@10796: pages = {140-190}, paulson@10796: note = {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}} paulson@10796: } paulson@10796: 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: wenzelm@20506: @Article{Gentzen:1935, wenzelm@20506: author = {G. Gentzen}, wenzelm@20506: title = {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en}, wenzelm@20506: journal = {Math. Zeitschrift}, wenzelm@20506: year = 1935 wenzelm@20506: } wenzelm@20506: 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@9816: @book{girard89, paulson@9816: author = {Jean-Yves Girard}, paulson@9816: title = {Proofs and Types}, paulson@9816: year = 1989, paulson@9816: publisher = CUP, paulson@9816: note = {Translated by Yves LaFont and Paul Taylor}} paulson@9816: paulson@6592: @Book{mgordon-hol, nipkow@11205: editor = {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: haftmann@23956: @InProceedings{Haftmann-Wenzel:2006:classes, haftmann@23956: author = {Florian Haftmann and Makarius Wenzel}, haftmann@23956: title = {Constructive Type Classes in {Isabelle}}, haftmann@24628: editor = {T. Altenkirch and C. McBride}, haftmann@24628: booktitle = {Types for Proofs and Programs, TYPES 2006}, haftmann@24628: publisher = {Springer}, haftmann@24628: series = {LNCS}, haftmann@24628: volume = {4502}, haftmann@24628: year = {2007} haftmann@24193: } haftmann@24193: haftmann@24193: @TechReport{Haftmann-Nipkow:2007:codegen, haftmann@24193: author = {Florian Haftmann and Tobias Nipkow}, haftmann@24193: title = {A Code Generator Framework for {Isabelle/HOL}}, haftmann@24628: editor = {Klaus Schneider and Jens Brandt}, haftmann@24628: booktitle = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings}, haftmann@24628: month = {08}, haftmann@24628: year = {2007}, haftmann@24628: institution = {Department of Computer Science, University of Kaiserslautern}, haftmann@24628: number = {364/07} haftmann@23956: } haftmann@23956: wenzelm@30115: @InProceedings{Haftmann-Wenzel:2009, wenzelm@30115: author = {Florian Haftmann and Makarius Wenzel}, wenzelm@30115: title = {Local theory specifications in {Isabelle/Isar}}, wenzelm@30115: editor = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo}, wenzelm@30115: booktitle = {Types for Proofs and Programs, TYPES 2008}, wenzelm@30115: publisher = {Springer}, wenzelm@30115: series = {LNCS}, wenzelm@32572: volume = {5497}, wenzelm@30115: year = {2009} wenzelm@30115: } wenzelm@30115: haftmann@22290: @manual{isabelle-classes, haftmann@24193: author = {Florian Haftmann}, haftmann@24193: title = {Haskell-style type classes with {Isabelle}/{Isar}}, haftmann@24193: institution = TUM, haftmann@24193: note = {\url{http://isabelle.in.tum.de/doc/classes.pdf}} haftmann@24193: } haftmann@22290: haftmann@22290: @manual{isabelle-codegen, haftmann@24193: author = {Florian Haftmann}, haftmann@24193: title = {Code generation from Isabelle theories}, haftmann@24193: institution = TUM, haftmann@24193: note = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}} haftmann@24193: } haftmann@22290: 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: nipkow@11207: @book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn}, nipkow@11207: title={Dynamic Logic},publisher=MIT,year=2000} nipkow@11207: 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: nipkow@10244: @book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman}, nipkow@10244: title={Introduction to Automata Theory, Languages, and Computation.}, nipkow@10244: publisher={Addison-Wesley},year=1979} nipkow@10244: 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: nipkow@11209: @book{Hudak-Haskell,author={Paul Hudak}, nipkow@11209: title={The Haskell School of Expression},publisher=CUP,year=2000} nipkow@11209: 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, nipkow@10186: author = {G{\'e}rard 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: nipkow@10186: @Book{Huth-Ryan-book, nipkow@10186: author = {Michael Huth and Mark Ryan}, nipkow@10186: title = {Logic in Computer Science. Modelling and reasoning about systems}, nipkow@10186: publisher = CUP, nipkow@10186: year = 2000} nipkow@10186: 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: haftmann@22290: %J haftmann@22290: haftmann@22290: @article{haskell-revised-report, haftmann@22290: author = {Simon {Peyton Jones} and others}, haftmann@22290: title = {The {Haskell} 98 Language and Libraries: The Revised Report}, haftmann@22290: journal = {Journal of Functional Programming}, haftmann@22290: volume = 13, haftmann@22290: number = 1, haftmann@22290: pages = {0--255}, haftmann@22290: month = {Jan}, haftmann@22290: year = 2003, haftmann@22290: note = {\url{http://www.haskell.org/definition/}}} haftmann@22290: blanchet@33191: @book{jackson-2006, blanchet@33191: author = "Daniel Jackson", blanchet@33191: title = "Software Abstractions: Logic, Language, and Analysis", blanchet@33191: publisher = MIT, blanchet@33191: year = 2006} blanchet@33191: 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: paulson@8284: @book{Knuth3-75, paulson@8284: author={Donald E. Knuth}, paulson@8284: title={The Art of Computer Programming, Volume 3: Sorting and Searching}, paulson@8284: publisher={Addison-Wesley}, paulson@8284: year=1975} paulson@8284: paulson@8284: @Article{korf85, paulson@8284: author = {R. E. Korf}, paulson@8284: title = {Depth-First Iterative-Deepening: an Optimal Admissible paulson@8284: Tree Search}, paulson@8284: journal = AI, paulson@8284: year = 1985, paulson@8284: volume = 27, paulson@8284: pages = {97-109}} nipkow@6607: krauss@23187: @InProceedings{krauss2006, krauss@23187: author = {Alexander Krauss}, krauss@23187: title = {Partial Recursive Functions in {Higher-Order Logic}}, krauss@23187: crossref = {ijcar2006}, krauss@23187: pages = {589--603}} krauss@23187: krauss@33856: @PhdThesis{krauss_phd, krauss@33856: author = {Alexander Krauss}, krauss@33856: title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic}, krauss@33856: school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, krauss@33856: year = {2009}, krauss@33856: address = {Germany} krauss@33856: } krauss@33856: krauss@24524: @manual{isabelle-function, krauss@24524: author = {Alexander Krauss}, krauss@24524: title = {Defining Recursive Functions in {Isabelle/HOL}}, krauss@24524: institution = TUM, nipkow@25280: note = {\url{http://isabelle.in.tum.de/doc/functions.pdf}} krauss@24524: } krauss@24524: 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@11246: %L paulson@11246: haftmann@22290: @manual{OCaml, haftmann@22290: author = {Xavier Leroy and others}, haftmann@22290: title = {The Objective Caml system -- Documentation and user's manual}, haftmann@22290: note = {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}} haftmann@22290: paulson@11246: @InProceedings{lowe-fdr, paulson@11246: author = {Gavin Lowe}, paulson@11246: title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key paulson@11246: Protocol using {CSP} and {FDR}}, paulson@11246: booktitle = {Tools and Algorithms for the Construction and Analysis paulson@11246: of Systems: second international workshop, TACAS '96}, paulson@11246: editor = {T. Margaria and B. Steffen}, paulson@11246: series = {LNCS 1055}, paulson@11246: year = 1996, paulson@11246: publisher = {Springer}, paulson@11246: pages = {147-166}} paulson@11246: 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, nipkow@10186: author = {Per Martin-L{\"o}f}, 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: wenzelm@29728: @Article{Miller:1991, wenzelm@29728: author = {Dale Miller}, wenzelm@29728: title = {A Logic Programming Language with Lambda-Abstraction, Function Variables, wenzelm@29728: and Simple Unification}, wenzelm@29728: journal = {Journal of Logic and Computation}, wenzelm@29728: year = 1991, wenzelm@29728: volume = 1, wenzelm@29728: number = 4 wenzelm@29728: } wenzelm@29728: 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: nipkow@10970: @book{SML,author="Robin Milner and Mads Tofte and Robert Harper", nipkow@10970: title="The Definition of Standard ML",publisher=MIT,year=1990} nipkow@10970: 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@11564: {Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch}, nipkow@11197: title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}} nipkow@6607: wenzelm@9599: @Manual{Muzalewski:Mizar, wenzelm@9599: title = {An Outline of {PC} {Mizar}}, wenzelm@9599: author = {Micha{\l} Muzalewski}, wenzelm@9599: organization = {Fondation of Logic, Mathematics and Informatics wenzelm@9599: --- Mizar Users Group}, wenzelm@9599: year = 1993, wenzelm@9599: note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}} wenzelm@9599: } wenzelm@9599: 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@11246: @Article{needham-schroeder, paulson@11246: author = "Roger M. Needham and Michael D. Schroeder", paulson@11246: title = "Using Encryption for Authentication in Large Networks paulson@11246: of Computers", paulson@11246: journal = cacm, paulson@11246: volume = 21, paulson@11246: number = 12, paulson@11246: pages = "993-999", paulson@11246: month = dec, paulson@11246: year = 1978} paulson@11246: 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}, nipkow@10186: editor = {E. Gim{\'e}nez 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: wenzelm@8892: @InCollection{nipkow-sorts93, wenzelm@8892: author = {T. Nipkow}, wenzelm@8892: title = {Order-Sorted Polymorphism in {Isabelle}}, wenzelm@8892: booktitle = {Logical Environments}, wenzelm@8892: publisher = CUP, wenzelm@8892: year = 1993, wenzelm@8892: editor = {G. Huet and G. Plotkin}, wenzelm@8892: pages = {164--188} wenzelm@8892: } wenzelm@8892: wenzelm@8892: @Misc{nipkow-types93, wenzelm@8892: author = {Tobias Nipkow}, wenzelm@8892: title = {Axiomatic Type Classes (in {I}sabelle)}, wenzelm@8892: howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen}, wenzelm@8892: year = 1993 wenzelm@8892: } wenzelm@8892: 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@15429: @inproceedings{Nipkow-TYPES02, nipkow@15429: author = {Tobias Nipkow}, nipkow@15429: title = {{Structured Proofs in Isar/HOL}}, nipkow@15429: booktitle = {Types for Proofs and Programs (TYPES 2002)}, nipkow@15429: editor = {H. Geuvers and F. Wiedijk}, nipkow@15429: year = 2003, nipkow@15429: publisher = Springer, nipkow@15429: series = LNCS, nipkow@15429: volume = 2646, nipkow@15429: pages = {259-278}} nipkow@15429: 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@10186: institution = {Institut f{\"u}r Informatik, Technische Universi{\"a}t nipkow@10186: M{\"u}nchen and Computer Laboratory, University of Cambridge}, wenzelm@8892: note = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}} 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: haftmann@23956: @InProceedings{Nipkow-Prehofer:1993, haftmann@23956: author = {T. Nipkow and C. Prehofer}, haftmann@23956: title = {Type checking type classes}, haftmann@23956: booktitle = {ACM Symp.\ Principles of Programming Languages}, haftmann@23956: year = 1993 haftmann@23956: } haftmann@23956: paulson@14147: @Book{isa-tutorial, paulson@14147: author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, blanchet@33191: title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic}, blanchet@33191: publisher = Springer, paulson@14147: year = 2002, blanchet@33191: series = LNCS, blanchet@33191: volume = 2283} paulson@14147: 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, nipkow@10186: author = {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith}, nipkow@10186: title = {Programming in {Martin-L{\"o}f}'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: wenzelm@12616: @manual{isabelle-intro, wenzelm@12616: author = {Lawrence C. Paulson}, wenzelm@12616: title = {Introduction to {Isabelle}}, wenzelm@12616: institution = CUCL, wenzelm@12616: note = {\url{http://isabelle.in.tum.de/doc/intro.pdf}}} wenzelm@12616: wenzelm@12616: @manual{isabelle-logics, wenzelm@12616: author = {Lawrence C. Paulson}, wenzelm@12616: title = {{Isabelle's} Logics}, wenzelm@12616: institution = CUCL, wenzelm@12616: note = {\url{http://isabelle.in.tum.de/doc/logics.pdf}}} wenzelm@12616: paulson@6613: @manual{isabelle-ref, paulson@6613: author = {Lawrence C. Paulson}, paulson@6613: title = {The {Isabelle} Reference Manual}, wenzelm@8892: institution = CUCL, wenzelm@8892: note = {\url{http://isabelle.in.tum.de/doc/ref.pdf}}} nipkow@6607: nipkow@6607: @manual{isabelle-ZF, paulson@6592: author = {Lawrence C. Paulson}, paulson@6592: title = {{Isabelle}'s Logics: {FOL} and {ZF}}, wenzelm@8892: institution = CUCL, wenzelm@8892: note = {\url{http://isabelle.in.tum.de/doc/logics-ZF.pdf}}} 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@7991: title = {Final Coalgebras as Greatest Fixed Points paulson@7991: in {ZF} Set Theory}, paulson@6592: journal = {Mathematical Structures in Computer Science}, paulson@6592: year = 1999, paulson@6592: volume = 9, paulson@23505: number = 5, paulson@23505: pages = {545-567}} 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@14210: @InCollection{paulson-fixedpt-milner, paulson@14210: author = {Lawrence C. Paulson}, paulson@14210: title = {A Fixedpoint Approach to (Co)inductive and paulson@14210: (Co)datatype Definitions}, paulson@14210: pages = {187-211}, paulson@14210: crossref = {milner-fest}} paulson@14210: paulson@14210: @book{milner-fest, paulson@14210: title = {Proof, Language, and Interaction: paulson@14210: Essays in Honor of {Robin Milner}}, paulson@14210: booktitle = {Proof, Language, and Interaction: paulson@14210: Essays in Honor of {Robin Milner}}, blanchet@33191: publisher = MIT, paulson@14210: year = 2000, paulson@14210: editor = {Gordon Plotkin and Colin Stirling and Mads Tofte}} paulson@14210: 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: wenzelm@12878: @Book{isabelle-hol-book, wenzelm@12878: author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel}, wenzelm@12878: title = {Isabelle/HOL --- A Proof Assistant for Higher-Order Logic}, wenzelm@12878: publisher = {Springer}, wenzelm@12878: year = 2002, wenzelm@12878: note = {LNCS 2283}} wenzelm@12878: 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, nipkow@14385: url = {\url{http://www.cl.cam.ac.uk/users/lcp/papers/Sets/set-I.pdf}}} 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: wenzelm@11564: %replaces 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@11246: @Article{paulson-tls, paulson@11246: author = {Lawrence C. Paulson}, paulson@11246: title = {Inductive Analysis of the {Internet} Protocol {TLS}}, paulson@11246: journal = TISSEC, paulson@11246: month = aug, paulson@11246: year = 1999, paulson@11246: volume = 2, paulson@11246: number = 3, paulson@11246: pages = {332-351}} haftmann@21074: haftmann@21074: @Article{paulson-yahalom, haftmann@21074: author = {Lawrence C. Paulson}, haftmann@21074: title = {Relations Between Secrets: haftmann@21074: Two Formal Analyses of the {Yahalom} Protocol}, haftmann@21074: journal = JCS, paulson@23505: volume = 9, paulson@23505: number = 3, paulson@23505: pages = {197-216}, paulson@23505: year = 2001}} paulson@11246: 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: nipkow@11209: @book{Rosen-DMA,author={Kenneth H. Rosen}, nipkow@11209: title={Discrete Mathematics and Its Applications}, nipkow@11209: publisher={McGraw-Hill},year=1998} nipkow@11209: 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: wenzelm@29728: @Article{Schroeder-Heister:1984, wenzelm@29728: author = {Peter Schroeder-Heister}, wenzelm@29728: title = {A Natural Extension of Natural Deduction}, wenzelm@29728: journal = {Journal of Symbolic Logic}, wenzelm@29728: year = 1984, wenzelm@29728: volume = 49, wenzelm@29728: number = 4 wenzelm@29728: } wenzelm@29728: blanchet@33191: @misc{sledgehammer-2009, blanchet@33191: key = "Sledgehammer", blanchet@33191: title = "The {S}ledgehammer: Let Automatic Theorem Provers blanchet@33191: Write Your {I}s\-a\-belle Scripts", blanchet@33191: note = "\url{http://www.cl.cam.ac.uk/research/hvg/Isabelle/sledgehammer.html}"} blanchet@33191: paulson@6592: @inproceedings{slind-tfl, paulson@6592: author = {Konrad Slind}, paulson@6592: title = {Function Definition in Higher Order Logic}, krauss@23187: crossref = {tphols96}, krauss@23187: pages = {381-397}} 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: nipkow@11209: @book{Thompson-Haskell,author={Simon Thompson}, nipkow@11209: title={Haskell: The Craft of Functional Programming}, nipkow@11209: publisher={Addison-Wesley},year=1999} nipkow@11209: blanchet@33191: @misc{kodkod-2009, blanchet@33191: author = "Emina Torlak", blanchet@33191: title = {Kodkod: Constraint Solver for Relational Logic}, blanchet@33191: note = "\url{http://alloy.mit.edu/kodkod/}"} blanchet@33191: blanchet@33191: @misc{kodkod-2009-options, blanchet@33191: author = "Emina Torlak", blanchet@33191: title = "Kodkod {API}: Class {Options}", blanchet@33191: note = "\url{http://alloy.mit.edu/kodkod/docs/kodkod/engine/config/Options.html}"} blanchet@33191: blanchet@33191: @inproceedings{torlak-jackson-2007, blanchet@33191: title = "Kodkod: A Relational Model Finder", blanchet@33191: author = "Emina Torlak and Daniel Jackson", blanchet@33191: editor = "Orna Grumberg and Michael Huth", blanchet@33191: booktitle = "TACAS 2007", blanchet@33191: series = LNCS, blanchet@33191: volume = {4424}, blanchet@33191: pages = "632--647", blanchet@33191: year = 2007, blanchet@33191: publisher = Springer} blanchet@33191: 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, nipkow@10186: author = {Norbert V{\"o}lker}, 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: haftmann@23956: @inproceedings{wadler89how, haftmann@23956: author = {P. Wadler and S. Blott}, haftmann@23956: title = {How to make ad-hoc polymorphism less ad-hoc}, haftmann@23956: booktitle = {ACM Symp.\ Principles of Programming Languages}, haftmann@23956: year = 1989 haftmann@23956: } haftmann@23956: blanchet@33191: @phdthesis{weber-2008, blanchet@33191: author = "Tjark Weber", blanchet@33191: title = "SAT-Based Finite Model Generation for Higher-Order Logic", blanchet@33191: school = {Dept.\ of Informatics, T.U. M\"unchen}, blanchet@33191: type = "{Ph.D.}\ thesis", blanchet@33191: year = 2008} blanchet@33191: wenzelm@8505: @Misc{x-symbol, wenzelm@8505: author = {Christoph Wedler}, wenzelm@8505: title = {Emacs package ``{X-Symbol}''}, wenzelm@13141: note = {\url{http://x-symbol.sourceforge.net}} wenzelm@8505: } wenzelm@8505: wenzelm@7858: @manual{isabelle-sys, wenzelm@7858: author = {Markus Wenzel and Stefan Berghofer}, wenzelm@7858: title = {The {Isabelle} System Manual}, wenzelm@8892: institution = {TU Munich}, wenzelm@8892: note = {\url{http://isabelle.in.tum.de/doc/system.pdf}}} wenzelm@7858: wenzelm@7858: @manual{isabelle-isar-ref, wenzelm@28837: author = {Makarius Wenzel}, wenzelm@7966: title = {The {Isabelle/Isar} Reference Manual}, wenzelm@8892: institution = {TU Munich}, wenzelm@8892: note = {\url{http://isabelle.in.tum.de/doc/isar-ref.pdf}}} wenzelm@8892: wenzelm@28837: @manual{isabelle-implementation, wenzelm@28837: author = {Makarius Wenzel}, wenzelm@28837: title = {The {Isabelle/Isar} Implementation}, wenzelm@28837: institution = {TU Munich}, wenzelm@28837: note = {\url{http://isabelle.in.tum.de/doc/implementation.pdf}}} wenzelm@28837: 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: paulson@14147: @phdthesis{Wenzel-PhD, paulson@14147: author={Markus Wenzel}, paulson@14147: title={Isabelle/Isar --- a versatile environment for human-readable formal proof documents}, paulson@14147: school={Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen}, paulson@14147: year=2002, wenzelm@12901: note = {\url{http://tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html}}} wenzelm@7041: wenzelm@29715: @Article{Wenzel-Wiedijk:2002, wenzelm@29715: author = {Freek Wiedijk and Markus Wenzel}, wenzelm@29715: title = {A comparison of the mathematical proof languages {Mizar} and {Isar}.}, wenzelm@29715: journal = {Journal of Automated Reasoning}, wenzelm@29715: year = 2002, wenzelm@29715: volume = 29, wenzelm@29715: number = {3-4} wenzelm@29715: } wenzelm@29715: wenzelm@29715: @InCollection{Wenzel-Paulson:2006, wenzelm@29715: author = {Markus Wenzel and Lawrence C. Paulson}, wenzelm@29715: title = {{Isabelle/Isar}}, wenzelm@29715: booktitle = {The Seventeen Provers of the World}, wenzelm@29715: year = 2006, wenzelm@29715: editor = {F. Wiedijk}, wenzelm@29715: series = {LNAI 3600} wenzelm@29715: } wenzelm@29715: wenzelm@27060: @InCollection{Wenzel:2006:Festschrift, wenzelm@27060: author = {Makarius Wenzel}, wenzelm@27060: title = {{Isabelle/Isar} --- a generic framework for human-readable proof documents}, wenzelm@27060: booktitle = {From Insight to Proof --- Festschrift in Honour of Andrzej Trybulec}, wenzelm@27060: publisher = {University of Bia{\l}ystok}, wenzelm@27060: year = 2007, wenzelm@27060: editor = {R. Matuszewski and A. Zalewska}, wenzelm@27060: volume = {10(23)}, wenzelm@27060: series = {Studies in Logic, Grammar, and Rhetoric}, wenzelm@27060: note = {\url{http://www.in.tum.de/~wenzelm/papers/isar-framework.pdf}} wenzelm@27060: } wenzelm@27060: 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: wenzelm@9599: @Misc{Wiedijk:1999:Mizar, wenzelm@9599: author = {Freek Wiedijk}, wenzelm@9599: title = {Mizar: An Impression}, wenzelm@9599: howpublished = {Unpublished paper}, wenzelm@9599: year = 1999, wenzelm@9599: note = {\url{http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz}} wenzelm@9599: } wenzelm@9599: wenzelm@9599: @Misc{Wiedijk:2000:MV, wenzelm@9599: author = {Freek Wiedijk}, wenzelm@9599: title = {The Mathematical Vernacular}, wenzelm@9599: howpublished = {Unpublished paper}, wenzelm@9599: year = 2000, wenzelm@9599: note = {\url{http://www.cs.kun.nl/~freek/notes/mv.ps.gz}} wenzelm@9599: } wenzelm@9599: 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, nipkow@10186: editor = {Peter Dybjer and Bengt Nordstr{{\"o}m} 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, nipkow@10186: editor = {{G{\'e}rard} 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, nipkow@10186: editor = {{G{\'e}rard} 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, nipkow@10186: editor = {P. Martin-L{\"o}f 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}}, blanchet@33191: publisher = MIT, 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, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 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}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 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}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 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}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 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.}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 1690, paulson@6670: year = 1999} paulson@6670: wenzelm@12878: @Proceedings{tphols2000, wenzelm@12878: title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, wenzelm@12878: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2000}, wenzelm@12878: editor = {J. Harrison and M. Aagaard}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 1869, wenzelm@12878: year = 2000} wenzelm@12878: wenzelm@12878: @Proceedings{tphols2001, wenzelm@12878: title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, wenzelm@12878: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2001}, wenzelm@12878: editor = {R. J. Boulton and P. B. Jackson}, berghofe@13009: publisher = Springer, berghofe@13009: series = LNCS, berghofe@13009: volume = 2152, wenzelm@12878: year = 2001} haftmann@22317: krauss@23187: @Proceedings{ijcar2006, krauss@23187: title = {Automated Reasoning: {IJCAR} 2006}, krauss@23187: booktitle = {Automated Reasoning: {IJCAR} 2006}, krauss@23187: editor = {U. Furbach and N. Shankar}, krauss@23187: publisher = Springer, krauss@23187: series = LNCS, krauss@23187: volume = 4130, krauss@23187: year = 2006} krauss@23187: krauss@25093: @Proceedings{tphols2007, krauss@25093: title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007}, krauss@25093: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2007}, krauss@25093: editor = {K. Schneider and J. Brandt}, krauss@25093: publisher = Springer, krauss@25093: series = LNCS, krauss@25093: volume = 4732, krauss@25093: year = 2007} krauss@25093: haftmann@28593: @Proceedings{tphols2008, haftmann@28593: title = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008}, haftmann@28593: booktitle = {Theorem Proving in Higher Order Logics: {TPHOLs} 2008}, haftmann@28593: publisher = Springer, haftmann@28593: series = LNCS, haftmann@28593: year = 2008} haftmann@28593: % editor = haftmann@28593: % volume = 4732, haftmann@28593: haftmann@22317: @unpublished{classes_modules, haftmann@23956: title = {{ML} Modules and {Haskell} Type Classes: A Constructive Comparison}, haftmann@22317: author = {Stefan Wehr et. al.} haftmann@22317: } blanchet@33191: blanchet@33191: @misc{wikipedia-2009-aa-trees, blanchet@33191: key = "Wikipedia", blanchet@33191: title = "Wikipedia: {AA} Tree", blanchet@33191: note = "\url{http://en.wikipedia.org/wiki/AA_tree}"}