% BibTeX database for the Isabelle documentation

%publishers

@string{AP="Academic Press"}

@string{CUP="Cambridge University Press"}

@string{IEEE="{\sc ieee} Computer Society Press"}

@string{LNCS="Lecture Notes in Computer Science"}

@string{MIT="MIT Press"}

@string{NH="North-Holland"}

@string{Prentice="Prentice-Hall"}

@string{PH="Prentice-Hall"}

@string{Springer="Springer-Verlag"}

%institutions

@string{CUCL="Computer Laboratory, University of Cambridge"}

@string{Edinburgh="Department of Computer Science, University of Edinburgh"}

@string{TUM="Department of Informatics, Technical University of Munich"}

%journals

@string{AI="Artificial Intelligence"}

@string{FAC="Formal Aspects of Computing"}

@string{JAR="Journal of Automated Reasoning"}

@string{JCS="Journal of Computer Security"}

@string{JFP="Journal of Functional Programming"}

@string{JLC="Journal of Logic and Computation"}

@string{JLP="Journal of Logic Programming"}

@string{JSC="Journal of Symbolic Computation"}

@string{JSL="Journal of Symbolic Logic"}

@string{PROYAL="Proceedings of the Royal Society of London"}

@string{SIGPLAN="{SIGPLAN} Notices"}

@string{TISSEC="ACM Transactions on Information and System Security"}

%conferences

@string{CADE="International Conference on Automated Deduction"}

@string{POPL="Symposium on Principles of Programming Languages"}

@string{TYPES="Types for Proofs and Programs"}

%A

@incollection{abramsky90,

  author	= {Samson Abramsky},

  title		= {The Lazy Lambda Calculus},

  pages		= {65-116},

  editor	= {David A. Turner},

  booktitle	= {Research Topics in Functional Programming},

  publisher	= {Addison-Wesley},

  year		= 1990}

@Unpublished{abrial93,

  author	= {J. R. Abrial and G. Laffitte},

  title		= {Towards the Mechanization of the Proofs of Some Classical

		  Theorems of Set Theory},

  note		= {preprint},

  year		= 1993,

  month		= Feb}

@incollection{aczel77,

  author	= {Peter Aczel},

  title		= {An Introduction to Inductive Definitions},

  pages		= {739-782},

  crossref	= {barwise-handbk}}

@Book{aczel88,

  author	= {Peter Aczel},

  title		= {Non-Well-Founded Sets},

  publisher	= {CSLI},

  year		= 1988}

@InProceedings{alf,

  author	= {Lena Magnusson and Bengt {Nordstr\"{o}m}},

  title		= {The {ALF} Proof Editor and Its Proof Engine},

  crossref	= {types93},

  pages		= {213-237}}

@inproceedings{andersson-1993,

  author = "Arne Andersson",

  title = "Balanced Search Trees Made Simple",

  editor = "F. K. H. A. Dehne and N. Santoro and S. Whitesides",

  booktitle = "WADS 1993",

  series = LNCS,

  volume = {709},

  pages = "61--70",

  year = 1993,

  publisher = Springer}

@book{andrews86,

  author	= "Peter Andrews",

  title		= "An Introduction to Mathematical Logic and Type Theory: to Truth

through Proof",

  publisher	= AP,

  series	= "Computer Science and Applied Mathematics",

  year		= 1986}

@InProceedings{Aspinall:2000:eProof,

  author = 	 {David Aspinall},

  title = 	 {Protocols for Interactive {e-Proof}},

  booktitle = 	 {Theorem Proving in Higher Order Logics (TPHOLs)},

  year =	 2000,

  note =	 {Unpublished work-in-progress paper,

                  \url{http://homepages.inf.ed.ac.uk/da/papers/drafts/eproof.ps.gz}}

}

@InProceedings{Aspinall:TACAS:2000,

  author = 	 {David Aspinall},

  title = 	 {{P}roof {G}eneral: A Generic Tool for Proof Development},

  booktitle = 	 {Tools and Algorithms for the Construction and Analysis of

                  Systems (TACAS)},

  year =	 2000,

  publisher	= Springer,

  series	= LNCS,

  volume	= 1785,

  pages = "38--42"

}

@Misc{isamode,

  author =	 {David Aspinall},

  title =	 {Isamode --- {U}sing {I}sabelle with {E}macs},

  note =	 {\url{http://homepages.inf.ed.ac.uk/da/Isamode/}}

}

@Misc{proofgeneral,

  author =	 {David Aspinall},

  title =	 {{P}roof {G}eneral},

  note =	 {\url{http://proofgeneral.inf.ed.ac.uk/}}

}

%B

@book{Baader-Nipkow,author={Franz Baader and Tobias Nipkow},

title="Term Rewriting and All That",publisher=CUP,year=1998}

@InCollection{Barendregt-Geuvers:2001,

  author = 	 {H. Barendregt and H. Geuvers},

  title = 	 {Proof Assistants using Dependent Type Systems},

  booktitle = 	 {Handbook of Automated Reasoning},

  publisher =	 {Elsevier},

  year =	 2001,

  editor =	 {A. Robinson and A. Voronkov}

}

@incollection{basin91,

  author	= {David Basin and Matt Kaufmann},

  title		= {The {Boyer-Moore} Prover and {Nuprl}: An Experimental

		   Comparison}, 

  crossref	= {huet-plotkin91},

  pages		= {89-119}}

@Unpublished{HOL-Library,

  author =       {Gertrud Bauer and Tobias Nipkow and Oheimb, David von and

                  Lawrence C Paulson and Thomas M Rasmussen and Christophe Tabacznyj and

                  Markus Wenzel},

  title =        {The Supplemental {Isabelle/HOL} Library},

  note =         {Part of the Isabelle distribution,

                  \url{http://isabelle.in.tum.de/library/HOL/Library/document.pdf}},

  year =         2002

}

@InProceedings{Bauer-Wenzel:2000:HB,

  author = 	 {Gertrud Bauer and Markus Wenzel},

  title = 	 {Computer-Assisted Mathematics at Work --- The {H}ahn-{B}anach Theorem in

      {I}sabelle/{I}sar},

  booktitle = 	 {Types for Proofs and Programs: TYPES'99},

  editor =       {Thierry Coquand and Peter Dybjer and Bengt Nordstr{\"o}m

                  and Jan Smith},

  series =	 {LNCS},

  year =	 2000

}

@InProceedings{Bauer-Wenzel:2001,

  author =       {Gertrud Bauer and Markus Wenzel},

  title =        {Calculational reasoning revisited --- an {Isabelle/Isar} experience},

  crossref =     {tphols2001}}

@INPROCEEDINGS{Berghofer-Nipkow:2000:TPHOL,

  crossref        = "tphols2000",

  title           = "Proof terms for simply typed higher order logic",

  author          = "Stefan Berghofer and Tobias Nipkow",

  pages           = "38--52"}

@inproceedings{berghofer-nipkow-2004,

  author = {Stefan Berghofer and Tobias Nipkow},

  title = {Random Testing in {I}sabelle/{HOL}},

  pages = {230--239},

  editor = "J. Cuellar and Z. Liu",

  booktitle = {{SEFM} 2004},

  publisher = IEEE,

  year = 2004}

@InProceedings{Berghofer-Nipkow:2002,

  author =       {Stefan Berghofer and Tobias Nipkow},

  title =        {Executing Higher Order Logic},

  booktitle =    {Types for Proofs and Programs: TYPES'2000},

  editor =       {P. Callaghan and Z. Luo and J. McKinna and R. Pollack},

  series =       LNCS,

  publisher =    Springer,

  volume =       2277,

  year =         2002}

@InProceedings{Berghofer-Wenzel:1999:TPHOL,

  author = 	 {Stefan Berghofer and Markus Wenzel},

  title = 	 {Inductive datatypes in {HOL} --- lessons learned in

                  {F}ormal-{L}ogic {E}ngineering},

  crossref =     {tphols99}}

@InProceedings{Bezem-Coquand:2005,

  author = 	 {M.A. Bezem and T. Coquand},

  title = 	 {Automating {Coherent Logic}},

  booktitle = {LPAR-12},

  editor = 	 {G. Sutcliffe and A. Voronkov},

  volume = 	 3835,

  series = 	 LNCS,

  publisher = Springer}

@book{Bird-Wadler,author="Richard Bird and Philip Wadler",

title="Introduction to Functional Programming",publisher=PH,year=1988}

@book{Bird-Haskell,author="Richard Bird",

title="Introduction to Functional Programming using Haskell",

publisher=PH,year=1998}

@inproceedings{blanchette-nipkow-2009,

  title = "Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)",

  author = "Jasmin Christian Blanchette and Tobias Nipkow",

  booktitle = "{TAP} 2009: Short Papers",

  editor = "Catherine Dubois",

  publisher = "ETH Technical Report 630",

  year = 2009}

@Article{boyer86,

  author	= {Robert Boyer and Ewing Lusk and William McCune and Ross

		   Overbeek and Mark Stickel and Lawrence Wos},

  title		= {Set Theory in First-Order Logic: Clauses for {G\"{o}del's}

		   Axioms},

  journal	= JAR,

  year		= 1986,

  volume	= 2,

  number	= 3,

  pages		= {287-327}}

@book{bm79,

  author	= {Robert S. Boyer and J Strother Moore},

  title		= {A Computational Logic},

  publisher	= {Academic Press},

  year		= 1979}

@book{bm88book,

  author	= {Robert S. Boyer and J Strother Moore},

  title		= {A Computational Logic Handbook},

  publisher	= {Academic Press},

  year		= 1988}

@Article{debruijn72,

  author	= {N. G. de Bruijn},

  title		= {Lambda Calculus Notation with Nameless Dummies,

	a Tool for Automatic Formula Manipulation,

	with Application to the {Church-Rosser Theorem}},

  journal	= {Indag. Math.},

  volume	= 34,

  pages		= {381-392},

  year		= 1972}

@InProceedings{bulwahnKN07,

  author   = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow},

  title    = {Finding Lexicographic Orders for Termination Proofs in {Isabelle/HOL}},

  crossref = {tphols2007},

  pages    = {38--53}

}

@InProceedings{bulwahn-et-al:2008:imperative,

  author   = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erkök and John Matthews},

  title    = {Imperative Functional Programming with {Isabelle/HOL}},

  crossref = {tphols2008},

}

%  pages    = {38--53}

@Article{ban89,

  author	= {M. Burrows and M. Abadi and R. M. Needham},

  title		= {A Logic of Authentication},

  journal	= PROYAL,

  year		= 1989,

  volume	= 426,

  pages		= {233-271}}

%C

@TechReport{camilleri92,

  author	= {J. Camilleri and T. F. Melham},

  title		= {Reasoning with Inductively Defined Relations in the

		 {HOL} Theorem Prover},

  institution	= CUCL,

  year		= 1992,

  number	= 265,

  month		= Aug}

@Book{charniak80,

  author	= {E. Charniak and C. K. Riesbeck and D. V. McDermott},

  title		= {Artificial Intelligence Programming},

  publisher	= {Lawrence Erlbaum Associates},

  year		= 1980}

@article{church40,

  author	= "Alonzo Church",

  title		= "A Formulation of the Simple Theory of Types",

  journal	= JSL,

  year		= 1940,

  volume	= 5,

  pages		= "56-68"}

@book{ClarkeGP-book,author="Edmund Clarke and Orna Grumberg and Doron Peled",

title="Model Checking",publisher=MIT,year=1999}

@PhdThesis{coen92,

  author	= {Martin D. Coen},

  title		= {Interactive Program Derivation},

  school	= {University of Cambridge},

  note		= {Computer Laboratory Technical Report 272},

  month		= nov,

  year		= 1992}

@book{constable86,

  author	= {R. L. Constable and others},

  title		= {Implementing Mathematics with the Nuprl Proof

		 Development System}, 

  publisher	= Prentice,

  year		= 1986}

%D

@Book{davey-priestley,

  author	= {B. A. Davey and H. A. Priestley},

  title		= {Introduction to Lattices and Order},

  publisher	= CUP,

  year		= 1990}

@Book{devlin79,

  author	= {Keith J. Devlin},

  title		= {Fundamentals of Contemporary Set Theory},

  publisher	= {Springer},

  year		= 1979}

@book{dummett,

  author	= {Michael Dummett},

  title		= {Elements of Intuitionism},

  year		= 1977,

  publisher	= {Oxford University Press}}

@incollection{dybjer91,

  author	= {Peter Dybjer},

  title		= {Inductive Sets and Families in {Martin-L{\"o}f's} Type

		  Theory and Their Set-Theoretic Semantics}, 

  crossref	= {huet-plotkin91},

  pages		= {280-306}}

@Article{dyckhoff,

  author	= {Roy Dyckhoff},

  title		= {Contraction-Free Sequent Calculi for Intuitionistic Logic},

  journal	= JSL,

  year		= 1992,

  volume	= 57,

  number	= 3,

  pages		= {795-807}}

%F

@Article{IMPS,

  author	= {William M. Farmer and Joshua D. Guttman and F. Javier

		 Thayer},

  title		= {{IMPS}: An Interactive Mathematical Proof System},

  journal	= JAR,

  volume	= 11,

  number	= 2,

  year		= 1993,

  pages		= {213-248}}

@InProceedings{felty91a,

  Author	= {Amy Felty},

  Title		= {A Logic Program for Transforming Sequent Proofs to Natural

		  Deduction Proofs}, 

  crossref	= {extensions91},

  pages		= {157-178}}

@Article{fleuriot-jcm,

  author = 	 {Jacques Fleuriot and Lawrence C. Paulson},

  title = 	 {Mechanizing Nonstandard Real Analysis},

  journal = 	 {LMS Journal of Computation and Mathematics},

  year = 	 2000,

  volume =	 3,

  pages =	 {140-190},

  note =	 {\url{http://www.lms.ac.uk/jcm/3/lms1999-027/}}

}

@TechReport{frost93,

  author	= {Jacob Frost},

  title		= {A Case Study of Co-induction in {Isabelle HOL}},

  institution	= CUCL,

  number	= 308,

  year		= 1993,

  month		= Aug}

%revised version of frost93

@TechReport{frost95,

  author	= {Jacob Frost},

  title		= {A Case Study of Co-induction in {Isabelle}},

  institution	= CUCL,

  number	= 359,

  year		= 1995,

  month		= Feb}

@inproceedings{OBJ,

  author	= {K. Futatsugi and J.A. Goguen and Jean-Pierre Jouannaud

		 and J. Meseguer}, 

  title		= {Principles of {OBJ2}},

  booktitle	= POPL, 

  year		= 1985,

  pages		= {52-66}}

%G

@book{gallier86,

  author	= {J. H. Gallier},

  title		= {Logic for Computer Science: 

		Foundations of Automatic Theorem Proving},

  year		= 1986,

  publisher	= {Harper \& Row}}

@Book{galton90,

  author	= {Antony Galton},

  title		= {Logic for Information Technology},

  publisher	= {Wiley},

  year		= 1990}

@Article{Gentzen:1935,

  author =       {G. Gentzen},

  title =        {Untersuchungen {\"u}ber das logische {S}chlie{\ss}en},

  journal =      {Math. Zeitschrift},

  year =         1935

}

@InProceedings{gimenez-codifying,

  author	= {Eduardo Gim{\'e}nez},

  title		= {Codifying Guarded Definitions with Recursive Schemes},

  crossref	= {types94},

  pages		= {39-59}

}

@book{girard89,

  author	= {Jean-Yves Girard},

  title		= {Proofs and Types},

  year		= 1989,

  publisher	= CUP, 

  note		= {Translated by Yves LaFont and Paul Taylor}}

@Book{mgordon-hol,

  editor	= {M. J. C. Gordon and T. F. Melham},

  title		= {Introduction to {HOL}: A Theorem Proving Environment for

		 Higher Order Logic},

  publisher	= CUP,

  year		= 1993}

@book{mgordon79,

  author	= {Michael J. C. Gordon and Robin Milner and Christopher P.

		 Wadsworth},

  title		= {Edinburgh {LCF}: A Mechanised Logic of Computation},

  year		= 1979,

  publisher	= {Springer},

  series	= {LNCS 78}}

@inproceedings{Gunter-HOL92,author={Elsa L. Gunter},

title={Why we can't have {SML} style datatype declarations in {HOL}},

booktitle={Higher Order Logic Theorem Proving and its Applications: Proc.\

IFIP TC10/WG10.2 Intl. Workshop, 1992},

editor={L.J.M. Claesen and M.J.C. Gordon},

publisher=NH,year=1993,pages={561--568}}

@InProceedings{gunter-trees,

  author	= {Elsa L. Gunter},

  title		= {A Broader Class of Trees for Recursive Type Definitions for

		  {HOL}},

  crossref	= {hug93},

  pages		= {141-154}}

%H

@InProceedings{Haftmann-Wenzel:2006:classes,

  author        = {Florian Haftmann and Makarius Wenzel},

  title         = {Constructive Type Classes in {Isabelle}},

  editor        = {T. Altenkirch and C. McBride},

  booktitle     = {Types for Proofs and Programs, TYPES 2006},

  publisher     = {Springer},

  series        = {LNCS},

  volume        = {4502},

  year          = {2007}

}

@TechReport{Haftmann-Nipkow:2007:codegen,

  author        = {Florian Haftmann and Tobias Nipkow},

  title         = {A Code Generator Framework for {Isabelle/HOL}},

  editor        = {Klaus Schneider and Jens Brandt},

  booktitle     = {Theorem Proving in Higher Order Logics: Emerging Trends Proceedings},

  month         = {08},

  year          = {2007},

  institution   = {Department of Computer Science, University of Kaiserslautern},

  number        = {364/07}

}

@InProceedings{Haftmann-Wenzel:2009,

  author        = {Florian Haftmann and Makarius Wenzel},

  title         = {Local theory specifications in {Isabelle/Isar}},

  editor        = {Stefano Berardi and Ferruccio Damiani and de Liguoro, Ugo},

  booktitle     = {Types for Proofs and Programs, TYPES 2008},

  publisher     = {Springer},

  series        = {LNCS},

  volume        = {5497},

  year          = {2009}

}

@manual{isabelle-classes,

  author        = {Florian Haftmann},

  title         = {Haskell-style type classes with {Isabelle}/{Isar}},

  institution   = TUM,

  note          = {\url{http://isabelle.in.tum.de/doc/classes.pdf}}

}

@manual{isabelle-codegen,

  author        = {Florian Haftmann},

  title         = {Code generation from Isabelle theories},

  institution   = TUM,

  note          = {\url{http://isabelle.in.tum.de/doc/codegen.pdf}}

}

@Book{halmos60,

  author	= {Paul R. Halmos},

  title		= {Naive Set Theory},

  publisher	= {Van Nostrand},

  year		= 1960}

@book{HarelKT-DL,author={David Harel and Dexter Kozen and Jerzy Tiuryn},

title={Dynamic Logic},publisher=MIT,year=2000}

@Book{hennessy90,

  author	= {Matthew Hennessy},

  title		= {The Semantics of Programming Languages: An Elementary

		  Introduction Using Structural Operational Semantics},

  publisher	= {Wiley},

  year		= 1990}

@book{HopcroftUllman,author={John E. Hopcroft and Jeffrey D. Ullman},

title={Introduction to Automata Theory, Languages, and Computation.},

publisher={Addison-Wesley},year=1979}

@Article{haskell-report,

  author	= {Paul Hudak and Simon Peyton Jones and Philip Wadler},

  title		= {Report on the Programming Language {Haskell}: A

		 Non-strict, Purely Functional Language},

  journal	= SIGPLAN,

  year		= 1992,

  volume	= 27,

  number	= 5,

  month		= May,

  note		= {Version 1.2}}

@Article{haskell-tutorial,

  author	= {Paul Hudak and Joseph H. Fasel},

  title		= {A Gentle Introduction to {Haskell}},

  journal	= SIGPLAN,

  year		= 1992,

  volume	= 27,

  number	= 5,

  month		= May}

@book{Hudak-Haskell,author={Paul Hudak},

title={The Haskell School of Expression},publisher=CUP,year=2000}

@article{huet75,

  author	= {G. P. Huet},

  title		= {A Unification Algorithm for Typed $\lambda$-Calculus},

  journal	= TCS,

  volume	= 1,

  year		= 1975,

  pages		= {27-57}}

@article{huet78,

  author	= {G. P. Huet and B. Lang},

  title		= {Proving and Applying Program Transformations Expressed with 

			Second-Order Patterns},

  journal	= acta,

  volume	= 11,

  year		= 1978, 

  pages		= {31-55}}

@inproceedings{huet88,

  author	= {G{\'e}rard Huet},

  title		= {Induction Principles Formalized in the {Calculus of

		 Constructions}}, 

  booktitle	= {Programming of Future Generation Computers},

  editor	= {K. Fuchi and M. Nivat},

  year		= 1988,

  pages		= {205-216}, 

  publisher	= {Elsevier}}

@Book{Huth-Ryan-book,

  author	= {Michael Huth and Mark Ryan},

  title		= {Logic in Computer Science. Modelling and reasoning about systems},

  publisher	= CUP,

  year		= 2000}

@InProceedings{Harrison:1996:MizarHOL,

  author = 	 {J. Harrison},

  title = 	 {A {Mizar} Mode for {HOL}},

  pages =	 {203--220},

  crossref =     {tphols96}}

%J

@article{haskell-revised-report,

  author =  {Simon {Peyton Jones} and others},

  title =   {The {Haskell} 98 Language and Libraries: The Revised Report},

  journal = {Journal of Functional Programming},

  volume =  13,

  number =  1,

  pages =   {0--255},

  month =   {Jan},

  year =    2003,

  note =    {\url{http://www.haskell.org/definition/}}}

@book{jackson-2006,

  author = "Daniel Jackson",

  title = "Software Abstractions: Logic, Language, and Analysis",

  publisher = MIT,

  year = 2006}

%K

@InProceedings{kammueller-locales,

  author = 	 {Florian Kamm{\"u}ller and Markus Wenzel and 

                  Lawrence C. Paulson},

  title = 	 {Locales: A Sectioning Concept for {Isabelle}},

  crossref =	 {tphols99}}

@book{Knuth3-75,

  author={Donald E. Knuth},

  title={The Art of Computer Programming, Volume 3: Sorting and Searching},

  publisher={Addison-Wesley},

  year=1975}

@Article{korf85,

  author	= {R. E. Korf},

  title		= {Depth-First Iterative-Deepening: an Optimal Admissible

		 Tree Search},

  journal	= AI,

  year		= 1985,

  volume	= 27,

  pages		= {97-109}}

@InProceedings{krauss2006,

  author   =  {Alexander Krauss},

  title    =  {Partial Recursive Functions in {Higher-Order Logic}},

  crossref =  {ijcar2006},

  pages =     {589--603}}

@PhdThesis{krauss_phd,

	author = {Alexander Krauss},

	title = {Automating Recursive Definitions and Termination Proofs in Higher-Order Logic},

  school = {Institut f{\"u}r Informatik, Technische Universit{\"a}t M{\"u}nchen},

	year = {2009},

	address = {Germany}

}

@manual{isabelle-function,

  author        = {Alexander Krauss},

  title         = {Defining Recursive Functions in {Isabelle/HOL}},

  institution   = TUM,

  note          = {\url{http://isabelle.in.tum.de/doc/functions.pdf}}

}

@Book{kunen80,

  author	= {Kenneth Kunen},

  title		= {Set Theory: An Introduction to Independence Proofs},

  publisher	= NH,

  year		= 1980}

%L

@manual{OCaml,

  author =  {Xavier Leroy and others},

  title =   {The Objective Caml system -- Documentation and user's manual},

  note =    {\url{http://caml.inria.fr/pub/docs/manual-ocaml/}}}

@InProceedings{lowe-fdr,

  author	= {Gavin Lowe},

  title		= {Breaking and Fixing the {Needham}-{Schroeder} Public-Key

		  Protocol using {CSP} and {FDR}},

  booktitle = 	 {Tools and Algorithms for the Construction and Analysis 

                  of Systems:  second international workshop, TACAS '96},

  editor =	 {T. Margaria and B. Steffen},

  series =	 {LNCS 1055},

  year =	 1996,

  publisher =	 {Springer},

  pages		= {147-166}}

%M

@Article{mw81,

  author	= {Zohar Manna and Richard Waldinger},

  title		= {Deductive Synthesis of the Unification Algorithm},

  journal	= SCP,

  year		= 1981,

  volume	= 1,

  number	= 1,

  pages		= {5-48}}

@InProceedings{martin-nipkow,

  author	= {Ursula Martin and Tobias Nipkow},

  title		= {Ordered Rewriting and Confluence},

  crossref	= {cade10},

  pages		= {366-380}}

@book{martinlof84,

  author	= {Per Martin-L{\"o}f},

  title		= {Intuitionistic type theory},

  year		= 1984,

  publisher	= {Bibliopolis}}

@incollection{melham89,

  author	= {Thomas F. Melham},

  title		= {Automating Recursive Type Definitions in Higher Order

		 Logic}, 

  pages		= {341-386},

  crossref	= {birtwistle89}}

@Article{Miller:1991,

  author = 	 {Dale Miller},

  title = 	 {A Logic Programming Language with Lambda-Abstraction, Function Variables,

    and Simple Unification},

  journal = 	 {Journal of Logic and Computation},

  year = 	 1991,

  volume =	 1,

  number =	 4

}

@Article{miller-mixed,

  Author	= {Dale Miller},

  Title		= {Unification Under a Mixed Prefix},

  journal	= JSC,

  volume	= 14,

  number	= 4,

  pages		= {321-358},

  Year		= 1992}

@Article{milner78,

  author	= {Robin Milner},

  title		= {A Theory of Type Polymorphism in Programming},

  journal	= "J. Comp.\ Sys.\ Sci.",

  year		= 1978,

  volume	= 17,

  pages		= {348-375}}

@TechReport{milner-ind,

  author	= {Robin Milner},

  title		= {How to Derive Inductions in {LCF}},

  institution	= Edinburgh,

  year		= 1980,

  type		= {note}}

@Article{milner-coind,

  author	= {Robin Milner and Mads Tofte},

  title		= {Co-induction in Relational Semantics},

  journal	= TCS,

  year		= 1991,

  volume	= 87,

  pages		= {209-220}}

@Book{milner89,

  author	= {Robin Milner},

  title		= {Communication and Concurrency},

  publisher	= Prentice,

  year		= 1989}

@book{SML,author="Robin Milner and Mads Tofte and Robert Harper",

title="The Definition of Standard ML",publisher=MIT,year=1990}

@PhdThesis{monahan84,

  author	= {Brian Q. Monahan},

  title		= {Data Type Proofs using Edinburgh {LCF}},

  school	= {University of Edinburgh},

  year		= 1984}

@article{MuellerNvOS99,

author=

{Olaf M{\"u}ller and Tobias Nipkow and Oheimb, David von and Oscar Slotosch},

title={{HOLCF = HOL + LCF}},journal=JFP,year=1999,volume=9,pages={191--223}}

@Manual{Muzalewski:Mizar,

  title = 	 {An Outline of {PC} {Mizar}},

  author =	 {Micha{\l} Muzalewski},

  organization = {Fondation of Logic, Mathematics and Informatics

                  --- Mizar Users Group},

  year =	 1993,

  note =	 {\url{http://www.cs.kun.nl/~freek/mizar/mizarmanual.ps.gz}}

}

%N

@InProceedings{NaraschewskiW-TPHOLs98,

  author	= {Wolfgang Naraschewski and Markus Wenzel},

  title		= 

{Object-Oriented Verification based on Record Subtyping in

                  Higher-Order Logic},

  crossref      = {tphols98}}

@inproceedings{nazareth-nipkow,

  author	= {Dieter Nazareth and Tobias Nipkow},

  title		= {Formal Verification of Algorithm {W}: The Monomorphic Case},

  crossref	= {tphols96},

  pages		= {331-345},

  year		= 1996}

@Article{needham-schroeder,

  author =       "Roger M. Needham and Michael D. Schroeder",

  title =        "Using Encryption for Authentication in Large Networks

                 of Computers",

  journal =      cacm,

  volume =       21,

  number =       12,

  pages =        "993-999",

  month =        dec,

  year =         1978}

@inproceedings{nipkow-W,

  author	= {Wolfgang Naraschewski and Tobias Nipkow},

  title		= {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}},

  booktitle	= {Types for Proofs and Programs: Intl. Workshop TYPES '96},

  editor	= {E. Gim{\'e}nez and C. Paulin-Mohring},

  publisher	= Springer,

  series	= LNCS,

  volume	= 1512,

  pages		= {317-332},

  year		= 1998}

@InCollection{nipkow-sorts93,

  author = 	 {T. Nipkow},

  title = 	 {Order-Sorted Polymorphism in {Isabelle}},

  booktitle = 	 {Logical Environments},

  publisher =	 CUP,

  year =	 1993,

  editor =	 {G. Huet and G. Plotkin},

  pages =	 {164--188}

}

@Misc{nipkow-types93,

  author =	 {Tobias Nipkow},

  title =	 {Axiomatic Type Classes (in {I}sabelle)},

  howpublished = {Presentation at the workshop \emph{Types for Proof and Programs}, Nijmegen},

  year =	 1993

}

@inproceedings{Nipkow-CR,

  author	= {Tobias Nipkow},

  title		= {More {Church-Rosser} Proofs (in {Isabelle/HOL})},

  booktitle	= {Automated Deduction --- CADE-13},

  editor	= {M. McRobbie and J.K. Slaney},

  publisher	= Springer,

  series	= LNCS,

  volume	= 1104,

  pages		= {733-747},

  year		= 1996}

% WAS Nipkow-LICS-93

@InProceedings{nipkow-patterns,

  title		= {Functional Unification of Higher-Order Patterns},

  author	= {Tobias Nipkow},

  pages		= {64-74},

  crossref	= {lics8},

  url		= {\url{ftp://ftp.informatik.tu-muenchen.de/local/lehrstuhl/nipkow/lics93.html}},

  keywords	= {unification}}

@article{nipkow-IMP,

  author	= {Tobias Nipkow},

  title		= {Winskel is (almost) Right: Towards a Mechanized Semantics Textbook},

  journal	= FAC,

  volume	= 10,

  pages		= {171-186},

  year		= 1998}

@inproceedings{Nipkow-TYPES02,

  author        = {Tobias Nipkow},

  title         = {{Structured Proofs in Isar/HOL}},

  booktitle     = {Types for Proofs and Programs (TYPES 2002)},

  editor        = {H. Geuvers and F. Wiedijk},

  year          = 2003,

  publisher     = Springer,

  series        = LNCS,

  volume        = 2646,

  pages         = {259-278}}

@manual{isabelle-HOL,

  author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},

  title		= {{Isabelle}'s Logics: {HOL}},

  institution	= {Institut f{\"u}r Informatik, Technische Universi{\"a}t

                  M{\"u}nchen and Computer Laboratory, University of Cambridge},

  note          = {\url{http://isabelle.in.tum.de/doc/logics-HOL.pdf}}}

@article{nipkow-prehofer,

  author	= {Tobias Nipkow and Christian Prehofer},

  title		= {Type Reconstruction for Type Classes},

  journal	= JFP,

  volume	= 5,

  number	= 2,

  year		= 1995,

  pages		= {201-224}}

@InProceedings{Nipkow-Prehofer:1993,

  author =       {T. Nipkow and C. Prehofer},

  title =        {Type checking type classes},

  booktitle =    {ACM Symp.\ Principles of Programming Languages},

  year =         1993

}

@Book{isa-tutorial,

  author	= {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},

  title		= {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},

  publisher	= Springer,

  year		= 2002,

  series    = LNCS,

  volume    = 2283}

@Article{noel,

  author	= {Philippe No{\"e}l},

  title		= {Experimenting with {Isabelle} in {ZF} Set Theory},

  journal	= JAR,

  volume	= 10,

  number	= 1,

  pages		= {15-58},

  year		= 1993}

@book{nordstrom90,

  author	= {Bengt {Nordstr{\"o}m} and Kent Petersson and Jan Smith},

  title		= {Programming in {Martin-L{\"o}f}'s Type Theory.  An

		 Introduction}, 

  publisher	= {Oxford University Press}, 

  year		= 1990}

%O

@Manual{pvs-language,

  title		= {The {PVS} specification language},

  author	= {S. Owre and N. Shankar and J. M. Rushby},

  organization	= {Computer Science Laboratory, SRI International},

  address	= {Menlo Park, CA},

  note          = {Beta release},

  year		= 1993,

  month		= apr,

  url		= {\url{http://www.csl.sri.com/reports/pvs-language.dvi.Z}}}

%P

% replaces paulin92

@InProceedings{paulin-tlca,

  author	= {Christine Paulin-Mohring},

  title		= {Inductive Definitions in the System {Coq}: Rules and

		 Properties},

  crossref	= {tlca93},

  pages		= {328-345}}

@InProceedings{paulson-CADE,

  author	= {Lawrence C. Paulson},

  title		= {A Fixedpoint Approach to Implementing (Co)Inductive

		  Definitions},

  pages		= {148-161},

  crossref	= {cade12}}

@InProceedings{paulson-COLOG,

  author	= {Lawrence C. Paulson},

  title		= {A Formulation of the Simple Theory of Types (for

		 {Isabelle})}, 

  pages		= {246-274},

  crossref	= {colog88},

  url		= {\url{http://www.cl.cam.ac.uk/Research/Reports/TR175-lcp-simple.dvi.gz}}}

@Article{paulson-coind,

  author	= {Lawrence C. Paulson},

  title		= {Mechanizing Coinduction and Corecursion in Higher-Order

		  Logic},

  journal	= JLC,

  year		= 1997,

  volume	= 7,

  number	= 2,

  month		= mar,

  pages		= {175-204}}

@manual{isabelle-intro,