bibi.bib

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% String Definitions

% Institutions

@STRING{AMS   = "American Mathematical Society"}
@STRING{DAI   = "Dept.\ of Artificial Intelligence, University of Edinburgh"}
@STRING{DFKI  = "DFKI Saarbr{\"u}cken"}
@STRING{FZKI  = "Forschungszentrum K\protect{\"u}nstliche Intelligenz, Saarbr\protect{\"u}cken"}
@STRING{IWBS  = "IBM, Scientific Center, Institute for Knowledge Based Systems"}
@STRING{THD   = "Technische Hochschule Darmstadt"}
@STRING{UoD   = "University of Darmstadt"}
@STRING{UKA   = "Universit\protect{\"a}t Karlsruhe"}
@STRING{UKL   = "Universit\protect{\"a}t Kaiserslautern"}
@STRING{USL   = "Universit\protect{\"a}t des Saarlands"}
@STRING{INRIA = "CRIN \& INRIA-Lorraine"}
@STRING{fundinf	= "Fundam. Inform." }
% Proceedings and Conferences

@STRING{AAAI88 = "Proceedings of the Seventh American Association for
         Artificial Intelligence Conference, Saint Paul, Minnesota"}
@STRING{AAAI90 = "Proceedings of the Eigth American Association for
         Artificial Intelligence Conference, Boston, Ma."}
@string{ASE97 = "Proceedings of the twelfth IEEE International Automated
                 Software Engineering Conference, Incline Village, Nevada"}
@string{AISC98 = "Proceedings of the 4th International Conference on
          Symbolic Computation and Artificial Intelligence, Plattsburgh, NY, USA"}
@STRING{CADE80 = "Proceedings of the 5th International Conference on
         Automated Deduction, Les Arcs, France"}
@STRING{CADE84 = "Proceedings of the 7th International Conference on
                 Automated Deduction, Napa, Ca., USA"}
@STRING{CADE86 = "Proceedings of the 8th International Conference on
         Automated Deduction, Oxford, UK"}
@STRING{CADE88 = "Proceedings of the 9th International Conference on
         Automated Deduction, Argonne"}
@STRING{CADE90 = "Proceedings of the 10th International Conference on
         Automated Deduction, Kaiserslautern"}
@STRING{CADE92 = "Proceedings of the 11th International Conference on
         Automated Deduction, Saratoga Springs, NY"}
@STRING{CADE94 = "Proceedings of the 12th International Conference on
         Automated Deduction, Nancy, France"}
@STRING{CADE96 = "Proceedings of the 13th International Conference on
         Automated Deduction, New Brunswick, NJ, July 1996"}
@STRING{CADE97 = "Proceedings of the 14th International Conference on
         Automated Deduction"}
@STRING{CADE98 = "Proceedings of the 15th International Conference on
         Automated Deduction, Lindau, Germany, July 1998"}
@string{Cogsci94 = "Proceedings of the 16th Annual Conference of
                  the Cognitive Science Society"}
@STRING{CTRS87 = "Proceedings of the 1st International Workshop on
          Conditional Term Rewriting Systems, Orsay, France"}
@STRING{CTRS90 = "Proceedings of the 2nd International CTRS--Workshop,
         Montreal, Canada"}
@STRING{CTRS92 = "Proceedings of the third International CTRS--Workshop,
         Pont-{\`a}-Mousson, France"}
@STRING{ECAI86 = "Proceedings of the 7th European Conference on Artificial
          Intelligence, Brighton"}
@STRING{ECAI88 = "Proceedings of the 8th European Conference on Artificial
          Intelligence"}
@STRING{EUROCAL85 = "European Conference on Computer Algebra,
         EUROCAL-85, Linz, Austria"}
@STRING{FLAIRS97 = "Proceedings of the 10th FLAIRS Conference, Daytona Beach,
                  Fa."}
@STRING{HICSS94 = "Proceedings of the Hawaiian International Conference
          on System Sciences"}
@STRING{IJCAI83 = "Proceedings of the eighth International Joint
         Conference on Artificial Intelligence, Karlsruhe,
          Germany"}
@string{IJCAI85 = "Proceedings of the 9th International Joint
         Conference on Artificial Intelligence, Los Angeles"}
@STRING{IJCAI89 = "Proceedings of the 11th International Joint
         Conference on Artificial Intelligence"}
@STRING{IJCAI93 = "Proceedings of the 13th International Joint
         Conference on Artificial Intelligence, Chamb{\'e}ry, France"}
@STRING{ISMVL94 = "Proceedings of the 24th International Symposium on
                  Multiple-valued Logic, Boston, Ma"}
@STRING{ISMVL96 = "Proceedings of the 26th International Symposium on
                  Multiple-valued Logic, Santiago de Compostela, Spain"}
@STRING{IWWC97 = "Proceeding of the Third International Women, Work
                  and Computerization, Bonn, Germany"}
@STRING{KI94    = "Proceedings of the 18th German Annual Conference on
          Artificial Intelligence, Saarbr{\"u}cken, Germany"}
@STRING{KI95    = "Proceedings of the 19th German Annual Conference on
          Artificial Intelligence, Bielefeld, Germany"}
@string{KI97    = "Proceedings of the 21st German Annual Conference on
          Artificial Intelligence, Freiburg, Germany"}
@STRING{KGC93   = "Proceedings of the 3rd Kurt G{\"o}del Colloquium on
                  Computational Logic and Proof Theory, Brno, Czech Republic"}
@STRING{ML95 =    "Proceedings of the 12th International Conference on
          Machine Learning, Tahoe City, Ca"}
@STRING{LICS86 = "Proceedings of the first annual Symposium on Logic
         in Computer Science, Cambridge, Ma"}
@string{LPAR92 = "Proceedings of the Conference on Logic Programming
          and Automated Reasoning, St.~Petersburg"}
@string{LPAR93 = "Proceedings of the Conference on Logic Programming
          and Automated Reasoning, St.~Petersburg"}
@STRING{LICS88 = "Proceedings of the third annual Symposium on Logic in
         Computer Science, Edinburgh, Scotland"}
@string{LPST93 = "Logic Program Synthesis and Transformation"}
@STRING{POPL88 = "Proceedings of the 15th Annual ACM SIGACT-SIGPLAN
          Symposium on Principles of Programming Languages, San Diego, CA"}
@STRING{popl13	= "Proc. of the 40th ACM Symp. on Principles of Programming
		  Languages, POPL 2013" }
@STRING{RTA85  = "Proceedings of the 1nd International Conference
         on Rewriting Techniques and Applications, Dijon, France"}
@STRING{RTA87  = "Proceedings of the 2nd International Conference
         on Rewriting Techniques and Applications, Bordeaux, France"}
@STRING{RTA89  = "Proceedings of the 3rd International Conference
                 on Rewriting Techniques and Applications, Chapel
         Hill, North Carolina, USA"}
@STRING{RTA91  = "Proceedings of the 4th International Conference
         on Rewriting Techniques and Applications, Como, Italy"}
@STRING{RTA93  = "Proceedings of the 5th International Conference
         on Rewriting Techniques and Applications, Montreal, Canada"}
@STRING{RTA95  = "Proceedings of the 6th International Conference
         on Rewriting Techniques and Applications, Kaiserslautern, Germany"}
@STRING{RTA99  = "Proceedings of the 10th International Conference
         on Rewriting Techniques and Applications, Trento, Italy"}
@STRING{TACS94 = "Proceedings of the Symposium on Theoretical Aspects
          of Computer Science"}
@STRING{TPHOLs98 = "Proceedings of the 11th International Conference on Theorem
    Proving in Higher Order Logics (TPHOLs'98), Canberra, Australia"}
@STRING{TPHOL99 = "Proceedings of the 12th International Conference on Theorem
    Proving in Higher Order Logics (TPHOLs'99), Nice, France"}
@STRING{TPHOLs09 = "22nd International Conference on Theorem
    Proving in Higher Order Logics (TPHOLs'09)"}
@STRING{IJCAR01  = "{First International Joint Conference
         on Automated Reasoning (IJCAR'01)}"}
@STRING{IJCAR06  = "Proceedings of the Third International Joint Conference
         on Automated Reasoning, Seattle, USA"}
@STRING{IJCAR08  = "4th International Joint Conference
         on Automated Reasoning"}

% Names of Journals
@STRING{ACTAINF = "Acta Informatica"}
@STRING{AI      = "Artificial Intelligence"}
@STRING{CACM    = "Communications of the ACM"}
@STRING{FI      = "Fundamenta Informaticae"}
@STRING{JACM    = "Journal of the ACM"}
@STRING{JAR     = "Journal of Automated Reasoning"}
@STRING{JCSS    = "Journal of Computer and System Sciences"}
@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{MSCS	= "Mathematical Structures in Computer Science" }
@STRING{SIAMJC  = "SIAM Journal on Computation"}
@STRING{TCS     = "Theoretical Computer Science"}
@STRING{TOPLAS  = "ACM Transactions on Programming Languages and Systems"}
@string{AHC     = "IEE Annals of the History of Computing"}
@STRING{JAIR    = "Journal of Artificial Intelligence Research"}

% misc
@STRING{DAIRP   = "University of {E}dinburgh {DAI} Research Paper"}
@STRING{SEKI    = "{SEKI} {R}eport"}

% books
@STRING{MLAaR   = "Meta-Level Architectures and Reflection"}

% publisher
@string{ACM     = "ACM Press"}
@STRING{AVB     = "Akademie-Verlag Berlin"}
@STRING{AW      = "Addison-Wesley"}
@STRING{AP      = "Academic Press"}
@string{BIRK    = "Birkh{\"a}user Verlag"}
@STRING{CUP     = "Cambridge University Press"}
@STRING{cup     = "Cambridge University Press"}
@STRING{ESP     = "Elsevier Science Publishers B.V."}
@STRING{MK      = "Morgan Kaufmann"}
@STRING{NoHo    = "North-Holland"}
@STRING{OUP     = "Oxford University Press"}
@STRING{PH      = "Prentice-Hall"}
@STRING{SPR     = "Springer-Verlag"}
@STRING{TEU     = "Teubner"}
@STRING{VIE     = "Vieweg"}
@string{IEEECS  = "IEEE Computer Society"}

% series
@string{LNAI    = "Lecture Notes in Artificial Intelligence"}
@string{LNCS    = "Lecture Notes in Computer Science"}

%% Authors
%% Keep spaces around the names so that we can use #{and}# rather than
%% having to use #{ and }#.
@string{Appel     = { Andrew W. Appel }}
@string{Felty     = { Amy P. Felty }}
@string{Cheng     = { Perry Cheng }}
@string{Crary     = { Karl Crary }}
@string{Glew      = { Neal Glew }}
@string{Harper    = { Robert Harper }}
@string{League	  = { Christopher League }}
@string{Lee       = { Peter Lee }}
@string{Momigliano= { Alberto Momigliano }}
@string{Monnier	  = { Stefan Monnier }}
@string{Morrisett = { Greg Morrisett }}
@string{Saha      = { Bratin Saha }}
@string{Shao      = { Zhong Shao }}
@string{Stone     = { Christopher Stone }}
@string{Tarditi   = { David Tarditi }}
@string{Trifonov  = { Valery Trifonov }}
@string{Walker    = { David Walker }}


@Booklet{Blackout2003,
  title =    {Final {R}eport on the {A}ugust 14, 2003 {B}lackout in the {U}nited {S}tates and {C}anada: Causes and {R}ecommendations},
  author =   {U.S. and Canada Power System Outage Task Force},
  OPThowpublished = {},
  address =      {National Resources Canada},
  month =    {April},
  year =     {2004},
  OPTnote =      {},
  OPTannote =    {}
}


@PhdThesis{Sarkar:Phd09,
  author = 	 {Susmit Sarkar},
  title = 	 {A Dependently Typed Programming Language, with applications to Foundational Certified Code Systems },
  school = 	 {Carnegie Mellon University},
  year = 	 {2009},
  note = 	 {CMU-CS-09-128}
}

@Misc{Sarkar:phdproposal05,
  author =   {Susmit Sarkar},
  title =    {A cost-effective certified code system},
  howpublished = {Thesis proposal, Carnegie Mellon University},
  OPTmonth =     {},
  year =     {2005},
  OPTnote =      {},
  OPTannote =    {}
}

"\newcommand{\ppdp}[1]{\cconf{PPDP}{{I}nternational {C}onference on {P}rinciples and {P}ractice of {D}eclarative {P}rogramming}{#1}}" #
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%  Literature sorted alphabetically by first author
%  Personal communication entries are near the end of the file.
%  Search for `%%% [A-Z]' to find a location for a certain author.


%%% A

@inproceedings{Abadi:POPL90,
   author    = {Martin Abadi and Luca Cardelli and Pierre-Louis Curien and Jean-Jacques L\`{e}vy},
   title     = {Explicit Substitutions},
   booktitle = {17th {ACM} {SIGPLAN-SIGACT} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
   publisher = ACM,
   pages     = {31--46},
   year      = {1990}
}

@InProceedings{AbadiBlanchet2002,
  author    = {Martin Abadi and Bruno Blanchet},
  title     = {Analyzing {S}ecurity {P}rotocols with {S}ecrecy {T}ypes and {L}ogic {P}rograms},
  booktitle = {29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2002)},
  pages     = {33--44},
  year      = {2002},
  address   = {Portland, Oregon},
  month     = jan,
  publisher = ACM
}

@article{Abadi:TOPLAS93,
  author    = {Mart\'{\i}n Abadi and
               Michael Burrows and
               Butler W. Lampson and
               Gordon D. Plotkin},
  title     = {A Calculus for Access Control in Distributed Systems},
  journal   = {ACM Transaction on Programming Language Systems},
  volume    = {15},
  number    = {4},
  year      = {1993},
  pages     = {706-734}
}

@inproceedings{Abadi:POPL99,
  author = {Martin Abadi and Anindya Banerjee and Nevin Heintze and Jon G. Riecke},
  title = {A core calculus of dependency},
  booktitle = {26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '99)},
  year = {1999},
  pages = {147--160},
  publisher = ACM,
}

@InProceedings{Abel:POPL13,
  author	= {Andreas Abel and Brigitte Pientka and David Thibodeau and
		  Anton Setzer},
  title		= {Copatterns: Programming Infinite Structures by
		  Observations},
  booktitle	= popl13,
  year		= 2013,
  pages		= {27-38}
}


@Article{	  abelCoquand:lfsigma,
  author	= {Andreas Abel and Thierry Coquand},
  title		= {Untyped Algorithmic Equality for {Martin-L\"of's} Logical
		  Framework with Surjective Pairs},
  journal	= fundinf,
  year		= 2007,
  volume	= 77,
  number	= 4,
  pages		= {345--395},
  note		= {{TLCA'05} special issue.}
}


@Article{Abel:mscs06,
  author	= {Andreas Abel},
  title		= {Polarized Subtyping for Sized Types},
  journal	= MSCS,
  year		= 2008,
  volume    = 18,
  number    = 5,
  pages     = {797-822},
  note		= {Special issue on subtyping, edited by Healfdene Goguen and
		  Adriana Compagnoni}}

@inproceedings{Abel:CSL04,
  author    = {Andreas Abel and
               Ralph Matthes},
  title     = {Fixed Points of Type Constructors and Primitive Recursion},
  editor    = {Jerzy Marcinkowski and
               Andrzej Tarlecki},
  booktitle = {18th International Workshop on Computer Science Logic (CSL'04)},
  year      = {2004},
  pages     = {190-204},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3210}
}


@InProceedings{Abel:APLAS07,
  author    = {Andreas Abel},
  title	    = {Mixed Inductive/Coinductive Types and Strong Normalization},
  booktitle = {5th ASIAN Symposium on Programming Languages and Systems (APLAS'07)},
  editor    = {Zhong Shao},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {4807},
  year      = {2007},
  pages     = {286-301}
}

@InProceedings{Abel00,
  author =   {Andreas Abel},
  title =    {Specification and Verification of a Formal System for Structurally Recursive Functions},
  booktitle =    {Types for Proof and Programs, International Workshop, TYPES '99},
  year =     2000,
  editor =       {Thierry Coquand and Peter Dybjer and Bengt Nordstr\"om and Jan Smith},
  series =   LNCS,
  volume =       1956,
  pages  =       {1--20},
  publisher =    {Springer-Verlag},
  keywords =     "Termination, structural subterm order, reasoning,
          inductive types",
  url =          {http://www.tcs.informatik.uni-muenchen.de/\~abel/sound-simple.pdf}
}

@InProceedings{Abel:LFM01,
  author =    {Andreas Abel},
  title =     {A Third-Order Representation of the $\lambda\mu$-Calculus},
  booktitle = {Electronic Notes in Theoretical Computer Science},
  volume =    {58},
  issue =     {1},
  publisher = {Elsevier Science Publishers},
  editor =    {S.J. Ambler, R.L. Crole and A. Momigliano},
  year =      {2001},
  url =       {http://www.elsevier.com/gej-ng/31/29/23/90/27/show/Products/notes/index.htt}
}

@article{AbelAltenkirch:JFP02,
   author    = "Andreas Abel and Thorsten Altenkirch",
   title     = "A predicative analysis of structural recursion",
   journal   = "Journal of  Functional Programming",
   year      = "2002",
   volume    = "12",
   number    = "1",
   pages     = "1-41",
   keywords  = "type-checking, termination"
}


@inproceedings{Altenkirch:TLCA93,
  author    = {Thorsten Altenkirch},
  editor    = {Marc Bezem and
               Jan Friso Groote},
  title     = {A Formalization of the Strong Normalization Proof for {System
               F} in {LEGO}},
  booktitle = {International Conference on Typed Lambda Calculi and Applications (TLCA '93)},
  year      = {1993},
  pages     = {13-28},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {664},
  isbn      = {3-540-56517-5}
}


@PhDThesis{	  adams:PhD,
  author	= {Robin Adams},
  title		= {A Modular Hierarchy of Logical Frameworks},
  school	= {University of Manchester},
  year		= 2005
}


@article{Andreoli92,
   author    = "Jean-Marc Andreoli",
   title     = "Logic programming with focusing proofs in linear logic",
   journal   = "Journal of  Logic and Computation",
   year      = "1992",
   OPTmonth     = aug,
   volume    = "2",
   number    = "3",
   pages     = "297-347",
   keywords  = "proof search, focusing, linear logic, linear logic programming"
}

@inproceedings{AppelFelten99,
    author = "Andrew W. Appel and Edward W. Felten",
    title = "Proof-Carrying Authentication",
    booktitle = "{ACM} Conference on Computer and Communications Security",
    pages = "52-62",
    year = "1999",
    url = "citeseer.nj.nec.com/appel99proofcarrying.html" }

@InProceedings{AppelFelty00,
  author =   {W.~Appel and Amy P.~Felty},
  title =    {A Semantic Model of Types and Machine Instructions for Proof-Carrying Code},
  booktitle =    {27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '00)},
  pages =    {243-253},
  year =     2000
}

@inproceedings{Appel:CCS99,
  author    = {Andrew W. Appel and
               Edward W. Felten},
  title     = {Proof-Carrying Authentication},
  booktitle = {ACM Conference on Computer and Communications Security},
  year      = {1999},
  pages     = {52-62},
  ee        = {http://doi.acm.org/10.1145/319709.319718},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@InProceedings{Appel01lics,
  author =   {Andrew Appel},
  title =    {Foundational Proof-Carrying Code},
  booktitle =    {Proceedings of the 16th Annual Symposium on
                  Logic in Computer Science (LICS'01)},
  pages =    {247--256},
  year =     2001,
  editor =   {J. Halpern},
  month =    jun,
  publisher =    {IEEE Computer Society Press},
  note =         {Invited Talk},
  keywords =     {PCC, LF, Elf}
}

@Article{Adam96,
  author =   "Alison Adam",
  title =    "Constructing Gender in the History of Artificial Intelligence",
  journal =      AHC,
  year =     "1996",
  OPTkey =   "",
  volume =   "18",
  number =   "3",
  OPTmonth =     "",
  pages =    "47 - 53",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "women studies, feminism, gender, knowledge representation"
}

@BOOK{Adams79,
  author =       "Douglas Adams",
  title =        "The Hitch Hiker's Guide to the Galaxy",
  publisher =    "Pan Books",
  edition =      "First",
  year =         "1979",
  keywords =     "Deep Thought"
}

@article{Amati:StudiaLogica94,
    author = "Giambattista Amati and Fiora Pirri",
    title = "A Uniform Tableau Method for Intuitionistic Modal Logics {I}",
    journal = "Studia Logica",
    volume = "53",
    number = "1",
    pages = "29--60",
    year = "1994",
    url = "citeseer.ist.psu.edu/article/amati93uniform.html" 
}

@InProceedings{Armando97,
  author =   "A. Armando and A. Smaill and I. Green",
  title =    "Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm",
  booktitle =    ASE97,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1997",
  OPTorganization = "",
  publisher = IEEECS,
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "2-9",
  OPTnote =      "",
  OPTannote =    "",
  keywords =    "proof planning, existential quantifiers, specifications"
}

@Misc{Ashley:POPLMARK,
  author =   "Michael Ashley-Rollman and Karl Crary and Robert Harper",
  title =    "Twelf solution to POPLMark Challenge",
  howpublished = "electronically available at {\tt http://fling-l.seas.upenn.edu/~plclub/cgi-bin/poplmark/index.php?title=Submission\_from\_Carnegie\_Mellon }",
  OPTmonth =     {},
  OPTyear =      {},
  OPTnote =      {},
  OPTannote =    {}
}

@PhDThesis{Aubin76,
  author =      "Raymond Aubin",
  title =       "Mechanizing Structural Induction",
  school =      "University of Edinburgh",
  year =        "1976",
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "explicit induction"
}

@article{Aubin79,
   author    =  "Raymond Aubin",
   title     =  "Mechanizing Structural Induction",
   journal   =  TCS,
   year      =  "1979",
   volume    =  "9",
   pages     =  "329-362",
   keywords  =  "explicit induction, induction heuristics, call-by-need
          heuristic"
}

@article{Aubin79a,
   author    =  "Raymond Aubin",
   title     =  "Mechanizing Structural Induction, Part {I}: Formal System",
   journal   =  TCS,
   year      =  "1979",
   volume    =  "9",
   pages     =  "329-345",
   keywords  =  "explicit induction"
}

@article{Aubin79b,
   author    =  "Raymond Aubin",
   title     =  "Mechanizing Structural Induction, Part {II}: Strategies",
   journal   =  TCS,
   year      =  "1979",
   volume    =  "9",
   pages     =  "347-362",
   keywords  =  "explicit induction, induction heuristics, call-by-need
          heuristic"
}

@inproceedings{Avellone:TABEAUX96,
    author = "Alessandro Avelone and Mauro Ferrari",
    title = "Almost Duplication-Free Tableau Calculi for Propositional Lax Logics",
    booktitle = "Analytic Tableaux and Related Methods",
    pages = "48--64",
    year = "1996",
    url = "citeseer.ist.psu.edu/avellone96almost.html" 
}

@TechReport{Avenhaus84,
  author =   "J{\"u}rgen Avenhus",
  title =    "On the termination of the {K}nuth-{B}endix
          completion algorithm",
  institution =  UKL,
  year =     "1984",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "120/84",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination of KBA, Knuth-Bendix completion"
}

@Book{Avenhaus95,
  author =   "J{\"u}rgen Avenhaus",
  title =    "Termersetzungssysteme",
  publisher =    SPR,
  year =     "1995",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "textbook"
}

@TechReport{AvenhausBecker92,
  author =   "J{\"u}rgen Avenhaus and Klaus Becker",
  title =    "Conditional Rewriting modula a Built-in Algebra",
  institution =  UKL,
  year =     1992,
  type =     SEKI,
  number =   "{SR}-92-11",
  keywords  =    "inductionless induction, rewriting, order sorted
          algebra, built-in algebra"
}



@TechReport{Aydemir:TechReport09,
  author = 	 {B. Aydemir and S. Zdancewic and S. Weirich},
  title = 	 {Abstracting Syntax},
  institution =  {University of Pennsylvania},
  year = 	 {1990},
  OPTkey = 	 {},
  type = 	 {(CIS)},
  number = 	 {901},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@inproceedings{Aydemir05TPHOLs,
  author = "B. Aydemir and A. Bohannon and M. Fairbairn and J. Foster
            and B. Pierce and P. Sewell and D. Vytiniotis and
            G. Washburn and S. Weirich and S. Zdancewic",
  title = "Mechanized metatheory for the masses: The {POPLmark} Challenge",
  pages     = "50-65",
  editor    = "Joe Hurd and
               Thomas F. Melham",
  booktitle = "Eighteenth {I}nternational {C}onference
    on {T}heorem {Proving} in {Higher Order Logics} ({TPHOLs})",
  series    = LNCS,
  volume    = "3603",
  year      = "2005",
  publisher = "Springer"
}

@inproceedings{Aydemir:POPL08,
  author = "B. Aydemir and Arthur Chargueraud and B. Pierce and Randy Pollack and Stephanie Weirich. ",
  title = "Engineering Formal Metatheory",
  pages     = "3--15r",
  editor    = "Phil Wadler",
  booktitle = "35th {A}nnual {ACM} {SIGPLAN-SIGACT} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages",
  publisher = "ACM",
  year      = "2008"
}

%%% B


@inproceedings{Barras:FOSSACS08,
  author    = {Bruno Barras and
               Bruno Bernardo},
  title     = {The Implicit Calculus of Constructions as a Programming
               Language with Dependent Types},
  booktitle     = {11th {I}nternational {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputational {S}tructures {(FOSSACS'08)}},
  editor    = {Roberto M. Amadio},
  year      = {2008},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 4962)},
  pages     = {365-379}
}


@inproceedings{Baelde:LICS12,
  author    = {David Baelde and
               Gopalan Nadathur},
  title     = {Combining Deduction Modulo and Logics of Fixed-Point
                  Definitions},
  booktitle     = {27th Annual IEEE Symposium on Logic in
               Computer Science (LICS'12)},
  year      = {2012},
  pages     = {105-114},
  publisher = {IEEE},
  year      = {2012}
}


@PhDThesis{baelde:PhD,
  author	= {David Baelde},
  title		= {A linear approach to the proof-theory of least and greatest fixed points},
  school	= "\'{E}cole Polytechnique",
  year		= 2008
}


@inproceedings{Barras:TYPES09,
 author = {Bruno Barras and  Pierre Corbineau and Benjamin Gr\'{e}goire and Hugo
                  Herbelin and  Jorge Luis Sacchini},
 title = {A New Elimination Rule for the Calculus of Inductive Constructions},
 booktitle = {Types for Proofs and Programs (TYPES'08)},
 editor = {Stefano Berardi and Ferruccio Damiani and  Ugo De'Liguoro},
 year = {2009},
 isbn = {978-3-642-02443-6},
 pages = {32--48},
 numpages = {17},
 publisher = {Springer}
} 



@inproceedings{DBLP:conf/flops/BartheS99,
  author    = {Gilles Barthe and
               Bernard P. Serpette},
  title     = {Partial Evaluation and Non-inference for Object Calculi.},
  booktitle = {Fuji International Symposium on Functional and Logic Programming},
  year      = {1999},
  pages     = {53-67},
  crossref  = {DBLP:conf/flops/1999},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/flops/1999,
  editor    = {Aart Middeldorp and
               Taisuke Sato},
  title     = {Functional and Logic Programming, 4th Fuji International
               Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999,
               Proceedings},
  booktitle = {FLOPS},
  publisher = {Springer},
  series    = LNCS,
  volume    = {1722},
  year      = {1999},
  isbn      = {3-540-66677-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Baker94,
  author =   "Siani Baker",
  title =    "A New Application for Explanation-Based
          Generalization within Automated Deduction",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "177-191",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction, omega-rule, constructive omega-rule"
}

@InProceedings{BakerIrelandSmaill92,
  author =   "Siani Baker and Andrew Ireland and Alan Smaill",
  title =    "On the Use of the Constructive Omega-Rule within
          Automated Deduction",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 624",
  pages =    "214-225",
  booktitle =    "Proceedings of the Conference on Logic Programming
          and Automated reasoning (LPAR--92), St.~Petersburg",
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction, omega-rule, constructive omega-rule"
}

@article{Baudinet92,
    author = "Marianne Baudinet",
    title = "Proving Termination Properties of Prolog Programs: A Semantic Approach",
    journal = "Journal of Logic Programming",
    volume = "14",
    number = "1\&2",
    pages = "1-29",
    year = "1992"
}

@PhdThesis{bauer:thesis,
  author =   {Lujo Bauer},
  title =    {Access Control for the {W}eb via Proof-carrying Authorization},
  school =   {Princeton University},
  year =     {2003},
  month =    nov,
  url =          {http://www.ece.cmu.edu/~lbauer/papers/thesis.pdf}
}

@inproceedings{Bauer:security02,
  author    = {Lujo Bauer and
               Michael A. Schneider and
               Edward W. Felten},
  title     = {A General and Flexible Access-Control System for the Web},
  editor    = {Dan Boneh},
  booktitle = {11th USENIX Security Symposium},
  year      = {2002},
  pages     = {93-108},
  publisher = {USENIX}
}

@inproceedings{Bauer:CSF10,
  author    = {Lujo Bauer and
               Limin Jia and
               Divya Sharma},
  title     = {Constraining Credential Usage in Logic-Based Access Control},
  booktitle = {Proceedings of the 23rd IEEE Computer Security Foundations
               Symposium (CSF'10)},
  year      = {2010},
  publisher = {IEEE Computer Society},
  pages     = {154-168}
}




@InProceedings{Baumgartner93,
  author =   "Peter Baumgartner",
  title =    "A Model Elimination Calculus with Built-in Theories",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 671",
  pages =    "30-42",
  booktitle =    "GWAI-92: Advances in Artificial Intelligence, 16th
          German Conference on Artificial Intelligence",
  year =     "1993",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    aug,
  OPTnote =  "",
  OPTannote =    ""
}

@TechReport{BBH91,
  author =   "Richard Barnett and David Basin and Jane Hesketh",
  title =    "A Recursion Planning Analysis of Inductive Completion",
  institution =  DAI,
  year =     "1991",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     DAIRP,
  number =   "518",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "inductionless induction, Huet & Hullot Method, rippling,
       nqthm, explicit induction"
}

@Article{BBH93,
  author =   "Richard Barnett and David Basin and Jane Hesketh",
  title =    "A Recursion Planning Analysis of Inductive Completion",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Annals of Mathematics and Artificial Intelligence",
  year =     "1993",
  volume =   "8",
  number =   "3-4",
  pages =    "363-381",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    {inductionless induction, Huet & Hullot Method,
          rippling, nqthm, explicit induction}
}

@Article{BasinWalsh96a,
  author      = "Basin, David and Toby Walsh",
  title       = "A Calculus for and Termination of Rippling",
  journal     = JAR,
  year        = 1996,
  OPTkey      = "",
  volume      = 16,
  number      = 2,
  pages       = "147--180",
  OPTmonth    = "",
  OPTnote     = ""
}

@techreport{BBKM93,
   author    = {David Basin and Alan Bundy and Ina Kraan and Sean Matthews},
   title     = {A Framework for Program Development Based on
       Schematic Proof},
   institution = {Max--Planck--Institut f{\"u}r Informatik,
       Saarbr{\"u}cken, Germany and University of Edinburgh,
       Scotland},
   year      = {1993},
   keywords  = {program synthesis, schematic proof}
}

@inproceedings{BachmairTiwari00:CADE,
    TITLE = {Abstract Congruence Closure and Specializations},
    AUTHOR = {Leo Bachmair and Ashish Tiwari},
    BOOKTITLE = {Conference on Automated Deduction, CADE '2000},
    EDITOR = {David McAllester},
    PAGES = {64--78},
    PUBLISHER = {Springer-Verlag},
    SERIES = LNAI,
    VOLUME = 1831,
    MONTH = jun,
    YEAR = 2000,
    ADDRESS = {Pittsburgh, PA}
}

@InProceedings{Bachmair88,
  author =  "Leo Bachmair",
  title =   "Proof by Consistency in Equational Theories",
  booktitle =   LICS88,
  year =    "1988",
  pages =   "228-233",
  OPTorganization =     "",
  OPTpublisher =    "",
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "inductive completion, inductive reducibility,
         covering sets, proof by consistency"
}

@InProceedings{BachmairDershowitz86,
  author =  "Leo Bachmair and Nachum Dershowitz",
  title =   "Commutation, Transformation, and Termination",
  booktitle =   CADE86,
  year =    "1986",
  OPTpages =    "",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  OPTmonth =    "",
  note =     "Lecture Notes in Computer Science (LNCS) 230",
  keywords =    "quasi cummutation, termination of trs"
}

@InProceedings{BachmairDershowitz87,
  author =  "Leo Bachmair and Nachum Dershowitz",
  title =   "Completion for rewriting modulo a congruence",
  booktitle =   RTA87,
  year =    "1987",
  pages =   "192-203",
  OPTorganization =     "",
  OPTpublisher =    "",
  OPTaddress =  "",
  month =   may,
  OPTnote =     "",
  keywords =    "term rewriting, rewriting modulo a congruence"
}

@InProceedings{BachmairDershowitzHsiang86,
  author =   "Leo Bachmair and Nachum Dershowitz and Jieh Hsiang",
  title =    "Orderings for equational proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "346-357",
  booktitle =    LICS86,
  year =     "1986",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "complexity ordering, proof ordering"
}

@inbook{BachmairDershowitzPlaisted92,
   author    = "Leo Bachmair and Nachum Dershowitz and David A.~Plaisted",
   title     = "Completion without Failure",
   chapter   = "one",
   year      = "1992",
   publisher = AP,
   volume    = "2 Rewriting Techniques",
   pages     = "1-30",
   series    = "Resolution of Equations in Algebraic Structures"
}

@techreport{Basin93,
   author    = "David Basin",
   title     = "Refining Biundo",
   institution = DFKI,
   year      = "1993",
   number    = "816",
   type      = {Dream Blue Note},
   keywords  = "program synthesis"
}

@InProceedings{BasinWalsh92,
  author =   "David Basin and Toby Walsh",
  title =    "Difference Matching",
  booktitle =    CADE92,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI vol.~607",
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "295-309",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "difference matching"
}

@InProceedings{BeckertHaehnle92,
  author =   "Bernhard Beckert and Reiner H{\"a}hnle",
  title =    "An Improved Method for Adding Equality to Free
          Variable Semantic Tableaux",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "507-522",
  booktitle =    CADE92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "LNAI vol.\ 607",
  OPTannote =    "",
  keywords =     "equality, tableau, universal variables"
}



@InCollection{BelnapRepublished:62,
  author = 	 {Nuel D. Belnap},
  title = 	 {Tonk, Plonk, and Plink (republished from 1962)},
  booktitle = 	 {Philosophical Logic},
  OPTcrossref =  {},
  OPTkey = 	 {},
  OPTpages = 	 {},
  publisher = {Oxford University Press},
  year = 	 {1985},
  editor = 	 {P.F. Strawson},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTtype = 	 {},
  OPTchapter = 	 {},
  OPTaddress = 	 {},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}



@Article{Belnap:62,
  author = 	 {Nuel D. Belnap},
  title = 	 {Tonk, Plonk, and Plink},
  journal = 	 {Analysis},
  year = 	 {1962},
  OPTkey = 	 {},
  volume = 	 {22},
  number = 	 {6},
  pages = 	 {130--134},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}



@TechReport{BGH94,
  author =   "Bernhard Beckert and Stefan Gerberding and Reiner
       H{\"a}hnle",
  title =    "The Many--Valued Theorem Prover {3TAP}, 3rd.\ edition",
  institution =  UKA,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      {Interner Bericht 30/94},
  OPTannote =    "",
  keywords =     "3TAP"
}


@TechReport{BHS92,
  author =   "Bernhard Beckert and Reiner H{\"a}hnle and Peter H.~Schmitt",
  title =    "The Even More Liberalized $\delta$-Rule in Free
          Variable Semantic Tableaux",
  institution =  UKA,
  year =     "1992",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "November",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tableau"
}

@InProceedings{BHS93,
  author =   "Bernhard Beckert and Reiner H{\"a}hnle and Peter H.~Schmitt",
  title =    "The Even More Liberalized $\delta$-Rule in Free
          Variable Semantic Tableaux",
  booktitle =    KGC93,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) vol.~713",
  year =     "1993",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  month =    aug,
  pages =    "108-119",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tableau"
}

@InProceedings{BeckertGore97,
  author    = {Bernhard Beckert and Rajeev Gor\'e},
  title     = {Free Variable Tableaux for Propositional Modal Logics},
  booktitle = {Proceedings, International Conference on Theorem Proving with Analytic
          Tableaux and Related Methods, Pont-a-Mousson, France},
  pages         = {91--106},
  series    = {LNCS 1227},
  publisher = {Springer},
  year      = {1997}
}


@inproceedings{Belanger:CPP13,
  author    = {Olivier Savary Belanger and
               Stefan Monnier and
               Brigitte Pientka},
  editor    = {Georges Gonthier and
               Michael Norrish},
  title     = {Programming Type-Safe Transformations Using Higher-Order
               Abstract Syntax},
  booktitle = {Third International Conference on Certified Programs and Proofs (CPP'13)},
  year      = {2013},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 8307)},
  pages     = {243-258}
}



@conference{Benke:07,
    author    = "Marcin Benke",
    title     = "Alonzo - a compiler for Agda",
    booktitle = "Talk at TYPES 2007",
    year      = "2007",
}


@article{Benton:JFP98,
  author    = {P. N. Benton and
               Gavin M. Bierman and
               Valeria de Paiva},
  title     = {Computational Types from a Logical Perspective},
  journal   = {J. Funct. Program.},
  volume    = {8},
  number    = {2},
  year      = {1998},
  pages     = {177-193}
}

@article{Benton:12,
year={2012},
journal={Journal of Automated Reasoning},
volume={49},
number={2},
title={Strongly Typed Term Representations in {C}oq},
publisher={Springer Netherlands},
keywords={The Coq proof assistant; de Bruijn indices; Typed object languages},
author={Benton, Nick and Hur, Chung-Kil and Kennedy, AndrewJ. and McBride, Conor},
pages={141-159},
language={English}
}


@InProceedings{Berardi:WLF90,
  author =   {Stefano Berardi},
  title =    {Girard Normalization Proof in {LEGO}},
  booktitle =    {Proceedings of the First Workshop on Logical Frameworks},
  OPTcrossref =  {},
  OPTkey =   {},
  pages =    {67--78},
  year =     {1990},
  OTPeditor =    {G. Huet and G. Plotkin},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  OPTaddress =   {},
  OPTmonth =     {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote =      {},
  OPTannote =    {}
}



 @Comment issn={0168-7433},
 @Comment doi={10.1007/s10817-011-9219-0},
 @Comment url={http://dx.doi.org/10.1007/s10817-011-9219-0},
@inproceedings{Bershad95protection,
    author = "B. N. Bershad and S. Savage and P. Pardyak and D. Becker",
    title = "Protection is a Software Issue",
    booktitle = "Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V), Orcas Island, WA.",
    pages = "62--65",
    year = "1995",
    url = "citeseer.nj.nec.com/bershad95protection.html" 
}

@inproceedings{Bertot:TYPES08,
    title = { {U}sing {S}tructural {R}ecursion for {C}orecursion},
    author = {{B}ertot, {Y}ves and {K}omendantskaya, {E}katerina},
    keywords = {{C}onstructive {T}ype {T}heory; {S}tructural {R}ecursion; {C}o-inductive types; {C}alculus of {C}onstructions},
    booktitle = {{T}ypes 2008 },
    publisher = {{S}pringer },
    pages = {220-236 },
    volume = {5497 },
    editor = {{S}tefano {B}erardi and {F}eruccio {D}amiani and {U}go de {L}iguoro },
    series = {{L}ecture {N}otes in {C}omputer {S}cience (LNCS)},
    year = {2008},
    URL = {http://hal.inria.fr/inria-00322331/PDF/fibonacci.pdf},
}



@inproceedings{Omega97,
   author    = "C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler,
          X. Huang, M. Kerber, M. Kohlhase, K. Konrad,
          E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, and V. Sorge.",
   title     = "Omega: Towards a mathematical assistant.",
   booktitle = "14$^{th}$ International Conference on Automated Deduction",
   year      = 1997,
   editor    = "W. McCune",
   volume    = 1249,
   series    = "Lecture Notes in Artificial Intelligence",
   year      = "1997",
   month     = jul,
   publisher = SPR,
   pages     = "252-255",
   OPTnote      = {Lecture Notes in Computer Science (LNCS) 230},
   keywords  = "proof planning"
}



@BOOK{bertot/casteran:2004,
  author = {Yves Bertot and Pierre Cast\'{e}ran},
  title = {Interactive Theorem Proving and Program
                 Development. Coq'Art: The Calculus of Inductive
                 Constructions},
  publisher = {Springer},
  year = 2004
}

@misc{Bonfante99:JFP,
  author = "G. Bonfante and A. Cichon and J. Marion and H. Touzet",
  title = "Algorithms with polynomial interpretation termination proof",
  journal = "Journal of Functional Programming",
  year = "2001",
  volume = "11",
  number = "1",
  pages = "33-53",
  month = "Jan",
  url = "citeseer.nj.nec.com/bonfante99algorithms.html" 
}

@article{BellantoniCook92,
   author    = "Stephen Bellantoni and Stepehn Cook",
   title     = "New recursion-theoretic characterization of the polytime functions",
   journal   = "Computational Complexity",
   year      = "1992",
   OPTmonth     = aug,
   number    = "2",
   pages     = "97--110",
   keywords  = "primitive recursion schemas, complexity"
}

@InProceedings{BernardLee:CADE02,
  author =       "Andrew Bernard and Peter Lee",
  title =        "Temporal Logic for Proof-Carrying Code",
  booktitle =    "Proceedings of the 18th International Conference on
                 Automated Deduction (CADE-18)",
  year =         "2002",
  month =        jul,
  pages =        "31--46",
  address =      "Copenhagen, Denmark",
  series =       "Lecture Notes in Artificial Intelligence",
  volume =       "2392",
}

@incollection{Beth86,
   author    = "E.W.~Beth",
   title     = "Semantic entailment and formal derivability",
   booktitle = "Kommentierte Auswahl zur Geschichte der modernen Logik",
   year      = "1986",
   editor    = "Karel Berka and Lothar Kreiser",
   publisher = {Akademie--Verlag, Berlin},
   pages     = "262-266",
   keywords  = "semantic tableau"
}

@InProceedings{BeversLevi90,
  author =  "Eddy Bevers and Johan Lewi",
  title =   "Proof by Consistency in Conditional Equational Theories",
  booktitle =   CTRS90,
  year =    "1990",
  pages =   "194-205",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  month =   jun,
  note =    "Lecture Notes in Computer Science (LNCS) vol.\ 516",
  keywords =    "proof by consistency, inductive reasoning,
          conditional term rewriting"
}

@InProceedings{Bibel+98a,
  author      = "Wolfgang Bibel and Daniel Korn and Christoph Kreitz and
                     Ferenc Kurucz and
             Jens Otten and Stephan Schmitt and Gerd Stolpmann",
  title       = "A multi-level approach to program synthesis",
  booktitle   = "Seventh International Workshop on Logic Program Synthesis
             and Transformation (LOPSTR'97), Leuven, Belgium, July 1997",
  year        = 1998,
  OPTkey      = "",
  OPTeditor   = "",
  OPTvolume   = "",
  OPTnumber   = "",
  series      = "Lecture Notes in Computer Science (LNCS) 1463",
  OPTpages    = "",
  OPTorganization = "",
  OPTpublisher    = "",
  OPTaddress      = "",
  OPTmonth    = "",
  OPTnote     = ""
}

@book{Birkhoff67,
   author    = "Garret Birkhoff",
   title     = "Lattice Theory",
   year      = "1967",
   publisher = AMS,
   edition   = "third",
   series    = {Colloquium Publications Volume {XXV}},
   keywords  = "lattice theory"
}

@inproceedings{Biundo86,
   author    = "Susanne Biundo",
   title     = "A Synthesis System Mechanizing Proofs by Induction",
   booktitle = ECAI86,
   year      = "1986",
   keywords =  "programm syntheses, explicit induction"
}

@InProceedings{Biundo88,
  author =   "Susanne Biundo",
  title =    "Automated Synthesis of Recursive Algorithms as a
          Theorem Proving Tool",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTpages =     "",
  booktitle =    ECAI88,
  year =     "1988",
  OPTorganization = "",
  OPTpublisher = "",
  address =  "M{\"u}nchen, Germany",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "programm syntheses"
}

@Book{Biundo91,
  author =   "Susanne Biundo",
  title =    "Automatische {S}ynthese rekursiver {P}rogramme als
          {B}eweisverfahren",
  publisher =    SPR,
  year =     "1991",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Informatik-Fachberichte 302",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "programm syntheses, explicit induction"
}

@inproceedings{BHHW86,
   author    = "Susanne Biundo and Birgit Hummel and Dieter Hutter
       and Christoph Walther",
   title     = "The {K}arlsruhe Induction Theorem Proving System",
   booktitle = CADE86,
   year      = "1986",
   month     = jul,
   publisher = SPR,
   pages     = "672-674",
   note      = {Lecture Notes in Computer Science (LNCS) 230},
   keywords  = "explicit induction, system abstract"
}

@InProceedings{BM00,
      Author = "N. Bj{\o}rner and C. Mu{\~{n}}oz",
      Title  = "Absolute Explicit Unification",
      Booktitle   = "Proceedings of the 11th International Conference on Rewriting Techniques and Applications (RTA'00), Norwich, UK",
      Month = {July},
      series = "LNCS",
      volume = 1833,
      pages = "31--46",
      Year ={2000},
      note = {http://heory.stanford.edu/people/nikolaj/rta.ps}
}

@InProceedings{Blanqi04rta,
   author    = "Frederic Blanqi",
   title     = "A type-based termination criterion for dependently-typed higher-order rewrite systems",
   pages =        "to appear",
   booktitle =    "Proceedings of the 15th International Conference
          on Rewriting Techniques and Applications (RTA '04)",
  year =         2004,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS)",
  address =      "Aachen, Germany",
  month =        jul,
  keywords =     "rewriting"
}

@InProceedings{Blanchet2001,
  author =       {Bruno Blanchet},
  title =        {An {E}fficient {C}ryptographic {P}rotocol {V}erifier {B}ased on {P}rolog {R}ules},
  booktitle =    {14th IEEE Computer Security Foundations Workshop (CSFW-14)},
  pages =        {82--96},
  year =         2001,
  address =      {Cape Breton, Nova Scotia, Canada},
  month =        jun,
  publisher =    {IEEE Computer Society}
}


@article{Bloch+94:CC,
   author   = "Stephen Bloch" ,
   title    = "Function-algebraic characterizations of log and loylog parallel time" ,
   journal  = "Computational Complexity",
   year     = 1994 ,
   volume   = "4(2)",
   pages    = "175--205",
   keywords = "graph plan"
}

@article{BlumFurst:AI,
   author   = "Avrim Blum and Merrick Furst" ,
   title    = "Fast Planning Through Planning Graph Analysis" ,
   journal  = AI ,
   year     = 1997 ,
   volume   =  "90",
   pages    = "281--300",
   keywords = "graph plan"
}

@InProceedings{BoddyDean88,
  author =   "M.~Boddy and T.~Dean",
  title =    "An Analysis of Time-Dependent Planning",
  booktitle =    AAAI88,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1988",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "49-54",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "planning, anytime algorithm"
}





@InProceedings{Boespflug:LFMTP11,
  author = 	 {Mathieu Boespflug and Brigitte Pientka},
  title = 	 {Multi-level Contextual Modal Type Theory},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {6th International Workshop on Logical Frameworks and
                  Meta-languages: Theory and Practice (LFMTP'11)},
  OPTpages = 	 {},
  year = 	 {2011},
  editor = 	 {Gopalan Nadathur and Herman Geuvers},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  series = 	 {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

%  title = 	 {The {D}edukti {P}roof {C}hecker},
@Manual{DeduktiManual,
  title = 	 {Dedukti},
  author = 	 {Mathieu Boespflug},
  url = {http://www.lix.polytechnique.fr/~mboes/projects/dedukti/doc/manual.html},
  year = 	 2010,
  note = 	 {\mbox{\tt{http://www.lix.polytechnique.fr/dedukti}}}
}
@InProceedings{Bognar:LFM99,
  author =   "Mirna Bognar and Roel de Vrijer",
  title =    "The Context Calculus Lambda-c",
  booktitle =    "International Workshop on Logical Frameworks and
Meta-Languages (LFM'99), Paris, France",
  OPTseries =  "",
  year = "1999"
}

@Article{Bognar:JAR01,
  author      = "Mirna Bognar and Roel de Vrijer",
  title       = "A calculus of lambda calculus context",
  journal     = "Journal of Automated Reasoning",
  year        = 2001,
  volume      = 27,
  number      = "1",
  pages       = "29--59",
  doi         = "10.1023/A:1010654904735"
}

@book{BoolosJeffrey89,
   author    = {George S.~Boolos and Richard C.~Jeffrey},
   title     = {Computability and Logic},
   year      = 1989,
   publisher = CUP,
   edition   = {3.},
   keywords  = {first-order predicate logic, second-order predicate
       logic, logic textbook, recursive functions,
       computability, Turing machines}
}

@incollection{BoergerRosenzweig94,
   author    = "Egon B{\"o}rger and Dean Rosenzweig",
   title     = "The {WAM} -- Definition and Compiler Correctness",
   booktitle = "Logic Programming: Formal Methods and Proactical Applications",
   year      = "1994",
   editor    = "C. Beierle and L. Pl{\"u}mer",
   publisher = "Elsevier Science Publishers B.V.",
   pages     = "1-71",
   keywords  = "WAM, Prolog, compilation"
}

@InProceedings{Bouhoula94,
  author =   "Adel Bouhoula",
  title =    "SPIKE: a system for sufficient completeness and
          parameterized inductive proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "836-840",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "SPIKE"
}

@techreport{BouhoulaKounalisRusinowitch92,
   author    = "Adel Bouhoula and Emmanuel Kounalis and Micha{\"e}l
       Rusinowitch",
   title     = "Automated Mathematical Induction",
   institution = {INRIA},
   year      = "1992",
   month     = jun,
   number    = "1663",
   keywords  = "inductive reasoning, test set, case rewriting,
         induction scheme"
}

@InProceedings{BouhoulaRusinowitch93,
  author =   "Adel Bouhoula and Micha{\"e}l Rusinowitch",
  title =    "Automatic Case Analysis in Proof by Induction",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  volume =   "1",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "88-94",
  booktitle =    IJCAI93,
  year =     "1993",
  OPTorganization = "",
  publisher =    MK,
  OPTaddress =   "",
  month =    aug,
  OPTnote =      "",
  OPTannote =    "",
  keywords  = {induction, rewriting systems, implicit induction, case
         rewriting, spike}
}


@TechReport{BouhoulaRusinowitch94,
  author =   "Adel Bouhoula and Micha{\"e}l Rusinowitch",
  title =    "Implicit Induction in Conditional Theories",
  institution =  INRIA,
  year =     "1994",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "induction, rewriting systems, implicit induction, case
         rewriting, spike, Gilbreth card trick"
}

@Article{BouhoulaRusinowitch95,
  author =   "Adel Bouhoula and Micha{\"e}l Rusinowitch",
  title =    "Implicit Induction in Conditional Theories",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JAR,
  year =     "1995",
  volume =   "14",
  OPTnumber =    "",
  pages =    "189-235",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "induction, rewriting systems, implicit induction, case
         rewriting, spike, Gilbreth card trick"
}

@InProceedings{Boultonetal98},
  author =   "Richard Boulton and Konrad Slind and Alan Bundy and Mike Gordon",
  title =    "An interface between {CLAM} and {HOL}",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "J.~Grundy and M.~Newey",
  volume =   "Lecture Notes in Computer Science (LNCS) 1479",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "87-104",
  booktitle =    TPHOLs98,
  year =     "1998",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    sept/oct,
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{Boultonetal98a},
  author =   "Richard Boulton and Mike Gordon and Konrad Slind and Alan Bundy",
  title =    "System Description: An Interface between {CLAM} and {HOL}",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "C.~Kirchner and H.~Kirchner",
  volume =   "LNAI 1421",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "134-138",
  booktitle =    CADE98,
  year =     "1998",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    sept/oct,
  OPTnote =      "",
  OPTannote =    ""
}

@article{BoyerMoore75,
   author    = "Robert S.~Boyer and J~Strother Moore",
   title     = "Proving Theorems about {LISP} functions",
   journal   = JACM,
   year      = 1975,
   volume    = 22,
   keywords  = "induction, lisp, nqthm"
}

@book{BoyerMoore79,
   author    = "Robert S.~Boyer and J~Strother Moore",
   title     = "A Computational Logic",
   year      = "1979",
   publisher = AP,
   series    = {ACM Monograph Series},
   opteditor = "Thomas A.~Standish",
   keywords  = "induction, lisp, nqthm"
}

@book{BoyerMoore88,
   author    = "Robert S.~Boyer and J~Strother Moore",
   title     = "A Computational Logic Handbook",
   year      = "1988",
   publisher = AP,
   series    = "Perspectives in Computing. Vol.\ 23",
   keywords  = "induction, lisp, nqthm"
}

@InProceedings{BoyerMoore90,
  author =  "Robert S.~Boyer and J~Strother Moore",
  title =   "A Theorem Prover for a Computational Logic",
  booktitle =   CADE90,
  year =    "1990",
  OPTeditor =   "",
  OPTpages =    "",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     ""
}

@Misc{Brauburger94,
  author =       "J{\"u}rgen Brauburger",
  title =        "{\sc Plagiator}: {Entwurf und Implementierung eines
                  lernenden Beweisers}",
  howpublished = "{Diplomarbeit, TH Darmstadt}",
  year =         "1994"
}

@inproceedings{Brisset:ICLP91,
    author = "Pascal Brisset and Olivier Ridoux",
    title = "Naive Reverse Can be Linear",
    booktitle = "International Conference on Logic Programming",
    editor =    "Koichi Furukawa",
    pages = "857-870",
    year = "1991",
    month = "June",
    address      = "Paris, France",
    publisher = "MIT Press",
    url = "citeseer.nj.nec.com/brisset91naive.html" 
}

@InProceedings{BronsardReddy90,
  author =  "Francois Bronsard and Eday S.~Reddy",
  title =   "Conditional Rewriting in Focus",
  booktitle =   CTRS90,
  year =    "1990",
  OPTeditor =   "",
  pages =   "2-13",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  month =   jun,
  note =    "Lecture Notes in Computer Science (LNCS) vol.\ 516",
  keywords =    "conditional rewriting"
}

@InProceedings{BronsardReddyHasker94,
  author =  "Francois Bronsard and Eday S.~Reddy and W.~Hasker",
  title =   "Induction using Term Orderings",
  booktitle =   CADE94,
  year =    "1994",
  OPTeditor =   "",
  pages =   "102-117",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "implicit induction, induction relations"
}


@Article{Brotherston-Simpson:10,
  author    = "James Brotherston and Alex Simpson",
  title     = "Sequent Calculi for Induction and Infinite Descent",
  journal   = "Journal of Logic and Computation",
  year      = 2010
}

@InProceedings{Brotherston-Simpson:07,
  author  =   "James Brotherston and Alex Simpson",
  title   =   "Complete Sequent Calculi for Induction and Infinite Descent",
  booktitle = "Proceedings of LICS-22",
  pages   =   "51--60",
  publisher = "IEEE Computer Society",
  month   =   "July",
  year    =   2007
}

@InProceedings{Brotherston:05,
  author  =   "James Brotherston",
  title   =   "Cyclic Proofs for First-Order Logic with Inductive Definitions",
  booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods: Proceedings of TABLEAUX 2005",
  editor  =   "B. Beckert",
  publisher = "Springer-Verlag",
  pages   =   "78--92",
  series  =   "LNAI",
  volume  =   3702,
  year    =   2005
}





@Article{BundyWelham81,
  author =   "Alan Bundy and Bob Welham",
  title =    "Using meta-level Inference for Selective Application
          of Multiple rewrite Rule Sets in Algebraic Manipulation",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  AI,
  year =     "1981",
  volume =   "16",
  number =   "2",
  pages =    "189-211",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "proof plans, tactical theorem proving, meta-level
          reasoning, computer algebra, press,
                   prolog equation solving system"
}

@InProceedings{Bundy88,
  author =   "Alan Bundy",
  title =    "The Use of Explicit Plans to Guide Inductive Proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  number =   "310",
  series =   "Lecture Notes in Computer Science (LNCS)",
  pages =    "111-120",
  booktitle =    CADE88,
  year =     "1988",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "proof plans, tactical theorem proving, inductive
          proofs, automatic programming, planning"
}

@InProceedings{Bundy89,
  author =   "Alan Bundy and Frank van Harmelen and Jane Hesketh
          and Alan Smail and Andrew Stevens",
  title =    "A Rational Reconstruction and Extension of Recursion
          Analysis",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "359-365",
  booktitle =    IJCAI89,
  year =     "1989",
  OPTorganization = "",
  publisher =    MK,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     ""
}

@inproceedings{Bundy90,
   author    = "Alan Bundy and Frank van Harmelen and Alan Smaill and
       Andrew Ireland",
   title     = "Extensions to the Rippling--Out Tactic for Guiding
       Inductive Proofs",
   booktitle = CADE90,
   year      = 1990,
   publisher = SPR,
   pages     = "132-146",
   keywords  = "rippling"
}

@InCollection{Bundy91,
  author =   "Alan Bundy",
  title =    "A Science of Reasoning",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    {Computational Logic: Essays in Honor of Alan Robinson},
  publisher =    "{MIT} press",
  year =     "1991",
  editor =   "J.-L.~Lassez and G.~Plotkin",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  pages =    "178-198",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tactical theorem proving"
}

@Article{Bundy93,
  author =   "Alan Bundy and Andrew Stevens and Frank van Harmelen
          and Alan Smaill and Andrew Ireland",
  title =    "Rippling: A Heuristic for Guiding Inductive Proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  AI,
  year =     "1993",
  volume =   "62",
  number =   "2",
  pages =    "185-253",
  month =    aug,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Rippling"
}


@Misc{Bundy95,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Alan Bundy",
  title =    "Architectures for Proof Planning",
  howpublished = "Personal communication",
  year =     "1995",
  month =    sep,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Blue Book Note 945, tactics, pseudo tactics"
}

@Misc{Bundy95b,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Alan Bundy",
  title =    "The Nature of Proof Planning",
  howpublished = "Personal communication",
  year =     "1995",
  month =    sep,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Blue Book Note 1020, hierarchical planning"
}

@TechReport{BundyIreland94,
  author =   "Alan Bundy and Andrew Ireland",
  title =    "Productive Use of Failure in Inductive Proof",
  institution =  JAR,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     DAIRP,
  number =   "716",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "proof critics, planing critics, proof plan"
}

@Article{Burstall69,
  author =      "R.~M.~Burstall",
  title =       "Proving Properties of Programs by Structural Induction",
  journal =     "Comput. J.",
  year =        "1969",
  volume =      "12",
  number =      "1",
  OPTpages =    "",
  OPTmonth =    "",
  OPTnote =     ""
}

@inproceedings{BvHHS90,
   author    = "Alan Bundy and Frank van Harmelen and C.~Horn and
       Alan Smaill",
   title     = "The {Oyster-Clam} System",
   booktitle = CADE90,
   year      = "1990",
   publisher = SPR,
   pages     = "647-648",
   note      = {LNAI 449},
   keywords  = "explicit induction, Oyster-Clam"
}

%%% C

@InCollection{Carbonell86,
  author =   "Jaime G.~Carbonell",
  title =        "Derivational Analogy: A theory of reconstructive
          problem solving and expertise acquisition",
  OPTkey =   "",
  booktitle =    "{Machine Learning: An Artificial Intelligence Approach}",
  publisher =    MK,
  year =     "1986",
  editor =   "R.S.~Michalsky, J.G.~Carbonell, T.M.~Mitchell",
  pages =    "371 -- 392"
}

@inproceedings{Cardelli:LFP84,
 author = {Cardelli, Luca},
 title = {Compiling a functional language},
 booktitle = {ACM Symposium on LISP and Functional Programming (LFP'84)},
 year = {1984},
 pages = {208--217},
 numpages = {10},
 publisher = {ACM}
} 



@InProceedings{Carlson87,
  author       = "M.~Carlson",
  title        = "Freeze, Indexing and Other Implementation Issues in the WAM",
  pages        = "40--58",
  editor       = "",
  booktitle    = "Proceedings of the 4th International Conference
                  on Logic Programming(ICLP)",
  year         = 1987,
  publisher    = "MIT Press",
  address      = "Melbourne, Australia"
}

@Article{Carlson84,
  author =   "M.~Carlson",
  title =    "On implementing {P}rolog in functional programming",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "New Generation Computin",
  year =     "1984",
  volume =   "2",
  number =   "4",
  pages =    "347-357",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple-valued logic, tableau"
}

@Article{Carnielli87,
  author =   "W.~A.~Carnielli",
  title =    "Systematization of finite many-valued logics through
          the method of tableaux",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JSL,
  year =     "1987",
  volume =   "52",
  number =   "2",
  pages =    "473-493",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple-valued logic, tableau"
}

@InProceedings{Castaing85,
  author =   "Jacqueline Castaing",
  title =    "How to facilitate the proof of theorems using
          induction-matching and by generalization",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "1208-1213",
  booktitle =    IJCAI85,
  year =     "1985",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "generalization"
}

@TechReport{Cervesato02tr,
  author =   {Iliano Cervesato and Frank Pfenning and David Walker
                  and Kevin Watkins},
  title =    {A Concurrent Logical Framework {II}: Examples and Applications},
  institution =  {Department of Computer Science, Carnegie Mellon University},
  year =     2002,
  number =   {CMU-CS-02-102}
}

@InProceedings{Cervesato96lics,
  author =       "Iliano Cervesato and Frank Pfenning",
  title =        "A Linear Logical Framework",
  editor =       "E. Clarke",
  booktitle =    "{Eleventh Annual Symposium on Logic in
                  Computer Science}",
  year =         1996,
  publisher =    "IEEE Computer Society Press",
  address =      "New Brunswick, New Jersey",
  month =        jul,
  pages =        "264--275",
  keywords =     "LF, Elf, linear",
  urldvi =       "http://www.cs.cmu.edu/~fp/papers/lics96.dvi.gz",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/lics96.ps.gz"
}

@Article{Cervesato02ic,
  title =        "A Linear Logical Framework",
  author =       "Iliano Cervesato and Frank Pfenning",
  journal =      "{Information \& Computation}",
  volume =       179,
  number =       1,
  pages =        "19--75",
  year =         2002,
  month =        nov,
  urlpdf =       "http://www.cs.cmu.edu/~fp/papers/llf00.pdf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/llf00.ps"
}

@InProceedings{Cervesato98jicslp,
  author       = "Iliano Cervesato",
  title        = "Proof-Theoretic Foundation of Compilation in Logic
                  Programming Languages",
  pages        = "115--129",
  editor       = "J. Jaffar",
  booktitle    = "{Joint International Conference and
                  Symposium on Logic Programming (JICSLP'98)}",
  year         = 1998,
  publisher    = "MIT Press",
  address      = "Manchester, UK",
  month        = "16--19 June"
}

@PhdThesis{Cervesato96phd,
  author =       "Iliano Cervesato",
  title =        "A Linear Logical Framework",
  school =       "Dipartimento di Informatica, Universit{\`a} di Torino",
  month =        feb,
  year =         1996,
  keywords =     "LF, Elf, linear"
}

@Article{Cervesato00tcs,
  author       = "Iliano Cervesato and Joshua S. Hodas and Frank Pfenning",
  title        = "Efficient Resource Management for Linear Logic Proof Search",
  journal      = "Theoretical Computer Science",
  year         = 2000,
  volume       = 232,
  number       = "1--2",
  pages        = "133--163",
  month        = feb
}

@Article{Cervesato:JLC03,
   author    = {Iliano Cervesato and Frank Pfenning},
   title     = {A Linear Spine Calculus},
   journal   = {{Journal of Logic and Computation}},
   year      = {2003},
   OPTkey    = {},
   volume    = {13},
   number    = {5},
   pages     = {639--688},
}

@InProceedings{Cervesato96lics,
  author =       "Iliano Cervesato and Frank Pfenning",
  title =        "A Linear Logical Framework",
  editor =       "E. Clarke",
  booktitle =    "Proceedings of the Eleventh Annual Symposium on Logic in
                  Computer Science",
  year =         1996,
  publisher =    "IEEE Computer Society Press",
  address =      "New Brunswick, New Jersey",
  month =        jul,
  pages =        "264--275",
  keywords =     "LF, Elf, linear",
  urldvi =       "http://www.cs.cmu.edu/~fp/papers/lics96.dvi.gz",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/lics96.ps.gz"
}

@TechReport{Cervesato97tr,
  author =       "Iliano Cervesato and Frank Pfenning",
  title =        "A Linear Spine Calculus",
  institution =  "Department of Computer Science, Carnegie Mellon University",
  year =         1997,
  number =       "CMU-CS-97-125",
  month =        apr,
  keywords =     "LF, Elf, linear",
  urlpdf =       "http://www.cs.cmu.edu/~fp/papers/CMU-CS-97-125.pdf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/CMU-CS-97-125.ps"
}






@InProceedings{Cervesato02isssb,
  title        = "{A Comparison between Strand Spaces and Multiset Rewriting
                  for Security Protocol Analysis}",
  author       = "Iliano Cervesato and Nancy Durgin and Patrick D. Lincoln
                  and John C. Mitchell and Andre Scedrov",
  booktitle    = "Software Security - Theories and Systems  --- ISSS 2002",
  pages        = "356--383",
  editor       = "M. Okada and B. Pierce and Andre Scedrov and H. Tokuda and A.
                  Yonezawa",
  address      = "Tokyo, Japan",
  publisher    = "Springer-Verlag LNCS 2609",
  year         = "2003",
  month        = "8--10 November"
}

@TechReport{ChangCP:03,
  author =   {Bor-Yuh Evan Chang and Kaustuv Chaudhuri and Frank Pfenning},
  title =    {A judgmental analysis of linear logic},
  institution =  {Carnegie Mellon University},
  year =     {2003},
  OPTkey =   {},
  OPTtype =      {},
  number =   {CMU-CS-03-131R},
  OPTaddress =   {},
  month =    {December},
  OPTnote =      {},
  OPTannote =    {}
}

@InProceedings{Chaudhuri:IJCAR06,
  author =   "Kaustuv Chaudhuri and Frank Pfenning and Greg Price",
  title =    "A Logical Characterization of Forward and Backward Chaining in the Inverse Method",
  booktitle =    IJCAR06,
  editor    =    "U. Furbach and N. Shankar",
  series =   "Lecture Notes in Artificial Intelligence (LNAI)",
  year =     2006,
  publisher    = SPR,
  pages =    "97-111"
}

@InProceedings{Chaudhuri:CADE05,
  author =   "Kaustuv Chaudhuri and Frank Pfenning",
  title =    "A Focusing Inverse Method Theorem Prover for First Order Linear Logic",
  editor    = {Robert Nieuwenhuis},
  booktitle = {20th International Conference
               on Automated Deduction (CADE), Talinn, Estonia},
  year      = {2005},
  series    = "Lecture Notes in Computer Science (LNCS)",
  pages     = {69-83},
  publisher    = SPR,
  volume    = {3632}
}


@inproceedings{Chaudhuri:CSL05,
  author    = {Kaustuv Chaudhuri and Frank Pfenning},
  title     = {Focusing the Inverse Method for Linear Logic.},
  editor    = {C.-H. Luke Ong},
  booktitle = {Proceedings of the Computer Science Logic (CSL), 14th Annual Conference of the EACSL, Oxford, UK},
  year      = {2005},
  pages     = {200-215},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3634}
}



@TechReport{Chaudhuri:phd06,
  author =   {Kaustuv Chaudhuri},
  title =    {The Focused Inverse Method for Linear Logic},
  institution =  {Department of Computer Science,},
  year =     {December 2006},
  OPTkey =   {},
  OPTtype =      {},
  OPTnumber =    {},
  OPTaddress =   {},
  OPTmonth =     {},
  number =     {CMU-CS-06-162},
  OPTannote =    {}
}

@article{chen96tabled,
   author    = "W. Chen and D. S. Warren",
   title     = "Tabled Evaluation with Delaying for General Logic Programs",
   journal   = JACM,
   volume    = "43",
   number    = "1",
   month   =       "January",
   year    =       1996,
   pages   =       "20--74"
}


@article{Chen93hilog,
    author = "Weidong Chen and Michael Kifer and David Scott Warren",
    title = "{HILOG}: A Foundation for Higher-Order Logic Programming",
    journal = "Journal of Logic Programming",
    volume = "15",
    number = "3",
    pages = "187-230",
    year = "1993",
    url = "citeseer.nj.nec.com/chen89hilog.html" }


@PhdThesis{Cheney:PHD04,
  author =   {James Cheney},
  title =    {Nominal Logic Programming},
  school =   {Cornell University},
  year =     2004,
  address =  {Ithaca, NY},
  month =    {August}
}



@Misc{Cheney:NominalLF06,
  author =   {James Cheney},
  title =    {A nominal logical framework (Extended Abstract)},
  howpublished = {Draft},
  OPTmonth =     {},
  year =     {2006},
  OPTnote =      {},
  OPTannote =    {}
}

@InProceedings{Cheney:ICLP04,
  author =   {J.~Cheney and C.~Urban},
  title =    {{Alpha}-{Prolog}: A Logic Programming Language with
                  Names, Binding and Alpha-Equivalence},
  editor    = {Bart Demoen and Vladimir Lifschitz},
  booktitle =    {Proceedings of the 20th International Conference on
                  Logic Programming (ICLP 2004)},
  year =     {2004},
  pages = {269--283},
  series = {LNCS (3132)},
  publiusher = {Springer-Verlag}
}

@inproceedings{Gabbay:LICS99,
    author = "Murdoch Gabbay and Andrew Pitts",
    title = "A New Approach to Abstract Syntax Involving Binders",
    OPTshortbooktitle = "Logic in Computer Science ({LICS}'99)",
    booktitle = "Proceedings of the 14th Annual Symposium on Logic in Computer Science ({LICS}'99)",
    publisher = "IEEE Computer Society Press",
    OPTaddress = "Trento, Italy",
    editor = "G. Longo",
    pages = "214--224",
    year = "1999",
    url = "citeseer.ist.psu.edu/gabbay99new.html" }


@Article{Gabbay:FAC02,
  author =	 {M. J. Gabbay and A. M. Pitts},
  title =	 {A New Approach to Abstract Syntax with Variable
                  Binding},
  journal =	 {Formal Aspects of Computing},
  year =	 2002,
  volume =	 13,
  pages =	 {341--363}
}


@InProceedings{Gabbay:LICS04,
  author =   {M.~J.~Gabbay and J.~Cheney},
  title =    {A Sequent Calculus for Nominal Logic},
  booktitle =    {Proceedings of the 19th Annual {IEEE} Symposium on
                  Logic in Computer Science ({LICS} 2004)},
  year =     2004,
  pages =    {139--148},
  address =  {Turku, Finland}
}


@article{Gabbay:InfComp09,
  author = {Murdoch J. Gabbay and St{\'e}phane Lengrand},
  title = {The lambda-context calculus (extended version)},
  journal = {{I}nformation and {C}omputation},
  publisher = {Elsevier},
  year = {2009},
  month = {December},
  issue = {12},
  volume = {207},
  pages = {1369-1400},
  doi = {10.1016/j.ic.2009.06.004}
}



@InProceedings{cheney05fossacs,
  author =   {James Cheney},
  title =    {A Simpler Proof Theory for Nominal Logic},
  booktitle =    {Proceedings of the 2005 Conference on Foundations of
                  Software Science and Computation Structures
                  ({FOSSACS 2005})},
  year =     2005,
  pages =    {379--394},
  series =   {LNCS},
  number =   3441,
publisher = {Springer-Verlag}
}


@InProceedings{Chlipala:POPL10,
author = {Adam Chlipala},
editor = {Manuel V. Hermenegildo and Jens Palsberg},
title  = {A Verified Compiler for an Impure Functional Language},
booktitle = {37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'10)},
pages     = {93-106},
month  = jan,
year   = {2010},
publisher = {ACM}
}


@inproceedings{Chlipala:ICFP08,
  author    = {Adam J. Chlipala},
  title     = {Parametric higher-order abstract syntax for mechanized semantics},
  editor    = {James Hook and
               Peter Thiemann},
  booktitle = {13th ACM SIGPLAN {I}nternational {C}onference
               on {F}unctional {P}rogramming (ICFP'08)},
  year      = {2008},
  pages     = {143-156},
  publisher = {ACM}
}



@InProceedings{Chlipala:PLDI07,
author    = {Adam Chlipala},
editor    = {Jeanne Ferrante and
               Kathryn S. McKinley},
title     = {A Certified Type-Preserving Compiler from Lambda Calculus to Assembly Language},
booktitle = {Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI'07)},
month     = jun,
year      = {2007},
pages     = {54-65},
publisher = {ACM},
}


@TechReport{CleveHutter93,
  author =   "J{\"u}rgen Cleve and Dieter Hutter",
  title =    "Guiding Equational Proofs by Attribute Functions",
  institution =  USL,
  year =     "1993",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-93-15",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction, rippling, equational theorem proving,
                  attribute functions"
}


@InProceedings{CleveHutter94,
  author =   "J{\"u}rgen Cleve and Dieter Hutter",
  title =    "A methodology for equational reasoning",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTpages =     "",
  booktitle =    HICSS94,
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction proving, C-logic, rippling"
}


@InProceedings{CloteExpNote,
  author =       {Peter Clote},
  title =        {A safe rucursion scheme for exponential time},
  booktitle =    {unpublished note},
  year =         2000
}

@TechReport{	  cockett:charity,
  author	= {Robin Cockett and Tom Fukushima},
  title		= {About Charity},
  institution	= {Department of Computer Science, The University of
		  Calgary},
  note		= {Yellow Series Report No. 92/480/18},
  month		= jun,
  year		= {1992}
}


@article{Codish99,
   author = {Michael Codish and Cohavit Taboch},
   title = {A Semantic Basis for the Termination
                  Analysis of Logic Programs},
   journal = {The Journal of Logic Programming},
   volume = {41},
   number = {1},
   year = {1999},
   pages = {103-123}
}


@Article{Colby+:certcomp,
  author =   {Christopher Colby and Karl Crary and Robert Harper and Peter Lee and Frank Pfenning},
  title =    {Automated Techniques for Provably Safe Mobile Code},
  journal =      {Theoretical Computer Science},
  year =     {2003},
  volume =   {290},
  pages =    {1175--1199},
  note =     {Special issue on \emph{Dependable Computing}.}
}

@Article{BatesConstable85a,
  author          = "Joseph  L. Bates and Robert L. Constable",
  title           = "Proofs as Programs",
  journal         = TOPLAS,
  volume          = "7",
  number          = 1,
  pages           = "113-136",
  year            = "1985",
  month           = "January"
}



@Book{Constable86,
  author =   "R.~L.~Constable and S.~F.~Allen and H.~M.~Bromley and et al.",
  title =    "Implementing Meta-Mathematics with the Nuprl Proof Development System",
  publisher =    PH,
  year =     "1086",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Article{ConstableKnoblockBates85,
  author =   "R.~L.\ Constable and T.~B.~Knoblock and J.~L.~Bates",
  title =    "Writing Programs that Construct Proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JAR,
  year =     "1985",
  volume =   "1",
  OPTnumber =    "",
  pages =    "285-326",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tactical theorem proving, PRL, nuprl, NuPRL"
}


@incollection{CCoquand:92,
    author = "Catarina Coquand",
    title = "A proof of normalization for simply typed lambda calculus writting
                  in {ALF}",
    booktitle = "Informal Proceedings of Workshop on Types for Proofs and Programs",
    OPTcity = "B{\aa}stad, Sweden, 8--12 June 1992",
    publisher = "Dept.\ of Computing Science, Chalmers Univ.\ of Technology and G{\"o}teborg Univ.",
    OPTeditor = "B. Nordstr{\"o}m and K. Pettersson and G. Plotkin",
    pages = "80--87",
    year = "1992"
}



@incollection{Coquand:92,
    author = "Thierry Coquand",
    title = "Pattern Matching with Dependent Types",
    booktitle = "Informal Proceedings of Workshop on Types for Proofs and Programs",
    OPTcity = "B{\aa}stad, Sweden, 8--12 June 1992",
    publisher = "Dept.\ of Computing Science, Chalmers Univ.\ of Technology and G{\"o}teborg Univ.",
    OPTeditor = "B. Nordstr{\"o}m and K. Pettersson and G. Plotkin",
    pages = "66--79",
    year = "1992"
}



@inproceedings{Cousot:POPL92,
 author = {Cousot, Patrick and Cousot, Radhia},
 title = {Inductive definitions, semantics and abstract interpretations},
 booktitle = {{19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming
                  Languages (POPL'92)}},
 year = {1992},
 pages = {83--94},
 numpages = {12},
 publisher = {ACM}
} 


@inproceedings{DBLP:conf/icfp/Crary10,
  author    = {Karl Crary},
  title     = {Higher-order representation of substructural logics},
  editor    = {Paul Hudak and
               Stephanie Weirich},
  booktitle = {15th ACM SIGPLAN International Conference
               on Functional Programming (ICFP'10)},
  year      = {2010},
  pages     = {131-142},
  publisher = {ACM}
}

@incollection{Crary:ATAPL,
 author = {Karl Crary},
 title = {Logical Relations and a Case Study in Equivalence Checking},
 editor = {Bejamin C. Pierce},
 booktitle = {Advanced Topics in Types and Programming Languages},
 publisher = {The MIT Press},
 year = 2005
}


@InProceedings{Crary:POPL03,
  author =   {Karl Crary},
  title =    {Toward a Foundational Typed Assembly Language},
  booktitle =    {{30th {ACM SIGPLAN-SIGACT} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages {(POPL'03)}}},
  OPTcrossref =  {},
  OPTkey =   {},
  publisher =    {ACM-Press},
  pages =    {198-212},
  year =     {2003},
  address =      {New Orleans, Louisisana},
  month =    {January},
  OPTorganization = {},
  OPTnote =      {},
  OPTannote =    {proof-carrying code, certified code}
}

@inproceedings{Crary:CADE03,
 author = "Karl Crary and Susmit Sarkar",
 title = "Foundational Certified Code in a Metalogical Framework",
 booktitle = "19th International Conference on Automated Deduction",
 editor =       "F.~Baader",
  booktitle =    "19th International Conference on Automated Deduction, Miami, USA",
  series =   "Lecture Notes in Artificial  Intelligence (LNAI) 2741",
  year =     "July 2003",
  publisher    = SPR,
 pages = "106-120"
}


@InProceedings{CraryWeirich+POPL00,
  author =   {Karl Crary and Stephanie Weirich},
  title =    {Resource Bound Certification},
  booktitle =    {27th ACM SIGPLAN-SIGACT Symposiumn on Principles of Programming Languages (POPL'00)},
  OPTcrossref =  {},
  OPTkey =   {},
  pages =    {184-198},
  year =     {2000},
  OPTnumber =    {},
  address =      {Boston, MA},
  OPTmonth =     {},
  OPTorganization = {},
  OPTnote =      {},
  OPTannote =    {XSB, tabled logic programming, CCS, concurrent systems}
}





@Misc{CRAGrandChallenge:2003,
  author = 	 {Computing Research Association CRA},
  title = 	 {{F}our {G}rand {C}hallenges in {T}rustworthy {C}omputing:
                  {S}econd in a {S}eries of {C}onferences on {G}rand {R}esearch {C}hallenges
                  in {C}omputer {S}cience and {E}ngineering},
  year = 	 2003
}



@InProceedings{XMC98+long,
  author =   {Baoqiu Cui and Yifei Dong and Xiaoqun Du and K. Narayan Kumar and C.R. Ramakrishnan and I.V. Ramakrishnan and Abhik Roychoudhury and Scott A. Smolka and David S. Warren},
  title =    {Logic Programming and Model Checking},
  booktitle =    {International Symposium on Programming Language
          Implementation and Logic Programming (PLILP'98)},
  OPTcrossref =  {},
  OPTkey =   {},
  pages =    {1-20},
  year =     {1998},
  editor =   {Catuscia Palamidessi and Hugh Glaser and Karl Meinke},
  volume =   {1490},
  OPTnumber =    {},
  series =   {Lecture Notes in Computer Science},
  OPTaddress =   {},
  OPTmonth =     {},
  OPTorganization = {},
  publisher = {Springer-Verlag},
  OPTnote =      {},
  OPTannote =    {XSB, tabled logic programming, CCS, concurrent systems}
}


@InProceedings{XMC98,
  author =   {B.~Cui and Y.~Dong and X.~Du and K.~N.~Kumar and C.R. Ramakrishnan and I.V. Ramakrishnan and A.~Roychoudhury and S.A. Smolka and D.S. Warren},
  title =    {Logic Programming and Model Checking},
  booktitle =    {International Symposium on Programming Language
          Implementation and Logic Programming (PLILP'98)},
  OPTcrossref =  {},
  OPTkey =   {},
  pages =    {1-20},
  year =     {1998},
  editor =   {Catuscia Palamidessi and Hugh Glaser and Karl Meinke},
  volume =   {1490},
  OPTnumber =    {},
  series =   {Lecture Notes in Computer Science},
  OPTaddress =   {},
  OPTmonth =     {},
  OPTorganization = {},
  publisher = {Springer-Verlag},
  OPTnote =      {},
  OPTannote =    {XSB, tabled logic programming, CCS, concurrent systems}
}

%%% D

@inproceedings{Danielsson:MPC10,
 author = {Nils Anders Danielsson and Thorsten Altenkirch},
 title = {Subtyping, declaratively: an exercise in mixed induction and coinduction},
 booktitle = {10th {I}nternational {C}onference on Mathematics of {P}rogram {C}onstruction (MPC'10)},
 year = {2010},
 isbn = {3-642-13320-7, 978-3-642-13320-6},
 pages = {100--118},
 url = {http://portal.acm.org/citation.cfm?id=1886619.1886629},
 acmid = {1886629},
 publisher = {Springer-Verlag}
} 


@inproceedings{Danielsson:PAR10,
  author    = {Nils Anders Danielsson},
  title     = {Beating the Productivity Checker Using Embedded Languages},
  editor    = {Ana Bove and
               Ekaterina Komendantskaya and
               Milad Niqui},
  booktitle = {Proceedings Workshop on Partiality and Recursion in Interactive
               Theorem Provers (PAR'10)},
  year      = {2010},
  volume    = {43},
  series    = {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
  pages     = {29-48}
}

@unpublished{danielsson:Email:CodataOddity,
author = {Nils Anders Danielsson},
title = {Codata Oddity },
note = {Email posted on agda email list. Available from http://thread.gmane.org/gmane.comp.lang.agda/226},
year = {2008}
}




@PhdThesis{dagostino90,
  author =   "Marcello D'Agostino",
  title =    "Investigations into the Complexity of some
          Propositional Calculus",
  school =   "Oxford University Computing Laboratory, Programming
          Research Group",
  year =     "1990",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTtype =      "",
  OPTnote =      "",
  OPTannote =    "",
  Keywords  =    "tableau calculus"
}

@article{Davies:ACM01,
  author    = {Rowan Davies and
               Frank Pfenning},
  title     = {A modal analysis of staged computation},
  journal   = {Journal of the ACM},
  volume    = {48},
  number    = {3},
  year      = {2001},
  pages     = {555-604},
  doi       = {10.1145/382780.382785}
}
@inproceedings{Davies+ICFP00,
  author =   "Rowan Davies and Frank Pfenning",
  title =    "Intersection Types and Computational Effects",
   OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Proceedings of the International Conference on Functional Programming (ICFP 2000), Montreal, Canada",
  year =     "2000",
  OPTvolume =    "",
  OPTseries    =    "",
  publisher =    "ACM Press",
  pages     =    "198--208",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "refinement types"
}

@inproceedings{Dawson+95:optimizing,
    author = "Steven Dawson and C. R. Ramakrishnan and I. V. Ramakrishnan and Terrance Swift",
    title = "Optimizing Clause Resolution: Beyond Unification Factoring",
    booktitle = "International Logic Programming Symposium",
    pages = "194-208",
    year = "1995",
    url = "citeseer.nj.nec.com/dawson95optimizing.html"
}


@inproceedings{Dawson+95:jump,
  author =   "Steve Dawson and C.~R. Ramakrishnan and I.~V.Ramakrishnan",
  title =    "Design and implementation of jump tables for fast
          indexing of logic programs",
   OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "International Symposium on Programming Language
          Implementation and Logic Programming (PLILP'95)",
  year =     "1995",
  volume =   "982",
  series    =    "Lecture Notes in Computer Science",
  publisher =    SPR,
  pages     =    "133--150",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "logic programming, indexing"
}


@Article{Dawson+95:unification,
  author =   "Steve Dawson and C.~R. Ramakrishnan and Steve Skiena and Terrance Swift",
  title =    "Principles and Practice of Unification Factoring",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "ACM Transactions on Programming Languages and Systems",
  year =     "1995",
  volume =   "18",
  number =   "6",
  pages =    "528--563",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "logic programming, indexing"
}

@InProceedings{Decorte+97,
  author =   "Stefaan Decorte and Danny De Schreye and Michael Leuschel and Bern Martens and Konstantinos Sagonas",
  title =    "Termination Analysis for Tabled Logic Programming",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 1463",
  pages =    "111-127",
  booktitle =    "Seventh International Workshop on Logic Program Synthesis
             and Transformation (LOPSTR'97), Leuven, Belgium, July 1997",
  year =     "1998",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination, tabling"
}


@inproceedings{Demoen98,
    author = "Bart Demoen and Konstantinos Sagonas",
    title = "{CAT}: The Copying Approach to Tabling",
    booktitle = "International Symposium on Programming Language
          Implementation and Logic Programming (PLILP'98)",
    editor = {Catuscia Palamidessi and Hugh Glaser and Karl Meinke},
    series = "Lecture Notes in Computer Science (LNCS), vol. 1490",
    pages = "21--36",
    year = "1998",
    url = "citeseer.nj.nec.com/article/demoen98cat.html" }

@inproceedings{Demoen99,
    author = "Bart Demoen and Konstantinos Sagonas",
    title = "{CHAT}: The Copy-Hybrid Approach to Tabling",
    booktitle = "The First International Workshop on Practical Aspects of Declarative Languages",
    month = "January",
    address = "San Antonio",
    series = "Lecture Notes in Computer Science (LNCS), vol. 1551",
    pages = "106--121",
    year = "1999",
    publisher = "Springer",
    url = "citeseer.nj.nec.com/demoen99chat.html" }


@article{DemoenSagonas99,
   author    = "Bart Demoen and Konstantinos Sagonas",
   title     = "{CAT}: The Copying Approach to Tabling",
   journal   = "Journal of Functional and Logic Programming",
   pages = "1--38",
   year      = 1999,
   volume    = 2,
   keywords  = "tabelling"
}



@TechReport{Denzinger90,
  author =   "J{\"o}rg Denzinger",
  title =    "Ansatzpunkte f{\"u}r heuristische {M}ethoden bei der
          {V}ervollst{\"a}ndigung",
  institution =  UKL,
  year =     "1990",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     "{SEKI} Working Paper",
  number =   "{SWP}-90-01",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Knuth Bendix completion, heuristics"
}


@InProceedings{DenzingerFuchs94,
  author =   "J{\"o}rg Denzinger and Matthias Fuchs",
  title =    "Goal oriented equational theorem proving using teamwork",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 861",
  pages =    "343-354",
  booktitle =    KI94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "disstributed theorem proving, tactical theorem
          proving, implicit induction"
}


@TechReport{DenzingerKronenburg94,
  author =   "J{\"o}rg Denzinger and Martin Kronenburg",
  title =    "Planning for distributed theorem proving: The
                  teamwork approach",
  institution =  UKL,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  OPTnumber =    "{SR}-94-09",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "disstributed theorem proving, tactical theorem
          proving, implicit induction, planning"
}


@TechReport{DenzingerSonntag93,
  author =   "Inger Sonntag and J{\"o}rg Denzinger",
  title =    "Extending automated theorem proving by planning",
  institution =  UKL,
  year =     "1993",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-93-02",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "proof planning"
}


@article{Dershowitz82,
   author    = "Nachum Dershowitz",
   title     = "Orderings for Term--Rewriting Systems",
   journal   = TCS,
   year      = "1982",
   volume    = "17",
   number    = "3",
   pages     = "279-301",
   keywords  = "term rewriting systems, orderings"
}


@inproceedings{Dershowitz85,
   author    = "Nachum Dershowitz",
   title     = "Termination",
   booktitle = RTA85,
   year      = "1985",
   month     = may,
   publisher = SPR,
   pages     = "180-224",
   note      = {Lecture Notes in Computer Science (LNCS) 202},
   keywords  = "termination, term rewriting"
}


@Article{Dershowitz87,
  author =   "Nachum Dershowitz",
  title =    "Termination of Rewriting",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JSC,
  year =     "1987",
  volume =   "3",
  number =   "4",
  pages =    "69-116",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination, ordering"
}


@article{Dershowitz90,
   author    = "Nachum Dershowitz",
   title     = "A rationale for conditional equational programming",
   journal   = TCS,
   year      = "1990",
   volume    = "75",
   pages     = "111-138",
   keywords  = "conditional term rewriting systems"
}


@inbook{Dershowitz92,
   author    = "Nachum Dershowitz",
   title     = "Completion and Its Applications",
   chapter   = "two",
   year      = "1992",
   publisher = AP,
   volume    = "2 Rewriting Techniques",
   pages     = "31-85",
   series    = "Resolution of Equations in Algebraic Structures"
}


@InProceedings{DershowitzOkadaSivakumar87,
  author =   "Nachum Dershowitz and Mitsuhiro Okada and G.~Sivakumar",
  title =    "Confluence of Conditional Term Rewrite Systems",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 308",
  pages =    "31-44",
  booktitle =    CTRS87,
  year =     "1987",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "confluence of conditional rewriting"
}


@InProceedings{DershowitzOkadaSivakumar88,
  author =   "Nachum Dershowitz and Mitsuhiro Okada and G.~Sivakumar",
  title =    "Canonical Conditional Term Rewriting Systems",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  number =   "310",
  series =   "Lecture Notes in Computer Science (LNCS)",
  pages =    "538-549",
  booktitle =    CADE88,
  year =     "1988",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional rewriting"
}


@TechReport{DershowitzPlaisted86,
  author =   "Nachum Dershowitz and David A.\ Plaisted",
  title =    "Equational Programming",
  institution =  "University of Illinois, Urbana",
  year =     "1986",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "R-86-1265",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@InProceedings{DershowitzSivakumar88,
  author =  "Nachum Dershowitz and G.~Sivakumar",
  title =   "Goal--Directed Equation Solving",
  booktitle =   AAAI88,
  year =    "1988",
  OPTeditor =   "",
  pages =   "166-170",
  OPTorganization =     "",
  OPTpublisher =    "",
  OPTaddress =  "",
  month =   aug,
  OPTnote =     "",
  keywords =    "narrowing, equational programming"
}


@inbook{DershowitzJouannaud90,
   author    = "Nachum Dershowitz and Jean - Pierre Jouannaud",
   title     = "Rewrite Systems",
   chapter   = "6",
   year      = "1990",
   publisher = ESP,
   volume    = {B: Formal Models and Semantics},
   pages     = "243-320",
   note      = "Jan van Leeuwen (Ed.)",
   opteditor = "Jan van Leeuwen",
   keywords  = "term rewriting, Knuth-Bendix completion"
}


@inproceedings{DershowitzJouannaudKlop91,
   author    = "Nachum Dershowitz and Jean - Pierre Jouannaud and Jan
       Willem Klop",
   title     = "Open Problems in Rewriting",
   booktitle = RTA91,
   year      = "1991",
   month     = apr,
   publisher = SPR,
   pages     = "445-456",
   note      = {Lecture Notes in Computer Science (LNCS) 488},
   keywords  = "open problems in rewriting"
}


@inproceedings{DershowitzJouannaudKlop93,
   author    = "Nachum Dershowitz and Jean - Pierre Jouannaud and Jan
       Willem Klop",
   title     = "More Problems in Rewriting",
   booktitle = RTA93,
   year      = "1993",
   month     = jun,
   publisher = SPR,
   pages     = "468-487",
   note      = "Lecture Notes in Computer Science (LNCS) vol.\ 690",
   keywords  = "open problems in rewriting"
}


@article{DershowitzManna79,
   author    = "Nachum Dershowitz and Zohar Manna",
   title     = "Proving Termination with Multiset Orderings",
   journal   = CACM,
   year      = "1979",
   month     = aug,
   volume    = "22",
   number    = "8",
   pages     = "465-476",
   keywords  = "term rewriting systems, orderings"
}


@inproceedings{DershowitzOkada88,
   author    = "Nachum Dershowitz and Mitsuhiro Okada",
   title     = "Proof-Theoretic Techniques for Term Rewriting Theory",
   booktitle = LICS88,
   year      = "1988",
   pages     = "104-111",
   keywords  = "term rewriting systems, orderings, ordinals, proof theory"
}



@Article{DershowitzOkada90,
  author =   "Nachum Dershowitz and Mitsuhiro Okada",
  title =    "A rationale for conditional equational programming",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  TCS,
  year =     "1990",
  volume =   "75",
  OPTnumber =    "",
  pages =    "111-138"
}

@InProceedings{Despeyroux97,
  author =       "Jo{\"e}lle Despeyroux and Frank Pfenning and Carsten
                  Sch{\"u}rmann",
  title =        "Primitive Recursion for Higher-Order Abstract Syntax",
  OPTeditor =       "R. Hindley",
  pages =        "147--163",
  OPTshortbooktitle =    "International Conference Typed Lambda Calculus and Applications (TLCA'97)",
  booktitle =    "Proceedings of the Third International Conference on
                  Typed Lambda Calculus and Applications (TLCA'97)",
  year =         "1997",
  publisher =    "Springer",
  OPTaddress =      "Nancy, France",
  keywords =     "misc",
  note =         "Extended version available as Technical Report
                  CMU-CS-96-172, Carnegie Mellon University"

}


@article{Despeyroux01,
    author = "Jo{\"e}lle Despeyroux and Pierre Leleu",
    title = "Recursion over objects of functional type",
    journal = "Mathematical Structures in Computer Science",
    volume = "11",
    number = "4",
    pages = "555--572",
    year = "2001",
    url = "citeseer.nj.nec.com/despeyroux99recursion.html" }




@inProceedings{Despeyroux99,
    author = "Jo{\"e}lle Despeyroux and Pierre Leleu",
    title = "Primitive recursion for higher order abstract syntax with dependent types",
    booktitle = "International Workshop on Intuitionistic Modal Logics and Applications (IMLA)",
    OPTvolume = "",
    OPTnumber = "",
    OPTpages = "555--572",
    year = "1999"
}

@booklet{Deussen86,
   author       = "Peter Deussen",
   title        = "{E}rzeugung, {A}kzeption und sytaktische {A}nalyse formaler
       {S}prachen, {T}eil 1: {E}rzeugung und {A}kzeption",
   year         = "1986",
   howpublished = {Vorlesungsskrip der Universit{\"a}t Karlsruhe}
}


@inproceedings{Appel:PPDP03,
 author = {Dinghao Wu and Andrew W. Appel and Aaron Stump},
 title = {Foundational proof checkers with small witnesses},
 booktitle = {PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming},
 year = {2003},
 isbn = {1-58113-705-2},
 pages = {264--274},
 location = {Uppsala, Sweden},
 doi = {http://doi.acm.org/10.1145/888251.888276},
 publisher = ACM,
 }


@inproceedings{Doczkal:LFMTP09,
 author = {Doczkal, Christian and Schwinghammer, Jan},
 title = {Formalizing a Strong Normalization Proof for {M}oggi's Computational Metalanguage: A Case Study in {Isabelle/HOL}-nominal},
 booktitle = {Proceedings of the Fourth International Workshop on Logical
                  Frameworks and Meta-Languages: Theory and Practice (LFMTP'09)},
 year = {2009},
 isbn = {978-1-60558-529-1},
 location = {Montreal, Quebec, Canada},
 pages = {57--63},
 numpages = {7},
 publisher = {ACM},
 keywords = {HOL-nominal, TT-lifting, logical relations},
} 



@Article{Dowek:94,
  author = 	 {Gilles Dowek},
  title = 	 {L'ind{\'e}cidabilit{\'e} du filtrage du troisi{\`e}me ordre dans les calculs avec types d{\'e}pendants ou constructeurs de types ({T}he undecidability of third order pattern matching in calculi with dependent types or type constructors)},
  journal = 	 {Comptes rendus {\`a} l'Acad{\'e}mie des Sciences, S{\'e}rie I},
  year = 	 1994,
  volume = 	 312,
  number = 	 12,
  pages = 	 {951--956}}


@inproceedings{Dowek:TLCA93,
 author = {Dowek,, Gilles},
 title = {The Undecidability of Typability in the Lambda-Pi-Calculus},
 booktitle = {{International Conference on Typed Lambda Calculi and Applications(TLCA '93)}},
 year = {1993},
 isbn = {3-540-56517-5},
 pages = {139--145},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@InProceedings{Dowek95,
  author =       "Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude
                  Kirchner",
  title =        "Higher-Order Unification via Explicit Substitutions",
  editor =       "D. Kozen",
  booktitle =    "{10th Annual Symposium on Logic in
                  Computer Science}",
  year =         1995,
  publisher =    "IEEE Computer Society Press",
  month =        "June",
  pages =        "366--374",
  keywords =     "unification"
}

@InProceedings{Dowek96jicslp,
  author =       "Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude Kirchner
                  and Frank Pfenning",
  title =        "Unification via Explicit Substitutions: The Case of
                  Higher-Order Patterns",
  booktitle =    "{Joint International Conference and
                  Symposium on Logic Programming}",
  editor =       "M. Maher",
  year =         "1996",
  publisher =    "MIT Press",
  month =        sep,
  pages =        "259--273",
  notes =        "Extended version available as Rapport de Recherche No.~3591,
                  INRIA, December 1998",
  keywords =     "unification",
  urldvi =       "http://www.cs.cmu.edu/~fp/papers/jicslp96.dvi.gz",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/jicslp96.ps.gz"
}

@Book{Dreyfus,
  author =   "H.L.~Dreyfus",
  title =    "What Computers can't do - The Limits of Artificial Intelligence",
  publisher =    "Harper \& Row Publ.",
  year =     "1972",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@book{DuboisPrade80,
   author    = "Didier Dubois and Henri Prade",
   title     = "Fuzzy Sets and Systems: Theory and Applications",
   year      = 1980,
   publisher = AP,
   volume    = "44",
   series    = "Mathematics in Science and Engineering",
   keywords  = "fuzzy set theory, fuzzy logic"
}

@Article{Dubois+JAR99,
  author      = "Catherine Dubois and Valerie Menissier-Morain",
  title       = "Certification of a Type Inference Tool for {ML}:
          Damas-{M}ilner within {C}oq",
  journal     = JAR,
  year        = 1999,
  OPTkey      = "",
  volume      = "23",
  number      = "3-4",
  pages       = "319--346",
  OPTmonth    = "",
  OPTnote     = ""
}

@Book{Duffy91,
  author =  "David A.~Duffy",
  title =   "Principles of Automated Theorem Proving",
  publisher =   "John Wiley \& Sons",
  year =    "1991",
  OPTeditor =   "",
  OPTvolume =   "",
  OPTseries =   "",
  OPTaddress =  "",
  OPTedition =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "automated theorem proving, logic textbook"
}

@article{Duggan:TCS98,
  author    = {Dominic Duggan},
  title     = {Unification with Extended Patterns},
  journal   = {Theoretical Computer Science},
  volume    = {206},
  number    = {1-2},
  year      = {1998},
  pages     = {1-50},
  ee        = {http://dx.doi.org/10.1016/S0304-3975(97)00141-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@Book{Dummett:91,
  author = 	 {Michael Dummett},
  ALTeditor = 	 {},
  title = 	 {The Logical Basis of Metaphysics},
  publisher = 	 {Harvard University Press, Cambridge, Massachusetts},
  year = 	 {1993},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {The William James Lectures, 1976},
  OPTannote = 	 {}
}

@article{Dyckhoff:JSL92,
  author    = {Roy Dyckhoff},
  title     = {Contraction-Free Sequent Calculi for Intuitionistic Logic.},
  journal   = {Journal of Symbolic Logic},
  volume    = {57},
  number    = {3},
  year      = {1992},
  pages     = {795-807},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

%%% E

@PhdThesis{Elliot90:Dissertation,
  author       = {Conal Elliott},
  title        = {Extensions and Applications of Higher-Order Unification},
  url          = {http://conal.net/papers/elliott90.pdf},
  school       = {School of Computer Science, Carnegie Mellon University},
  year         = 1990
}


@InCollection{Elliott91,
  author =      "Conal Elliott and Frank Pfenning",
  title =       "A Semi-Functional Implementation of a Higher-Order Logic
                  Programming Language",
  booktitle =   "Topics in Advanced Language Implementation",
  publisher =   "MIT Press",
  year =        "1991",
  pages =       "289--325",
  editor =      "Peter Lee",
  url =         "http://www.cs.cmu.edu/~fp/papers/elpsml-paper.tar.gz",
  keywords =    "lambda-Prolog, LF, Elf"
}


@book{EhrichGogollaLipeck89,
   author    = "Hans D.~Ehrich and Martin Gogolla and Udo W.~Lipeck",
   title     = {Al\-ge\-bra\-ische Spezifikation abstrakter Datentypen},
   year      = "1989",
   publisher = TEU,
   keywords  = "abstrakte Datentypen, Semantik, initiale Modelle"
}

@inproceedings{Erlingsson00irm,
author = "Ulfar Erlingsson and Fred B. Schneider",
title = "{IRM} Enforcement of Java Stack Inspection",
booktitle = "{IEEE} Symposium on Security and Privacy",
pages = "246-255",
year = "2000",
url = "citeseer.nj.nec.com/erlingsson00irm.html" }

@inproceedings{Erlingsson00sasi,
author = "Erlingsson and Schneider",
title = "{SASI} Enforcement of Security Policies: {A} Retrospective",
booktitle = "{WNSP}: New Security Paradigms Workshop",
publisher = "ACM Press",
year = "2000",
url = "citeseer.nj.nec.com/erlingsson99sasi.html" }



@Article{Eusterbrock,
  author =   "Jutta Eusterbrock",
  title =    "{Beobachtung, Strukturierung und Synthese: Weibliche Vorgehensweisen?}",
  journal =      "Koriph{\"a}e",
  year =     "1994",
  OPTkey =   "",
  OPTvolume =    "",
  number =   "15",
  month =    "May",
  pages =    "26 - 31",
  OPTnote =      "",
  OPTannote =    ""
}

@inproceedings{EvansTwyman99,
author = "D.~Evans. and A.~Twyman",
title = "Policy-directed code safety",
booktitle = "{IEEE} Symposium on Security and Privacy, Oakland, California",
pages = "32--45",
year = "1999",
 }

%%% F

@Article{Faltings83,
  author =   "Faltings, G. and  U.~Deker",
  title =    "Interview: Die Neugier, etwas ganz genau wissen zu wollen",
  journal =      "Bild der Wissenschaft",
  year =     "1983",
  OPTkey =   "",
  volume =   "10",
  OPTnumber =    "10",
  OPTmonth =     "",
  pages =    "162-182",
  OPTnote =      "",
  OPTannote =    ""
}




@Article{Felty93jar,
  author =      "Amy Felty",
  title =       "Implementing Tactics and Tacticals in a Higher-Order Logic
                  Programming Language",
  journal =     "Journal of Automated Reasoning",
  volume =      "11",
  number =      "1",
  year =        1993,
  month =       aug,
  pages =       "43--81",
  urlps =       "ftp://ftp.research.bell-labs.com/dist/felty/jar.ps.gz",
  keywords =    "lambda-Prolog"
}


@InProceedings{Felty:TPHOLs02,
   Author="Amy P. Felty",
   Title="Two-Level Meta-Reasoning in {Coq}",
   Booktitle="Fifteenth International Conference on Theorem
       Proving in Higher-Order Logics",
   Publisher="Springer-Verlag Lecture Notes in Computer Science",
   Month=aug,
   Pages="198--213",
   Year=2002}



@inproceedings{Felty:PPDP09,
 author = {Felty, Amy P. and Momigliano, Alberto},
 title = {Reasoning with hypothetical judgments and open terms in hybrid},
 booktitle = {11th ACM SIGPLAN {C}onference on {P}rinciples and {P}ractice of {D}eclarative {P}rogramming (PPDP '09)},
 year = {2009},
 isbn = {978-1-60558-568-0},
 pages = {83--92},
 location = {Coimbra, Portugal},
 doi = {http://doi.acm.org/10.1145/1599410.1599422},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@Article{Felty12,
  author =       Felty #{and}# Momigliano,
  title =        {Hybrid: A Definitional Two-Level Approach to Reasoning with
                  Higher-Order Abstract Syntax},
  journal =      JAR,
  year =         {2012},
  volume =       48,
  number =       1,
  pages =        {43-105},
  keywords =     {Logical frameworks, Higher-order abstract syntax,
                  Interactive theorem proving, Induction, Variable binding,
                  Isabelle/HOL, Coq}
}



@InProceedings{Felty:ITP10,
  author = 	 {Amy P. Felty and Brigitte Pientka},
  title = 	 {Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison},
  booktitle = 	 {International Conference on Interactive Theorem Proving},
  OPTcrossref =  {},
  OPTkey = 	 {},
  pages = 	 {227-242},
  year = 	 {2010},
  editor = 	 {Matt Kaufmann and Lawrence C. Paulson},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  series = 	 {Lecture Notes in Computer Science (LNCS 6172)},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  publisher = {Springer},
  OPTnote = 	 {},
  OPTannote = 	 {}
}


@inproceedings{Felty92logic,
    author = "Amy Felty",
    title = "A Logic Programming Approach to Implementing Higher-Order Term Rewriting",
    booktitle = "Proceedings of the January 1991 Workshop on Extensions to Logic Programming",
    publisher = "Springer-Verlag Lecture Notes in Artificial Intelligence",
    editor = "Lars-Henrik Eriksson and Lars Halln{\"{a}}s and Peter Schroeder-Heister",
    pages = "135--161",
    year = "1992",
    url = "citeseer.nj.nec.com/felty92logic.html" }

@inproceedings{Ferreira:PPDP14,
  author    = {Francisco Ferreira and Brigitte Pientka},
  title     = {Bidirectional elaboration of dependently typed languages},
  booktitle = {16th International Symposium on Principles and Practice
of Declarative Programming (PPDP'14)},
  year      = {2014},
  publisher = {ACM},
}

@inproceedings{Ferreira:PLPV13,
 author = {Ferreira, Francisco and Monnier, Stefan and Pientka, Brigitte},
 title = {Compiling contextual objects: bringing higher-order abstract syntax to programmers},
 booktitle = {Proceedings of the 7th Workshop on Programming Languages meets Program Verification},
 series = {PLPV '13},
 year = {2013},
 location = {Rome, Italy},
 pages = {13--24},
 numpages = {12},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {compilation, contextual objects, pattern matching},
} 
 @Comment isbn = {978-1-4503-1860-0},
 @Comment url = {http://doi.acm.org/10.1145/2428116.2428121},
 @Comment doi = {10.1145/2428116.2428121},
 @Comment acmid = {2428121},

@inproceedings{Fettig:RTA96,
  author    = {Roland Fettig and
               Bernd L{\"o}chner},
  title     = {Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus
               with Finite Products and terminal Type},
  editor    = {Harald Ganzinger},
  booktitle     = {7th International
               Conference on Rewriting Techniques and Applications (RTA'96)},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 1103)},
  year      = {1996},
  pages     = {347-361}
}


@Article{FikesNilsson71,
  author =   "R.~E.~Fikes and N.~J.~Nilsson",
  title =    "{STRIPS}: A new approach to the application of
          theorem proving to problem solving",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  AI,
  year =     "1971",
  volume =   "2",
  OPTnumber =    "",
  pages =    "189-208",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "planning"
}


@book{Fitting90,
   author    = "Melvin Fitting",
   title     = "First-Order Logic and Automated Theorem Proving",
   year      = "1990",
   publisher = SPR,
   series    = "Texts and Monographs in Computer Science",
   keywords  = "first order predicate logic, calculi, analytic
       tableau, resolution, Gentzen sequence, logic textbook"
}

@inproceedings{Fisher99design,
    author = "Kathleen Fisher and John H. Reppy",
    title = "The Design of a Class Mechanism for Moby",
    booktitle = "ACM {SIGPLAN} Conference on Programming Language Design and Implementation",
    pages = "37-49",
    year = "1999"
}


@Misc{FPPC,
  author =   "Andrew Appel",
  title =    "Foundational Proof-carrying code Project",
  howpublished = "personal communication",
  OPTyear =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{Frauss92,
  author =   "Ulrich Frauss",
  title =    "A Calculus for Conditional Inductive Theorem Proving",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "357-362",
  booktitle =    CTRS92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords = "inductive theorem proving, conditional term rewriting
          systems, explicit induction, structural induction"
}


@TechReport{FraussHussmann90,
  author =   "U.~Frauss and H.~Hussmann",
  title =    "A Narrowing-Based Theorem Prover ",
  institution =  "University of Passau",
  year =     "1990",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "TIP prover"
}


@InProceedings{Fribourg83,
  author =  "Laurent Fribourg",
  title =   "A Superposition oriented Theorem Prover",
  booktitle =   IJCAI83,
  year =    "1983",
  OPTeditor =   "",
  pages =   "923-925",
  OPTorganization =     "",
  OPTpublisher =    "",
  OPTaddress =  "",
  month =   aug,
  OPTnote =     "",
  keywords =    "automated theorem proving, term rewriting, resolution"
}


@InProceedings{Fribourg84,
  author =  "Laurent Fribourg",
  title =   "A Narrowing Procedure for Theories with Constructors",
  booktitle =   CADE84,
  year =    "1984",
  OPTeditor =   "",
  pages =   "259-281",
  OPTorganization ="",
  publisher =   SPR,
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "narrowing, completion"
}


@inproceedings{Fribourg86,
   author    = "Laurent Fribourg",
   title     = "A strong restriction of the inductive completion
       procedure",
   booktitle = "Automata, Languages and Programming, 13th
       International Colloquium, Rennes, France",
   year      = "1986",
   month     = jul,
   publisher = SPR,
   pages     = "105-115",
   note      = "Lecture Notes in Computer Science (LNCS) vol.\ 226"
}

@inproceedings{FoxLong1-AIPS00,
   author    = "Maria Fox and Derek Long",
   title     = "Recognizing and Exploiting Generic Types in Planning
                   Domains ",
   booktitle = "International AI Planning Systems conference, AIPS 2000, Breckenridge, Colorado,
                   USA",
   year      = "2000"
}


@inproceedings{FoxLong2-AIPS00,
   author    = "Maria Fox and Derek Long",
   title     = "Utilizing Automatically Inferred Invariants in Graph
                   Construction and Search",
   booktitle = "International AI Planning Systems conference, AIPS 2000, Breckenridge, Colorado,
                   USA",
   year      = "2000",
   publisher = SPR,
   pages     = "105-115",
   note      = "Lecture Notes in Computer Science (LNCS) vol.\ 226"
}


@Article{FoxLongJAIR98,
  author =   "Maria Fox and Derek Long",
  title =    "The Automatic Inference of State Invariants in TIM",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JAIR,
  year =     "1998",
  volume =   "9",
  OPTnumber =    "",
  pages =    "367-421",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "planning"
}

@inproceedings{FoxLong980,
   author    = "Maria Fox and Derek Long",
   title     = "A Type-Theoretic Semantics for Propositional Planning",
   booktitle = "Proceedings of 17th UK Planning and Scheduling SIG, Huddersfield UK",
   year      = "1998",
   publisher = SPR,
   pages     = "105-115",
   note      = "Lecture Notes in Computer Science (LNCS) vol.\ 226"
}


@InProceedings{Frairtlough91,
  author =   "M. Fairtlough and M. Mendler and X. Cheng",
  title =    "Abstraction and refinement in higher-order logic",
  editor    = "Richard J. Boulton and Paul B. Jackson",
  booktitle  = "14th International Conference on Theorem Proving in Higher Order Logics, Edinburgh, Scotland, UK",
  publisher = "Springer",
  series    = "Lecture Notes in Computer Science (LNCS)",
  volume    = "2152",
  year      = "2001",
  pages =    "201-216",
  month =    "September 3-6",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "lax logic, modal logic, constraint logic programming, higher-order"
}

@TechReport{Fairtlough97,
  author =   "M. Fairtlough and M. Mendler and M. Walton",
  title =    "First-order lax logic as a framework for constraint logic programming",
  institution =  "Passau University",
  year =     "1997",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =  "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "constraint logic programming, abstraction, modal logic"
}


@InProceedings{Fribourg87,
  author =   "Laurent Fribourg",
  title =    "On the use of conditional rewrite rules in inductive
          theorem proving",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 308",
  OPTpages =     "",
  booktitle =    CTRS87,
  year =     "1987",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting, inductive reasoning,
          Boyer Moore, nqthm, linear completion"
}


@TechReport{Fuchs93,
  author =   "Matthias Fuchs",
  title =    "Using theorem provers for {PL1EQ} as inductive provers",
  institution =  UKL,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-93-01",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction theorem proving, heuristics, automated
          theorem proving"
}


@TechReport{Fuchs94,
  author =   "Matthias Fuchs",
  title =    "The application of goal-oriented heuristics for
                  proving equational theorems via the unfailing
                  Knuth-Bendix completion procedure.  A case study:
                  lattice ordered groups",
  institution =  UKL,
  year =     "1994",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-94-02",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction theorem proving, heuristics, automated
          theorem proving, implicit induction, completion, teamwork"
}


@TechReport{Fuchs95,
  author =   "Matthias Fuchs",
  title =    "Learning proof heuristics by adapting parameters",
  institution =  UKL,
  year =     "1995",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  OPTnumber =    "{SR}-95-02",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "implicit induction, learning"
}


@InProceedings{Fuchs95b,
  author =   "Matthias Fuchs",
  title =    "Learning proof heuristics by adapting parameters",
  booktitle =    ML95,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1995",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "implicit induction, learning"
}


%%% G

@article{GalmichePym00,
   author    =  "D.~Galmiche and D.~Pym",
   title     =  "Proof-search in Type-theoretic Languages: An introduction",
   journal   =  TCS,
   year      =  "2000",
   volume    =  "232",
   pages     =  "5-53",
   keywords  =  "logical framework LF"
}



@InProceedings{GanzingerStuber92,
  author =   "Harald Ganzinger and J{\"u}rgen Stuber",
  title =    "Inductive Theorem Proving by Consistency for
          First-Order Clauses",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "226-241",
  booktitle =    CTRS92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting, inductive reasoning,
          proof by consistency, perfect model"
}


@InProceedings{Ganzinger87,
  author =   "Harald Ganzinger",
  title =    "A Completion Procedure for Conditional Equations",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 308",
  pages =    "63-83",
  booktitle =    CTRS87,
  year =     "1987",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "completion of conditional term rewriting systems"
}


@InProceedings{Ganzinger+ijcar01,
  author =   "Harald Ganzinger and Robert Nieuwenhuis and Pilar Nivela",
  title =    "Context Trees",
  series =   "LNAI 2083",
  pages =    "242-256",
  booktitle =    IJCAR01,
  year =     2001,
  publisher =    SPR,
  keywords =     "index, substitution trees"
}

@article{Ganzinger:JAR04,
 author = {Harald Ganzinger and Robert Nieuwenhuis and Pilar Nivela},
 title = {Fast Term Indexing with Coded Context Trees},
 journal = {Journal of Automated Reasoning},
 volume = {32},
 number = {2},
 year = {2004},
 issn = {0168-7433},
 pages = {103--120},
 doi = {http://dx.doi.org/10.1023/B:JARS.0000029963.64213.ac},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }


@InProceedings{GargPfenning:CSFW06,
  author = "D. Garg and F. Pfenning",
  title = "Non-interference in constructive authorization logic",
  booktitle = "Proceedings of the 19th IEEE Computer Security Foundations Workshop
    (CSFW 19)",
  publisher = "IEEE Computer Society Press",
  year = "2006"
}


@inproceedings{Garg:SSP10,
  author    = {Deepak Garg and
               Frank Pfenning},
  title     = {A Proof-Carrying File System},
  booktitle = {31st IEEE Symposium on Security and Privacy},
  year      = {2010},
  pages     = {349-364},
  publisher = {IEEE Computer Society}
}



@InProceedings{GarlandGuttag88,
  author =   "Stephen J.~Garland and John V.~Guttag",
  title =    "Inductive Methods for Reasoning about Abstract Data Types",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "219-228",
  booktitle =    POPL88,
  year =     "1988",
  OPTorganization = "",
  publisher =    "ACM Press",
  OPTaddress =   "",
  month =    jan,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "inductive reasoning, LP"
}

@MANUAL{gawk93,
author       = "Diane Barlow Close and Arnold D.~Robbins and Paul H.~Rubin
         and Richard Stallman",
title        = "The GAWK Manual",
organisation = "Free Software Foundation, Inc.",
month        = "April",
year         = 1993
}


@inproceedings{Gelernter:POPL87,
 author = {Gelernter, David and Jagannathan, Suresh and London, Thomas},
 title = {Environments as first class objects},
 booktitle = {Proceedings of the 14th {ACM SIGACT-SIGPLAN} {S}ymposium on
                  {P}rinciples of {P}rogramming {L}anguages (POPL'87)},
 year = {1987},
 pages = {98--110},
 numpages = {13},
 publisher = {ACM},
 address = {New York, NY, USA},
} 
 @Comment isbn = {0-89791-215-2},

@Article{Gentzen35,
  author =   "Gerhard Gentzen",
  title =    "Untersuchungen {\"u}ber das logische {S}chlie{\ss}en",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Mathematische Zeitschrift",
  year =     "1935",
  volume =   "39",
  OPTnumber =    "",
  pages =    "176-210",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Hauptsatz, Schnittelimination, cut, natural deduction"
}


@misc{Gerberding91,
   author    = {Stefan Gerberding},
   title     = {Monomorphe {A}xiomatisierung von {I}ntervallarithmetiken
       mit mehrwertigen {L}ogiken},
   year      = {1991},
   month     = dec,
   howpublished = {Diploma Thesis, University of Karlsruhe,
       Dept.\ of Computer Science},
   keywords  = {interval arithmetic, multiple valued logic, analytic
       free variable tableau}
}


@unpublished{Gerberding92,
   author    = "Stefan Gerberding",
   title     = "{\DT}---{E}in {T}ableaubeweiser f{\"u}r drei\-wertige
       {P}r{\"a}dikatenlogik erster {S}tufe",
   year      = "1992",
   month     = jan,
   note      = "User's manual and system description",
   keywords  = "manual, multiple valued logic, analytic free variable
       tableau"
}


@techreport{Gerberding92b,
   author    = "Stefan Gerberding",
   title     = {Implementierung von {R}elationen {B}eschreibungen},
   institution = THD,
   year      = "1992",
   note      = {IBN-92-4},
   keywords  = "inductive reasoning, relation descriptions"
}


@techreport{Gerberding92c,
   author    = "Stefan Gerberding",
   title     = "{\"U}ber die {F}undiertheit von {D}omain {G}eneralisierungen",
   institution = THD,
   year      = "1992",
   month     = oct,
   note      = {IBN-92-3},
   keywords  = "inductive reasoning, relation descriptions, domain
       generalization, well-founded orderings"
}


@TechReport{Gerberding92d,
  author =   "Stefan Gerberding",
  title =    "{A}ns{\"a}tze zur {K}ombination von
          {I}nduktionsvorschl{\"a}gen",
  institution =  THD,
  year =     "1992",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  month =    jul,
  note =     "IBN-92-1",
  OPTannote =    "",
  keywords =     "intersection, relation description, induction
          theorem proving, regular languages"
}


@techreport{Gerberding93,
   author    = "Stefan Gerberding",
   title     = "{\"U}ber die {Z}usammenh{\"a}nge des impliziten
       {I}nduktionsverfahrens von {F}ribourg und der expliziten
       {I}nduktion",
   institution = THD,
   year      = "1993",
   month     = may,
   keywords  = "inductive completion, proof by consistency, explicit
       induction, critical pair"
}


@TechReport{Gerberding93c,
  author =   "Stefan Gerberding",
  title =    "Verallgemeinerte instantiierte {V}arianten sind
          f{\"u}r die {K}atz!",
  institution =  THD,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  month =    apr,
  note =     "IBN-93-5",
  OPTannote =    "",
  keywords =     "relation description, induction, instantiated
          variants, term induction"
}


@TechReport{Gerberding93b,
  author =   "Stefan Gerberding",
  title =    "A Comparison of Explicit and Implicit Induction",
  institution =  THD,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN 93-12",
  OPTannote =    "",
  keywords =     "implicit induction, explicit induction"
}


@TechReport{Gerberding93d,
  author =   "Stefan Gerberding",
  title =    "Typ $\Lambda$--{Q}uasi--{K}ommutierung --- {D}er
          allgmeine {F}all",
  institution =  THD,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-93-6",
  OPTannote =    "",
  keywords =     "commutation test, combining induction axioms"
}


@TechReport{Gerberding93de,
  author =   "Stefan Gerberding",
  title =    "General $\Lambda$-quasi-commutation",
  institution =  THD,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-93-6",
  OPTannote =    "",
  keywords =     "commutation test, combining induction axioms"
}


@Manual{INKAdatadict,
  title =    "{INKA} Data Dictionary",
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Stefan Gerberding",
  organization = THD,
  OPTaddress =   "",
  OPTedition =   "",
  year =     "1993",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@TechReport{Gerberding94,
  author =   "Stefan Gerberding",
  title =    "{\"U}ber die {Z}usammenh{\"a}nge zwischen den
          impliziten und expliziten {I}nduktionsverfahren",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@TechReport{Gerberding94b,
  author =   "Stefan Gerberding",
  title =    "Comparing Explicit and Implicit Induction",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@TechReport{Gerberding94c,
  author =   "Stefan Gerberding",
  title =    "A Rational Reconstruction of Partial Substitutions",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "November",
  note =     "IBN-94-19",
  OPTannote =    "",
  keywords =     "partial substitution, relation description,
          containment test"
}


@TechReport{Gerberding94d,
  author =   "Stefan Gerberding",
  title =    "Implicit and Explicit Induction",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-94-22",
  OPTannote =    "",
  keywords =     "induction, explicit induction, implicit induction,
          induction relation"
}


@TechReport{Gerberding94e,
  author =   "Stefan Gerberding",
  title =    "Transforming Algorithmic Function Definitions into
          Unconditional Term Rewriting Systems",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-94-21",
  OPTannote =    "",
  keywords =     "rewrite systems, conditional rewrite systems, transformation"
}


@TechReport{GerNol94a,
  author =   "Stefan Gerberding and Axel Noltemeier",
  title =    "Choosing Appropiate Induction Relations Automatically",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  month =    nov,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "containment test, quasi-commutation test, inka"
}


@TechReport{GerNol94b,
  author =   "Stefan Gerberding and Axel Noltemeier",
  title =    "Utilizing Transitivity in Containment Tests",
  institution =  THD,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  month =    nov,
  note =     "IBN-94-20",
  OPTannote =    "",
  keywords =     "containment test, inka"
}


@InProceedings{GerNol95,
  author =   "Stefan Gerberding and Axel Noltemeier",
  title =    "Choosing Induction Relations within the {INKA} System
          (Extended abstract)",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "329-331",
  booktitle =    KI95,
  year =     "1995",
  OPTorganization = "",
  OPTpublisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "An extended version is available as Technical Report
          IBN-95-15",
  OPTannote =    "",
  keywords =     "containment test, quasi-commutation test, inka"
}


% Same as abobe but without mentioning the Blue Note.
@InProceedings{GerNol95nomentionIBN9515,
  author =   "Stefan Gerberding and Axel Noltemeier",
  title =    "Choosing Induction Relations within the {INKA} System
          (Extended abstract)",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "329-331",
  booktitle =    KI95,
  year =     "1995",
  OPTorganization = "",
  OPTpublisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =  "An extended version is available as Technical Report
          IBN-95-15",
  OPTannote =    "",
  keywords =     "containment test, quasi-commutation test, inka"
}

@InProceedings{GerNol97,
  author =       "Stefan Gerberding and Axel Noltemeier",
  title =        "Incremental Proof Planning by Meta-Rules",
  booktitle =    FLAIRS97,
  OPTcrossref =  "",
  OPTkey =       "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =         "1997",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTannote =    "",
  keywords =     "incremental proof planning, tiger, meta-rules"
}

@TechReport{GerPie97,
  author =   "Stefan Gerberding and Brigitte Pientka",
  title =    "Structured Incremental Proof Planning",
  institution =  "THD",
  year =     "1997",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{GerPientka-KI97,
  author =   "Stefan Gerberding and Brigitte Pientka",
  title =    "Structured Incremental Proof Planning",
  booktitle =     KI97,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1997",
  OPTorganization = "",
  publisher    = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTannote =    ""
}

@TechReport{Gerberding95,
  author =   "Stefan Gerberding",
  title =    "A Calculus for Incremental Proof Planning by
          Meta-Rules in Induction Theorem Proving",
  institution =  THD,
  year =     "1995",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-95-31",
  OPTannote =    "",
  keywords =     "tactical theorem proving, meta-reasoning, tiger"
}


@Manual{Gerberding95b,
  title =    "Deep Thought --- A Tableau Prover for Finitely
                  Multiple-Valued First-Order Predicate Logic",
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Stefan Gerberding",
  OPTorganization = THD,
  OPTaddress =   "",
  edition =  "3.3",
  year =     "1995",
  OPTmonth =     "",
  OPTnote =  "ftp://kirmes.inferenzsysteme.informatik.th-darmstadt.de/pub/DT/DT.ps.gz",
  OPTannote =    "",
  keywords =     "DT, Deep Thought, Manual"
}


@TechReport{Gerberding95c,
  author =   "Stefan Gerberding",
  title =    "On the Complexity of Containment and
          Quasi-Commutation Formulae",
  institution =  THD,
  year =     "1995",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "IBN-95-32",
  OPTannote =    "",
  keywords =     "containment test, commutation test, scheduling"
}

@InProceedings{Geuvers:CSL02,
  author    = "Herman Geuvers and Jojgov, G.I",
  title     = "Open Proofs and Open Terms: a Basis for Interactive Logic",
  editor    = {Julian C. Bradfield},
  booktitle = {Proceedings of the 16th International on Computer Science
               Logic (CSL'03) Edinburgh, Scotland, UK, September 22-25},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 2471)},
  year      = {2002},
  pages     = "537-552",
  doi       = {10.1007/3-540-45793-3_36}
}


@TechReport{Giesl93,
  author =  "J{\"u}rgen Giesl",
  title =   "Automatische {T}erminierungsbeweise mit
         {P}oly\-nom--{A}l\-ge\-bren",
  institution = THD,
  year =    "1993",
  OPTtype =     "",
  OPTnumber =   "",
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "termination, ordering, polynomial orderings"
}


@TechReport{Giesl93b,
  author =   "J{\"u}rgen Giesl",
  title =    "Proving Termination of Algorithms with Polynomial
          Interpretations",
  institution =  THD,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  OPTnumber =    "",
  OPTaddress =   "",
  month =    nov,
  note =     "IBN 93-14",
  OPTannote =    "",
  keywords =     "termination, ordering"
}


@Misc{Giesl95,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "J{\"u}rgen Giesl",
  title =    "{A}utomatisierung von {T}erminierungsbeweisen f{\"u}r
          rekursiv definierte {A}lgorithmen",
  howpublished = "Dissertation",
  year =     "1995",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination, ordering, polynomial orderings"
}

@article{ArtsGiesl00TCS,
   author    = "Thomas Arts and J{\"u}rgen Giesl",
   title     = "Termination of Term Rewriting Using Dependency Pairs",
   journal   = "Theoretical Computer Science",
   year      =  "2000",
   volume    = 236,
   pages     = "133-178",
   keywords  = "termination,rewrite systems, first-order"
}

@inproceedings{Giesl:ICAR04,
    author = "R. Thiemann and J. Giesl and P. Schneider-Kamp",
    title = "Improved Modular Termination Proofs Using Dependency Pairs",
    booktitle = "Proceedings of the 2nd International Joint Conference on Automated Reasoning (IJCAR 2004)",
    series = "Lecture Notes in Computer Science (LNCS)",
    publisher = "Springer",
    pages = "to appear",
    year = "2004"
}

@Article{Giesl02,
  author =   "J. Giesl and T. Arts and E. Ohlenbusch",
  title =    "Modular Termination Proofs for Rewriting Using Dependency Pairs",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JSC,
  year =     "2002",
  volume =   "34",
  number =   "1",
  pages =    "21-58",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination, ordering"
}


@inproceedings{Gimenez:ICALP98,
    author = "Eduardo Gimenez",
    title = "Structural Recursive Definitions in Type Theory",
    booktitle = "International Colloquium on Automata, Languages and Programming (ICALP'98)",
    series = "Lecture Notes in Computer Science (LNCS) 1443",
    publisher = "Springer",
    pages = "397-408",
    year = "1998",
    url = "citeseer.nj.nec.com/gimenez98structural.html" }




@inproceedings{Gimenez:ICALP98,
    author = "Eduardo Gimenez",
    title = "Structural Recursive Definitions in Type Theory",
    booktitle = "International Colloquium on Automata, Languages and Programming (ICALP'98)",
    series = "Lecture Notes in Computer Science (LNCS) 1443",
    publisher = "Springer",
    pages = "397-408",
    year = "1998",
    url = "citeseer.nj.nec.com/gimenez98structural.html" }


@InProceedings{Gerberding96,
  author =   "Stefan Gerberding",
  title =    "DT --- An Automated Theorem Prover for
                  Multiple-Valued First Order Predicate Logics",
  booktitle =    ISMVL96,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1996",
  OPTorganization = "",
  publisher =    "IEEE Computer Society Press",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "284-289",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "DT, Deep Thought, analytic tableau, free variable
                  tableau, multiple-valued logic"
}


@PhdThesis{GerberdingDiss,
  author =   "Stefan Gerberding",
  title =    "Implizite und explizite Induktionsbeweisverfahren",
  school =   THD,
  year =     "1996",
  OPTkey =   "",
  OPTaddress =   "",
  OPTtype =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "implicit induction, explicit induction"
}


@InProceedings{GiovannettiMoiso87,
  author =   "E.~Giovannetti and C.~Moiso",
  title =    "Notes on the elimination of conditions",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 308",
  OPTpages =     "",
  booktitle =    CTRS87,
  year =     "1987",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    jul,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting, removing conditions,
          transformation"
}

@Article{Giunchiglia92,
  author =   "Fausto Giunchiglia and Toby Walsh",
  title =    "A Theory of Abstraction",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Artificial Intelligence",
  year =     "1992",
  volume =   "56",
  OPTnumber =    "",
  pages =    "323-390",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "abstraction, generalization, analogy, theorem proving"
}

@ARTICLE{Giunchiglia93,
    author = {Fausto Giunchiglia},
    title = {Contextual Reasoning},
    journal = {Epistemologia},
    year = {1993},
    volume = {16},
    pages = {145-164}
}

@article{GiunchigliaSerafini:AI94,
  author    = {Fausto Giunchiglia and
               Luciano Serafini},
  title     = {Multilanguage Hierarchical Logics or: How we can do Without
               Modal Logics},
  journal   = {Artificial Intelligence},
  volume    = {65},
  number    = {1},
  year      = {1994},
  pages     = {29-70},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi       = {10.1016/0004-3702(94)90037-X}
}

@inproceedings{Giunchiglia:META92,
  author    = {Fausto Giunchiglia and
               Luciano Serafini and
               Alex K. Simpson},
  editor    = {Alberto Pettorossi},
  title     = {Hierarchical Meta-Logics: Intuitions, Proof Theory and Semantics},
  booktitle = {3rd International Workshop on Meta-Programming in Logic (META-92)},
  year      = {1992},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science LNCS(649)},
  pages     = {235-249}
}


@book{girardLafontTaylor:proofsAndTypes,
author= {Girard, J.-Y. and Lafont, Y. and Tayor, P.},
title = {Proofs and types},
publisher = "Cambridge University Press",
year = {1990}
}


@inproceedings{Gluck:PLILP95,
  author    = {Robert Gl{\"u}ck and
               Jesper J{\o}rgensen},
  title     = {Efficient Multi-level Generating Extensions for Program
               Specialization},
  editor    = {Manuel V. Hermenegildo and
               S. Doaitse Swierstra},
  booktitle   = {7th International Symposium on Programming Languages:
                  Implementations, Logics and Programs (PLILP'95)},
  year      = {1995},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science LNCS(982)},
  pages     = {259-278},
  doi       = {10.1007/BFb0026825}
}


@inproceedings{Gluck:Ershov96,
  author    = {Robert Gl{\"u}ck and
               Jesper J{\o}rgensen},
  title     = {Fast Binding-Time Analysis for Multi-Level Specialization},
  editor    = {Dines Bj{\o}rner and
               Manfred Broy and
               Igor V. Pottosin},
  booktitle = {2nd  International Andrei Ershov Memorial Conference},
  year      = {1996},
  pages     = {261-272},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science LNCS(1181)},
  volume    = {1181},
  doi       = {10.1007/3-540-62064-8_22}
}


@inproceedings{DBLP:conf/pepm/GluckJ98,
  author    = {Robert Gl{\"u}ck and
               Jesper J{\o}rgensen},
  title     = {Multi-Level Specialization (Extended Abstract)},
  editor    = {John Hatcliff and
               Torben {\AE}. Mogensen and
               Peter Thiemann},
  booktitle = {International Summer School on Partial Evaluation - Practice and Theory},
  year      = {1998},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science LNCS(1706)},
  pages     = {326-337}
}

@article{Gluck:LSC97,
  author    = {Robert Gl{\"u}ck and
               Jesper J{\o}rgensen},
  title     = {An Automatic Program Generator for Multi-Level Specialization},
  journal   = {Lisp and Symbolic Computation},
  volume    = {10},
  number    = {2},
  year      = {1997},
  pages     = {113-158}
}

@inproceedings{Goebel87,
   author    = "Richard G{\"o}bel",
   title     = "Ground Confluence",
   booktitle = RTA87,
   year      = "1987",
   month     = may,
   publisher = SPR,
   pages     = "156-167",
   note      = {Lecture Notes in Computer Science (LNCS) 256},
   keywords  = "term rewriting, ground confluence, ground confluence
       test, convertible functions, covering sets"
}


@article{Goedel32,
   author    = "Kurt G{\"o}del",
   title     = "Zum intuitionistischen {A}ussagenkalk{\"u}l",
   journal   = "Anzeiger {A}kademie der {W}issenschaften {W}ien, math.
       naturwissensch.\ {K}lasse",
   year      = "1932",
   volume    = "69",
   pages     = "65-66",
   keywords  = "multiple valued logic"
}


@inproceedings{Goguen80,
   author    = "J.~A.~Goguen",
   title     = "How to prove algebraic inductive hypotheses with\-out
       induction",
   booktitle = CADE80,
   year      = "1980",
   pages     = "356-373",
   keywords  = "inductionless induction"
}


@INPROCEEDINGS{Goguen:06,
    author = {Healfdene Goguen and Conor Mcbride and James Mckinna},
    title = {Eliminating dependent pattern matching},
    booktitle = {Joseph Goguen Festschrift} ,
    series = {Lecture Notes in Computer Science (LNCS)},
    volume = {4060},
    year = {2006},
    pages = {521--540},
    publisher = {Springer}
}


@InProceedings{	  goguen:justifyingAlgorithms,
  author	= {Healfdene Goguen},
  title		= {Justifying Algorithms for $\beta\eta$ Conversion},
  booktitle	= {8th Int. Conf. on Foundations of Software
		  Science and Computational Structures, (FoSSaCS'05)},
  pages		= {410-424},
  year		= 2005,
  ee		= {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3441{\&}spage=410}
		  ,
  optvolume	= 3441,
  series	= "LNCS 3441",
  isbn		= {3-540-25388-2},
  publisher	= springer
}



@Article{Goldfarb81,
  author =   "W.~D. Goldfarb",
  title =    "The undecidability of the second-order unification problem",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  TCS,
  year =     "1981",
  volume =   "13",
  OPTnumber =    "4",
  pages =    "225-230",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "higher-order"
}

@Book{Golumbic80,
  author =   "Martin Charles Golumbic",
  title =    "Algorithmic Graph Theory and Perfect Graphs",
  publisher =    AP,
  year =     "1980",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Computer Science and Applied Mathematics",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@Misc{GordonMilnerWadsworth79,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Michael Gordon and Robin Milner and Christopher Wadsworth",
  title =    "Edinburgh {LCF} - A mechanized logic of computation",
  howpublished = "Lecture Notes in Computer Science (LNCS) vol.\ 78, Springer",
  year =     "1979",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tactical theorem proving"
}

@book{Gottwald89,
   author    = "Siegfried Gottwald",
   title     = "Mehrwertige Logik",
   year      = "1989",
   publisher = AVB,
   keywords  = "multiple valued logic, independence proofs"
}

@InProceedings{GowBundy99lpr,
  author =   "Jeremy Gow and Alan Bundy and Ian Green",
  title =    "Extensions to the Estimation Calculus",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "H.~Ganzinger, D.~McAllester, A.~Voronkov",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 1705",
  pages =    "258-272",
  booktitle =    "Proceedings of the 6th International Conference on
          Logic for Programming and Automated Reasoning (LPAR`99)",
  year =     "1999",
  OPTorganization = "",
  publisher =    SPR,
  address =      "Tblisi, Georgia",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "induction, termination, ordering"
}



@InProceedings{Graf94,
  author =   "Peter Graf",
  title =    "Extended Path-Indexing",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 814",
  pages =    "514-528",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "index, path index, unification"
}




@Book{Graf+Book95,
  author =   "Peter Graf",
  title =    "Term Indexing",
  publisher =    "Springer-Verlag",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "1053",
  series =   "LNAI",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "Path indexing, substitution trees, discrimination trees, overview"
}

@InProceedings{Graf+rta95,
  author =   "Peter Graf",
  title =    "Substitution Tree Indexing",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 914",
  pages =    "117-131",
  booktitle =    RTA95,
  year =     "1995",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "index, substitution trees"
}


@TechReport{Gramlich89,
  author =   "Bernhard Gramlich",
  title =    "Inductive Theorem Proving Using Refined Unfailing
          Completion Techniques",
  institution =  UKL,
  year =     "1989",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-89-14",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "inductionless induction"
}


@InProceedings{Gramlich92,
  author =   "Bernhard Gramlich",
  title =    "Sufficient Conditions for Modular Termination of
          Conditional Term Rewriting Systems",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "128-142",
  booktitle =    CTRS92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting, termination, modular properties"
}


@InProceedings{Gramlich94,
  author =   "Bernhard Gramlich",
  title =    "On Modularity of Termination and Confluence
          Properties of Conditional Rewrite Systems",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "186-203",
  booktitle =    "Proceedings of the fourth International Conference
          on Algebraic and Logic Programming, Marid, Spain",
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keyword =      "Conditional Rewrite Systems"
}


@TechReport{GramlichLindner91,
  author =   "Bernhard Gramlich and Wolfgang Lindner",
  title =    "A Guide to {UNICOM}, An Inductive Theorem Prover
          Based on Rewriting and Completion Techniques",
  institution =  UKL,
  year =     "1991",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-91-17",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "inductionless induction, completion, proof by
          consistency, unicom"
}


@inproceedings{Griffin:POPL90,
 author = {Timothy G. Griffin},
 title = {A formulae-as-type notion of control},
 booktitle = {17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'90)},
 year = 1990,
 pages = {47--58},
 location = {San Francisco, California, United States},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inbook{Guessarian92,
   author    = "Ir{\'e}ne Guessarian",
   title     = "Some Fixpoint Techniques in Algebraic Structures and
       Applications to Computer Science",
   chapter   = "seven",
   year      = "1992",
   publisher = AP,
   volume    = "1 Algebraic Techniques",
   pages     = "263-292",
   series    = "Resolution of Equations in Algebraic Structures",
   keywords  = "fixpoints"
}


%%% H


@inproceedings{Hamid02+lics,
    author = "Nadeem A. Hamid and Zhong Shao and Valery Trifonov and Stefan Monnier and Zhaozhong Ni",
    title = "A syntactic approach to foundational proof-carrying code",
    booktitle = "17th Annual {IEEE} Symposium on Logic in Computer Science",
    address = "Kopenhagen, Denmark",
    pages = "to appear",
    year = "2002"
 }


@techreport{Haehnle90,
   author    = "Reiner H{\"a}hnle",
   title     = "{S}pezifikation eines {T}heorembeweisers f{\"u}r dreiwertige
       {F}irst-{O}rder {L}ogik",
   institution = "Wissenschaftliches {Z}entrum, {I}nstitut f{\"u}r
       {W}issensbasierte {S}ysteme, {IBM}",
   year      = "1990",
   number    = "136",
   type      = "{IWBS} {R}eport",
   keywords  = "multiple valued logic, analytic free variable tableau"
}


@inproceedings{Haehnle90b,
   author    = "Reiner H{\"a}hnle",
   title     = "Towards an efficient tableau proof procedure for
       multiple-valued logics",
   booktitle = "Proceedings Computer Science logic workshop, {H}eidelberg",
   year      = "1990",
   publisher = SPR,
   keywords  = "multiple valued logic, regular logic, analytic free
       variable tableau"
}


@inproceedings{Haehnle91,
   author    = "Reiner H{\"a}hnle",
   title     = "Uniform notation of tableau rules for multiple-valued logics",
   booktitle = "International Symposium on Multiple Valued Logic, Victoria",
   year      = "1991",
   publisher = "{IEEE} Press",
   keywords  = "multiple valued logic, regular logic, analytic free
       variable tableau"
}


@book{Haehnle93,
   author    = "Reiner H{\"a}hnle",
   title     = "Automated Deduction in Multiple-valued Logics",
   year      = "1993",
   publisher = "Oxford Science Publications",
   keywords  = "multiple-valued logic, automated deduction, regular
         logic, analytic free variable tableau"
}


@InProceedings{HaehnleKernig93,
  author =   "Reiner H{\"a}hnle and Werner Kernig",
  title =    "Verification of Switch Level Designs with
          Many-Valued Logic",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTpages =     "",
  booktitle =    LPAR93,
  year =     "1993",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple-valued logics, tap, hardware verification"
}


@Article{Haehnle94,
  author =   "Reiner H{\"a}hnle",
  title =    "Short conjunctive normal forms in finitely-valued logics",
  journal =      JLC,
  year =     "1994",
  OPTkey =   "",
  volume =   "4",
  number =   "6",
  OPTmonth =     "",
  pages =    "905-927",
  OPTnote =      "",
  OPTannote =    ""
}



@Article{HaehnleSchmitt94,
  author =   "Reiner H{\"a}hnle and Peter H.~Schmitt",
  title =    "The Liberalized $\delta$--Rule in Free Variable Semantic
                  Tableaux",
  journal =      JAR,
  year =     "1994",
  OPTkey =   "",
  volume =   "13",
  number =   "2",
  OPTmonth =     "",
  pages =    "211-221",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "multiple valued logic, analytic free variable tableau"
}


@InProceedings{Haehnle94b,
  author =   "Reiner H{\"a}hnle",
  title =    "Efficient Deduction in Many-Valued Logics",
  booktitle =    ISMVL94,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple valued logic, analytic free variable
                  tableau, generalized signs, normal forms"
}


@InProceedings{Haehnle96,
  author =   "Reiner H{\"a}hnle",
  title =    "Commodious Axiomatization of Quantifiers in
          Multiple-Valued Logic",
  booktitle =    ISMVL96,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1996",
  OPTorganization = "",
  publisher =    "IEEE Computer Society Press",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "118-123",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple valued logic, distribution quantifiers"
}

@inproceedings{HagiyaToda94,
  author    = {Masami Hagiya and Yozo Toda},
  title     = {On Implicit Arguments},
  editor    = {Neil D. Jones and
               Masami Hagiya and
               Masahiko Sato},
  booktitle = {{Logic, Language and Computation: Festschrift in Honor of
               Satoru Takasu}},
  year      = {1994},
  pages     = {10--30},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {792}
}



@InProceedings{	  hagino:categoricalDatatypes,
  author	= {Tatsuya Hagino},
  title		= {A Typed Lambda Calculus with Categorical Type
		  Constructors},
  booktitle	= {Category Theory and Computer Science},
  pages		= {140--157},
  year		= {1987},
  editor	= {D. H. Pitt and A. Poign{\'e} and D. E. Rydeheard},
  volume	= {283},
  series	= lncs,
  publisher	= "Springer"
}

@Article{	  hagino:jsl89,
  author	= {Tatsuya Hagino},
  title		= {Codatatypes in {ML}},
  journal	= JSL,
  volume	= {8},
  number	= {6},
  year		= {1989},
  pages		= {629-650},
  ee		= {http://dx.doi.org/10.1016/S0747-7171(89)80065-3},
  bibsource	= {DBLP, http://dblp.uni-trier.de}
}

@article{Hanus99:JFP,
    author = "Michael Hanus and Christian Prehofer",
    title = "Higher-Order Narrowing with Definitional Trees",
    journal = "Journal of Functional Programming",
    volume = "9",
    number = "1",
    pages = "33-75",
    year = "1999",
    url = "citeseer.nj.nec.com/article/hanus96higherorder.html"}


@InProceedings{GuoRamakrishnan01,
  author =   {Hai-Feng Guo and C.R. Ramakrishnan and  I.V. Ramakrishnan},
  title =    {Speculative beats Conservative Justification},
  booktitle =    {International Conference on Logic Programming (ICLP'01)},
  year =     {Nov 2001}
}

@Book{Haraway95,
  author =   "Donna,~Haraway",
  title =    "Die {N}euerfindung der {N}atur - {P}rimaten,
                  {C}yborgs und {F}rauen",
  publisher =    "Campus-Verlag",
  year =     "1995",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  keywords =     "konstruktivistischer Feminismus, Internet ",
  OPTannote =    ""
}



@Book{Harding90,
  author =   "Sandra Harding",
  title =    "{F}eministische {W}issenschaftstheorie: {Z}um
                  {V}erh{\"a}ltnis von {W}issenschaft und sozialem {G}eschlecht",
  year =     "1990",
  publisher =    "{A}rgument-{V}erlag",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@Book{Harding94,
  author =   "Sandra Harding",
  title =    "{D}as {G}eschlecht des {W}issens: {F}rauen denken die
                  {W}issenschaft neu",
  year =     "1994",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{Harland97,
  author =       "James Harland and David Pym",
  title =        "Resource-Distribution via Boolean Constraints",
  editor =       "W. McCune",
  pages =        "222--236",
  booktitle =    "Proceedings of the 14th International Conference on
                  Automated Deduction (CADE-14)",
  year =         1997,
  publisher =    "Springer-Verlag LNAI 1249",
  address =      "Townsville, Australia",
  month =        jul,
  keywords =     "linear"
}

@article{Harper:TOPLAS93,
 author = {Harper, Robert and Mitchell, John C.},
 title = {On the type structure of standard ML},
 journal = {ACM Transactions on Programming Languages and Systems},
 volume = {15},
 number = {2},
 year = {1993},
 issn = {0164-0925},
 pages = {211--252},
 doi = {http://doi.acm.org/10.1145/169701.169696},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@article{Harper93jacm,
   author  = {Robert Harper and Furio Honsell and Gordon Plotkin},
   title   = {A Framework for Defining Logics},
   journal = {{Journal of the ACM}},
   volume  = {40},
   number  = {1},
   month   = {January},
   year    = {1993},
   pages   = {143--184}
}

@inproceedings{Harper:POPL93,
 author = {Harper, Robert and Lillibridge, Mark},
 title = {Explicit polymorphism and CPS conversion},
 booktitle = {Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
 series = {POPL '93},
 year = {1993},
 location = {Charleston, South Carolina, USA},
 pages = {206--219},
 doi = {158511.158630},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@Article{Harper03tocl,
  author =       {Robert Harper and Frank Pfenning},
  title =        {On Equivalence and Canonical Forms in the {LF} Type Theory},
  journal =      {ACM Transactions on Computational Logic},
  volume    = {6},
  number    = {1},
  year      = {2005},
  pages     = {61-101},
}

@TechReport{HarperPfenning00,
  author =   "Robert Harper and Frank Pfenning",
  title =    "On Equivalence and canonical forms in {LF} type theory",
  institution =  "School of Computer Science, Carnegie Mellon University",
  year =     "2000",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "CMU-CS-00-148",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "type-checking, definitional equality, logical framework, dependent types"
}


@inproceedings{LeeCrary:POPL07,
 author = {Daniel K. Lee and Karl Crary and Robert Harper},
 editor    = {Martin Hofmann and Matthias Felleisen},
 title = {Towards a {M}echanized {M}etatheory of {S}tandard {ML}},
 booktitle = {34th {A}nnual ACM SIGPLAN-SIGACT {S}ymposium on {P}rinciples of {P}rogramming {L}anguages (POPL '07)},
 year = {2007},
 isbn = {1-59593-575-4},
 pages = {173--184},
 location = {Nice, France},
 doi = {http://doi.acm.org/10.1145/1190216.1190245},
 publisher = {ACM Press},
 address = {New York, NY, USA}
 }


@inproceedings{lee+07:mechanizing,
 author = {Daniel K. Lee and Karl Crary and Robert Harper},
 title = {Towards a mechanized metatheory of Standard ML},
 booktitle = {34th annual ACM SIGPLAN-SIGACT Symposium on Principles of
                  Programming Languages (POPL'07)},
 year = {2007},
 isbn = {1-59593-575-4},
 pages = {173--184},
 location = {Nice, France},
 publisher = {ACM Press}
 }


@TechReport{LeeHarper06,
  author =   "Daniel K. Lee and Karl Crary and Robert Harper",
  title =    "Mechanizing the Metatheory of Standard ML",
  institution =  "School of Computer Science, Carnegie Mellon University",
  year =     "2006",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "CMU-CS-00-??",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "type-checking, definitional equality, logical framework, dependent types"
}

@book{Harrison78,
   author    = "Michael A.~Harrison",
   title     = "Introduction to Formal Language Theory",
   year      = "1978",
   publisher = AW,
   keywords  = "formal languages textbook"
}

@inproceedings{Harrison09a,
  author    = {John Harrison},
  title     = {HOL Light: An Overview},
  booktitle = {TPHOLs},
  year      = {2009},
  pages     = {60-66},
  ee        = {http://dx.doi.org/10.1007/978-3-642-03359-9_4},
  crossref  = {DBLP:conf/tphol/2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/tphol/2009,
  editor    = {Stefan Berghofer and
               Tobias Nipkow and
               Christian Urban and
               Makarius Wenzel},
  title     = {Theorem Proving in Higher Order Logics, 22nd International
               Conference, TPHOLs 2009, Munich, Germany, August 17-20,
               2009. Proceedings},
  booktitle = {TPHOLs},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5674},
  year      = {2009},
  isbn      = {978-3-642-03358-2},
  ee        = {http://dx.doi.org/10.1007/978-3-642-03359-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Hashimoto:TCS01,
 author = {Masatomo Hashimoto and Atsushi Ohori},
 title = {A typed context calculus},
 journal = {Theoretical Computer Science},
 volume = {266},
 number = {1-2},
 year = {2001},
 pages = {249--272},
 publisher = {Elsevier Science Publishers Ltd.},
}
  @Comment issn = {0304-3975},
  @Comment doi = {http://dx.doi.org/10.1016/S0304-3975(00)00174-2},


@PhDThesis{Hasker95,
  author =      "Robert W.~Hasker",
  title =       "The Replay of Program Derivations",
  school =      "University of Illinois at Urbana-Champaign",
  year =        "1995",
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "analogy, higher-order generalization"
}



@Book{Heintz93,
  author =   "Bettina Heintz",
  title =    "Die {H}errschaft der {R}egel: zur {G}rundlagengeschichte
                  des {C}omputers",
  publisher =    "Campus Verlag",
  year =     "1993",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{HeiselReifStephan90,
  author =   "M.~Heisel and W.~Reif and W.~Stephan",
  title =    "Tactical Theorem Proving in Program Verification",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI vol.\ 449",
  pages =    "117-131",
  booktitle =    CADE90,
  year =     "1990",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tactical theorem proving, KIV"
}



@inproceedings{HermannPrivara86,
   author    = "Mikul{\'a}\v{s} Hermann and Igor Pr{\'\i}vara",
   title     = "On Nontermination of Knuth--Bendix Algorithm",
   booktitle = "Automata, Languages and Programming, 13th
       International Colloquium, Rennes, France",
   year      = "1986",
   month     = jul,
   pages     = "146-156",
   keywords  = "Knuth-Bendix algorithm, termination, nontermination
          criterion for KBA"
}


@book{Hermes69,
   author    = "Hans Hermes",
   title     = "Einf{\"u}hrung in die mathematische {L}ogik",
   year      = "1969",
   publisher = TEU,
   edition   = "2.",
   keywords  = "logic textbook"
}


@Misc{Herring93,
  author =   "Susan Herring",
  title =    "Gender and Democracy in Computer-mediated Communication",
  howpublished = "available in the Internet and EJC/REC Vol.3 No. 2 ",
  year =     "1993",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}




@Misc{Herring94,
  author =   "Susan Herring",
  title =    "Gender Differences in Computer-mediated
                  Communication: Bringing Familiar Baggge to the new Frontier",
  OPThowpublished = "available in the Internet, Talk during the
                  American Library Associaton annuak convention,
                  Maiami, June 27, 1994",
  OPTyear =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@PhdThesis{Hesketh91,
  author =   "Jane T.~Hesketh",
  title =    "Using Middle-Out Reasoning to Guide Inductive
                  Theorem Proving",
  school =   DAI,
  year =     "1991",
  OPTkey =   "",
  OPTaddress =   "",
  OPTtype =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "middle-out reasoning, lemma generation"
}



@Article{Hesse95,
  author =   "Wolfgang,~Hesse",
  title =    "Informieren wir uns zu {T}ode?",
  journal =      "FIFF-Kommunikation",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  month =    "2",
  pages =    "41 - 47",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Was ist Information, Internet "
}

@inproceedings{Heuerding:TABLEAUX96,
 author = "Alain Heuerding and Michael Seyfried and Heinrich Zimmermann",
 title = "Efficient Loop-Check for Backward Proof Search in Some
          Non-classical Propositional Logics",
 booktitle = "Analytic Tableaux and Related Methods",
 pages = "210-225",
 year = "1996",

 url = "citeseer.ist.psu.edu/heuerding96efficient.html" }

@techreport{Heuerding96benchmark,
  author = "A. Heuerding and S. Schwendimann",
  title = "A benchmark method for the propositional modal logics K, KT, and S4",
  number = "IAM-96-015",
  institution = "University of Bern, Switzerland",
  year = "1996",
  url = "citeseer.ist.psu.edu/heuerding96benchmark.html" }


@article{Hintikka55,
   author    = "K.J.J.~Hintikka",
   title     = "Form and content in quantification theory",
   journal   = "Acta Philosophica Fennica",
   year      = "1955",
   volume    = "8",
   pages     = "7-55",
   keywords  = "semantic tableau"
}

@InProceedings{NHRV01,
  author =       {R.~Nieuwenhuis and Th.~Hillenbrand and A.~Riazanov
                  and A.~Voronkov},
  title =        {On the Evaluation of Indexing Techniques for
                  Theorem Proving},
  booktitle =    {Proceedings of the First International Joint
                  Conference on Automated Reasoning},
  pages =        {257--271},
  year =         2001,
  editor =       {R.~Gor{\'e} and A.~Leitsch and T.~Nipkow},
  volume =       2083,
  series =       {LNAI},
  publisher =    {Springer-Verlag}
}

@InProceedings{Hil03,
  author =       {Th.~Hillenbrand},
  title =        {\textsc{Citius altius fortius:} Lessons Learned from
                  the Theorem Prover \textsc{Waldmeister} (Invited
                  Paper)},
  booktitle =    {Proceedings of the 4th International Workshop on
                  First-Order Theorem Proving},
  year =         2003,
  editor =       {I.~Dahn and L.~Vigneron},
  volume =       {86.1},
  series =       {Electronic Notes in Theoretical Computer Science},
  publisher =    {Elsevier Science}
}


@InProceedings{Hirokawa:CADE03,
  author =   "Nao Hirokawa, Aart Middeldorp",
  title =    "Automating the Dependency Pair Method",
  editor =       "F.~Baader",
  booktitle =    "19th International Conference on Automated Deduction, Miami, USA",
  series =   "Lecture Notes in Artificial  Intelligence (LNAI) 2741",
  year =     "July 2003",
  publisher    = SPR,
  pages = "32-46"
}


@inproceedings{Hodas91+lics,
    author = "J. Hodas and D. Miller",
    title = "Logic Programming in a Fragment of Intuitionistic Linear Logic",
    booktitle = "Proc. 6th Conf. on Logic in Computer Science",
    publisher = "IEEE Computer Society Press",
    address = "Amsterdam",
    pages = "32--42",
    year = "1991",
    url = "citeseer.nj.nec.com/article/hodas94logic.html" }

@Article{Hodas94ic,
  author =      "Joshua Hodas and Dale Miller",
  title =       "Logic Programming in a Fragment of Intuitionistic Linear
                  Logic",
  journal =     "Information and Computation",
  year =        "1994",
  volume=       "110",
  number=       "2",
  pages=        "327--365",
  note =        "A preliminary version appeared in the Proceedings of the
                  Sixth Annual IEEE Symposium on Logic in Computer Science,
                  pages 32--42, Amsterdam, The Netherlands, July 1991",
  urlps =       "file://ftp.cis.upenn.edu/pub/papers/miller/ic94.ps.Z",
  keywords =    "linear"
}

@inproceedings{Hofmann:LICS99,
  author    = {Martin Hofmann},
  title     = {Semantical Analysis of Higher-Order Abstract Syntax},
  booktitle     = {14th Annual IEEE Symposium on Logic in Computer Science (LICS'99)},
  year      = {1999},
  pages     = {204-213},
  publisher = {IEEE Computer Society}
}


@inproceedings{Hofmann+02:POPL,
    author = "Martin Hofmann",
    title = "The strength of non-size increasing computation",
    booktitle = "29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'02)",
    year = 2002,
    address =      {Portland, Oregon},
    month =        jan,
    publisher = ACM
}

@InProceedings{Hofmann00,
  author =       {Martin Hofmann},
  title =        {Programming languages coaturing complexity classes},
  booktitle =    {Logic Column 9},
  year =         2000
}


@InProceedings{HofbauerHuber92,
  author =   "Dieter Hofbauer and Maria Huber",
  title =    "Computing Linearizations Using Test Sets",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "287-301",
  booktitle =    CTRS92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "test sets, left linear rewrite systems,
          transformation to left linear rewrite systems"
}


@TechReport{HofbauerHuber94,
  author =   "Dieter Hofbauer and Maria Huber",
  title =    "Linearizing Term Rewriting Systems Using Test Sets",
  institution =  "Centre de Recherche en Informatique de Nancy",
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "CRIN 94-R-070",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "test sets, left linear term rewriting systems"
}


@book{Hopcroft79,
   author    = "John E.\ Hopcroft and Jeffrey D.\ Ullman",
   title     = "Einf{\"u}hrung in die Automatentheorie, Formale Sprachen und
       Komplexit{\"a}tstheorie",
   year      = "1979",
   publisher = AW,
   keywords  = "formal language theory, complexity theory,
       computaility, recursive functions"
}



@Manual{Horn95,
  title =    "The Oyster Proof Development System",
  OPTkey =   "",
  author =   "Christian Horn",
  organization = DAI,
  OPTaddress =   "",
  OPTedition =   "",
  year =     "1995",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "oyster"
}



@InCollection{Howard80,
  author =   "W.~A.~Howard",
  title =        "The formulae-as-types notion of construction",
  OPTkey =   "",
  booktitle =    "{To H.~B.~Curry; Essays on Combinatory Logic, Lambda Calculus and Formalism}",
  publisher =    AP,
  year =     "1980",
  editor =   "J.~P.~Seldin and J.~R.~Hindley",
  pages =    "479 -- 490"
}

@Misc{Howe,
  author =   "Douglas J. Howe",
  title =    "Metavariables and Tactic Proofs",
  howpublished = "personal communication",
  OPTyear =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@inproceedings{Howe:Tableaux97,
   author    = "Jacob M.~Howe",
   title     = "Two Loop Detection Mechanisms: a Comparison",
   booktitle = "Proceedings of the 6$^t{}^h$ Workshop on Theorem Proving with
             Analytic Tableaux and Related Methods ",
   year      = 1997,
   publisher = SPR,
   pages     = "188-200",
   note      = "{LNCAI} 1227",
   keywords  = "propositional intuitionistic logic, theorem proving"
}

@misc{Howe:phd98,
  author = "J. Howe",
  title = "Proof Search Issues in Some Non-Classical Logics",
  text = "Jacob M. Howe. Proof Search Issues in Some Non-Classical Logics. PhD thesis,
    University of St. Andrews, Scotland, 1998.",
  year = "1998",
  url = "citeseer.ist.psu.edu/howe98proof.html" }


@inproceedings{Hsiang85,
   author    = "Jieh Hsiang",
   title     = "Two Results in Term Rewriting Theorem Proving",
   booktitle = RTA85,
   year      = "1985",
   month     = may,
   publisher = SPR,
   pages     = "301-324",
   note      = "{Lecture Notes in Computer Science (LNCS)} 202",
   keywords  = "term rewriting, theorem proving"
}


@InProceedings{HuangKerberKohlhaseRichts94,
  author =   "Xiaorong Huang and Manfred Kerber and Michael
          Kohlhase and J{\"o}rn Richts",
  title =    "Adapting Methods to Novel Tasks in Proof Planning",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 861",
  pages =    "379-390",
  booktitle =    KI94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    sep,
  OPTnote =      "",
  OPTannote =    ""
}


@TechReport{HuangKerberRichtsSehn94,
  author =   "Xiaorong Huang and Manfred Kerber and J{\"o}rn
          Richts and Arthur Sehn",
  title =    "Planning Mathematical Proofs with Methods",
  institution =  UKL,
  year =     "1994",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  number =   "{SR}-94-08",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     ""
}


@article{Hudak:ACMCS96,
 author = {Paul Hudak},
 title = {Building domain-specific embedded languages},
 journal = {ACM Computing Survey},
 volume = {28},
 number = {4es},
 year = {1996},
 issn = {0360-0300},
 pages = {196},
 doi = {http://doi.acm.org/10.1145/242224.242477},
 publisher = ACM,
 address = {New York, NY, USA},
}

@inproceedings{Hudak:POPL84,
 author = {Hudak, Paul and Kranz, David},
 title = {A Combinator-based Compiler for a Functional Language},
 booktitle = {Proceedings of the 11th ACM SIGACT-SIGPLAN Symposium on Principles
                  of Programming Languages (POPL'84)},
 year = {1984},
 isbn = {0-89791-125-3},
 pages = {122--132},
 numpages = {11},
 acmid = {800523},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{Hudelmaier:CSL95,
 author = {J{"\o}rg Hudelmaier},
 title = {Improved Decision Procedures for the Modal Logics K, T, and S4},
 booktitle = {CSL '95: Selected Papers from the 9th International Workshop on Computer Science Logic},
 year = {1996},
 isbn = {3-540-61377-3},
 pages = {320--334},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@Article{Huelsmann95,
  author =   "Franz~W.~H{\"u}lsmann",
  title =    "Der Datahighway gef{\"a}hrdet ihre {P}rivatheit -
                  {D}atenflu{\ss} und {D}atenschutz",
  journal =      "FIFF-Kommunikation",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  month =    "2",
  pages =    "23 - 26",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Internet, Datenspuren, Datenschutz"
}

@Article{Huet75,
  author =      "G\'{e}rard Huet",
  title =       "A Unification Algorithm for Typed $\lambda$-Calculus",
  journal =     "Theoretical Computer Science",
  volume =      "1",
  year =        "1975",
  pages =       "27--57",
  keywords =    "unification"
}

@article{Huet80,
   author    = "G{\'e}rard Huet",
   title     = "Confluent Reductions: Abstract Properties and
       Applications to Term Rewriting Systems",
   journal   = JACM,
   year      = "1980",
   volume    = "27",
   number    = "4",
   pages     = "797-821",
   keywords  = "inductionless induction, Church-Rosser property,
       confluence, equational theories"
}


@article{Huet81,
   author    = "G{\'e}rard Huet",
   title     = "A Complete Proof of Correctness of the {K}nuth--{B}endix
       Completion Algorithm",
   journal   = JCSS,
   year      = "1981",
   volume    = "23",
   number    = "1",
   pages     = "11-21",
   keywords  = "Knuth-Bendix algorithm, completion algorithm,
          nontermination criterion for KBA"
}


@article{HuetHullot82,
   author    = "G{\'e}rard Huet and Jean--Marie Hullot",
   title     = "Proof by Induction in Equational Theories with Constructors",
   journal   = JCSS,
   year      = "1982",
   volume    = "25",
   pages     = "239-266",
   keywords  = "inductionless induction, constructor models, test
       sets, proof by consistency"
}



@inproceedings{Hughes:POPL96,
 author = {Hughes, John and Pareto, Lars and Sabry, Amr},
 title = {Proving the correctness of reactive systems using sized types},
 booktitle = {23rd ACM SIGPLAN-SIGACT {S}ymposium on {P}rinciples of {P}rogramming {L}anguages (POPL'96)},
 year = {1996},
 isbn = {0-89791-769-3},
 pages = {410--423},
 publisher = {ACM},
 address = {New York, NY, USA},
} 


@inproceedings{Hullot80,
   author    = "Jean-Marie Hullot",
   title     = "Canonical forms and unification",
   booktitle = CADE80,
   year      = "1980",
   pages     = "318-334",
   keywords  = "unification, narrowing"
}




@PhdThesis{Hummel90,
  author =   "Birgit Hummel",
  title =    "Generierung von {I}nduktionsformeln und
          {G}eneralisierung beim automatischen {B}eweisen mit
          vollst{\"a}ndiger {I}nduktion",
  school =   UKA,
  year =     "1990",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTtype =      "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "generalization"
}


@inproceedings{Hutter90,
   author    = "Dieter Hutter",
   title     = "Guiding Induction Proofs",
   booktitle = CADE90,
   year      = "1990",
   publisher = SPR,
   pages     = "147-161",
   keywords  = "rippling, coloured terms, c-terms, context, skeleton,
       inductive reasoning, proof plan"
}




@PhdThesis{Hutter91,
  author =   "Dieter Hutter",
  title =    "Mustergesteuerte Strategien f{\"u}r das Beweisen von
                  Gleichungen",
  school =   UKA,
  year =     "1991",
  OPTkey =   "",
  OPTaddress =   "",
  OPTtype =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "rippling, c-logic"
}

@InProceedings{Hutter94,
  author =   "Dieter Hutter",
  title =    "Synthesis of Induction Orderings for Existence Proofs",
  booktitle =    CADE94,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "LNAI 814",
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  = "rippling,existential quantifiers, skeleton,
       inductive reasoning, proof plan"
}

@misc{Hutter92,
   author    = "Dieter Hutter",
   title     = "Adapting a Resolution Calculus for Inductive Proofs",
   year      = "1992",
   keywords  = "m-clauses, inductive reasoning, resolution"
}


@Misc{Hupfauf93,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Peter Hupfauf",
  title =    "Eine vergleichende {A}nalyse induktiver {T}heorembeweiser",
  howpublished = "Diplomarbeit, Universit{\"a}t Passau",
  year =     "1993",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "explicit induction, implicit induction, nqthm,
          unicom, tip"
}


%%% I


@Misc{Ireland94,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Andrew Ireland",
  title =    "Failure Analysis through Meta-Level Inference",
  howpublished = "personal communication",
  year =     "1994",
  OPTmonth =     "",
  OPTnote =      "Blue Book Note 947",
  OPTannote =    "enriched proof plan architecture, critics"
}

@InProceedings{Ireland92,
  author =   "Andrew Ireland",
  title =    "The Use of Planing Critics in Mechanizing Inductive Proofs",
  volume =   624,
  series =   "LNAI",
  pages =    "178-189",
  booktitle =    LPAR92,
  year =     1992,
  publisher =    SPR,
  keywords =     "proof critics, planing critics, proof plan"
}

@Article{IrelandBundy96,
  author =   "Andrew Ireland and Alan Bundy",
  title =    "Productive use of failure in inductive proofs",
  journal =      JAR,
  year =     "1996",
  OPTkey =   "",
  volume =   "16",
  OPTnumber =    "",
  month =    "March",
  pages =    "79-111",
  OPTnote =      "",
  keywords =     "proof critics, planing critics, proof plan"
}

%%% J



@ARTICLE{Jacobs:tutorial97,
    author = {Bart Jacobs and Jan Rutten},
    title = {A Tutorial on (Co)Algebras and (Co)Induction},
    journal = {EATCS Bulletin},
    year = {1997},
    volume = {62},
    pages = {62--222}
}

@unpublished{jacobs:IntrodcutionToCoalgebra:2005,
author = {Bart Jacobs},
title = {Introduction to Coalgebra. Towards Mathematics of States and Oberservations},
note = {Available via http://www.cs.ru.nl/B.Jacobs/CLG/JacobsCoalgebraIntro.pdf},
year = {2005}
}



@Article{Jaeger95,
  author =   "Kurt J{\"a}ger",
  title =    "({K}ein) {S}chutz geistigen {E}igentums",
  journal =      "FIFF-Kommunikation",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  number =   "2",
  OPTmonth =     "",
  pages =    "32 - 33",
  OPTnote =      "",
  OPTannote =    ""
}

@misc{Jahn,
   author    = "Karl--Udo Jahn",
   title     = "The Importance of 3--valued Notions for Interval
       Mathematics",
   keywords  = "interval arithmetic"
}


@misc{Jahn73,
   author    = "Karl--Udo Jahn",
   title     = "Eine auf den {I}ntervall--{Z}ahlen fu\ss{}ende 3--wertige
       lineare {A}lgebra",
   year      = "1973",
   keywords  = "interval arithmetic, linear algebra"
}


@article{Jahn74,
   author    = "Karl--Udo Jahn",
   title     = "Eine {T}heorie der {G}leichungssysteme mit
       {I}ntervallkoeffizienten",
   journal   = {ZAMM},
   year      = 1974,
   volume    = 54,
   pages     = "405-412",
   keywords  = "interval arithmetic, linear algebra"
}



@InProceedings{Jojgov:TYPES02,
  author    = "Jojgov, G.I",
  title     = "Holes with binding power",
  editor    = {Herman Geuvers and
               Freek Wiedijk},
  booktitle = {Types for Proofs and Programs, Second International Workshop,
               TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002,
               Selected Papers},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 2646)},
  year      = 2003,
  pages     = "162-181"
}


@TECHREPORT{Jones:techrep93,
  author = {Geraint Jones and Jeremy Gibbons},
  title = {Linear-time Breadth-first Tree Algorithms: An Exercise in the
      Arithmetic of Folds and Zips},
  year = {1993},
  month = {May},
  number = {Computer Science Report No.\,71, University of Auckland}
}

@InProceedings{Jones01:POPL,
  AUTHOR       = "Lee, Chin Soon and Jones, Neil D. and Ben-Amram, Amir M.",
  YEAR         = "2001",
  TITLE        = "The Size-Change Principle for Program Termination",
  booktitle =    "28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01)",
  editor       = "",
  publisher    = "ACM press",
  organization = "",
  address      = "",
  series       = "",
  pages        = "81--92",
  month        = "january",
  keywords     = "termination, program analysis, lexical order, pspace hardness"
}

@Article{JouannaudKirchner,
  author =   "Jean - Pierre Jouannaud and Helene Kirchner",
  title =    "Completion of a Set of Rules Modulo a Set of Equations",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  SIAMJC,
  year =     "1986",
  volume =   "15",
  number =   "4",
  pages =    "1155-1194",
  month =    nov,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     ""
}


@article{JouannaudKounalis89,
   author    = "Jean-Pierre Jouannaud and Emmanuel Kounalis",
   title     = "Automatic Proofs by Induction in Theories without
       Constructors",
   journal   = "Information and Computation",
   year      = "1989",
   volume    = "82",
   number    = "33",
   pages     = "1-33",
   keywords  = "inductionless induction, inductive reducibility,
       inductive co-reducibility"
}

@InProceedings{Jouannaud99lics,
  author =       "J.-P. Jouannaud and A. Rubio",
  title =        "The Higher-Order Recursive Path Ordering",
  editor =       "G. Longo",
  pages =        "402--411",
  booktitle =    "Proceedings of the 14th Annual Symposium on Logic in
                  Computer Science (LICS'99)",
  year =         1999,
  publisher =    "IEEE Computer Society Press",
  address =      "Trento, Italy",
  month =        jul,
  keywords =     "rewriting"
}

%%% K
@inproceedings{Kameyama:PEPM08,
 author = {Yukiyoshi Kameyama and Oleg Kiselyov and Chung-chieh Shan},
 title = {Closing the stage: from staged code to typed closures},
 booktitle = {Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation (PEPM'08)},
 year = {2008},
 isbn = {978-1-59593-977-7},
 pages = {147--157},
 location = {San Francisco, California, USA},
 doi = {http://doi.acm.org/10.1145/1328408.1328430},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@InProceedings{KBB93,
  author =   "I. Kraan and D. Basin and A. Bundy",
  title =    "Logic Program Synthesis via Proof Planning",
  booktitle =    LPST93,
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "K. K. Lau and T. Clement",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1993",
  OPTorganization = "",
  publisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "1-14",
  note =     "also available as Max-{P}lanck {I}nstitut f{\"u}r {I}nformatik Report MPI-I-92-244 and {E}dinburgh {DAI} {R}esearch {R}eport 603",
  OPTannote =    ""
}

@Article{Kamin83,
  author =  "Samuel Kamin",
  title =   "Final Data Types and Their Specification",
  journal =     TOPLAS,
  year =    "1983",
  volume =  "5",
  number =  "1",
  pages =   "97-121",
  month =   jan,
  OPTnote =     "",
  keywords =    "final algebra, abstract data types, specification"
}


@Article{Kaplan84,
  author =   "St{\'e}phane Kaplan",
  title =    "Conditional Rewrite Rules",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  TCS,
  year =     "1984",
  volume =   "33",
  number =   "4",
  pages =    "175-193",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting"
}

@inproceedings{KapurMusser86,
   author    = "Deepak Kapur and David R.~Musser",
   title     = "Inductive Reasoning with Incomplete Specifications",
   booktitle = LICS86,
   organization = "{IEEE}",
   year      = "1986",
   pages     = "367-377",
   keywords  = "inductive reasoning, incomplete specifications,
       ambiguous specifications, unambiguous specifications,
       proof by consistency, S-congruence, completable extension"
}


@article{KapurMusser87,
   author    = "Deepak Kapur and David R.~Musser",
   title     = "Proof by Consistency",
   journal   = AI,
   year      = "1987",
   volume    = "31",
   pages     = "125-157",
   keywords  = "inductive reasoning, unambiguous specifications,
       proof by consistency, S-congruence"
}


@inproceedings{KapurNarendranZhang86,
   author    = "Deepak Kapur and Paliath Narendran and Hantao Zhang",
   title     = "Proof by induction using test sets",
   booktitle = CADE86,
   year      = "1986",
   publisher = SPR,
   pages     = "99-117",
   OPTnote      = "",
   keywords  = "inductive reasoning, test sets, inductionless induction"
}


@Article{KapurNarendranZhang87,
  author =  "Deepak Kapur and Paliath Narendran and Hantao Zhang",
  title =   "On Sufficient--Completeness and Related Properties of
         Term Rewriting Systems",
  journal =     ACTAINF,
  year =    "1987",
  volume =  "24",
  OPTnumber =   "",
  pages =   "395-415",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "sufficient completeness, inductive reducibility"
}


@manual{KapurZhang87,
   author    = "Deepak Kapur and Hantao Zhang",
   title     = "{RRL: Rewrite Rule Laboratory}",
   year      = "1987",
   month     = jun,
   note      = "Revised 1989",
   keywords  = "inductiove completion, inductionless induction, test
       sets, cover sets, Knuth-Bendix completion"
}


@InProceedings{KapurZhang88,
  author    = "Deepak Kapur and Hantao Zhang",
  title     = "{RRL: A Rewrite Rule Laborarory}",
  booktitle = CADE88,
  publisher = SPR,
  year      = "1988",
  number    = "310",
  series    = "Lecture Notes in Computer Science (LNCS)",
  pages     = "768-769",
  keywords  = "RRL"
}

@inproceedings{Keller:10,
 author = {Keller, Chantal and Altenkirch, Thorsten},
 title = {Hereditary substitutions for simple types, formalized},
 booktitle = {Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming},
 series = {MSFP '10},
 year = {2010},
 location = {Baltimore, Maryland, USA},
 pages = {3--10},
 numpages = {8},
 acmid = {1863601},
 address = {New York, NY, USA},
 keywords = {decidability of {\$\beta\$}\&\#951;-equality, hereditary substitutions, normalizer, type theory},
}
  @Comment publisher = {ACM},
  @Comment isbn = {978-1-4503-0255-5},
  @Comment url = {http://doi.acm.org/10.1145/1863597.1863601},
  @Comment doi = {10.1145/1863597.1863601},

@article{Keshav:2007,
 author = {Keshav, S.},
 title = {How to read a paper},
 journal = {ACM SIGCOMM Computing Communication Review},
 volume = {37},
 issue = {3},
 month = {July},
 year = {2007},
 issn = {0146-4833},
 pages = {83--84},
 numpages = {2},
 url = {http://doi.acm.org/10.1145/1273445.1273458},
 doi = {http://doi.acm.org/10.1145/1273445.1273458},
 acmid = {1273458},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {hints, paper, reading},
} 



@inproceedings{Kim:POPL06,
 author = {Ik-Soon Kim and Kwangkeun Yi and Cristiano Calcagno},
 title = {A polymorphic modal type system for lisp-like multi-staged languages},
 booktitle = {33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages(POPL '06)},
 year = {2006},
 pages = {257--268},
 location = {Charleston, South Carolina, USA},
 doi = {http://doi.acm.org/10.1145/1111037.1111060},
 publisher = ACM,
 address = {New York, NY, USA},
 }


@inproceedings{Kirchner84,
   author    = "Helene Kirchner",
   title     = "A general inductive completion algorithm and
         application to abstract data types",
   booktitle = CADE84,
   year      = "1984",
   month     = may,
   publisher = SPR,
   pages     = "282-302",
   note      = "{Lecture Notes in Computer Science (LNCS)} 170",
   keywords  = "inductive completion"
}


@Book{Klaeren83,
  author =  "Herbert Alois Klaeren",
  title =   "Algebraische {S}pezifikation",
  publisher =   SPR,
  year =    "1983",
  OPTeditor =   "",
  OPTvolume =   "",
  OPTseries =   "",
  OPTaddress =  "",
  OPTedition =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "initial algebra, final algebra, abstract datatype,
         algebraic specification",
  thdinfbib =   "D.3, Kla, 6527"
}

@inproceedings{Klaua78,
   author    = "Dieter Klaua",
   title     = "Mengen-{I}ntervalle",
   booktitle = "Freiburger Intervall-Berichte",
   organization = "Institute of Applied Mathematics, University of
       Freiburg i.~Br.",
   year      = 1978,
   publisher = "Karl Nickel",
   keywords  = "interval arithmetic, multiple valued logic"
}

@Misc{Klein97,
  OPTkey =   "",
  author =   "Lars Klein",
  title =    "Indexing f{\"u}r {T}erme h{\"o}herer {S}tufe",
  howpublished = "Diplomarbeit, FB 14, Universit{\"a}t des {S}aarlandes, {S}aarbr{\"u}cken, Germany" ,
  year =     "1997",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "substitution trees, higher-order term indexing"
}


@Article{Kleene38,
  author =   "S.~Kleene",
  title =    "On a notation for ordinal numbers",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JSL,
  year =     "1938",
  volume =   "3",
  OPTnumber =    "",
  pages =    "150-155",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "strong Kleene logic, SKL, Rosser & Turquette"
}


@InCollection{KnuthBendix70,
  author =   "Donald E.~Knuth and P.~Bendix",
  title =    "Simple word problems in universal algebras",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Computational Problems in Abstract Algebra",
  publisher =    "Pergamon, Oxford",
  year =     "1970",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  pages =    "263-297",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Knuth-Bendex completion"
}


@book{Knuth87,
   author    = "Donald E.~Knuth",
   title     = "Computers and Typesetting Vol.~A-E",
   year      = "1987-1991",
   publisher = AW,
   keywords  = "Typesetting, LaTeX, TeX, Metafont"
}


@Book{Knuth73,
  author =   "Donald E.~Knuth",
  title =    "The Art of Computer Programming",
  publisher =    "Addision-Wesley",
  year =     "1973",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  volume =   "2, Fundamental Algorithms",
  OPTnumber =    "",
  series =   "Computer Science and Information Processing",
  OPTaddress =   "",
  edition =  "second",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@InProceedings{KolbeWalther96,
  author =   "Thomas Kolbe and Christoph Walther",
  title =    "Proving Theorems by Mimicking a Human's Skill",
  booktitle =    "Proceedings of the {AAAI} Spring Symposium on
          Acquisition, Learning \& Demonstration",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1996",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "lerning"
}

@InProceedings{KolbeWalther94,
  author =   "Thomas Kolbe and Christoph Walther",
  title =    "Reusing Proofs",
  booktitle =    "Proceedings of the 11-th European Conference on
          Artificial Intelligence",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "A.~Cohen",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1994",
  OPTorganization = "",
  publisher = "John Wiley \& Sons",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "lerning, analogy"
}

@InCollection{KolbeWalther95c,
    author = "Thomas Kolbe and Christoph Walther",
    title = "{Second-Order Matching modulo Evaluation --- A Technique for Reusing Proofs}",
    booktitle = "{Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal,
    Canada}",
    year = "1995"
    }

@InCollection{KolbeWalther96b,
    author = "Thomas Kolbe and Christoph Walther",
    title = "{Termination of Theorem Proving by Reuse}",
    booktitle = "{Proceedings of the 13th International Conference on Automated Deduction (CADE-96), New
    Brunswick, USA}",
    editor = {M.A. McRobbie and J.K. Slaney},
    publisher = {Springer LNAI 1104},
    year = {1996},
    pages = {106--120}
    }


@inproceedings{Kounalis85,
   author    = "Emmanuel Kounalis",
   title     = "Completeness in Data Type Specifications",
   booktitle = EUROCAL85,
   year      = "1985",
   month     = apr,
   publisher = SPR,
   note      = {Lecture Notes in Computer Science (LNCS) 204},
   pages     = "348-362"
}


@inproceedings{KounalisRusinowitch90,
   author    = "Emmanuel Kounalis and Micha{\"e}l Rusinowitch",
   title     = "Mechanizing inductive reasoning",
   booktitle = AAAI90,
   year      = "1990",
   month     = jul,
   publisher = "{AAAI} Press and {MIT} Press",
   pages     = "240-245",
   keywords  = "conditional term rewriting, induction"
}


@book{KreiserGottwaldStelzner90,
   author    = "Lothar Kreiser and Siegfried Gottwald and Werner Stelzner",
   title     = "Nichtklassische {L}ogik",
   year      = "1990",
   publisher = AVB,
   keywords  = "non-classical logic, multiple valued logic, modal
       logic, intuitionistic logic, epistemic logic"
}


@InCollection{Kreitz+00a,
   author          = "Christoph Kreitz and Jens Otten and Stephan Schmitt and
                             Brigitte Pientka",
   title           = "Matrix-based Constructive Theorem Proving",
   booktitle       = "Intellectics and Computational Logic. Papers in honor of
                             Wolfgang Bibel",
   publisher       = "Kluwer",
   year            = "2000",
   editor          = "Steffen H{\"o}lldobler",
   number          = "19",
   series          = "Applied Logic Series",
   pages           = "189--205"
        }


@Article{KreitzPientka01a,
         author          = "Christoph Kreitz and Brigitte Pientka",
         title           = "Connection-Driven Inductive Theorem Proving",
         journal         = "Studia Logica",
         year            = "2001",
         volume          = "69",
         number          = "2",
         pages           = "293--326"
       }


@InProceedings{KreitzPientka00a,
         author          = "Christoph Kreitz and Brigitte Pientka",
         title           = "Matrix-based Inductive Theorem Proving",
         booktitle       = "9th International Conference on
  Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)",
         year            = "2000",
         editor          = "R. Dyckhoff",
         series          = "Lecture Notes in Artificial Intelligence (LNAI) 1847",
         pages           = "294--308",
         publisher       = "Springer Verlag"
       }

 @InProceedings{KreitzPientka98,
         author          = "Christoph Kreitz and Brigitte Pientka",
         title           = "Matrix-based Inductive Theorem Proving",
         booktitle       = "Workshop on Automating Proofs by Induction",
         year            = "1998",
        OPTeditor        = ""
       }


@inbook{Kuechlin92,
   author    = "Wolfgang K{\"u}chlin",
   title     = "Inductive Completion by Ground Proof Transformation",
   chapter   = "7",
   year      = "1992",
   publisher = AP,
   volume    = "2",
   pages     = "211-244",
   series    = "Resolution of Equations in Algebraic Structures",
   keywords  = "proof transformation, unfailing completion, implicit
          induction"
}

@manual{Kulisch87,
   author    = "Ulrich Kulisch",
   title     = "{\sc pascal-sc}, A {\sc pascal} Extension for
       Scientific Computation",
   organization = "University of Karlsruhe, Dept.\ of Applied
       Mathematics",
   year      = "1987",
   note      = TEU
}


@InProceedings{KuriharaKondoOhuchi95,
  author =   "Masahito Kurihara and Hisashi Kondo and Azuma Ohushi",
  title =    "Completion for Multiple Reduction Orderings",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) vol.~914",
  pages =    "71-85",
  booktitle =    RTA95,
  year =     "1995",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "completion, Knuth-Bendix"
}

@MastersThesis{Kurucz97a,
  author      = "Ferenc Kurucz",
  title       = "{Realisierung verschiedender Induktionsstrategien basierend
             auf dem Rippling-Kalk{\"u}l}",
  school      = "Technical University Darmstadt",
  year        = 1997,
  OPTkey      = "",
  OPTaddress      = "",
  OPTmonth    = "",
  OPTnote     = ""
}




@Article{Kwon94,
  author =   "Keehang Kwon, Gopalan Nadathur and Debra Sue Wilson",
  title =    "Implementing Polymorphic Typing in a Logic Programming Language",
  journal =      "Computer Languages ",
  year =     "1994",
  OPTkey =   "",
  volume =   "20",
  number =   "1",
  pages =    "25-42",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

%%% L

@Book{Lakatos,
  author =   "Imre Lakatos",
  title =    "{Beweise und Widerlegung}",
  publisher =    "Vieweg",
  year =     "1979",
  OPTkey =   "",
  editor =   "John Worral, Elie Zahar",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@book{Lamport85,
   author    = "Leslie Lamport",
   title     = "\LaTeX -- A Document Preparation System",
   year      = "1985",
   publisher = "AW",
   keywords  = "LaTeX"
}

@inproceedings{LeFessant:ICFP01,
 author = {Fabrice Le Fessant and Luc Maranget},
 title = {Optimizing pattern matching},
 booktitle = {6th ACM SIGPLAN International Conference on Functional Programming
                  (ICFP'01)},
 year = {2001},
 pages = {26--37},
 numpages = {12},
 publisher = {ACM}
} 

@InCollection{LetzStenz01,
  author =   "Reinhold Letz and Gernot Stenz",
  title =    "Model Eliminiation and Connection Tableau Procedures",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Handbook of Automated Reasoning",
  publisher =    ESP,
  year =     "2001",
  editor =   "Alan Robinson and Andrei Voronkov",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  chapter =      "28",
  pages =    "2015-2112",
  keywords =     "memoization, failure caching, logic programming "
}



@inproceedings{Letouzey:TYPES02,
 author = {Pierre Letouzey},
 title = {A new extraction for Coq},
 booktitle = {Types for Proofs and Programs (TYPES'02)},
 editor    = {Herman Geuvers and Freek Wiedijk},
 year = {2003},
 pages = {200--219},
 numpages = {20},
 series    = {Lecture Notes in Computer Science (LNCS 2646)},
 publisher = {Springer}
} 


@InProceedings{Letouzey:CiE08,
  author = 	 {Pierre Letouzey},
  title = 	 {Extraction in Coq: An Overview},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {4th Conference on Computability in Europe: Logic and Theory of Algorithms},
  pages = 	 {359--369},
  year = 	 {2008},
  editor = {Arnold Beckmann and Costas Dimitracopoulos and Benedikt Löwe},
  OPTnumber = 	 {},
  series = 	 {Lecture Notes in Computer Science (LNCS 5028)},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  publisher = {Springer},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{Leron83,
  author    = "Leron,~Uri",
  title     = "Structuring mathematical proofs",
  journal   = "The American Mathematical Monthly",
  year      = "1983",
  OPTkey    = "",
  volume    = "90",
  OPTnumber = "",
  OPTmonth  = "",
  pages     = "174-185",
  OPTnote   = "",
  OPTannote = ""
}

@article{Leroy:JACM09,
  author    = {Xavier Leroy},
  title     = {Formal verification of a realistic compiler},
  journal   = {Communications of the ACM},
  volume    = {52},
  number    = {7},
  year      = {2009},
  pages     = {107-115}
}

@article{Leroy:JAR09,
  author    = {Xavier Leroy},
  title     = {A Formally Verified Compiler Back-end},
  journal   = {J. Autom. Reasoning},
  volume    = {43},
  number    = {4},
  year      = {2009},
  pages     = {363-446},
}


@inproceedings{Leroy:ESOP06,
  author    = {Xavier Leroy},
  title     = {Coinductive Big-Step Operational Semantics},
  editor    = {Peter Sestoft},
  booktitle = {15th European Symposium on Programming (ESOP'06)},
  publisher = {Springer},
  series    = {LNCS(3924)},
  year      = {2006},
  pages     = {54-68}
}

@ARTICLE{Leroy:InfComp09,
AUTHOR = "Xavier Leroy and Hervé Grall",
TITLE = "Coinductive big-step operational semantics.",
JOURNAL = "{Information and Computation}",
PAGES = {284-304},
YEAR = {2009}  
}




@Article{HarperLicata:JFP07,
  author    = {Robert Harper and Daniel R. Licata},
  title     = {{Mechanizing Metatheory in a Logical Framework}},
  journal   = {{Journal of Functional Programming}},
  year      = {2007},
  volume    = {17},
  number    = {4-5},
  pages     = {613--673},
  publisher = {Cambridge Univ Press}
}


@Unpublished{Licata:extensible07,
  author    = {Daniel R. Licata and Robert Harper},
  title     = {An Extensible Theory of Indexed Types},
  note      = {Unpublished manuscript},
  month     = {July},
  year      = {2007}
}

@inproceedings{lh09pdt,
  author    = {Daniel R. Licata and Robert Harper},
  title     = {Positively dependent types},
  booktitle = {PLPV '09: Proceedings of the 3rd Workshop on Programming Languages Meets Program Verification},
  year      = {2009},
  isbn      = {978-1-60558-330-3},
  pages     = {3--14},
  location  = {Savannah, GA, USA},
  publisher = ACM,
  address   = {New York, NY, USA}
}



@InProceedings{Lindenstrauss:ICLP97,
  author =   "Naomi Lindenstrauss, Yehoshua Sagiv",
  title =    "Automatic Termination Analysis of Logic Programs",
  editor =       "Lee Naish",
  booktitle =    "14th International Conference on Logic Programming, Leuven, Belgium",
  OPTseries =    "",
  year =     "1997",
  publisher    = "MIT Press",
  pages =    "63--77"
}


@inproceedings{Liskov:74,
 author = {Liskov, Barbara and Zilles, Stephen},
 title = {Programming with Abstract Data Types},
 booktitle = {Proceedings of the ACM SIGPLAN Symposium on Very High Level Languages},
 year = {1974},
 location = {Santa Monica, California, USA},
 pages = {50--59},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/800233.807045},
 doi = {10.1145/800233.807045},
 acmid = {807045},
 publisher = {ACM},
 address = {New York, NY, USA},
} 


@article{LiskovSIGPLAN:1974,
 author = {Liskov, Barbara and Zilles, Stephen},
 title = {Programming with Abstract Data Types},
 journal = {SIGPLAN Not.},
 issue_date = {April 1974},
 volume = {9},
 number = {4},
 month = mar,
 year = {1974},
 issn = {0362-1340},
 pages = {50--59},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/942572.807045},
 doi = {10.1145/942572.807045},
 acmid = {807045},
 publisher = {ACM},
 address = {New York, NY, USA},
} 


@Book{Lloyd84,
  author =   "Genevieve Lloyd",
  title =    "The Man of Reason",
  publisher =    "Richard Clay (The Chaucer Press) Ltd",
  year =     "1984",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  =    "Reasoning,psychology,philosophy,epistemology,Erkenntinistheorie"
}

@Book{Lloyd85,
  author =   "Genevieve Lloyd",
  title =    "Das Patriarchat der Vernunft:``m{\"a}nnlich'' und
                  ``weiblich'' in der westlichen Philosophie",
  publisher =    "Daedalus-Verlag",
  year =     "1985",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}





@book{Loveland78,
   author    = "Donald W.~Loveland",
   title     = "Automated theorem proving: a logical basis",
   year      = "1978",
   publisher = NoHo,
   volume    = "6",
   series    = "Fundamental Studies in Computer Science",
   keywords  = "logic textbook"
}

@InProceedings{Luther:IJCAR01,
   author    = {Marko Luther},
   title     = {More On Implicit Syntax},
   booktitle = IJCAR01,
   editor    = {R.~Gore and A.~Leitsch and T.~Nipkow},
   pages     = {386--400},
   year      = {2001},
   series    = {Lecture Notes in Artificial Intelligence (LNAI) 2083},
   publisher = {Springer}
}

@article{Lukasiewicz20,
   author    = "Jan {\L}ukasiewicz",
   title     = "O logice tr\'{o}jwarto\'{s}ciowej",
   journal   = "Ruch {F}ilozoficzny",
   year      = 1920,
   volume    = 5,
   pages     = "170--171",
   note      = "English translation 1970",
   keywords  = "multiple valued logic"
}

@InProceedings{LynchSnyder93,
   author          = "Christopher Lynch and Wayne Snyder",
   title           = "Redundancy Criteria for Constrained Completion",
   booktitle       = RTA93,
   year            = "1993",
   OPTeditor       = "",
   pages           = "2--16",
   OPTorganization = "",
   publisher       = SPR,
   OPTaddress      = "",
   month           = jun,
   note            = "Lecture Notes in Computer Science (LNCS) vol.\ 690",
   keywords        = "constrained completion, constrained equational reasoning"
}

@inproceedings{Lysne95,
   author    = "Olav Lysne and Javier Piris",
   title     = "A Termination Ordering for Higher Order Rewrite Systems",
   editor    = "Jieh Hsiang",
   booktitle = "Proceedings of the Sixth International Conference on Rewriting Techniques and Applications",
   year      = 1995,
   publisher = "Springer-Verlag Lecture Notes in Computer Science (LNCS) 914",
   address   = "Kaiserslautern, Germany",
   month     = apr,
   pages     = "26--40",
   keywords  = "rewriting"
}

%%% M

@Book{MacLane72,
   author     = "Saunders Mac Lane",
   title      = "Kategorien",
   publisher  = SPR,
   year       = "1972",
   OPTeditor  = "",
   OPTvolume  = "",
   OPTseries  = "",
   OPTaddress = "",
   OPTedition = "",
   OPTmonth   = "",
   OPTnote    = "",
   keywords   = "category theory",
   thdinfbib  = "M.6 Mac, 1250"
}

@PhdThesis{Magnusson95a,
  author      = "Lena Magnusson",
  title       = "The implementation of {ALF} -- A Proof Editor Based on
             Martin-L{\"o}f's Monomorphic Type Theory with Explicit
             Substitutions",
  school      = "Chalmers University of Technology and G{\"o}teborg
             University",
  year        = "1995",
  OPTkey      = "",
  OPTaddress  = "",
  month       = "January",
  OPTtype     = "",
  OPTnote     = ""
}




@InProceedings{Magnusson:Types94,
  author = 	 {Lena Magnusson and Bengt Nordstr\"om},
  title = 	 {The Alf proof editor and its proof engine},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle =    {TYPES:Types for Proofs and Programs},
  pages =        {213-237},
  year = 	 {1994},
  editor = 	 {Barendregt, Henk and Nipkow, Tobias},
  volume = 	 {806},
  OPTnumber = 	 {},
  series = 	 {Lecture Notes in Computer Science (LNCS)},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  publisher = {Springer},
  OPTnote = 	 {},
  OPTannote = 	 {}
}


@incollection{MMW86,
   author    = "Yonathan Malachi and Zohar Manna and Richard Waldinger",
   title     = "{TABLOG}, a New Approach to Logic Programming",
   booktitle = "Logic Programming. Functions, Relations and Equations",
   year      = "1986",
   editor    = "Doug {DeGroot} and Gary Lindstrom",
   publisher = PH,
   pages     = "365-394",
   keywords  = "Prolog, Functional Programming, Equations,
       Extensions of Prolog"
}

@Article{MannaWaldinger80,
  author =   "Z. Manna and R.J. Waldinger",
  title =    "A deductive approach to program synthesis",
  journal =      TOPLAS,
  year =     "1980",
  OPTkey =   "",
  volume =   "2",
  number =   "1",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@article{MannaWaldinger86,
   author    = "Zohar Manna and Richard Waldinger",
   title     = "Special Relations in Automated Deduction",
   journal   = JACM,
   year      = "1986",
   volume    = "33",
   number    = "1",
   pages     = "1-59",
   keywords  = "program verification, automated theorem proving"
}

@Book{Mansfield87,
  author =  "Jaap Mansfield",
  title =   "Die Vorsokratiker: Auswahl der Fragmente, Übersetzung
          und Erläuterungen",
  publisher =   "Philipp Reclam Jun. Stuttgart",
  year =    "1987",
  OPTeditor =   "",
  OPTvolume =   "",
  OPTseries =   "",
  OPTaddress =  "",
  OPTedition =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "",
  thdinfbib =   ""
}

@inproceedings{Maranget:08,
 author = {Luc Maranget},
 title = {Compiling pattern matching to good decision trees},
 booktitle = {ACM SIGPLAN Workshop on ML (ML'08)},
 year = {2008},
 pages = {35--46},
 numpages = {12},
 publisher = {ACM},
 keywords = {decision trees, heuristics, match compilers}
} 


@Article{MartelliMonatanari82,
  author          = "Alberto Martelli and Ugo Montanari",
  title           = "An efficient unification algorithm",
  journal         = TOPLAS,
  volume          = "4",
  number          = 2,
  pages           = "258-282",
  year            = "1982",
  month           = "April"
}

@Book{Martin-Loef70a,
  author      = "Per Martin-L{\"o}f",
  title       = "Notes on Constructive Mathematics",
  publisher   = "Almqvist \& Wiksell",
  year        = "1970",
  OPTeditor   = "",
  OPTvolume   = "",
  OPTseries   = "",
  address     = "Stockholm",
  OPTedition      = "",
  OPTmonth    = "",
  keywords    = "Type Theory",
  notes           = "CMU library 510.1 M386N"
}

@Unpublished{Martin-Loef70a,
  author      = "Per Martin-L{\"o}f",
  title       = "A Theory of Types",
  note        = "unpublished manuscript",
  year        = "1970",
  OPTmonth    = "",
  key         = "",
  language    = "English",
  where       = ASK,
  importance      = "",
  last_use    = NOT,
  keywords    = "Type Theory -- Wohl das Ursprungsmanuskript"
}

@InProceedings{Martin-Loef73a,
  author      = "Per Martin-L{\"o}f",
  title       = "An intuitionistic Theory of Types: predicative part",
  booktitle   = "Logic Colloquium '73",
  year        = "1973",
  editor      = "H. E. Rose and J. C. Shepherdson",
  OPTpages    = "73-118",
  OPTorganization = "",
  publisher   = NoHo,
  OPTseries   = "",
  OPTnumber   = "",
  address     = "Amsterdam",
  OPTmonth    = "",
  OPTnote     = ""
}

@InProceedings{Martin-Loef79a,
  author      = "Per Martin-L{\"o}f",
  title       = "Constructive Mathematics and Computer Programming",
  booktitle   = "6-th International Congress for Logic, Methodology and
                  Philosophy of Science, 1979",
  year        = "1982",
  pages       = "153-175",
  publisher   = NoHo,
  keywords    = "Type Theory, Program Construction --
                    sehr viel kann dirkekt zitiert werden und nur leicht
           abgewandelt
                   set-theory ---- int.TT
                   mathematics as prog. language, p162. ist wichtig
                   CMU library 501 I612L, 1979"
}

@Article{MartinLof96,
  author =  "Per Martin-L{\"o}f",
  title =   "On the meaning of the logical constants and the justifications of the logical laws",
  journal =     "Nordic Journal of Philosophical Logic",
  year =    "1996",
  volume =  "1",
  number =  "1",
  pages =   "11-60",
  OPTnote =     "",
  keywords =    "http://www.hf.uio.no/filosofi/njpl/vol1no1/meaning/meaning.html"
}

@Misc{Martin-Loef83a,
  OPTkey      = "",
  author      = "Per Martin-L{\"o}f",
  title       = "On the meaning of the logical constants and the
                  justifications of the logical laws",
  howpublished    = "Lecture Notes, Universita degli Studi di Siena",
  OPTmonth    = "",
  year        = 1983,
  OPTnote     = ""
}

@Book{Martin-Loef84a,
  author      = "Per Martin-L{\"o}f",
  title       = "Intuitionistic {Type Theory}",
  publisher   = "Bibliopolis",
  year        = "1984",
  OPTeditor   = "",
  volume      = "1",
  series      = "Studies in Proof Theory Lecture Notes",
  address     = "Napoli",
  OPTedition      = "",
  OPTmonth    = "",
  OPTnote     = "Notes by Giovanni Sambin of a series of lectures given in
           Padua, June 1980",
  keywords    = "Type Theory -- Gute Vorlage f{\"u}r Systematik einer Vorlesung
                   Setzt aber sehr viel voraus an mathematisch-philosophischen
           Kenntnissen L{\"u}cken der Pr{\"a}sentation im Detail -- CMU library
                   510.1.M3861"
}

@InProceedings{Martin-Loef88a,
  author      = "Per Martin-L{\"o}f",
  title       = "Mathematics of infinity",
  booktitle   = COLOG-88,
  year        = "1988",
  editor      = "P. Martin-L{\"o}f and G. Mints",
  pages       = "146--197",
  publisher   = SPR,
  series      = LNCS,
  number      = "417",
  keywords    = ""
}

@InProceedings{inp:Martin-Loef94a,
   author    = {Per Martin-L"of},
   title     = "{Analytic and Synthetic Judgements in Type Theory}",
   booktitle = "Kant and Contemporary Epistemology",
   editor    = "Paolo Parrini",
   year      = "1994",
   pages     = "87--99",
   publisher = "Kluwer Academic Publishers"
}

@Article{mason99,
   author    = {Ian A. Mason},
   title     = {Computing with Contexts},
   journal   = {Higher-Order and Symbolic Computation},
   year      = {1999},
   volume    = {12},
   number    = {2},
   pages     = {171--201},
   publisher = {Kluwer}
}

@inproceedings{McAllester+CADE96,
   author    = "David McAllester and Kostas Arkoudas",
   title     = "Walther Recursion",
   booktitle = CADE96,
   year      = "1996",
   publisher = SPR,
   pages     = "643--657",
   keywords  = "termination, reducers, type system"
}

@phdthesis{McBride:phd00,
   author = {Conor McBride},
   title  = {Dependently Typed Functional Programs and Their Proofs},
   year   = 2000,
   school = {University of Edinburgh},
   note   = {{T}echnical {R}eport {ECS}-{LFCS}-00-419}
}



@InProceedings{	  mcBride:wgp10,
  author	= {Conor McBride},
  title		= {Outrageous but Meaningful Coincidences: Dependent
		  type-safe syntax and evaluation},
  editor    = {Bruno C. d. S. Oliveira and Marcin Zalewski},
  booktitle     = {ACM SIGPLAN Workshop on Genetic Programming (WGP'10)},
  publisher = {ACM},
  year      = {2010},
  pages		= {1-12}
}

@article{McGraw00,
    author = "Gary McGraw and Greg Morrisett",
    title = "Attacking Malicious Code: A Report to the Infosec Research Council",
    journal = "IEEE Software",
    volume = 17,
    number = 5,
    pages = "147-167",
    year = "September/October 200",
    url = "http://www.cs.cornell/Info/People/jgm/cs711sp02/maliciouscode.pdf" }

@article{McCune92,
    author = "William McCune",
    title = "Experiments with Discrimination-Tree Indexing and Path Indexing for Term Retrieval",
    journal = "Journal of Automated Reasoning",
    volume = "9",
    number = "2",
    pages = "147-167",
    year = "1992",
    url = "citeseer.nj.nec.com/377693.html" }

@Manual{McCune94,
  title =    "Otter 3.0 Reference Manual and Guide",
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "William W.~McCune",
  organization = "Argonne National Laboratory",
  address =  "Argonne, Illinois",
  OPTedition =   "",
  year =     "1994",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Otter"
}

@Article{McDermott82,
  author =   "John McDermott",
  title =    "R1: A Rule-Based Configurer",
  journal =      AI,
  year =     "1982",
  OPTkey =   "",
  volume =   "19",
  number =   "1",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "XCON, R1, expert systems"
}

@article{McDowell:TOCL02,
   author = {Raymond C. McDowell and Dale A. Miller},
   title = {Reasoning with higher-order abstract syntax in a logical framework},
   journal = {ACM Transactions on Computational Logic},
   volume = {3},
   number = {1},
   year = {2002},
   issn = {1529-3785},
   pages = {80--136},
   publisher = ACM
}


@InCollection{MelisVeloso97,
  author =   "Erica Melis and Manuela Veloso",
  title =    "Analogy in problem solving",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Handbook of Practical Reasoning Computational
    and Theoretical Aspects",
  publisher =    OUP,
  year =     "1997",
  editor =   "L.Farinas del Cerro, D. Gabbay, and H.J. Ohlbach",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  OPTpages =     "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "proof planning, planning by analogy"
}


@InProceedings{Melis94,
  author =   "Melis,~Erica",
  title =    "How Mathematicians Prove Theorems",
  booktitle =    Cogsci94,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "624-628",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "empirical evidence, theorem proving, proof plans"
}

@InProceedings{Melis94,
  author =   "Erica Melis and Manuela Veloso",
  title =    "Analogy makes proofs feasible",
  booktitle =    "Proceedings of the AAAI Workshop on Case-based Reasoning",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "13-17",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "analogy, theorem proving"
}

@InProceedings{MelisBundy96,
  author =   "Erica Melis and Alan Bundy",
  title =    "Planning and Proof Planning",
  booktitle =    "ECAI-96 Workshop on Cross-Fertilization in Planning, ",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1996",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{MelisCarbonell96,
  author =   "Erica Melis and Jaime G.~Carbonell",
  title =    "An argument for derivational analogy",
  booktitle =    "Advances in Analogy Research" ,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1998",
  OPTorganization = "",
  OPTpublisher = springer,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "92-105",
  keywords =     "derivational analogy"
}

@inproceedings{Mendler:LICS87,
  author    = {N. P. Mendler},
  title     = {Recursive Types and Type Constraints in Second-Order Lambda
               Calculus},
  booktitle = {Symposium on Logic in Computer Science (LICS'87)},
  year      = {1987},
  publisher = {IEEE Computer Society},
  pages     = {30-36}
}



@InProceedings{Michaylov92,
  author =      "Spiro Michaylov and Frank Pfenning",
  title =       "An Empirical Study of the Runtime Behavior of Higher-Order
                  Logic Programs",
  booktitle =   "Proceedings of the Workshop on the {$\lambda$Prolog}
                  Programming Language",
  editor =      "D. Miller",
  publisher =   "University of Pennsylvania",
  address =     "Philadelphia, Pennsylvania",
  month =       jul,
  year =        "1992",
  note =        "Available as Technical Report MS-CIS-92-86",
  pages =       "257--271",
  urldvi =      "http://www.cs.cmu.edu/~fp/papers/lpproc92.dvi.gz",
  urlps =       "http://www.cs.cmu.edu/~fp/papers/lpproc92.ps.gz",
  keywords =    "LF, Elf"
}

@InProceedings{Miller:WLF90,
  author =   {Dale Miller},
  title =    {An extension to {ML} to handle bound variables in data structures},
  booktitle =    {Proceedings of the First Workshop on Logical Frameworks},
  OPTcrossref =  {},
  OPTkey =   {},
  pages =    {323--335},
  year =     {1990},
  OTPeditor =    {G. Huet and G. Plotkin},
  OPTvolume =    {},
  OPTnumber =    {},
  OPTseries =    {},
  OPTaddress =   {},
  OPTmonth =     {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote =      {},
  OPTannote =    {}
}


@Inproceedings{Miller91iclp,
  Author = "Dale Miller",
  Title = "Unification of Simply Typed Lambda-Terms as Logic Programming",
  Editors = "Koichi Furukawa",
  Booktitle = "{8th International Logic Programming Conference}",
  Publisher = "MIT Press",
  Year = 1991,
  Pages = "255-269"}


@Article{Miller91jlc,
  author =      "Dale Miller",
  title =       "A Logic Programming Language with Lambda-Abstraction,
                  Function Variables, and Simple Unification",
  journal =     "Journal of Logic and Computation",
  volume =      "1",
  number =      "4",
  pages =       "497--536",
  year =        "1991",
  urldvi =      "file://ftp.cis.upenn.edu/pub/papers/miller/jlc91.dvi.Z",
  keywords =    "lambda-Prolog, pattern unification"
}


@Article{Miller91apal,
  author =      "Dale Miller and Gopalan Nadathur and Frank Pfenning and
                  Andre Scedrov",
  title =       "Uniform Proofs as a Foundation for Logic Programming",
  journal =     "Annals of Pure and Applied Logic",
  year =        "1991",
  volume =      "51",
  pages =       "125--157",
  urldvi =      "file://ftp.cis.upenn.edu/pub/papers/miller/apal91.dvi.Z",
  keywords =    "lambda-Prolog"
}

@Article{Miller92jsc,
  author   = {Dale Miller},
  title    = {Unification under a Mixed Prefix},
  year     = {1992},
  journal  = {Journal of Symbolic Computation},
  pages    = {321--358},
  volume   = {14},
  urldvi   = {file://ftp.cis.upenn.edu/pub/papers/miller/jsc92.dvi.Z},
  keywords = {unification}
}

@article{MillerTiu:TCL05,
   author = {Dale Miller and Alwen Tiu},
   title = {A proof theory for generic judgments},
   journal = {ACM Transactions on Computational Logic},
   volume = 6,
   number = 4,
   year = 2005,
   issn = {1529-3785},
   pages = {749--783},
   doi = {http://doi.acm.org/10.1145/1094622.1094628},
   publisher = ACM,
   address = {New York, NY, USA},
}

@InProceedings{Tiu:LFMTP06,
  author =   {Alwen Tiu},
  title =    {A Logic for Reasoning about Generic Judgments},
  booktitle = {First International Workshop on Logical Frameworks and Meta-Languages:Theory and Practice (LFMTP 2006)},
  pages =    {3 -- 18},
  year =     2007,
  editor =   {B. Pientka and A. Momigliano},
  volume =   {174(5)},
  publisher = {Electronic Notes in Theoretical Computer Science}}

@inproceedings{Gabbay:LFMTP07,
  author    = {Murdoch Gabbay},
  title     = {Hierarchical Nominal Terms and Their Theory of Rewriting},
  editor =   {B. Pientka and A. Momigliano},
  booktitle = {1st International Workshop on Logical Frameworks and Meta-Languages ({LFMTP'06})},
  publisher   = {Electronic Notes Theorical Computer Science},
  volume    = {174(5)},
  year      = {2007},
  pages     = {37-52},
  doi       = {10.1016/j.entcs.2007.01.017}
}

@article{Gabbay:JAL07,
  author =   {Murdoch~J.~Gabbay},
  title =    {{F}resh {L}ogic},
  note =     {In press},
  journal = {Journal of Applied Logic},
  doi = {http://dx.doi.org/10.1016/j.jal.2005.10.012},
  OPTkey =   {},
  year =     {2007},
  publisher = {Elsevier},
  OPTannote =    {},
  abstract =     {In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the FM-sets model of names and binding in abstract syntax. Fresh Logic can be classical or intuitionistic depending on whether we include a law of excluded middle; we present a proof-normalisation procedure for the intuitionistic case and a semantics based on Kripke models in FM-sets for which it is sound and complete.}
}

@article{Gabbay20091369,
title = "The lambda-context calculus (extended version)",
journal = "Information and Computation",
volume = "207",
number = "12",
pages = "1369 - 1400",
year = "2009",
doi = "DOI: 10.1016/j.ic.2009.06.004",
author = "Murdoch J. Gabbay and St{\'e}phane Lengrand",
}


@InProceedings{MelisWhittle96,
   author =   "E.~Melis and J.~ Whittle",
   title =    "Internal analogy in inductive theorem proving",
   booktitle =    CADE96,
   series =   "Lecture Notes in Artificial Intelligence (LNAI) 1104",
   year =     "1996",
   publisher = springer,
   keywords =     "analogy, inductive theorem proving "
}


@inproceedings{Miculan:Merlin05,
   author = {Marino Miculan and Ivan Scagnetto and Furio Honsell},
   title = {Translating specifications from nominal logic to CIC with the theory of contexts},
   booktitle = {3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding (MERLIN '05)},
   year = {2005},
   isbn = {1-59593-072-8},
   pages = {41--49},
   location = {Tallinn, Estonia},
   doi = {http://doi.acm.org/10.1145/1088454.1088460},
   publisher = {ACM},
   address = {New York, NY, USA},
}

@InProceedings{Miquel:TLCA01,
  author =   {Alexandre Miquel},
  title =    {The Implicit Calculus of Constructions: Extending Pure Type Systems with an Intersection Type Binder and Subtyping},
  OPTcrossref =  {},
  OPTkey =   {},
  booktitle = {{5th International Conference on Typed Lambda Calculi and
                  Aplications (TLCA'01)}},
  pages =    {344-359},
  year =     {2001},
  editor =   {S. Abramsky},
  OPTvolume =    {},
  OPTnumber =    {},
  series =   {Lecture Notes in Computer Science (LNCS 2044)},
  OPTaddress =   {},
  OPTmonth =     {},
  OPTorganization = {},
  publisher = {Springer},
  OPTnote =      {},
  OPTannote =    {}
}

@InProceedings{Miyamoto:FCS04,
  author = 	 {Kenji Miyamoto and Atsushi Igarashi},
  title = 	 {A Modal Foundation for Secure Information Flow},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {Workshop on Foundations of Computer Security (FCS'04)},
  pages = 	 {187-203},
  year = 	 {2004},
  editor = 	 {A. Sabelfeld},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@inproceedings{Moggi89,
  author    = {Eugenio Moggi},
  title     = {Computational Lambda-Calculus and Monads},
  booktitle = {LICS},
  year      = {1989},
  pages     = {14-23},
  ee        = {http://dx.doi.org/10.1109/LICS.1989.39155},
  crossref  = {DBLP:conf/lics/1989},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/lics/1989,
  title     = {Proceedings of the Fourth Annual Symposium on Logic in Computer
               Science (LICS '89), Pacific Grove, California, USA, June
               5-8, 1989},
  booktitle = {LICS},
  publisher = {IEEE Computer Society},
  year      = {1989},
  isbn      = {0-8186-1954-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@ARTICLE{MMF07,
  author = {Alberto Momigliano and
               Alan J. Martin and
               Amy P. Felty},
  title = {Two-Level {H}ybrid: A System for Reasoning Using Higher-Order
               Abstract Syntax},
  journal = {Electr. Notes Theor. Comput. Sci.},
  volume = {196},
  year = {2008},
  pages = {85--93}
}


@inproceedings{Momigliano:TYPES03,
  author    = {Alberto Momigliano and
               Alwen Fernanto Tiu},
  booktitle     = {Induction and Co-induction in Sequent Calculus},
  editor    = {Stefano Berardi and
               Mario Coppo and
               Ferruccio Damiani},
  title     = {Types for Proofs and Programs (TYPES'03)},
  pages     = {293-308},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3085},
  year      = {2004}
}

@article{Tiu:JAL12,
  author    = {Alwen Tiu and
               Alberto Momigliano},
  title     = {Cut elimination for a logic with induction and co-induction},
  journal   = {J. Applied Logic},
  volume    = {10},
  number    = {4},
  pages     = {330--367},
  year      = {2012},
  url       = {http://dx.doi.org/10.1016/j.jal.2012.07.007},
  doi       = {10.1016/j.jal.2012.07.007},
  timestamp = {Tue, 04 Dec 2012 18:34:55 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/japll/TiuM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@InProceedings{Momigliano:FOSSACS03,
   Author="Alberto Momigliano and Simon J. Ambler",
   Title="Multi-level Meta-reasoning with Higher-Order Abstract
   Syntax",
   Booktitle="Sixth International Conference on Foundations of
   Software Science and Computational Structures",
   Publisher="Springer-Verlag Lecture Notes in Computer Science",
   Pages="375--391",
   Month=apr,
   Year=2003
}

@InProceedings{Momigliano:LFMTP07,
  author    = {Alberto Momigliano and
               Alan J. Martin and
               Amy P. Felty},
  title     = {{Two-Level Hybrid}: A System for Reasoning Using Higher-Order Abstract Syntax},
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'07)},
   series    = {Electronic Notes in Theoretical Computer Science (ENTCS)},
   volume    = {196},
   year      = {2008},
   pages     = {85--93},
   publisher = {Elsevier}
}


@InProceedings{Monnier:PLPV06,
  author =   "Louis-Julien Guillemette and Stefan Monnier",
  title =    " Statically Verified Type-Preserving Code Transformations in {Haskell}",
  booktitle =    "Programming Languages meets Program Verification (PLPV)",
  series =       "Electronic Notes in Theoretical Computer Science (ENTCS)",
  publisher=     "Elsevier",
  year =     "2006"
}


@inproceedings{Monnier:PLPV10,
 author = {Stefan Monnier and David Haguenauer},
 title = {Singleton types here, singleton types there, singleton types everywhere},
 booktitle = {4th ACM SIGPLAN Workshop on Programming Languages Meets Program
                  Verification (PLPV'10)},
 year = {2010},
 pages = {1--8},
 numpages = {8},
 publisher = {ACM},
 keywords = {certified compilation, dependent types, singleton types},
} 


@InProceedings{Monnier:ICFP08,
  author =   "Louis-Julien Guillemette and Stefan Monnier",
  title     = {A type-preserving compiler in {H}askell},
  editor    = {James Hook and Peter Thiemann},
  booktitle = {13th ACM SIGPLAN International Conference
               on Functional Programming (ICFP'08)},
  year      = {2008},
  publisher = {ACM},
  pages     = {75-86},
}


@TechReport{Moody03tr,
  author =   {Jonathan Moody},
  title =    {Modal Logic as a Basis for Distributed Computation},
  institution =  {Carnegie Mellon University},
  year =     2003,
  number =   {CMU-CS-03-194},
  month =    oct
}

@InCollection{Moulton77,
  author =   "Janice Moulton",
  title =    "The Myth of the Neutral Man",
  booktitle =    "Feminism and Philosophy",
  OPTcrossref =  "",
  OPTkey =   "",
  publisher =    "Totowa, N.~J.~: Littlefield Adams",
  year =     "1977",
  editor =   "M.~Vetterling--Braggin",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTchapter =   "",
  OPTtype =      "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@article{Morrisett99,
    author = "Greg Morrisett and David Walker and Karl Crary and Neal Glew",
    title = "From {System F} to typed assembly language",
    journal = "ACM Transactions on Programming Languages and Systems",
    volume = "21",
    number = "3",
    pages = "527--568",
    year = "1999"
}

@inproceedings{Morrisett02stackbased,
    author = "J. Gregory Morrisett and Karl Crary and Neal Glew and David Walker",
    title = "Stack-Based Typed Assembly Language",
    booktitle = "Journal of Functional Programming",
    month = "January",
    year = "2002",
    url = "citeseer.nj.nec.com/morrisett01stackbased.html" 
}



@TechReport{Mundie:WP2002,
  author = 	 {Craig Mundie and  Pierre de Vries and Peter Haynes and Matt Corwine},
  title = 	 {Trustworthy computing},
  institution =  {Microsoft White Paper},
  year = 	 {2002},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{Mun:MSCS01,
      Author = "C. Mu{\~{n}}oz",
      Title  = "Dependent types and explicit substitutions",
      Journal = "Mathematical Structures in Computer Science",
      Issue = "Theory and applications of explicit substitutions",
      Volume = "11",
      Number = "1",
      Pages = "91--129",
      Month = "February",
      Note =  {It also appears as report
              NASA/CR-1999-209722 ICASE No. 99-43.},
      Year ={2001}
}

@Article{Mun:TCS01,
      Author = "C. Mu{\~{n}}oz",
      Title  = "Proof-term synthesis on dependent-type systems
                via explicit substitutions",
      Journal = "Theoretical Computer Science",
      Volume = "266",
      Pages= "407--440",
      year = {2001},
      Note = {It also appears as report
              NASA/CR-1999-209730 ICASE No. 99-47.}}

@Techreport{Mun:RR2762,
      Author = "C. Mu{\~{n}}oz",
      Title  = "Confluence and Preservation of Strong Normalisation in an
           Explicit Substitutions Calculus",
      Institution = {Unit\'e de recherche INRIA-Rocquencourt},
      Month = {Decembre},
      Number = {RR-2762},
      Year = {1995},
      }

@inproceedings{Murphy:LICS04,
   author = {Tom Murphy VII and Karl Crary and Robert Harper and Frank Pfenning},
   title = {A Symmetric Modal Lambda Calculus for Distributed Computing},
   booktitle = {LICS '04: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)},
   year = {2004},
   isbn = {0-7695-2192-4},
   pages = {286--295},
   doi = {http://dx.doi.org/10.1109/LICS.2004.7},
   publisher = {IEEE Computer Society},
   address = {Washington, DC, USA},
}

%%% N

@PhdThesis{Necula98phd,
  author =       "George C. Necula",
  title =        "Compiling with Proofs",
  school =       "Carnegie Mellon University",
  year =         "1998",
  month =        oct,
  note =         "Available as Technical Report CMU-CS-98-154",
  urlabstract =  "http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-154.html",
  urlps =        "http://reports-archive.adm.cs.cmu.edu/anon/1998/CMU-CS-98-154.ps",
  urlpdf =       "http://reports-archive.adm.cs.cmu.edu/anon/1998/CMU-CS-98-154.pdf",
  keywords =     "lf, pcc",
}

@InProceedings{Necula:POPL97,
  author =   "George C. Necula",
  title =    "Proof-carrying Code",
  booktitle =    "{24th Annual Symposium on Principles of Programming Languages (POPL'97)}",
  pages =    "106--119",
  year =     1997,
  publisher =    "ACM Press",
  month =  jan,
  keywords =     "PCC, LF, Elf"
}


@InProceedings{Necula98lics,
  author =   "George C. Necula and Peter Lee",
  title =    "Efficient Representation and Validation of Logical Proofs",
  booktitle =    "{13th Annual Symposium on Logic in
          Computer Science (LICS'98)}",
  editor =       "Vaughan Pratt",
  pages =    "93--104",
  year =     1998,
  publisher =    "IEEE Computer Society Press",
  address =  "Indianapolis, Indiana",
  month =    jun,
  keywords =     "PCC, LF, Elf"
}

@InCollection{NeculaLee+97:resource,
  author =       "George C. Necula and Peter Lee",
  title =        "Safe, Untrusted Agents using Proof-Carrying Code",
  booktitle =    "Mobile Agents and Security",
  publisher =    "Springer-Verlag LNCS 1419",
  year =         "1998",
  editor =       "Giovanni Vigna",
  month =        aug,
  pages =        "61--91",
  urlps =        "http://www.cs.berkeley.edu/~necula/lncs98.ps.gz",
  keywords =     "pcc, resource bounds",
}

@inproceedings{Necula96safe,
    author = "George C. Necula and Peter Lee",
    title = "Safe Kernel Extensions Without Run-Time Checking",
    booktitle = "2nd Symposium on Operating Systems Design and Implementation ({OSDI} '96), October 28--31, 1996. Seattle, {WA}",
    publisher = "USENIX",
    address = "Berkeley, CA, USA",
    pages = "229--243",
    year = "1996",
    url = "citeseer.nj.nec.com/necula96safe.html" }

@inproceedings{Necula+01:oracle,
    author = "G. Necula and S. Rahul",
    title = "Oracle-based checking of untrusted software",
    booktitle = "28th ACM SIGPLAN-SIGACT Symposium on Principles of
    Programming Languages (POPL'01)",
    year = "2001",
    pages = "142-154",
    url = "citeseer.nj.nec.com/necula01oraclebased.html"
}

@InProceedings{Necula98pldi,
  author =       "George C. Necula and Peter Lee",
  title =        "The Design and Implementation of a Certifying
                 Compiler",
  editor =       "Keith D. Cooper",
  pages =        "333--344",
  booktitle =    "Proceedings of the Conference on Programming Language
                 Design and Implementation",
  year =         "1998",
  publisher =    "ACM Press",
  address =      "Montreal, Canada",
  month =        jun,
  urlps =        "http://foxnet.cs.cmu.edu/papers/necula-pldi98.ps",
  urlabstract =  "http://foxnet.cs.cmu.edu/papers/necula-pldi98.abstract",
  keywords =     "lf, pcc",
}

@TechReport{Necula97tr172,
  author =       "George C. Necula and Peter Lee",
  title =        "Efficient Representation and Validation of Logical
                 Proofs",
  institution =  "School of Computer Science, Carnegie Mellon
                 University",
  year =         "1997",
  number =       "CMU-CS-97-172",
  month =        oct,
  urlabstract =  "http://reports-archive.adm.cs.cmu.edu/anon/1997/abstracts/97-172.html",
  urlps =        "http://reports-archive.adm.cs.cmu.edu/anon/1997/CMU-CS-97-172.ps",
  keywords =     "lf, pcc",
}

@InProceedings{Necula97popl,
  author =       "George C. Necula",
  title =        "Proof-Carrying Code",
  booktitle =    "Proceedings of the Symposium on Principles of
                 Programming Languages",
  year =         "1997",
  publisher =    "ACM Press",
  address =      "Paris, France",
  month =        jan,
  editor =       "Neil D. Jones",
  pages =        "106--119",
  urlps =        "http://foxnet.cs.cmu.edu/papers/necula-popl97.ps",
  urlabstract =  "http://foxnet.cs.cmu.edu/papers/necula-popl97.abstract",
  keywords =     "lf, pcc",
}

@TechReport{Necula96tr165,
  author =       "George C. Necula and Peter Lee",
  title =        "Proof-Carrying Code",
  institution =  "School of Computer Science, Carnegie Mellon
                 University",
  year =         "1996",
  number =       "CMU-CS-96-165",
  month =        sep,
  urlps =        "http://foxnet.cs.cmu.edu/papers/necula-ppctr.ps",
  urlabstract =  "http://foxnet.cs.cmu.edu/papers/necula-ppctr.abstract",
  keywords =     "lf, pcc",
}

@InProceedings{Nadathur88,
  author =      "Gopalan Nadathur and Dale Miller",
  title =       "An Overview of {$\lambda$Prolog}",
  editor =      "Kenneth A. Bowen and Robert A. Kowalski",
  booktitle =   "Fifth International Logic Programming Conference",
  address =     "Seattle, Washington",
  publisher =   "MIT Press",
  pages =       "810--827",
  month =       aug,
  year =        1988,
  keywords =    "lambda-Prolog"
}

@TechReport{Nadathur93trb,
  author =      "Gopalan Nadathur and Bharat Jayaraman and Debra Sue Wilson",
  title =       "Implementation Considerations for Higher-Order Features in
                  Logic Programming",
  month =       jun,
  year =        1993,
  institution = "Department of Computer Science, Duke University",
  number =      "CS-1993-16",
  urldvi =      "http://cs-www.uchicago.edu/~gopalan/papers/hoimp.dvi.Z",
  keywords =    "lambda-Prolog"
}


@article{Nadathur:TCS98,
  author    = {Gopalan Nadathur and
               Debra Sue Wilson},
  title     = {A Notation for Lambda Terms: A Generalization of Environments},
  journal   = {Theoretical Computer Science},
  volume    = {198},
  number    = {1-2},
  year      = {1998},
  pages     = {49-98},
  ee        = {http://dx.doi.org/10.1016/S0304-3975(97)00184-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@article{Nadathur:JFLP99,
  author    = {Gopalan Nadathur},
  title     = {A Fine-Grained Notation for Lambda Terms and Its Use in
               Intensional Operations},
  journal   = {Journal of Functional and Logic Programming},
  volume    = {1999},
  number    = {2},
  year      = {1999},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@InProceedings{Nadathur99cade,
  author =       "Gopalan Nadathur and Dustin J. Mitchell",
  title =        "System Description: {Teyjus} -- A Compiler and Abstract
                  Machine Based Implementation of {L}ambda {P}rolog",
  editor =       "H. Ganzinger",
  pages =        "287--291",
  booktitle =    "Proceedings of the 16th International Conference on
                  Automated Deduction (CADE-16)",
  year =         1999,
  publisher =    "Springer-Verlag LNCS",
  address =      "Trento, Italy",
  month =        jul,
  keywords =     "lambda-Prolog"
}

@InProceedings{Nadathur01,
  author =      "Gopalan Nadathur",
  title =       "The Metalanguage {$\lambda$Prolog} and its implementation",
  editor =      "H. Kuchen and K. Ueda",
  booktitle =   "Proceedings of the Fifth International Symposium on Functional
and Logic Programming",
  address =     "Tokyo, Japan",
  publisher =   "Springer-Verlag, Lecture Notes in Computer Science(LNCS) 2024",
  OPTpages =       "810--827",
  month =       "March",
  year =        "2001",
  keywords =    "lambda-Prolog"
}


@inproceedings{LiangNadathur:RTA02,
  author    = {Chuck Liang and
               Gopalan Nadathur},
  title     = {Tradeoffs in the Intensional Representation of Lambda Terms},
  editor    = {Sophie Tison},
  booktitle = {13th International
               Conference Rewriting Techniques and Applications (RTA'02), Copenhagen, Denmark}, 
  year      = {2002},
  pages     = {192-206},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2378},
  ee        = {http://link.springer.de/link/service/series/0558/bibs/2378/23780192.htm},
  crossref  = {DBLP:conf/rta/2002},
  isbn      = {3-540-43916-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{NadathurQi:03,
  author    = {Gopalan Nadathur and
               Xiaochu Qi},
  title     = {Explicit substitutions in the reduction of lambda terms},
  booktitle = {5th International ACM SIGPLAN Conference
               on Principles and Practice of Declarative Programming (PPDP'03)},
  year      = {2003},
  pages     = {195-206},
  publisher = {ACM},
}


@article{LiangNadathurQi:JAR05,
  author    = {Chuck Liang and
               Gopalan Nadathur and
               Xiaochu Qi},
  title     = {Choices in Representation and Reduction Strategies for Lambda
               Terms in Intensional Contexts},
  journal   = {Journal of Automated Reasoning},
  volume    = {33},
  number    = {2},
  year      = {2005},
  pages     = {89-132},
  ee        = {http://www.springerlink.com/index/10.1007/s10817-004-6885-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@TechReport{Nadathur03Draft,
  author =      "Gopalan Nadathur",
  title =       "A treatment of higher-order features in logic programming",
  month =       jan,
  year =        2003,
  institution = "Department of Computer Science and Engineering, University of Minnesota",
  number =      "draft, available upon request",
  keywords =    "lambda-Prolog"
}


@inproceedings{Nadathur:LPAR05,
  author    = {Gopalan Nadathur and
               Xiaochu Qi},
  title     = {Optimizing the Runtime Processing of Types in Polymorphic
               Logic Programming Languages.},
  editor    = {Geoff Sutcliffe and Andrei Voronkov},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning,
               12th International Conference, LPAR 2005, Montego Bay, Jamaica,
               December 2-6, 2005, Proceedings},
  year      = {2005},
  pages     = {110-124},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3835},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Naish:JFLP97,
      author={Lee Naish},
      title={A Declarative Debugging Scheme},
      journal={Journal of Functional and Logic Programming},
      volume={1997},
      number={3},
      publisher={The MIT Press},
      month={April},
      year={1997},
      abstractURL = "http://www.cs.mu.oz.au/~lee/papers/dds/",
      comment = {Also Technical Report 95/1, Department of Computer
                        Science, University of Melbourne, 16 pages}
}

@InProceedings{nanevski02icfp,
  author =   {Aleksandar Nanevski},
  title =    {Meta-programming with Names and Necessity},
  booktitle =    {\icfp{02}},
  pages =    {206--217},
  address =      {Pittsburgh, Pennsylvania},
  year =     {2002},
  note =         {A significant revision is available as a technical report CMU-CS-02-123R,
                  Computer Science Department, Carnegie Mellon University}
}

@Article{nanevski02jfp,
  author    = {Aleksandar Nanevski and Frank Pfenning},
  title     = {Staged Computation with Names and Necessity},
  journal   = {Journal of Functional Programming},
  year      = {2002},
  note      = {To appear.}
}

@InProceedings{nanevski03ppdp,
  author    = {Aleksandar Nanevski},
  title     = {From Dynamic Binding to State via Modal Possibility},
  booktitle = {{I}nternational {C}onference on {P}rinciples and {P}ractice of {D}eclarative {P}rogramming{(PPDP03)}},
  pages     = {207--218},
  year      = {2003},
  address   = {Uppsala, Sweden}
}

@InProceedings{Nanevski:Merlin03,
 author     = {Aleksandar Nanevski and Brigitte Pientka and Frank Pfenning},
 title      = {A Modal Foundation for Meta-Variables},
 booktitle  = {MERLIN'03: Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding},
 pages      = {159--170},
 year       = {2003},
 editor     = {Furio Honsell and Marino Miculan and Alberto Momigliano},
 address    = {Uppsala, Sweden},
 publisher  = ACM
}

@Article{Nanevski:ICML05,
   author  = {Aleksandar Nanevski and Frank Pfenning and Brigitte Pientka},
   title   = {Contextual modal type theory},
   journal = {{ACM Transactions on Computational Logic}},
   year    = {2008},
   volume  = {9},
   number  = {3},
   pages   = {1--49}
}


@article{Nanevski:JFP08,
  author    = {Aleksandar Nanevski and
               J. Gregory Morrisett and
               Lars Birkedal},
  title     = {Hoare type theory, polymorphism and separation},
  journal   = {Journal of Functional Programming},
  volume    = {18},
  number    = {5-6},
  year      = {2008},
  pages     = {865-911}
}



@Article{Naraschewski+JAR99,
  author      = "Wolfgang Naraschewski and Tobias Nipkow",
  title       = "Type Inference Verified: Algorithm {W} in {I}sabelle/{HOL}",
  journal     = JAR,
  year        = 1999,
  volume      = 23,
  number      = "3--4",
  pages       = "299--318"
}

@article{Narboux:LFMTP08,
  author    = {Julien Narboux and
               Christian Urban},
  title     = {Formalising in {N}ominal {I}sabelle {C}rary's Completeness Proof
               for Equivalence Checking},
  journal   = {Electr. Notes Theor. Comput. Sci.},
  volume    = {196},
  year      = {2008},
  pages     = {3-18},
  ee        = {http://dx.doi.org/10.1016/j.entcs.2007.09.014},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}



@InCollection{NewellSimon63,
  author =   "A.~Newell, H.~Simon",
  title =    "Empirical Explorations with the Logic Theory
                  Machine: A case study in Heuristics",
  booktitle =    "Computers and Thought",
  OPTcrossref =  "",
  OPTkey =   "",
  publisher =    "McGraw-Hill",
  year =     "1963",
  editor =   "E.A.~Feigenbaum, J.~Feldman",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTchapter =   "",
  OPTtype =      "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{NieuwenhuisOliveras:RTA05,
  author    = {R. Nieuwenhuis and A. Oliveras},
  title     = {{Proof-Producing Congruence Closure}},
  pages     = {453--468},
  booktitle = {16th International Conference on Term Rewriting and Applications, RTA'05},
  year      = {2005},
  editor    = {J. Giesl},
  series    = {Lecture Notes in Computer Science},
  volume    = {3467},
  publisher = {Springer}
}

@BOOK{Nipkow-Paulson-Wenzel:2002,
  author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
  title = {Isabelle/{HOL}: A Proof Assistant for Higher-Order Logic},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = 2283,
  year = 2002
}

@inproceedings{Nipkow-LICS-93,
author="Tobias Nipkow",
title="Functional Unification of Higher-Order Patterns",
booktitle= "8th IEEE Symposium Logic in Computer Science (LICS'93)",
publisher =  "IEEE Computer Society Press",
pages="64--74",
year=1993}


@InProceedings{NipkowPaulson92,
  author =   "Tobias Nipkow and Lawrence C.~Paulson",
  title =    "Isabelle-91",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) vol.~607",
  pages =    "673-676",
  booktitle =    CADE92,
  year =     "1992",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Isabelle, tactical theorem proving"
}

@article{Nishizaki:HOSC00,
 author = {Shin-Ya Nishizaki},
 title = {A Polymorphic Environment Calculus and its Type-Inference Algorithm},
 journal = {Higher Order Symbol. Comput.},
 volume = {13},
 number = {3},
 year = {2000},
 pages = {239--278},
 publisher = {Kluwer Academic Publishers},
 address = {Hingham, MA, USA},
 }

@Misc{Noltemeier96,
  OPTkey =   "",
  author =   "Axel Noltemeier",
  title =    "Inkrementelle {B}eweisplanung mit {M}etaregeln",
  howpublished = "Diplomarbeit," # THD,
  year =     "1996",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "incremental proof planning, tiger, meta-rules"
}

@Misc{Noltemeier96engl,
  OPTkey =   "",
  author =   "Axel Noltemeier",
  title =    "Inkrementelle {B}eweisplanung mit {M}etaregeln",
  howpublished = "Diploma Thesis, " # UoD,
  year =     "1996",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "incremental proof planning, tiger, meta-rules"
}

@Book{NordstroemPetersonSmith90a,
  author      = "Bengt Nordstr{\"o}m and Kent Petersson and Jan M. Smith",
  title       = "Programming in Martin-L{\"o}fs Type Theory. An introduction",
  publisher   = "Clarendon Press, Oxford",
  year        = "1990",
  OPTeditor   = "",
  OPTvolume   = "",
  OPTseries   = "",
  OPTaddress  = "",
  OPTedition  = "",
  OPTmonth    = ""
}

@phdthesis{Norell:phd07,
  author     = {Ulf Norell},
  title      = {Towards a practical programming language based on dependent type theory},
  school     = {Department of Computer Science and Engineering, Chalmers University of Technology},
  month      = sep,
  year       = {2007},
  note       = {{T}echnical {R}eport 33D},
  OPTaddress = {SE-412 96 G\"{o}teborg, Sweden}
}

@Book{Nye90,
  author =   "Andrea Nye",
  title =    "Words of Power: A feminist Reading in the History of Logic",
  publisher =    "Routledge, Chapman and Hall, Inc.",
  year =     "1990",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

%%% O

@InProceedings{Ohlenbusch00,
  author      = "Enno Ohlebusch and Claus Claves and Claude Marche",
  title       = "TALP: A Tool for the Termination Analysis of Logic Programs",
  booktitle   = "Proceedings of the 11th International Conference on Rewriting Techniques and Applications (RTA'00), Norwich, UK",
  month           = "July",
  year        = 2000,
  OPTkey      = "",
  editor      = "Leo Bachmair",
  volume      = "1833",
  OPTnumber   = "",
  series      = "Lecture Notes in Computer Science (LNCS)",
  pages       = ". 270-273",
  OPTorganization = "",
  publisher       = "Springer"
}

@InProceedings{OttenKreitz95a,
  author      = "Jens Otten and Christoph Kreitz",
  title       = "A Connection Based Proof Method for Intuitionistic Logic",
  booktitle   = "Proceedings of the 4$^t{}^h$ Workshop on Theorem Proving with
             Analytic Tableaux and Related Methods",
  year        = 1995,
  OPTkey      = "",
  editor      = "P.~Baumgartner and R.~H{\"a}hnle and J.~Posegga",
  volume      = 918,
  OPTnumber   = "",
  series      = LNAI,
  pages       = "122--137",
  OPTorganization = "",
  publisher       = SPR
}

@InProceedings{OttenKreitz96b,
  author          = "Jens Otten and Christoph Kreitz",
  title           = "A {U}niform {P}roof {P}rocedure  for
                {C}lassical and {N}on-classical {L}ogics",
  booktitle   = "KI-96: Advances in Artificial Intelligence",
  year        = 1996,
  OPTkey      = "",
  editor      = "G.~Gárz \& S.~Hálldobler",
  volume      = 1137,
  OPTnumber   = "",
  series      = LNAI,
  pages       = "307--319",
  OPTorganization = "",
  publisher       = SPR,
  OPTaddress      = "",
  OPTmonth    = "",
  note        = "Also technical report AIDA--96--02"
}

@inproceedings{Oury:PLPV07,
 author = {Oury, Nicolas},
 title = {Pattern matching coverage checking with dependent types using set approximations},
 booktitle = {Workshop on {P}rogramming {L}anguages meets {P}rogram
                  {V}erification (PLPV'07)},
 year = {2007},
 pages = {47--56},
 numpages = {10},
 publisher = {ACM},
 keywords = {coverage checking, pattern matching, set approximation},
} 



 series = {ICFP '08},
 year = {2008},
 isbn = {978-1-59593-919-7},
 location = {Victoria, BC, Canada},

 numpages = {12},
 url = {http://doi.acm.org/10.1145/1411204.1411213},
 doi = {http://doi.acm.org/10.1145/1411204.1411213},
 acmid = {1411213},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {dependent types, domain-specific embedded languages},
} 



@article{Oury:ICFP08,
 author = {Oury, Nicolas and Swierstra, Wouter},
 title = {{T}he {P}ower of {P}i},
 editor    = {James Hook and
               Peter Thiemann},
 booktitle = {13th ACM SIGPLAN International Conference on Functional Programming (ICFP
08)},
 year = {2008},
 publisher = {ACM},
 pages = {39--50},
 keywords = {dependent types, domain-specific embedded languages}
} 




%%% P

@article{Parberry:1989,
 author = {Parberry, I.},
 title = {A guide for new referees in theoretical computer science},
 journal = {SIGACT News},
 volume = {20},
 issue = {4},
 month = {November},
 year = {1989},
 issn = {0163-5700},
 pages = {92--99},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/74074.74090},
 doi = {http://doi.acm.org/10.1145/74074.74090},
 acmid = {74090},
 publisher = {ACM},
 address = {New York, NY, USA},
} 


@inproceedings{Parigot:KGC93,
 author = {Michel Parigot},
 title = {Classical Proofs as Programs},
 booktitle = {KGC '93: Proceedings of the Third Kurt G"odel Colloquium on Computational Logic and Proof Theory},
 year = 1993,
 pages = {263--276},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }



@inproceedings{Paulin-Mohring:TLCA93,
  author    = {Christine Paulin-Mohring},
  title     = {Inductive Definitions in the system Coq - Rules and Properties},
  editor    = {Marc Bezem and
               Jan Friso Groote},
  booktitle  = {International Conference on Typed Lambda Calculi and Applications(TLCA '93)},
  year      = {1993},
  pages     = {328-345},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {664},
}


@inproceedings{Paulson:CADE94,
  author    = {Lawrence C. Paulson},
  title     = {A Fixedpoint Approach to Implementing (Co)Inductive Definitions},
  editor    = {Alan Bundy},
  booktitle = {12th International Conference on Automated Deduction (CADE-12), Nancy, France}, 
  year      = {1994},
  pages     = {148-161},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {814},
  isbn      = {3-540-58156-1},
}


@inproceedings{Paulson:PLI00,
  author    = {Lawrence C. Paulson},
  title     = {A fixedpoint approach to (co)inductive and (co)datatype
               definitions},
  editor    = {Gordon D. Plotkin and
               Colin Stirling and
               Mads Tofte},
  booktitle = {Proof, Language, and Interaction, Essays in Honour of Robin
               Milner},
  publisher = {The MIT Press},
  pages     = {187-212},
  isbn      = {978-0-262-16188-6},
  year      = 2000,
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@Article{Paulson86,
  author =      "Lawrence C. Paulson",
  title =       "Natural Deduction as Higher-order Resolution",
  journal =     "Journal of Logic Programming",
  volume =      3,
  pages =       "237--258",
  year =        1986,
  urldvi =      "http://www.cl.cam.ac.uk/Research/Reports/TR082-lcp-higher-order-resolution.dvi.gz",
  keywords =    "Isabelle"
}

@InProceedings{Paulson88cade,
  author =      "Lawrence C. Paulson",
  title =       "Isabelle: The Next Seven Hundred Theorem Provers",
  editor =      "E. Lusk and R. Overbeek",
  booktitle =   "9th International Conference on Automated Deduction (CADE-9)",
  address =     "Argonne, Illinois",
  publisher =   "Springer Verlag Lecture Notes in Computer Science (LNCS) 310",
  year =        1988,
  pages =       "772--773",
  note =        "System abstract",
  urldvi =      "http://www.cl.cam.ac.uk/users/lcp/papers/CADE9.dvi.gz",
  keywords = "Iabelle"
}


@article{Paulson98inductive,
    author = "Lawrence C. Paulson",
    title = "The Inductive Approach to Verifying Cryptographic Protocols",
    journal = "Journal of Computer Security",
    volume = "6",
    pages = "85--128",
    year = "1998",
    url = "citeseer.nj.nec.com/paulson00inductive.html" 
}

@InProceedings{Padawitz92,
  author =   "Peter Padawitz",
  title =    "Generic Induction Proofs",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "175-197",
  booktitle =    CTRS92,
  year =     "1992",
  organization = SPR,
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "conditional term rewriting systems, inductive reasoning"
}

@ARTICLE{Pelletier86,
   AUTHOR   = "Francis Jeffry Pelletier",
   JOURNAL  = JAR,
   PAGES    = "191-216",
   TITLE    = "Seventy-Five Problems for Testing Automatic Theorem Provers",
   VOLUME   = "2",
   YEAR     = "1986",
   keywords = "automated theorem proving"
}


@InCollection{Perlis88,
  author =   "Donald Perlis",
  title =    "Meta in Logic",
  booktitle =    MLAaR,
  OPTcrossref =  "",
  OPTkey =   "",
  publisher =    NoHo,
  year =     "1988",
  editor =   "Pattie Maes and Daniele Nardi",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTchapter =   "",
  OPTtype =      "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  pages =    "37-49",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "meta-reasoning"
}


@article{Peterson81,
   author    = "Gerald E.\ Peterson",
   title     = "Complete Sets of Reduction for Some Equational Theories",
   journal   = JACM,
   year      = "1981",
   month     = apr,
   volume    = "28",
   number    = "2",
   pages     = "233-264",
   optkeyword = "Knuth-Bendix completion"
}


@Article{PetersonStickel81,
  author =   "Gerald E.\ Peterson and Mark E.\ Stickel",
  title =    "Complete Sets of Reductions for Some Equational Theories",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JACM,
  year =     "1981",
  volume =   "28",
  number =   "2",
  pages =    "233-264",
  month =    apr,
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "reductions, Knuth-Bendix comletion"
}


@inproceedings{Michaylov:PPCP93,
  author    = {Spiro Michaylov and
               Frank Pfenning},
  title     = {Higher-Order Logic Programming as Constraint Logic Programming},
  booktitle = {First Workshop on Principles and Practice of Constraint Programming},
  year      = {1993},
  pages     = {210-218},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@InProceedings{Pfenning:LICS01,
  author =       "Frank Pfenning",
  title =        "Intensionality, Extensionality, and Proof Irrelevance in
                  Modal Type Theory",
  editor =       "J. Halpern",
  booktitle =    "Proceedings of the 16th Annual Symposium on Logic in
                  Computer Science (LICS'01)",
  pages =        "221--230",
  year =         2001,
  publisher =    "IEEE Computer Society Press",
  address =      "Boston, Massachusetts",
  month =        jun,
  keywords =     "LF, Elf",
  urlpdf =       "http://www.cs.cmu.edu/~fp/papers/lics01.pdf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/lics01.ps"
}

@InProceedings{Pfenning91lics,
  author =      "Frank Pfenning",
  title =       "Unification and Anti-Unification in the {Calculus} of
                  {Constructions}",
  booktitle =   "Sixth Annual {IEEE} Symposium on Logic in Computer Science",
  address =     "Amsterdam, The Netherlands",
  month =       jul,
  year =        "1991",
  pages =       "74--85",
  urldvi =      "http://www.cs.cmu.edu/~fp/papers/lics91.dvi.gz",
  urlps =       "http://www.cs.cmu.edu/~fp/papers/lics91.ps.gz",
  keywords =    "LF, Elf, unification"
}

@InProceedings{Pfenning91lf,
  author    = {Frank Pfenning},
  title     = {Logic Programming in the {LF} Logical Framework},
  booktitle = {Logical Frameworks},
  editor    = {G\'{e}rard Huet and Gordon Plotkin},
  publisher = {Cambridge University Press},
  pages     = {149--181},
  year      = {1991},
  keywords  = {LF, Elf}
}

@InProceedings{Hannan92lics,
  author =      "John Hannan and Frank Pfenning",
  title =       "Compiler Verification in {LF}",
  booktitle =   "Seventh Annual {IEEE} Symposium on Logic in Computer Science",
  address =     "Santa Cruz, California",
  month =       jun,
  year =        "1992",
  editor =      "Andre Scedrov",
  pages =       "407--418",
  urldvi =      "http://www.cs.cmu.edu/~fp/papers/lics92.dvi.gz",
  urlps =       "http://www.cs.cmu.edu/~fp/papers/lics92.ps.gz",
  keywords =    "LF, Elf"
}

@InProceedings{Pfenning-reftypes:93,
  author =  "Frank Pfenning",
  title =   "Refinement Types for Logical Frameworks",
  booktitle =   "Informal Proceedings of the Workshop on Types for Proofs
          and Programs",
  editor =  "Herman Geuvers",
  address = "Nijmegen, The Netherlands",
  month =   may,
  year =    "1993",
  pages =   "285--299",
  urldvi =  "http://www.cs.cmu.edu/~fp/papers/rlf93.dvi.gz",
  urlps =   "http://www.cs.cmu.edu/~fp/papers/rlf93.ps.gz",
  keywords =    "LF, Elf, lambda-Prolog"
}

@InProceedings{Pfenning88pldi,
  author =      "Frank Pfenning and Conal Elliott",
  title =       "Higher-Order Abstract Syntax",
  booktitle =   "{ACM SIGPLAN } Symposium on Language
                  Design and Implementation (PLDI'88)",
  month =       jun,
  year =        "1988",
  pages =       "199--208",
  urlps =       "http://www.cs.cmu.edu/~fp/papers/pldi88.ps.gz",
  keywords =    "lambda-Prolog"
}

@InProceedings{Pfenning89lics,
  author =      "Frank Pfenning",
  title =       "{Elf}: A Language for Logic Definition and Verified
                  Meta-Programming",
  booktitle =   "Fourth Annual Symposium on Logic in Computer Science",
  address =     "Pacific Grove, California",
  publisher =   "IEEE Computer Society Press",
  month =       jun,
  year =        1989,
  pages =       "313--322",
  urldvi =      "http://www.cs.cmu.edu/~fp/papers/lics89.dvi.gz",
  urlps =       "http://www.cs.cmu.edu/~fp/papers/lics89.ps.gz",
  keywords =    "LF, Elf"
}

@InProceedings{Pfenning95mfps,
  author =       "Frank Pfenning and Hao-Chi Wong",
  title =        "On a Modal $\lambda$-Calculus for {S4}",
  booktitle =    "Proceedings of the Eleventh Conference on
                  Mathematical Foundations of Programming Semantics",
  editor =       "S. Brookes and M. Main",
  year =         1995,
  address =      "New Orleans, Louisiana",
  month =        mar,
  note =         "{\em Electronic Notes in Theoretical Computer
                  Science}, Volume 1, Elsevier",
  keywords =     "misc",
  urldvi =       "http://www.cs.cmu.edu/~fp/papers/mfps95.dvi.gz",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/mfps95.ps.gz"
}

@InProceedings{Pfenning95lics,
  author =       "Frank Pfenning",
  title =        "Structural Cut Elimination",
  editor =       "D. Kozen",
  booktitle =    "Proceedings of the Tenth Annual Symposium on Logic in
                  Computer Science",
  year =         1995,
  publisher =    "IEEE Computer Society Press",
  address =      "San Diego, California",
  month =        "June",
  pages =        "156--166",
  keywords =     "LF, Elf, linear",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/lics95.ps.gz"
}

@TechReport{Pfenning96,
  author =   "Frank Pfenning",
  title =    "The practice of logical frameworks",
  institution =  "FB Mathematik, THD",
  year =     "1996",
  OPTkey =   "",
  OPTtype =      "",
  number =   "pre-print 1813",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Misc{Pfenning97,
  author =   "Frank Pfenning",
  title =    "Computation and Deduction",
  institution =  "Course Notes - Carnegie Mellon University",
  year =     "1997",
  OPTkey =   "",
  OPTtype =      "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  annote =   "Available online"
}


@InProceedings{Pfenning98types
,
  author =   "Frank Pfenning and Carsten Sch{\"u}rmann",
  title =    "Algorithms for Equality and Unification in the
          Presence of Notational Definitions",
  editor =   "T. Altenkirch and W. Naraschewski and B. Reus",
  booktitle =    "Types for Proofs and Programs",
  year =     1998,
  publisher =    "Springer-Verlag LNCS 1657",
  pages     =    "",
  keywords =     "LF, Elf",
  urlps =    "http://www.cs.cmu.edu/~fp/papers/types98.ps.gz"
}




@Manual{Twelf:POPLtutorial09,
  title = 	 {POPL Tutorial: Mechanizing meta-theory with LF and Twelf},
  OPTkey = 	 {},
  OPTauthor = 	 {},
  organization = {Carnegie Mellon University},
  OPTaddress = 	 {},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  year = 	 {2009},
  note = 	 {available at {\url{http://twelf.org/wiki/POPL_Tutorial}}},
  OPTannote = 	 {}
}

@InProceedings{Pfenning99cade,
  author =       "Frank Pfenning and Carsten Sch{\"u}rmann",
  title =        "System Description: {Twelf} --- A Meta-Logical Framework for Deductive Systems",
  editor =       "H. Ganzinger",
  pages =        "202--206",
  OPTshortbooktitle =    "Int'l Conf.\ Automated Deduction (CADE-16)",
  booktitle =    "{16th International Conference on
                  Automated Deduction (CADE-16)}",
  year =         1999,
  series = "Lecture Notes in Artificial Intelligence (LNAI 1632)",
  publisher =    "Springer",
  OPTaddress =      "Trento, Italy",
  OPTmonth =        jul,
  keywords =     "LF, Elf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/cade99.ps.gz"
}

@article{Pfenning01mscs,
    author = "Frank Pfenning and Rowan Davies",
    title = "A judgmental reconstruction of modal logic",
    journal = "Mathematical Structures in Computer Science",
    volume = "11",
    number = "4",
    pages = "511-540",
    year = "2001",
    keywords =     "modal logic"
}

@inproceedings{Pfenning:LFHB01,
 author = {Frank Pfenning},
 title = {Logical frameworks},
 editor = {A. Robinson and A. Voronkov},
 booktitle = {Handbook of Automated Reasoning},
 year = {2001},
 OPTisbn = {0-444-50812-0},
 pages = {1063--1147},
 publisher = {Elsevier},
 OPTaddress = {Amsterdam},
}

@InProceedings{Rohwedder96esop,
  author =       "Ekkehard Rohwedder and Frank Pfenning",
  title =        "Mode and Termination Checking for Higher-Order Logic
                  Programs",
  editor =       "Hanne Riis Nielson",
  booktitle =    "Proceedings of the European Symposium on Programming",
  year =         1996,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS) 1058",
  address =      "Link{\"o}ping, Sweden",
  month =        apr,
  pages =        "296--310",
  keywords =     "LF, Elf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/esop96.ps.gz"
}

@inproceedings{Pfenning:TLCA07,
  author    = {Frank Pfenning},
  title     = {On a Logical Foundation for Explicit Substitutions},
  editor    = {Simona Ronchi Della Rocca},
  booktitle     = {8th International Conference on Typed Lambda Calculi and
                  Applications (TLCA'07)},
  year      = {2007},
  pages     = {1},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {4583},
  doi       = {10.1007/978-3-540-73228-0_1}
}




@InProceedings{Pollack90,
  author = {Robert Pollack},
  title  = {Implicit Syntax},
  editor = {G. Huet and G. Plotkin},
  booktitle   = {Proceedings of First Workshop on Logical Frameworks},
  pages = {421-434},
  year   = {1990},
}

@TechReport{Polakow98,
  author =      "Jeff Polakow and Frank Pfenning",
  title =       "Ordered linear logic programming",
  month =       dec,
  year =        1998,
  institution = "Department of Computer Science, Carnegie Mellon University",
  number =      "CMU-CS-98-183",
  urldvi =      "http://www.cs.cmu.edu/~fp/www/papers/CMU-CS-98-183.ps.gz",
  keywords =    "Twelf, logical framework"
}
@techreport{Remy:91,
  author = {Didier R{\'e}my},
  title = {Type Inference for Records in a natural Extension of {ML}},
  institution = {Institut National de Recherche en Informatique et Automatisme},
  year = 1991,
  type = {Research Report},
  number = 1431,
  address = {Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France},
  month = may,
  dvi = {ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/type-inf-records.dvi.gz},
  ps = {ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/type-inf-records.ps.gz},
  category = {C}
}
@PhDThesis{Scagnetto:PHD01,
  author =      "Ivan Scagnetto",
  title =       "Reasoning about names in Higher-order Abstract Syntax",
  school =      "University of Udine",
  year =        "2001",
  OPTaddress =  "",
  OPTmonth =    "",
  OPTnote =     "",
  keywords =    "higher-order abstract syntax (HOAS)"
}

@inproceedings{Schoop:CSL04,
  author    = {Ulrich Sch{\"o}pp and Ian Stark},
  title     = {A Dependent Type Theory with Names and Binding},
  editor    = {Jerzy Marcinkowski and Andrzej Tarlecki},
  booktitle = {13th Annual Conference on Computer Science Logic (CSL), Karpacz, Poland},
  pages     = {235--249},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3210},
  year      = {2004},
  isbn      = {3-540-23024-6},
  OPTee        = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3210{\&}spage=235},
  OPTcrossref  = {DBLP:conf/csl/2004},
  OPTbibsource = {DBLP, http://dblp.uni-trier.de}
}


@PhdThesis{Poswolsky08,
  author =       {},
  title    = {Functional Programming with Logical Frameworks},
  school =       {Yale University},
  year =         {2008},
  OPTmonth =     dec,
  note =      {\url{http://www.cs.yale.edu/homes/poswolsk/papers/poswolsky-dissertation.pdf}}
}

@book{Poswolsky08book,
  title    = {{Functional Programming with Logical Frameworks: The Delphin Project}},
  author   = {Adam Brett Poswolsky},
  year     = {2008},
  isbn     = {1440474923, 9781440474927},
  publisher= {CreateSpace},
  address  = {Paramount, CA}
}

@inproceedings{Schurmann:LICS08,
  author    = {Carsten Sch{\"u}rmann and
               Jeffrey Sarnat},
  title     = {Structural Logical Relations},
  booktitle = {23rd Annual Symposium on
               Logic in Computer Science (LICS), Pittsburgh,
               PA, USA},
  year      = {2008},
  pages     = {69-80},
  publisher = {IEEE Computer Society},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.44},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
 @Comment isbn      = {978-0-7695-3183-0},


@TechReport{Schuermann:TR07,
  author =      "Adam B. Poswolsky and Carsten Sch{\"u}rmann",
  title =       "Programming with higher-order encodings and dependent types",
  month =       jul,
  year =        "2007",
  institution = "Department of Computer Science, Yale University",
  number =      "YALEU/DCS/TR1375",
  keywords =    "Twelf, logical framework"
}

@inproceedings{Schuermann:ESOP08,
  author    = {Adam B. Poswolsky and Carsten Sch{\"u}rmann},
  title     = {Practical programming with higher-order encodings and dependent types},
  booktitle = {{17th European Symposium on Programming (ESOP '08)}},
  pages     = {93--107},
  OPTmonth     = {mar},
  year      = {2008},
  journal   = {Lecture Notes in Computer Science},
  volume    = {4960},
  publisher = {Springer}
}

@inproceedings{Schuermann:TLCA05,
  author    = {Carsten Sch{\"u}rmann and Adam Poswolsky and Jeffrey Sarnat},
  title     = {The $\nabla$-Calculus. {Functional} Programming with Higher-Order Encodings},
  editor    = {Pawel Urzyczyn},
  booktitle = {Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA'05)},
  year      = 2005,
  pages     = {339-353},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = 3461
}

@InProceedings{Schurmann98cade,
  author =       "Carsten Sch{\"u}rmann and Frank Pfenning",
  title =        "Automated Theorem Proving in a Simple Meta-Logic for {LF}",
  editor =       "Claude Kirchner and H{\'e}l{\`e}ne Kirchner",
  pages =        "286--300",
  booktitle =    "Proceedings of the 15th International Conference on
                  Automated Deduction (CADE-15)",
  year =         1998,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS) 1421",
  address =      "Lindau, Germany",
  month =        jul,
  keywords =     "LF, Elf",
  urlps =        "http://www.cs.cmu.edu/~fp/papers/cade98m2.ps.gz"
}

@PhdThesis{Schurmann00phd,
  author =       "Carsten Sch{\"u}rmann",
  title =        "Automating the Meta Theory of Deductive Systems.",
  school =       "Department of Computer Science, Carnegie Mellon University",
  year =         2000,
  note = "{CMU}-{CS}-00-146",
  keywords =     "LF, Elf, rewriting"
}

@InProceedings{Schurmann03tphols,
  author   = {Carsten Sch{\"u}rmann and Frank Pfenning},
  title    = {A Coverage Checking Algorithm for {LF}},
  OPTshortbooktitle =  {Theorem Proving in Higher Order Logics (TPHOLs 2003)},
  booktitle =          {Proceedings of the 16th International Conference on
                  Theorem Proving in Higher Order Logics (TPHOLs'03)},
  pages    = {120--135},
  year     = "2003",
  editor   = {D. Basin and B. Wolff},
  OPTmonth =         sep,
  publisher =         {Springer}
}

@InProceedings{Schurmann:LFM04,
  author =    {Andrew McCreight and Carsten Sch{\"u}rmann},
  title =     {A Meta-Linear Logical Framework},
  booktitle = {4th International Workshop on Logical Frameworks and Meta-Languages (LFM'04)},
  OPTshortbooktitle = {Logical Frameworks and Meta-Languages (LFM'04)},
  OPTeditor =    {Carsten Sch{\"u}rmann},
  year =      {2004}
}

@article{Schurmann:TCS01,
  author    = {Carsten Sch{\"u}rmann and
               Jo{\"e}lle Despeyroux and
               Frank Pfenning},
  title     = {Primitive recursion for higher-order abstract syntax},
  journal   = {Theoretical Computer Science},
  volume    = {266},
  number    = {1-2},
  year      = {2001},
  pages     = {1-57},
  ee        = {http://dx.doi.org/10.1016/S0304-3975(00)00418-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@Book{Pfenning00book,
  author =       "Frank Pfenning",
  title =        "Computation and Deduction",
  publisher =    "Cambridge University Press",
  year =         2000,
  note =         "In preparation",
  keywords =     "LF, Elf, Draft from April 1997 available electronically",
  urlps =        "http://www.cs.cmu.edu/~twelf/notes/cd.ps"
}




@Book{Piaget1,
  author =   "Jean Piaget",
  title =    "Von der Logik des Kindes zur Logik des Heranwachsenden",
  publisher =    "Klett-Verlag",
  year =     "1975",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Book{Piaget2,
  author =   "Jean Piaget",
  title =    "Die Entwicklung des Erkennens -- Das mathematische Denken",
  publisher =    "Klett-Verlag",
  year =     "1975",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}



% submitted to Mathematical Structures in Computer Science
@Article{Pientka:MSC11,
  author = 	 {Brigitte Pientka},
  title = 	 {Programming proofs: A novel approach based on contextual types },
  journal = 	 {submitted}, 
  year = 	 {2011},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Proceedings{Pientka:Festschrift10,
  author =       {Brigitte Pientka},
  title = 	 {Programming inductive proofs: a new approach based on contextual types},
  year = 	 {2010},
  OPTkey = 	 {},
  booktitle = {Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of his 60th Birthday},
  editor    = {Simon Siegler and Nathan Wasser},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6463},
  pages     = {1-16},
  OPTmonth = 	 {},
  OPTorganization = {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}



@Proceedings{Pientka:FLOPS10,
  author =       {Brigitte Pientka},
  title = 	 {Beluga: programming with dependent types, contextual data, and contexts},
  year = 	 {2010},
  OPTkey = 	 {},
  booktitle = {10th {I}nternational {S}ymposium on {F}unctional and {L}ogic {P}rogramming (FLOPS'10)},
  editor = 	 {Matthias Blume, Naoki Kobayashi, German Vidal},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  series = 	 {Lecture Notes in Computer Science (LNCS 6009)},
  pages =        {1-12},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}




@Article{Pientka:JFP13,
  author = 	 {Brigitte Pientka},
  title = 	 {An insider's look at {LF} type reconstruction:
{E}verything you (n)ever wanted to know},
  journal = 	 {Journal of Functional Programming},
  year = 	 {2013},
  OPTkey = 	 {},
  volume = 	 {1},
  number = 	 {1--37},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTannote = 	 {}
}

@TechReport{Pientka:ReconLF10,
  author = 	 {Brigitte Pientka},
  title = 	 {An insider's look at {LF} type reconstruction:
{E}verything you (n)ever wanted to know},
  institution =  {McGill University},
  year = 	 {2010},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  month = 	 {August},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@InProceedings{Abel:TLCA11,
  author = 	 {Andreas Abel and Brigitte Pientka},
  title = 	 {Higher-Order Dynamic Pattern Unification for Dependent Types
                  and Records},
  booktitle = {10th {I}nternational {C}onference on {T}yped {L}ambda {C}alculi and {A}pplications {(TLCA'11)}},
  pages = 	 {10-26},
  year = 	 2011,
  editor = 	 {Luke Ong},
  series = 	 {Lecture Notes in Computer Science (LNCS 6690)},
  publisher =    {Springer}
}

@TechReport{Abel:HOPSigma11,
  author = 	 {Andreas Abel and Brigitte Pientka},
  title = 	 {Higher-Order Dynamic Pattern Unification for Dependent Types
                  and Records},
  institution =  {McGill University},
  year = 	 {2011},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  month = 	 {February},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@TechReport{Pientka:Cover10,
  author = 	 {Brigitte Pientka and Joshua Dunfield},
  title = 	 {{C}overing all bases:
design and implementation of case analysis for contextual objects},
  institution =  {McGill University},
  year = 	 {2010},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@InProceedings{Pientka:IJCAR10,
  author = 	 {Brigitte Pientka and Joshua Dunfield},
  title = 	 {Beluga: a {F}ramework for {P}rogramming and {R}easoning with {D}eductive {S}ystems ({System Description})},
  booktitle = {{5th International Joint Conference on Automated Reasoning (IJCAR'10)}},
  pages = 	 {15-21},
  year = 	 {2010},
  editor = 	 {J{\"u}rgen Giesl and Reiner Haehnle},
  series = 	 {Lecture Notes in Artificial Intelligence (LNAI 6173)},
  publisher    = SPR,
}

@TechReport{Pientka:TR09,
  author = 	 {Brigitte Pientka},
  title = 	 {A insider's look at LF type reconstruction (draft)},
  institution =  {McGill University},
  year = 	 {2009},
  OPTkey = 	 {},
  OPTtype = 	 {},
  OPTnumber = 	 {},
  OPTaddress = 	 {},
  month = 	 {August},
  OPTnote = 	 {Older draft},
  OPTannote = 	 {}
}

@Article{Pientka:TOCL09,
  author =   {Brigitte Pientka},
  title =    {Higher-order term indexing using substitution trees},
  journal =      {ACM Transactions on Computational Logic},
  year =     {2009},
  volume =    {11},
  number =    {1},
  pages =     {1-40}
}

@inproceedings{Pientka:POPL08,
   author    = {Brigitte Pientka},
   title     = {A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions},
   OPTshortbooktitle = {Principles of Programming Languages (POPL'08)},
   booktitle = {{35th Annual {ACM} SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08)}},
   publisher = ACM,
   pages     = {371--382},
   year      = {2008}
}


@inproceedings{Cave:POPL12,
   author    = {Andrew Cave and Brigitte Pientka},
   title     = {Programming with binders and indexed data-types},
   OPTshortbooktitle = {Principles of Programming Languages (POPL'12)},
   booktitle = {{39th Annual {ACM} SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'12)}},
   publisher = ACM,
   pages     = {413-424},
   year      = {2012}
}


@inproceedings{Cave:LFMTP13,
   author    = {Andrew Cave and Brigitte Pientka},
   title     = {First-class substitutions in contextual type theory},
   booktitle = {Proceedings of the Eighth ACM SIGPLAN International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'13)},
   publisher = ACM,
   isbn = {978-1-4503-2382-6},
   pages     = {15-24},
   year      = {2013}
}




@inproceedings{Cave:POPL14,
  author    = {Andrew Cave and
               Francisco Ferreira and
               Prakash Panangaden and
               Brigitte Pientka},
  title     = {Fair reactive programming},
  booktitle = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
               Programming Languages, {POPL} '14},
  pages     = {361--372},
  year      = {2014},
  editor    = {Suresh Jagannathan and
               Peter Sewell},
  publisher = {{ACM}}
}


@inproceedings{Pientka:CADE07,
  author    = {Samuli Heilala and Brigitte Pientka},
  title     = {Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4},
  editor    = {Frank Pfenning},
  booktitle = {21st International Conference on Automated Deduction(CADE'07)},
  year      = {2007},
  pages     = {116--131},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 4603)},
}


@Unpublished{Pientka:LICS08Draft,
   author    = "Brigitte Pientka and Joshua Dunfield",
   title     = "Functional programming with dependently-typed higher-order data",
   note      = "Manuscript",
   month     = jan,
   year      = "2008"
}

@InProceedings{Pientka:PPDP08,
   author    = {Brigitte Pientka and Joshua Dunfield},
   title     = {Programming with proofs and explicit contexts},
   booktitle = {{ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'08)}},
   pages     = {163--173},
   month     = jul,
   year      = 2008,
   publisher = ACM
}

@article{Pitts:2003,
 author = {Andrew Pitts},
 title = {Nominal logic, a first order theory of names and binding},
 journal = {Information and Computation},
 volume = {186},
 number = {2},
 month = nov,
 year = {2003},
 issn = {0890-5401},
 pages = {165--193},
 numpages = {29},
 publisher = {Academic Press, Inc.},
 keywords = {abstract syntax, fresh names, permutation, variable binding},
} 


@Article{Pitts:JFP11,
  author =	 {A. M. Pitts},
  title =	 {Structural Recursion with Locally Scoped Names},
  journal =	 {Journal of Functional Programming},
  year =	 2011,
  volume =	 21,
  number =	 3,
  pages =	 {235--286}
}


@InProceedings{Poswolsky:DelphinDesc08,
   author    = "Adam Poswolsky and Carsten Sch{\"u}rmann",
   title     = "System Description: {Delphin}---A Functional Programming Language for Deductive Systems",
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08)},
   OPTmonth     = {jun},
   year      = 2009,
   series    = {Electronic Notes in Theoretical Computer Science (ENTCS)},
   volume    = 228,
   pages     = {135--141},
   publisher = {Elsevier}
}

@InProceedings{Dunfield:coverage08,
   author    = "Joshua Dunfield and Brigitte Pientka",
   title     = "Case analysis of higher-order data",
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08)},
   month     = jun,
   year      = {2009},
   series    = {Electronic Notes in Theoretical Computer Science (ENTCS)},
   volume    = {228},
   pages     = {69--84},
   publisher = {Elsevier}
}

@Unpublished{Dunfield:coverage08online,
    author = "Joshua Dunfield and Brigitte Pientka",
    title = "Case analysis of higher-order data",
    OPTbooktitle =    {International Workshop on Logical Frameworks and Meta-Languages:
                               Theory and Practice (LFMTP'08)},
    OPTpages =     {},
    month = jun,
    year =      {2008},
    OPTeditor =    {},
    OPTvolume =    {},
    OPTnumber =    {},
    OPTseries =       "Electronic Notes in Theoretical Computer Science (ENTCS)",
    OPTpublisher = {Elsevier},
    note = "Extended online version of this paper.  \url{http://complogic.cs.mcgill.ca/beluga}"
}


@inproceedings{Pientka:TPHOLs07,
  author    = {Brigitte Pientka},
  title     = {Proof Pearl: The Power of Higher-Order Encodings in the
               Logical Framework {LF}},
  editor    = {Klaus Schneider and
               Jens Brandt},
  booktitle = {{20th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'07)}},
  year      = {2007},
  pages     = {246-261},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 4732)}
}


@proceedings{LFMTP06,
  editor    = {Brigitte Pientka and
               Alberto Momigliano},
  title     = {Proceeding of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Seattle, WA, USA},
  booktitle = {LFMTP},
  publisher = {Elsevier},
  series = {Electronic Notes in Theoretical Computer Science (ENTCS)},
  year      = {2006}
}

@inproceedings{Pientka:ICLP06,
  author    = {Brigitte Pientka},
  title     = {Overcoming Performance Barriers: Efficient Verification
               Techniques for Logical Frameworks},
  booktitle = { 22nd International Conference Logic Programming (ICLP), Seattle, WA, USA},
  editor    = {Sandro Etalle and
               Miroslaw Truszczynski},
  year      = {2006},
  pages     = {3-10},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS) 4079}
}

@InProceedings{Pientka:IJCAR06,
  author =   "Brigitte Pientka",
  title =    "Eliminating redundancy in higher-order unification: a lightweight approach",
  booktitle =    "{3rd Int'l Joint Conference on Automated Reasoning}",
  editor    =    "U. Furbach and N. Shankar",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 4130",
  year =     2006,
  publisher    = SPR,
  pages =    "362--377"
}


@InProceedings{Pientka:PLPV06,
  author =   "Brigitte Pientka",
  title =    "Functional Programming with Higher-order Abstract Syntax and Explicit Substitutions",
  booktitle =    "Programming Languages meets Program Verification (PLPV), Seattle, USA",
  pages =    "87--102",
  series =       "Electronic Notes in Theoretical Computer Science (ENTCS)",
  publisher=     "Elsevier",
  year =     "2006"
}

@article{Pientka:JAR05,
  author    = {Brigitte Pientka},
  title     = {Verifying Termination and Reduction Properties about Higher-Order
               Logic Programs},
  journal   = {Journal of Automated Reasoning},
  volume    = {34},
  number    = {2},
  year      = {2005},
  pages     = {179-207}
}



@InProceedings{Pientka:ICLP05,
  author =   "Susmit Sarkar and Brigitte Pientka and Karl Crary",
  title =    "Small proof witnesses for LF",
  editor =       "Maurizio Gabbrielli and Gopal Gupta",
  booktitle =    "21st International Conference on Logic Programming, Sitges, Spain",
  series =   "Lecture Notes in Computer Science (LNCS)",
  year =     2005,
  publisher    = SPR,
  volume    = "3668",
  pages =    "387-401"
}

@inproceedings{Pientka:CADE05,
  author    = {Brigitte Pientka},
  title     = {Tabling for Higher-Order Logic Programming},
  editor    = {Robert Nieuwenhuis},
  booktitle = {20th International Conference
               on Automated Deduction (CADE), Talinn, Estonia},
  year      = {2005},
  pages     = {54-68},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3632}
}

@PhdThesis{Pientka03phd,
  author =       "Brigitte Pientka",
  title =        "Tabled higher-order logic programming",
  school =       "Department of Computer Science, Carnegie Mellon
                  University",
  year =         "2003",
  note =     "CMU-CS-03-185",
  keywords =     "LF, Elf"
}


@InProceedings{PientkaPfenning:CADE03,
  author =   "Brigitte Pientka and Frank Pfenning",
  title =    "Optimizing higher-order pattern unification",
  editor =       "F.~Baader",
  booktitle =    "19th International Conference on Automated Deduction (CADE-19)",
  series =   "Lecture Notes in Artificial  Intelligence (LNAI) 2741",
  year =     2003,
  publisher    = SPR,
  pages = "473--487"
}

@InProceedings{Pientka:ICLP03,
  author =       "Brigitte Pientka",
  title =        "Higher-order substitution tree indexing",
  editor =       "C.~Palamidessi",
  booktitle =    "19th International Conference on Logic Programming,
Mumbai, India",
  series =       "Lecture Notes in Computer Science (LNCS 2916)",
  year =         2003,
  publisher    = "Springer-Verlag",
  pages =     "377--391"
}

@InProceedings{Pientka:LFM02,
  author =   "Brigitte Pientka",
  title =    "Memoization-based proof search in {LF}: an experimental evaluation of a prototype",
  booktitle =    "Third International Workshop on Logical Frameworks and Meta-Languages (LFM'02), Copenhagen, Denmark",
  series =       "Electronic Notes in Theoretical Computer Science (ENTCS)",
  year =     2002
}

@InProceedings{Pientka:ICLP02,
  author =   "Brigitte Pientka",
  title =    "A proof-theoretic foundation for tabled higher-order logic programming",
  editor =       "P.~Stuckey",
  booktitle =    "18th International Conference on Logic Programming, Copenhagen, Denmark",
  series =   "Lecture Notes in Computer Science (LNCS), 2401",
  year =     2002,
  publisher    = SPR,
  pages =    "271 --286"
}

@TechReport{Pientka:proposal02,
  author =   "Brigitte Pientka",
  title =    "Tabled higher-order logic programming",
  institution =  "Carnegie Mellon University",
  year =     2002,
  type =     "Thesis proposal",
  keywords =     "higher-order logic programming"
}


@TechReport{Pientka01,
  author =   "Brigitte Pientka",
  title =    "Termination and Reduction Checking in logical frameworks",
  institution =  "Carnegie Mellon University",
  year =     2001,
  type =     "Technical Report {CMU-CS}-01-115",
  keywords =     "higher-order logic programming"
}

@TechReport{Pientka:techReport03,
  author =   "Brigitte Pientka",
  title =    "Termination and Reduction Checking for higher-order logic programs",
  institution =  "School of Computer Science, McGill University",
  year =     2003,
  type =     "Technical Report {SOCS}-??",
  keywords =     "higher-order logic programming"
}

@InProceedings{PientkaPfenning:00,
  author =   "Brigitte Pientka and Frank Pfenning",
  title =    "Termination and reduction checking in the Logical Framework",
  editor =   "C. Sch{\"u}rmann",
  booktitle =    "Workshop on Automation of Proofs by Mathematical Induction, Pittsburgh, PA",
  OPTseries =    "",
  year =     2000,
  pages =    ""
}


@InProceedings{Pientka:IJCAR01,
  author =   "Brigitte Pientka",
  title =    "Termination and reduction checking for higher-order logic programs",
  booktitle =    IJCAR01,
  editor    =    "R.~Gore and A.~Leitsch and T.~Nipkow",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 2083",
  year =     2001,
  publisher    = SPR,
  pages =    "401-415"
}

@InProceedings{PientkaKreitz98a,
  author          = "Brigitte Pientka and Christoph Kreitz",
  title           = "Instantiation of existentially quantified variables in
                             inductive specification proofs",
  booktitle       = "4th International Conference on Artificial
                     Intelligence and Symbolic Computation",
  year            = "1998",
  editor          = "J. Plaza and J. Calmet",
  series          = "Lecture Notes in Artificial Intelligence (LNAI) 1476",
  pages           = "247--258",
  publisher       = "Springer-Verlag"
}


@Article{PientkaKreitz99,
  author          = "Brigitte Pientka and Christoph Kreitz",
  title           = "Automating inductive specification proofs",
  journal         = "Fundamenta Informatica",
  year            = "1999",
  volume          = "39",
  number          = "1--2",
  pages           = "189--209"
}

@TechReport{Pientka95,
  author =   "Brigitte Pientka",
  title =    "A Heuristic for Case Analysis",
  institution =  "Departement of Artificial Intelligence, University of Edinburgh, Scotland",
  year =     1995,
  type =     "Technical Paper",
  number =   37,
  keywords =     "case analysis, proof plan"
}

@Misc{Pientka97,
  author =   "Brigitte Pientka",
  title =    "{Strukturierung und Optimierung inkrementeller
                  Beweisplanung}",
  howpublished = "Diplomarbeit",
  year =     "1997",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{Pientka97a,
  author =   "Brigitte Pientka",
  title =    "How to prove it",
  booktitle =    IWWC97,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1997",
  OPTorganization = "",
  publisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "To appear",
  OPTannote =    ""
}

@InProceedings{Pientka96,
  author =   "Brigitte Pientka",
  title =    "{I}st die {I}nformatik m{\"a}nnlich? {E}indr{\"u}cke, {E}rfahrungen,
          {F}orderungen",
  booktitle =    "``Eine Frau, die Maschinenbau studiert ist kein Wesen
          vom Mars \ldots '' -- Studentinnen motivieren Sch{\"u}lerinnen ",
  editor =   "A. Paul--Kohlhoff and  C. Walter",
  volume =   17,
  year =     1996,
  publisher = "Darmst{\"a}dter {B}eitr{\"a}ge zur {B}erufsp{\"a}dagogik",
  OPnote =   ""
}

@MastersThesis{Pientka97engl,
  author =   "Brigitte Pientka",
  title =    "Structuring and Optomizing incremental Proof Planning",
  school =   "Technical University Darmstadt",
  year =     "1997",
  OPTkey =   "",
  OPTaddress =   "",
  OPTtype =      "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@Book{TAPL,
  author =   "Benjamin C. Pierce",
  title =    "Types and Programming Languages",
  publisher =    "MIT Press",
  year =     2002
}

@Article{Plaisted85,
  author =   "David A.~Plaisted",
  title =    "Semantic confluence tests and completion methods",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Information and Control",
  year =     "1985",
  volume =   "65",
  OPTnumber =    "",
  pages =    "192-235",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "decidability of inductive reducibility"
}

@Article{Plaisted81,
  author =   "David A.~Plaisted",
  title =    "Theorem Proving with Abstraction",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Artificial Intelligence",
  year =     "1981",
  volume =   "16",
  OPTnumber =    "",
  pages =    "47-108",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "resolution, abstraction, analogy, proof generalization"
}

@Book{Pluemer90book,
  author =       "Lutz Pl{\"u}mer",
  title =        "Termination Proofs for Logic Programs",
  publisher =    "Springer-Verlag",
  year =         "1990",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 446"
}

@Article{Poehlmann95,
  author =   "Johannes P{\"o}hlmann",
  title =    "Ist {A}bh{\"o}ren bald {G}eschichte?",
  journal =      "FIFF-Kommunikation",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  number =   "2",
  OPTmonth =     "",
  pages =    "34 -35",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "PGP Pretty Good Privacy, Internet"
}

@Book{Polya45,
  author =   "Polya, George",
  title =    "How to solve it - A new Aspect of Mathematical Method",
  publisher =    "Princeton Univiersity Press",
  year =     "1945",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Book{Polya88,
  author =   "Polya, George",
  title =    "{Mathematik und plausibles Schlie{\ss}en -- Induktion und Analogie in der Mathematik}",
  publisher =    BIRK,
  year =     "1988",
  OPTkey =   "",
  OPTeditor =    "",
  volume =   "1",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  edition =      "3",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Article{Postman92,
  author =   "Neil Postman",
  title =    "Wir informieren uns zu {T}ode",
  journal =      "Die {Z}eit, Feulliton",
  year =     "1992",
  OPTkey =   "",
  OPTvolume =    "",
  number =   "41",
  month =    "2 Oct.",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@inproceedings{Prehofer-CADE94,
  author = {Christian Prehofer},
  title = {Decidable Higher-order Unification Problems},
  booktitle = {Automated Deduction CADE-12, 12th International Conference on Automated Deduction},
  year = {1994},
  publisher = {Springer},
 editor = {},
 url = {http://www4.informatik.tu-muenchen.de/papers/Prehofer-CADE1994.html},
 abstract = {Second-order unification is undecidable in general. Miller showed that unification of so-called higher-order patterns is decidable and unitary. We show that the unification of a linear higher-order pattern s with an arbitrary second-order term that shares no variables with s is decidable and finitary. A few extensions of this unification problem are still decidable\: unifying two second-order terms, where one term is linear, is undecidable if the terms contain bound variables but decidable if they don't. },
        CRClassification = {},
        CRGenTerms = {}
}

@InProceedings{Protzen92,
  author =  "Martin Protzen",
  title =   "Disproving Conjectures",
  booktitle =   CADE92,
  year =    "1992",
  OPTeditor =   "",
  pages =   "340-354",
  OPTorganization =     "",
  publisher =   SPR,
  OPTaddress =  "",
  month =   jun,
  note =    "Lecture Notes in Artificial Intelligence (LNAI) vol.\ 607",
  keywords =    "inductive theorem proving, disproving, counterexamples"
}


@INPROCEEDINGS{Pottier:LICS07,
  AUTHOR = {Fran\c{c}ois Pottier},
  TITLE = {Static Name Control for {FreshML}},
  MONTH = JUL,
  YEAR = 2007,
  BOOKTITLE = {22nd {IEEE} Symposium on Logic in
                 Computer Science (LICS'07)},
  OPTADDRESS = {Wroclaw, Poland},
 pages = {356--365},
 publisher = {IEEE Computer Society}
 }



@INPROCEEDINGS{Pouillard:ICFP10,
  author = {Nicolas Pouillard and François Pottier},
  title = {A fresh look at programming with names and binders},
  booktitle = {15th {ACM} {SIGPLAN}
                 International Conference on Functional Programming
                 (ICFP 2010)},
  pages = {217--228},
  year = 2010,
  off = {http://doi.acm.org/10.1145/1863543.1863575},
  pdf = {http://gallium.inria.fr/~fpottier/publis/pouillard-pottier-fresh-look.pdf},
  longpdf = {http://gallium.inria.fr/~fpottier/publis/pouillard-pottier-fresh-look-x.pdf},
  abstract = {A wide range of computer programs, including compilers
                 and theorem provers, manipulate data structures that
                 involve names and binding. However, the design of
                 programming idioms which allow performing these
                 manipulations in a safe and natural style has, to a
                 large extent, remained elusive.\par In this paper, we
                 present a novel approach to the problem. Our proposal
                 can be viewed either as a programming language design
                 or as a library: in fact, it is currently implemented
                 within Agda. It provides a safe and expressive means of
                 programming with names and binders. It is abstract
                 enough to support multiple concrete implementations: we
                 present one in nominal style and one in de Bruijn
                 style. We use logical relations to prove that
                 ``well-typed programs do not mix names with different
                 scope''. We exhibit an adequate encoding of Pitts-style
                 nominal terms into our system.}
}

@inproceedings{Pottier:POPL04,
 author = {Pottier, Fran\c{c}ois and Gauthier, Nadji},
 title = {Polymorphic typed defunctionalization},
 booktitle = {Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
 series = {POPL '04},
 year = {2004},
 location = {Venice, Italy},
 pages = {89--98},
 numpages = {10},
 doi = {10.1145/964001.964009},
 publisher = {ACM},
}

@InProceedings{Protzen94,
  author =   "Martin Protzen",
  title =    "Lazy Generation of Induction Hypotheses",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 814",
  pages =    "42-56",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     "induction theorem proving"
}


%%% Q
@InProceedings{Qian93,
   author    = "Zhenyu Qian",
   title     = "Linear unification of higher-order patterns",
   pages =        "391--405",
   booktitle =    "Proceedings of TAPSOFT'93",
   year =         1993,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS) 668",
  keywords =     "complexity higher-order unification"
}


@inproceedings{Queinnec:ICFP96,
  author    = {Christian Queinnec and
               David De Roure},
  editor    = {Robert Harper and
               Richard L. Wexelblat},
  title     = {Sharing Code through First-class Environments},
  booktitle = {Proceedings of the  1st ACM SIGPLAN {I}nternational {C}onference on {F}unctional {P}rogramming (ICFP '96)},
  year      = {1996},
  publisher = {ACM},
  pages     = {251-261},
}



%%% R
@InProceedings{VanRaamsdonk99rta,
   author    = "Femke van Raamsdonk",
   title     = "Higher-Order Rewriting",
   pages =        "220--239",
   booktitle =    "Proceedings of the 10th International Conference
          on Rewriting Techniques and Applications (RTA '99)",
  year =         1999,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS) 1631",
  address =      "Trento, Italy",
  month =        jul,
  keywords =     "rewriting"
}


@article{Raghu:JLP91,
 author = {Raghu Ramakrishnan},
 title = {Magic templates: a spellbinding approach to logic programs},
 journal = {Journal of Logic Programming},
 volume = {11},
 number = {3-4},
 year = {1991},
 issn = {0743-1066},
 pages = {189--216},
 doi = {http://dx.doi.org/10.1016/0743-1066(91)90026-L},
 publisher = {Elsevier Science Inc.},
 address = {New York, NY, USA},
 }


@Article{RamakrishnanJLP99,
  author =  "I.~V.\ Ramakrishnan and P. Rao and K. Sagonas and T. Swift and D. Warren",
  title =   "Efficient Access Mechanisms for Tabled Logic Programs",
  journal =     JLP,
  year =    "1999",
  volume =  "38",
  number =  "1",
  pages =   "31--54",
  OPTnote =     "",
  month =       "Jan",
  keywords =    "SLG, WAM, memoing, prolog, tabling"
}

@inproceedings{Ramakrishnan95efficient,
    author = "I.V Ramakrishnan and P. Rao and K. Sagonas and T. Swift and D. Warren",
    title = "Efficient tabling mechanisms for logic programs",
    booktitle =  "Proceedings of the Twelth International Conference on
          Logic Programming",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "L.~.Sterling",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "" ,
  year =     "1995",
  OPTorganization = "",
  publisher = "MIT Press",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "697--711",
  OPTnote =      "",
  OPTannote =    ""
}

@InCollection{Ramakrishnan01:indexing,
  author =   "I.~V. Ramakrishnan and R. Sekar and A. Voronkov",
  title =    "Term Indexing",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Handbook of Automated Reasoning",
  publisher =    ESP,
  year =     "2001",
  editor =   "Alan Robinson and Andrei Voronkov",
  volume =   "2",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  pages =    "1853-1962",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTannote =    "",
  keywords =     "tries, discrimination trees, adaptive automata"
}

@inproceedings{Ramesh:POPL90,
 author = {R. Ramesh and I. V. Ramakrishnan and D. S. Warren},
 title = {Automata-driven indexing of Prolog clauses},
 booktitle = {Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'90)},
 year = {1990},
 isbn = {0-89791-343-4},
 pages = {281--291},
 location = {San Francisco, California, United States},
 doi = {http://doi.acm.org/10.1145/96709.96738},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@article{Chen:SPE94,
  author    = {Ta Chen and
               I. V. Ramakrishnan and
               R. Ramesh},
  title     = {Multistage Indexing for Speeding Prolog Executions},
  journal   = {Software -- Practice and Experience},
  volume    = {24},
  number    = {12},
  year      = {1994},
  pages     = {1097-1119},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@inproceedings{Rasmussen:LFMTP13,
 author = {Rasmussen, Ulrik and Filinski, Andrzej},
 title = {Structural Logical Relations with Case Analysis and Equality Reasoning},
 booktitle = {Proceedings of the Eighth ACM SIGPLAN International Workshop on
                  Logical Frameworks and Meta-languages: Theory and Practice (LFMTP'13)},
 year = {2013},
 isbn = {978-1-4503-2382-6},
 pages = {43--54},
 publisher = ACM
} 

[download] 

@inproceedings{Ratschek75,
   author    = "H.~Ratschek",
   title     = "Nichtnumerische {A}spekte der {I}ntervallarithmetik",
   booktitle = "Interval Mathematics",
   note      = "{Lecture Notes in Computer Science (LNCS)} 29",
   year      = "1975",
   publisher = SPR,
   keywords  = "interval arithmetic"
}


@Book{Rawlins91,
  author =   "Gregory~J.E.~Rawlins",
  title =    "Foundations of Genetic Algorithms",
  publisher =    MK,
  year =     "1991",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "learning, genetic algorithms"
}


@inproceedings{Reddy89,
   author    = "Uday S.~Reddy",
   title     = "Rewriting Techniques for Program Synthesis",
   booktitle = RTA89,
   year      = "1989",
   month     = apr,
   editor    = "Nachum Dershowitz",
   publisher = SPR,
   pages     = "388-403",
   keywords  = "program synthesis, term rewriting, inductionless induction"
}


@inproceedings{Reddy90,
   author    = "Uday S.~Reddy",
   title     = "Term Rewriting Induction",
   booktitle = CADE90,
   year      = "1990",
   publisher = SPR,
   pages     = "162--177",
   keywords  = "inductionless induction, term rewriting induction"
}

@InProceedings{Reed04lfm,
  title        = "Redundancy elimination for {LF}",
  author       = "Jason Reed",
  booktitle    = "{4th Workshop on Logical Frameworks and Meta-languages
                  (LFM '04)}",
  editor       = "C. Sch{\"u}rmann",
  address      = "Cork, Ireland",
  year         = "2004",
  month        = jul
}

@article{Reed:Hylog06,
 author = {Jason Reed},
 title = {Hybridizing a Logical Framework},
 journal = {Electronic Notes Theoretical Computer Science},
 volume = {174},
 number = {6},
 year = {2007},
 issn = {1571-0661},
 pages = {135--148},
 doi = {http://dx.doi.org/10.1016/j.entcs.2006.11.030},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }



@InProceedings{Reed:LFMTP09,
  author =   {Jason Reed},
  title =    {Higher-Order Constraint Simplification In Dependent Type Theory},
  booktitle = {{International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'09)}},
  year =     2009,
  editor =   {A. Felty and J. Cheney}}

@article{Riazanov:02,
 author = {Alexandre Riazanov and Andrei Voronkov},
 title = {The design and implementation of VAMPIRE},
 journal = {AI Communications},
 volume = {15},
 number = {2},
 year = {2002},
 issn = {0921-7126},
 pages = {91--110},
 publisher = {IOS Press},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }


@Book{Rogers67,
  author =   "Hartley Rogers",
  title =    "Theory of Recursive Functions and Effective Computability",
  publisher =    "McGraw-Hill",
  year =     "1967",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "decidability, computability, recursive functions"
}


%  author =      "J.~Barkley Rosser and Atwell R.~Turquette",
@Book{RosserTurquette52,
  author =   "J.B.~Rosser and A.R.~Turquette",
  title =    "Many-Valued Logic",
  publisher =    NoHo,
  year =     "1952",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple valued logic, hilbert style axiomatization"
}

@inproceedings{Roychoudhury00,
    author = "Abhik Roychoudhury and C. R. Ramakrishnan and I. V. Ramakrishnan",
    title = "Justifying proofs using memo tables",
    booktitle = "International Conference on Principles and Practice of Declarative Programming(PPDP'00)",
    pages = "178-189",
    year = "2000",
    url = "citeseer.nj.nec.com/roychoudhury00justifying.html" }

@Book{RussellNorvig95,
  author =   "Stuart J.~Russell and Peter Norvig",
  title =    "Artificial Intelligence, a modern approach",
  publisher =    "Prentice Hall",
  year =     "1995",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  edition =  "second",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "AI textbook, knowledge representation, planning,
                  intelligent agents, history of AI, neural networks,
                  philosophical aspects of AI, heuristical search"
}


%%% S

@Article{SagonasSwift98,
  author =  "Konstantinos Sagonas and Terrance Swift ",
  title =   "An abstract machine for tabled execution of fixed-order stratified logic programs ",
  journal =     TOPLAS,
  year =    "1998",
  volume =  "20",
  number =  "3",
  pages =   "586-634",
  OPTnote =     "",
  keywords =    "SLG, WAM, memoizing, prolog, stratification theories, tabling"
}

@Article{sato01,
  author =   {Masahiko Sato and Takafumi Sakurai and Rod Burstall},
  title =    {Explicit Environments},
  journal =      {Fundamenta Informaticae},
  year =     {2001},
  volume =   {45},
  number =   {1-2},
  pages =    {79--115}
}

@article{sato02,
   author={Masahiko Sato and Takafumi Sakurai and Yukiyoshi Kameyama},
   title={A Simply Typed Context Calculus with First-class Environments},
   journal={Journal of Functional and Logic Programming},
   volume={2002},
   number={4},
   pages={1-41},
   publisher={European Association for Programming Languages and Systems},
   month={March},
   year={2002}
}

@InProceedings{Sato:CSL03,
  author    = "Masahiko Sato and Takafumi Sakurai and Yukiyoshi
Kameyama and Atsushi Igarashi",
  title     = "Calculi of Meta-varaibles",
  editor    = {Matthias Baaz and
               Johann A. Makowsky},
  booktitle = {Proceedings of the 17th International on Computer Science
               Logic (CSL'03) Vienna, Austria, August 25-30},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS 2803)},
  year      = {2003},
  pages     = "484-497",
  doi       = {10.1007/978-3-540-45220-1_39}
}


@TechReport{SattlerKlein93,
  author =   "Andrea Sattler-Klein",
  title =    "About Changing the Ordering during Knuth-Bendix Comletion",
  institution =  UKL,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  type =     SEKI,
  OPTnumber =    "{SR}-93-19",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Knuth-Bendix completion, implicit induction, RRL,
          confluence, solution to RTA problem 35"
}


@InProceedings{SattlerKlein94,
  author =   "Andrea Sattler-Klein",
  title =    "About Changing the Ordering during Knuth-Bendix Comletion",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "175-186",
  booktitle =    TACS94,
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "Also available as {SEKI} report {SR}-93-19",
  OPTannote =    "",
  keywords =     "Knuth-Bendix completion, implicit induction, RRL,
          confluence, solution to RTA problem 35"
}



@Article{Schaar95,
  author =   "Peter Schaar",
  title =    "Verfl{\"u}chtigung des {D}atenschutzes im {I}nternet",
  journal =      "FIFF-Kommunikation",
  year =     "1995",
  OPTkey =   "",
  OPTvolume =    "",
  number =   "2",
  OPTmonth =     "",
  pages =    "28 - 31",
  OPTnote =      "",
  OPTannote =    ""
}

. In: 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2010) Edinburgh, UK, July 14. 

@InProceedings{SchackNielson:LFMTP10,
   author    = "Anders Schack-Nielson and Carsten Sch{\"u}rmann",
   editor    = {Karl Crary and Marino Miculan},
   title     = "Pattern Unification for the Lambda Calculus with Linear and Affine Types",
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10)},
   month     = jul,
   year      = {2010},
   series    = {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
   volume    = {34},
   pages     = {101-116}
}

@InProceedings{Abel:LFMTP10,
   author    = "Andreas Abel and Brigitte Pientka",
   editor    = {Karl Crary and Marino Miculan},
   title     = "Explicit substitutions for contextual type theory",
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'10)},
   month     = jul,
   year      = {2010},
   series    = {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
   volume    = {34}
}



@Book{Scheich93,
  author =   "E.~ Scheich",
  title =    "Naturbeherrschung und Weiblichkeit: Denkformen und
                  Phantasmen der modernen Wissenschaften",
  year =     "1993",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@techreport{Schmitt87,
  author    = "Peter H.~Schmitt",
  title     = "The {THOT} Theorem Prover",
  institution = IWBS,
  year      = "1987",
  month     = oct,
  keywords  = "multiple valued logic, analytic free variable tableau"
}


@techreport{Schmitt91,
  author    = "Reiner H{\"a}hnle and Peter H.~Schmitt",
  title     = "The Liberalized $\delta$--Rule in Free Variable Semantic
       Tableaux",
  institution = UKA,
  year      = "1991",
  month     = apr,
  keywords  = "multiple valued logic, analytic free variable tableau"
} % see also HaehnleSchmitt94

@InProceedings{SchmittKreitz96a,
  author      = "Stephan Schmitt and Christoph Kreitz",
  title       = "Converting Non-Classical Matrix Proofs into Sequent-Style
          Systems",
  booktitle   = CADE96,
  year        = 1996,
  OPTkey      = "",
  editor      = "M.~McRobbie and J.~Slaney",
  volume      = 1104,
  OPTnumber   = "",
  series      = LNAI,
  pages       = "418--432",
  OPTorganization = "",
  publisher       = SPR
}

@InProceedings{Schneider+:langsec,
  author =   {Fred B. Schneider and Greg Morrisett and Robert Harper},
  title =    {A Language-Based Approach to Security},
  booktitle =    {Informatics -- 10 Years Back, 10 Years Ahead.  Conference on the Occasion of Dagstuhl's 10th Anniversary.},
  pages =    {86--101},
  year =     2000,
  editor =   {Reinhard Wilhelm},
  volume =   2000,
  series =   {Lecture Notes in Computer Science},
  address =  {Saarbr\"{u}cken, Germany},
  month =    {August},
  publisher =    {Springer Verlag}
}

@InProceedings{Sekar:MobileCode01,
  author      = "R. Sekar and C.R. Ramakrishnan and I.V. Ramakrishnan and Scott A. Smolka",
  title       = "Model-Carrying Code ({MCC}): A New Paradigm for Mobile-Code Security",
  booktitle   = "New Security Paradigms Workshop (NSPW'01); Cloudcroft, New Mexico",
  year        = "Sep 2001"
}


@Book{Sedgewick83,
  author =  "Robert Sedgewick",
  title =   "Algorithmen",
  publisher =   "Addison Wesley",
  year =    "1983",
  OPTeditor =   "",
  OPTvolume =   "",
  OPTseries =   "",
  OPTaddress =  "",
  edition =     "",
  OPTmonth =    "",
  OPTnote =     "Zweite Auflage 1992"
}


@InProceedings{Severin:LCF94,
  author =   "Paula Severin and Erik Poll",
  title =    "Pure Type Systems with Definitions",
  booktitle =    "Third International Symposium on Logical Foundations of Computer Science (LFCS'94), St. Petersburg, Russia, July 11-14, 1994",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "Anil Nerode and Yuri Matiyasevich",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) vol.~813",
  year =     "1994",
  OPTorganization = "",
  publisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "316--328",
  OPTnote =      "",
  OPTannote =    ""
}



@InProceedings{Shankar92,
  author =   "N.~Shankar",
  title =    "Proof Search in the Intuitionistic Sequent Calculus",
  booktitle =    CADE92,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) vol.~607",
  year =     "1992",
  OPTorganization = "",
  publisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords  = "skolemization, herbrand functions, instantiating meta-variables, free variables"
}


@InProceedings{Schrijvers:ICLP02,
  author =       "Tom Schrijvers and Mar{\'\i}a Garc{\'\i}a de la Banda
                  and Bart Demoen",
  title =        "Trailing Analysis for {HAL}",
  editor =       "P.~Stuckey",
  booktitle =    "18th International Conference on Logic Programming, Copenhagen, Denmark",
  series =   "Lecture Notes in Computer Science (LNCS), 2401",
  year =     2002,
  publisher    = SPR,
  pages =        "38--53",
  abstract =     "The HAL language includes a Herbrand constraint solver
                  which uses Taylor's PARMA scheme rather than the
                  standard WAM representation. This allows HAL to
                  generate more efficient Mercury code. Unfortunately,
                  PARMA's variable representation requires value trailing
                  with a trail stack consumption about twice as large as
                  for the WAM. We present a trailing analysis aimed at
                  determining which Herbrand variables do not need to be
                  trailed. The accuracy of the analysis comes from HAL's
                  semi-optional determinism and mode declarations. The
                  analysis has been partially integrated in the HAL
                  compiler and benchmark programs show good speed-up.",
}

@inproceedings{Schrijvers:ICFP08,
 author = {Schrijvers, Tom and Peyton Jones, Simon and Chakravarty, Manuel and Sulzmann, Martin},
 title = {Type checking with open type functions},
 booktitle = {Proceeding of the 13th ACM SIGPLAN international conference on Functional programming},
 series = {ICFP '08},
 year = {2008},
 location = {Victoria, BC, Canada},
 pages = {51--62},
 numpages = {12},
 doi = {10.1145/1411204.1411215},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Haskell, type checking, type families, type functions},
}

@Manual{SICSQuintus98,
  title =    {{SICS} Quintus Prolog Manual},
  OPTkey =   {},
  OPTauthor =    {},
  OPTorganization = {},
  address =      {http://www.sics.se/isl/quintus/qp/ref-semantics.html},
  OPTedition =   {},
  OPTmonth =     {},
  OPTyear =      {1998},
  OPTnote =      {},
  OPTannote =    {}
}


@PhdThesis{Shinwell05,
  author =   {M.~Shinwell},
  title =    {The Fresh Approach: Functional Programming with Names and Binders},
  school =   {Cambridge University},
  year =     {2005}
}

@inproceedings{Shinwell:ICFP03,
 author = {Mark R. Shinwell and Andrew M. Pitts and Murdoch J. Gabbay},
 title = {{FreshML}: programming with binders made simple},
 booktitle = {8th International Conference on Functional Programming (ICFP'03)},
 year = 2003,
 pages = {263--274},
 location = {Uppsala, Sweden},
 publisher = ACM
 }

@Article{Siekmann89,
  author =   "J{\"o}rg Siekmann",
  title =    "Unification Theory",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JSC,
  year =     "1989",
  volume =   "7",
  OPTnumber =    "",
  pages =    "207-274",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "unification"
}


@article{Sijtsma:TOPLAS89,
  title="On the Productivity of Recursive List Definitions",
  author="Ben A. Sijtsma",
  pages="633--649",
  journal=toplas,
  year=1989,
  month=oct,
  volume=11,
  number=4
}


@inproceedings{SkalkaSmith:ICFP00,
 author = {Christian Skalka and Scott Smith},
 title = {Static enforcement of security with types},
 booktitle = {Proceedings of the 5th {ACM} {SIGPLAN} {I}nternational {C}onference on {F}unctional {P}rogramming},
 year = {2000},
 isbn = {1-58113-202-6},
 pages = {34--45},
 doi = {http://doi.acm.org/10.1145/351240.351244},
 publisher = ACM,
 }

@TechReport{SmaillGreen95,
  author =   "Allan Smaill and Ian Green",
  title =    "Automating the synthesis of functional programs",
  institution =  DAI,
  year =     "1995",
  OPTkey =   "",
  type =     "Research Paper 777",
  OPTnumber =    "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@article{Smith:1990,
 author = {Smith, Alan Jay},
 title = {The Task of the Referee},
 journal = {Computer},
 volume = {23},
 issue = {4},
 month = {April},
 year = {1990},
 issn = {0018-9162},
 pages = {65--71},
 numpages = {7},
 url = {http://portal.acm.org/citation.cfm?id=78901.78905},
 doi = {10.1109/2.55470},
 acmid = {78905},
 publisher = {IEEE Computer Society Press},
 address = {Los Alamitos, CA, USA},
} 



@book{Smullyan68,
  author    = "Raymond M.~Smullyan",
  title     = "First-Order Logic",
  year      = "1968",
  publisher = SPR,
  note      = "New edition by Dover Press, 1995",
  keywords  = "analytic tableau, logic textbook"
}

@Book{Spender96,
  author =   "Dale,~Spender",
  title =    "1. {A}uffahrt {C}yberspace - {F}rauen im {I}nternet",
  publisher =    "Frauenoffensive",
  year =     "1996",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  keywords  =    "Feminismus, Vergleich Revolution des Buchdrucks mit
                  Internet, Bildung, Erziehung"
}


@inproceedings{Sprenger:FOSSACS03,
 author = {Christoph Sprenger and Mads Dam},
 title = {On the structure of inductive reasoning: circular and tree-shaped proofs in the \mu-calculus},
 booktitle = {6th International conference on Foundations of Software Science and Computation Structures(FOSSACS'03)},
 year = {2003},
 series = {LNCS (2620)},
 pages = {425--440},
 numpages = {16},
 publisher = {Springer-Verlag}
} 


@inproceedings{Sozeau:ITP10,
  author    = {Matthieu Sozeau},
  title     = {Equations: A Dependent Pattern-Matching Compiler},
  editor    = {Matt Kaufmann and Lawrence C. Paulson},
  booktitle = {First International Conference on Interactive Theorem Proving (ITP-10), Edinburgh, UK},
  year      = {2010},
  pages     = {419-434},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science (LNCS)},
  volume    = {6172}
}

@InProceedings{Spertus,
  author =   "Ellen Spertus",
  title =    "Social and Technical Means for Fighting On-Line Harassment",
  booktitle =    "Conference on Virtue and Virtuality: Gender, Law and
                  Cyberspace",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  year =     "1996",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTpages =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@misc{Statman85logical,
  author = "R. Statman",
  title = "Logical relations and the simply typed lambda calculus",
  text = "Statman, R.: Logical relations and the simply typed lambda calculus. Information
    and Control 65 (1985) 85-97.",
  year = "1985" }




@inproceedings{Stampoulis:ICFP10,
  author    = {Antonis Stampoulis and
               Zhong Shao},
  title     = {{VeriML}: typed computation of logical terms inside a language
               with effects},
  editor    = {Paul Hudak and
               Stephanie Weirich},
  booktitle     = {15th ACM SIGPLAN {I}nternational {C}onference
               on {F}unctional {P}rogramming (ICFP'10)},
  year      = 2010,
  pages     = {333-344},
  publisher = {ACM}
}


@InProceedings{Stevens88,
  author =   "Andrew Stevens",
  title =    "A rational Reconstruction of Boyer and Moore's
       Technique for Constructing Induction Formulas",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTpages =     "",
  booktitle =    ECAI88,
  year =     "1988",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     DAIRP # " 360",
  OPTannote =    "",
  keywords  =    "nqthm, recursion analysis, inductive reasoning"
}


@PhdThesis{Stevens89,
  author =   "Andrew Stevens",
  title =    "An improved method for the mechanisation of
          inductive proofs",
  school =   DAI,
  year =     "1989",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTtype =      "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "inductive reasoning, recursion analysis"
}

@PhdThesis{Strecker:phd99,
  author =   {Martin Strecker},
  title =    {Construction and Deduction in Type Theories},
  school =   {Universit{\"a}t Ulm},
  year =     1999
}

@TECHREPORT{AICPub498:1989,
      AUTHOR={Stickel, Mark E.},
      TITLE={The Path-Indexing Method For Indexing Terms},
      ADDRESS={333 Ravenswood Ave., Menlo Park, CA 94025},
      INSTITUTION={AI Center, SRI International},
      MONTH={Oct},
      NUMBER={473},
      YEAR={1989},
      KEYWORDS={Path-indexing, Deduction!Indexing},
      ABSTRACT={The path-indexing method for indexing first-order predicate calculus
         terms is a refinement of the standard coordinate-indexing method. Path indexing
         offers much faster retrieval at a modest cost in space. Path indexing is compared
         with discrimination-net and codeword indexing. While discrimination-net indexing
         may often be the preferred method for maximum speed, path indexing is an effective
         alternative if discrimination-net indexing requires too much space or in certain
         cases in which discrimination-net indexing performs particularly poorly.}
    }

@Article{Schumann94,
  author =   "J.~Schumann",
  title =    "Tableaux-based Theorem Provers --- Systems and
          Implementations",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  JAR,
  year =     "1994",
  volume =   "13",
  OPTnumber =    "",
  pages =    "409-421",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "DT, tableau-based theorem provers"
}


@Misc{GerberdingSchumann94,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Stefan Gerberding",
  title =    "{Deep Thought}",
  howpublished = "In Tableaux-based Theorem Provers --- Systems and
          Implementations, {\em Journal of Automated
          Reasoning} 13:409-421, J.~Schumann (ed.)",
  year =     "1994",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "DT, tableau-based theorem provers"
}

@inproceedings{Speirs97,
 author = "Chris Speirs and Zoltan Somogyi and Harald Sondergaard",
 title = "Termination Analysis for Mercury",
 editor    = "Pascal Van Hentenryck",
 booktitle     = "4th International Static Analysis Symposium (SAS), Paris, France, September 8-10, 1997, Proceedings",
 publisher = "Springer",
 series    = "Lecture Notes in Computer Science",
 volume    = "1302",
 year      = "1997",
 pages = "160-171"
}

@Book{Stoll96,
  author =   "Clifford,~Stoll",
  title =    "Die {W}{\"u}ste {I}nternet - {G}eisterfahrten auf der {D}atenautobahn",
  publisher =    "S.~Fischer Verlag",
  year =     "1996",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  keywords =     "Internet, popul{\"a}r-wissenschaftlich"
}

@InCollection{Surma74,
  author =   "S.~J.~Surma",
  title =    "An algorithm for axiomatizing every finite logic",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Computer Science and Multiple-Valued Logics",
  publisher =    "Noth-Holland, Amsterdam",
  year =     "1974",
  editor =   "D.~C.~Rine",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  pages =    "143-149",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "multiple-valued logics, tableau calculus"
}





@Book{fsharp:syme07,
  ALTauthor = 	 {Don Syme and Adam Granicz and Antonio Cisternino },
  title = 	 {Expert F\#},
  publisher = 	 {Apress},
  year = 	 {2007},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

%%% T


@inproceedings{Taha:POPL03,
 author = {Walid Taha and Michael Florentin Nielsen},
 title = {Environment classifiers},
 booktitle =     {30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'03)},
 year = {2003},
 pages = {26--37},
 address =   {New Orleans, Louisisana},
 month =     {January},
 publisher = ACM,
 doi = {http://doi.acm.org/10.1145/640128.604134}
 }


@InProceedings{TamakiSato86,
  author =   "H.~Tamaki and T.~Sato",
  title =    "{OLD} Resolution with tabulation",
  booktitle =    "Proceedings of the 3rd International Conference on
          Logic Programming",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "E.~.Shapiro",
  volume =   "225",
  OPTnumber =    "",
  series =   LNCS ,
  year =     "1986",
  OPTorganization = "",
  publisher = "Springer",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "84--98",
  OPTnote =      "",
  OPTannote =    ""
}

@InProceedings{Tammet96,
  author =   "T.~Tammet",
  title =    "A Resolution Theorem Prover for Intuitionistic Logic",
  booktitle =    CADE96,
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  volume =   "1104",
  OPTnumber =    "",
  series =   LNAI ,
  year =     "1996",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  pages =    "2--16",
  OPTnote =      "",
  OPTannote =    ""
}

@article{Thayer99strand,
  author = "J. Thayer and J. Herzog and J. Guttman",
  title = "Strand spaces: Proving security protocols correct",
  journal = "Journal of Computer Security",
  year = "1999",
  url = "citeseer.nj.nec.com/fabrega99strand.html" }

@Book{Trettin91,
  author =   "K{\"a}the Trettin",
  title =    "{D}ie {L}ogik und das {S}chweigen: {Z}ur antiken und
                  modernen {E}pistemotechnik",
  publisher =    "{A}cta {H}umaniora",
  year =     "1991",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@article{Turner79,
  author    = {D. A. Turner},
  title     = {A New Implementation Technique for Applicative Languages},
  journal   = {Softw., Pract. Exper.},
  volume    = {9},
  number    = {1},
  year      = {1979},
  pages     = {31-49}
}


@Book{Turkle96,
  author =   "Sherry Turkle",
  title =    "Life on the Screen - Identity in the Age of the Internet",
  publisher =    "MIT Press",
  year =     "1996",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "Internet, Frauen"
}

@Article{turner:TotalFunctionalProgramming:jucs_10_7, 
  author =     "D. A. Turner",                                                  
  title =      "Total Functional Programming", 
  abstract =   "The driving idea of functional programming is to make programming more closely related to mathematics\
. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rule\
s and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model \
of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recogni\
sed by the presence of partial functions. We consider a simple discipline of total functional programming designed to\
 exclude the possibility of non-termination. Among other things this requires a type distinction between data, which \
is finite, and codata, which is potentially infinite.", 
  journal =    "Journal of Universal Computer Science", 
  year =       "2004", 
  volume =     "10", 
  number =     "7", 
  pages =      "751--768", 
  note =       "http://www.jucs.org/jucs\_10\_7/total\_functional\_programming"}


@Book{Tymoczko85,
  author =   "Thomas Tymoczko",
  title =    "New Directions in the Philosophy of Mathematics-- An Anthology",
  publisher =    BIRK,
  year =     1985,
  editor =   "Thomas Tymoczko"
}

%%% U

@article{UllmanGelder+CACM88,
   author    = "Jeffrey D. Ullman and Allen van Gelder",
   title     = "Efficient Tests for Top-Down Termination of Logical Rules",
   journal   = CACM,
   year      = "1988",
   month     = apr,
   volume    = "35",
   number    = "2",
   pages     = "345-373",
   keywords  = "termination, prolog"
}

@article{Urban:TOCL11,
  author    = {Christian Urban and
               James Cheney and
               Stefan Berghofer},
  title     = {Mechanizing the metatheory of {LF}},
  journal   = {ACM Trans. Comput. Log.},
  volume    = {12},
  number    = {2},
  year      = {2011},
  pages     = {15},
  ee        = {http://doi.acm.org/10.1145/1877714.1877721},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{Urban:JAR08,
  author =       "Christian Urban",
  title =        "Nominal Techniques in {I}sabelle/{HOL}",
  journal =      JAR,
  year =         "2008",
  volume =       "40",
  number =       "4",
  pages =        "327-356",
  keywords =     "Lambda-calculus, nominal logic work, theorem provers"
}

%%% V

@TechReport{vanHarmelen93,
  author =   "F.~van Harmelen  and A.~Stevens and A.~Ireland and A.~Smaill  and S.~Negrete",
  title =    "The {C}lam proof planner, user manual and programmer manual",
  institution =  DAI,
  year =     "1993",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTtype =      "",
  number =   "{TP}-4",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "tactical theorem proving, proof plans, clam,
          planning, meta-reasoning"
}


@InProceedings{VanDePol95,
  author =       "J. van de Pol and H. Schwichtenberg",
  title =        "Strict Functionals for Termination Proofs",
  editor =       "M. Dezani-Ciancaglini and G. Plotkin",
  booktitle =    "Proceedings of the International Conference on Typed Lambda
                  Calculi and Applications",
  year =         1995,
  publisher =    "Springer-Verlag Lecture Notes in Computer Science (LNCS) 902",
  address =      "Edinburgh, Scotland",
  month =        apr,
  pages =        "350--364",
  keywords =     "rewriting"
}


@PhdThesis{Virga99phd,
  author =       "Roberto Virga",
  title =        "Higher-Order Rewriting with Dependent Types",
  school =       "Department of Mathematical Sciences, Carnegie Mellon
                  University",
  note = "{CMU}-{CS}-99-167",
  year =         "1999",
  keywords =     "LF, Elf, rewriting"
}

@TechReport{Virga1995:subordination,
  author =       "Roberto Virga",
  title =        "Higher-Order Superposition for Dependent Types",
  institution =       "Department of Mathematical Sciences, Carnegie Mellon University",
  number = "{CMU}-{CS}-95-150",
  year =         "1995"
}

		  
@Article{Vieille1989,
title={Recursive Query Processing: The Power of Logic},
author={Laurent Vieille},
pages={1--53},
journal=tcs,
year=1989,
month={5~} # dec,
volume=69,
number=1,
note={Fundamental study}
}


@book{Veloso94phd,
  author =       "Manuela Veloso",
  title =        "Planning and Learning by Analogical Reasoning",
  year =         1994,
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 886",
  publisher =    SPR,
  keywords =     "planning, analogy"
}




@InProceedings{Verbaeten+99,
  author =   "Sophie Verbaeten and Konstantinos Sagonas and Danny De Schreye",
  title =    "Modular Termination Proofs for {P}rolog with Tabling",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 1702",
  pages =    "342-359",
  booktitle =    "International Conference on Principles and Practice of Declarative Programming(PPDP'98)",
  year =     "1998",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "termination, tabling, tabled logic programming"
}


@incollection{Degtyarev:HAR01,
  author    = {Anatoli Degtyarev and
               Andrei Voronkov},
  title     = {The Inverse Method},
  booktitle = {Handbook of Automated Reasoning},
  year      = {2001},
  pages     = {179-272},
  crossref  = {RobinsonV01}
}

@book{RobinsonV01,
  editor    = {John Alan Robinson and
               Andrei Voronkov},
  title     = {Handbook of Automated Reasoning (in 2 volumes)},
  publisher = {Elsevier and MIT Press},
  year      = {2001},
  isbn      = {0-444-50813-9, 0-262-18223-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Voronkov:IJCAR01,
 author = {Andrei Voronkov},
 title = {Algorithms, Datastructures, and other Issues in Efficient Automated Deduction},
 booktitle = IJCAR01,
 year = {2001},
series = {LNAI 2083},
 isbn = {3-540-42254-4},
 pages = {13--28},
 publisher = {Springer-Verlag},
 address = {London, UK},
 }

@article{Voronkov:TOCL01,
 author = {Andrei Voronkov},
 title = {How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi},
 journal = {ACM Transactions on Computational Logic},
 volume = {2},
 number = {2},
 year = {2001},
 issn = {1529-3785},
 pages = {182--215},
 doi = {http://doi.acm.org/10.1145/371316.371511},
 publisher = ACM,
 address = {New York, NY, USA},
 }

 %%% W


@InProceedings{Wadler:ML98,
  author = 	 {Philip Wadler and Walid Taha and David MacQueen},
  title = 	 {How to add laziness to a strict language, without even being odd},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {Proceedings of the 1998 ACM SIGPLAN Workshop on ML},
  OPTpages = 	 {},
  year = 	 {1998}
}


@inproceedings{Walker:POPL00,
 author = {David Walker},
 title = {A type system for expressive security policies},
 booktitle = {Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
 year = {2000},
 isbn = {1-58113-125-9},
 pages = {254--267},
 location = {Boston, MA, USA},
 doi = {http://doi.acm.org/10.1145/325694.325728},
 publisher = ACM,
 }

@InProceedings{Walsh94,
  author =   "Toby Walsh",
  title =    "A Divergence Critic",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "",
  pages =    "14-28",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "divergence detection, lemma generation, generalization"
}



@inproceedings{Walther88,
   author    = "Christoph Walther",
   title     = "Argument-Bounded Algorithms as a Basis for Automated
       Termination Proofs",
   number    =   "310",
   series    =   "Lecture Notes in Computer Science (LNCS)",
   booktitle = CADE88,
   year      = 1988,
   publisher = SPR,
   pages     = "602-621",
   keywords  = "inductive reasoning, recursive functions, argument
       bounded functions, estimation calculus"
}


@Misc{Walther88b,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Christoph Walther",
  title =    "Beweisen durch vollst{\"a}ndige {I}nduktion -- {T}eil 2:
          Erzeugung von {I}nduktionsaxiomen",
  howpublished = "Vorlesungsskritpum, {GI}--Fr{\"u}hjahrsschule
          ``K{\"u}nstliche Intelligenz'', G{\"u}nne",
  year =     "1988",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "inductive reasoning, recursive functions, generating
          induction axioms"
}

@book{Walther90,
  author    = "Christoph Walther",
  title     = "{A}utomatisierung von {T}erminierungsbeweisen",
  year      = "1991",
  publisher = VIE,
  series    = "{K}{\"u}nst\-liche {I}n\-tel\-li\-genz",
  keywords  = "inductive reasoning, recursive functions, argument
       bounded functions, estimation calculus"
}


@techreport{Walther91,
  author    = "Christoph Walther",
  title     = "Computing Induction Axioms --- Methods and Formal Bases",
  institution = THD,
  year      = "1991",
  keywords  = "inductive reasoning, relation descriptions"
}


@techreport{Walther92a,
   author    = "Christoph Walther",
   title     = "Combining Induction Axioms by Machine",
   institution = THD,
   year      = "1992",
   keywords  = "inductive reasoning, relation descriptions, term
       rewriting systems, quasi commuting"
}


@inproceedings{Walther92b,
   author    = "Christoph Walther",
   title     = "Computing Induction Axioms",
   booktitle = LPAR92,
   year      = "1992",
   series    = "{Lecture Notes in Artificial Intelligence (LNAI)} 624",
   publisher = SPR,
   keywords  = "inductive reasoning, relation descriptions"
}


@InCollection{Walther93b,
  author =   "Christoph Walther",
  title =    "Mathematical Induction",
  OPTcrossref =  "",
  OPTkey =   "",
  booktitle =    "Handbook of Logic in Artificial Intelligence and
          Logic Programming",
  publisher =    OUP,
  year =     "1994",
  editor =   "D.~M.~Gabbay and C.~J.~Hogger and J.~A.~Robinson",
  volume =   "2",
  OPTnumber =    "",
  OPTseries =    "",
  OPTtype =      "",
  OPTchapter =   "",
  OPTpages =     "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}


@InProceedings{Walther93,
  author =  "Christoph Walther",
  title =   "Combining Induction Axioms by Machine",
  booktitle =   IJCAI93,
  volume =      "1",
  year =    "1993",
  OPTeditor =   "",
  pages =   "95-101",
  OPTorganization =     "",
  publisher =   MK,
  OPTaddress =  "",
  month =   aug,
  OPTnote =     "",
  keywords =    "relation descriptions, inductive reasoning, well
         founded orderings"
}


@Article{WashburnWeirich:JFP06,
  author = "Geoff Washburn and Stephanie Weirich",
  title = "Boxes Go Bananas: Encoding Higher-Order Abstract Syntax with Parametric Polymorphism",
  journal = "Journal of Functional Programming",
  year = 2008,
  volume = "18",
  number = {01},
  pages = {87-140},
}


@Article{Walther94,
  author =   "Christoph Walther",
  title =    "On Proving the Termination of Algorithms by Machine",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  AI,
  year =     "1994",
  volume =   "71",
  number =   "1",
  OPTpages =     "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords  = {inductive reasoning, recursive functions, argument
       bounded functions, estimation calculus}
}


@Book{Warren+book99,
  author =   {David S.~Warren},
  title =    {Programming in tabled logic programming},
  publisher =    {draft available from http://www.cs.sunysb.edu/\~warren/xsbbook/book.html},
  year =     1999
}

@TechReport{Watkins02tr,
  author =   {Kevin Watkins and Iliano Cervesato and Frank Pfenning
                  and David Walker},
  title =    {A Concurrent Logical Framework {I}: Judgments and Properties},
  institution =  {Department of Computer Science, Carnegie Mellon University},
  year =     2002,
  number =   {CMU-CS-02-101}
}

@Incollection{Weidenbach:HandbookAR:spass:2001,
  title = {Combining Superposition, Sorts and Splitting},
  author = {C. Weidenbach},
  chapter = 27,
  booktitle = {Handbook of Automated Reasoning},
  publisher = {Elsevier Science},
  editor = {A. Robinson and A. Voronkov},
  year = 2001,
  volume = {II},
  pages = {1965-2013}}


@InCollection{Welham88,
  author =   "Bob Welham",
  title =    "Declaratively programmable Interpreters and
                  Meta-Level Inference",
  booktitle =    MLAaR,
  OPTcrossref =  "",
  OPTkey =   "",
  publisher =    NoHo,
  OPTyear =      "",
  editor =   "Pattie Maes and Daniele Nardi",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTchapter =   "",
  OPTtype =      "",
  OPTaddress =   "",
  OPTedition =   "",
  OPTmonth =     "",
  pages =    "287-299",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "meta-reasoning, press"
}

@InProceedings{Wenzel99,
  author =   "Markus Wenzel",
  title =    "Isar - a generic interpretative approach to readable
          formal proof documents",
  OPTcrossref =  "",
  OPTkey =   "",
  editor =   "Y.~Bertot, G.~Dowek, A.~Hirschowitz, C.~Paulin, L.~ Thery",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Computer Science (LNCS) 1690",
  OPTpages =     "167-183",
  booktitle =    TPHOL99,
  year =     "1999",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "proof specification language, Isabelle"
}


@inproceedings{Westbrook:ICFP05,
author="E. Westbrook and A. Stump and I. Wehrman",
title={{A Language-based Approach to Functionally Correct Imperative Programming}},
booktitle="10th International Conference on Functional Programming (ICFP05)",
editor    = {Olivier Danvy and
               Benjamin C. Pierce},
pages     = {268-279},
year       ="2005",
 publisher = {ACM}
} 

@inproceedings{Westbrook:2011,
 author = {Edwin Westbrook and Nicolas Frisby and Paul Brauner},
 title = {Hobbits for {H}askell: a library for higher-order encodings in functional programming languages},
 booktitle = {4th ACM Symposium on Haskell (Haskell'11)},
 year = 2011,
 pages = {35--46},
 numpages = 12,
 publisher = {ACM},
 keywords = {haskell, higher-order encodings, name-binding},
} 

@InProceedings{WirthGramlich94,
  author =   "Claus-Peter Wirth and Bernhard Gramlich",
  title =    "On Notions of Inductive Validity for First-Order
          Equational Clauses",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  series =   "Lecture Notes in Artificial Intelligence (LNAI) 814",
  pages =    "162-174",
  booktitle =    CADE94,
  year =     "1994",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    "",
  keywords =     "inductive validity, semantics"
}


@InProceedings{WirthBecker94,
  author =   "Claus-Peter Wirth and Klaus Becker",
  title =    "Abstract Notions and Inference Systems for Proofs by
          Mathematical Induction",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "353-373",
  booktitle =    "Proceedings of the 14th International Workshop on
          Conditional and Typed Rewriting Systems (CTRS-94),
          Jerusalem, Israel",
  year =     "1994",
  OPTorganization = "",
  OPTpublisher = SPR,
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "Lecture Notes in Computer Science (LNCS) vol.\ 968",
  OPTannote =    "",
  keywords =     "mathematical induction, inductionless induction"
}


@Article{WhittleMelis98,
  author =   "J.~Whittle and E.~Melis",
  title =    "Analogy in inductive theorem proving",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Journal of Automated Reasoning",
  year =     "1998",
  OPTvolume =    "71",
  OPTnumber =    "1",
  OPTpages =     "",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords  = {inductive reasoning, analogy, critics}
}

@Article{Wos92,
  author =   "Larry Wos",
  title =    "Note on McCune's article on discrimination trees",
  OPTcrossref =  "",
  OPTkey =   "",
  journal =  "Journal of Automated Reasoning",
  year =     "1992",
  volume =   "9",
  number =   "2",
  pages =    "145--146",
  OPTmonth =     "",
  OPTnote =  "",
  OPTannote =    "",
  keywords =     {performance, term indexing, program degradation}
}


%%% X

@article{Xi:JUCS03,
author = "Hongwei Xi",
title = {{Dependently Typed Pattern Matching}},
journal = "Journal of Universal Computer Science",
volume = "9",
number = "8",
year = "2003",
pages = "851-872",
abstract = {{
The mechanism for declaring datatypes to model data structures in
programming languages such as Standard ML and Haskell can offer both
convenience in programming and clarity in code.  With the introduction of
dependent datatypes in DML, the programmer can model data structures with
more accuracy, thus capturing more program invariants.  In this paper, we
study some practical aspects of dependent datatypes that affect both
type-checking and compiling pattern matching.  The results, which have
already been tested, demonstrate that dependent datatype can not only offer
various programming benefits but also lead to performance gains, yielding a
concrete case where safer programs run faster.
}}
}

@inproceedings{Xi:PEPM03,
 author = {Chen, Chiyan and Xi, Hongwei},
 title = {Implementing typeful program transformations},
 booktitle = {Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation},
 series = {PEPM '03},
 year = {2003},
 isbn = {1-58113-667-6},
 location = {San Diego, California, USA},
 pages = {20--28},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/777388.777392},
 doi = {http://doi.acm.org/10.1145/777388.777392},
 acmid = {777392},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {CPS, DML, continuation-passing style, dependent ML, dependent types, typeful program transformation},
}

@inproceedings{Xi:LICS01,
author = "Hongwei Xi",
title = {{Dependent Types for Program Termination Verification}},
booktitle = "Proceedings of 16th IEEE Symposium on Logic in Computer Science",
year = 2001,
month = jun,
pages = "231--242",
address = "Boston"
}

%%% Y

@inproceedings{Yuse:PPDP06,
  author    = {Yosihiro Yuse and
               Atsushi Igarashi},
  title     = {A modal type system for multi-level generating extensions
               with persistent code},
  editor    = {Annalisa Bossi and
               Michael J. Maher},
  booktitle     = {8th International ACM SIGPLAN Conference
               on Principles and Practice of Declarative Programming (PPDP'06)},
  year      = {2006},
  publisher = {ACM},
  pages     = {201-212},
  doi       = {10.1145/1140335.1140360}
}


%%% Z


@Article{Zeilberger:APAL,
  author =      "Noam Zeilberger",
  title =       "On the unity of duality. ",
  journal =     "Annals of Pure and Applied Logic",
  year =        2007,
  volume =      "to appear (draft available on Noam's webpage)",
  pages =       ""
}

@inproceedings{Zeilberger:POPL08,
    author = "Noam Zeilberger",
    title = "Focusing and higher-order abstract syntax",
    booktitle = "Conference Record of the 35th Annual {ACM} Symposium on Principles of Programming Languages, San Francisco, California",
    publisher = "ACM",
    pages = "to appear(draft available on Noam's webpage)",
    year = "2008",
    url = "draft available on Noam's webpage" }


@article{Zenger:TCS97,
  author    = {Christoph Zenger},
  title     = {Indexed Types},
  journal   = {Theoretical Computer Science},
  volume    = {187},
  number    = {1-2},
  year      = {1997},
  pages     = {147-165}
}



@techreport{Zhang92,
  author    = "Hantao Zhang",
  title     = "Automatic Proofs of Equality Problems in {O}verbeek's
       Competition",
  institution = "The University of Iowa, Dept.\ of Computer Science",
  year      = "1992",
  month     = jul,
  keywords  = "inductionless induction, problemsets, Overbeek's
       competition"
}


@inproceedings{ZhangKapurKrishnamoorthy88,
  author    = "Hantao Zhang and Deepak Kapur and Mukkai S.~Krishnamoorthy",
  title     = "A Mechanizable Induction Principle for Equational
       Specifications",
  number    = "310",
  series    = "{Lecture Notes in Computer Science (LNCS)}",
  booktitle = CADE88,
  year      = "1988",
  publisher = SPR,
  pages     = "162-181",
  keywords  = "inductionless induction, cover set, cover set
          induction, generalizing structural induction"
}

@InProceedings{ZhangRemy85,
  author =   "Hantao Zhang and Jean-Luc Remy",
  title =    "Contextual Rewriting",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "46-62",
  booktitle =    RTA85,
  year =     "1985",
  OPTorganization = "",
  publisher =    SPR,
  OPTaddress =   "",
  month =    may,
  note =     "Lecture Notes in Computer Science (LNCS) 202",
  OPTannote =    "",
  keywords =     "contextual rewriting, conditional rewriting,
          completion of conditional rewrite systems,
          confluence of conditional rewrite systems"
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Personal communication and such ...

@Misc{AAAIIndWS93,
  OPTcrossref =  "",
  OPTkey =   "AAAI",
  author =   "{AAAI}",
  title =    "Induction Workshop",
  OPThowpublished = "",
  year =     "1993",
  OPTmonth =     "",
  note =     "Personal Communication",
  OPTannote =    ""
}




@Misc{MIndIndUS,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Pers{\"o}nliche Kommunikation: MInd/IndUS",
  OPTtitle =     "",
  OPThowpublished = "",
  year =     "1993",
  OPTmonth =     "",
  note =     "{\"U}ber den MInd/IndUS E-mail Verteiler werden
          Beweisprobleme der im Gebiet arbeitenden Gruppen ausgetauscht
          (Gruppe {\bf M}echanizing {\bf Ind}uction / Europa,
          Gruppe {\bf Ind}uction {\bf US} / USA)",
  OPTannote =    ""
}

@Article{deMillo79,
  author =   "R.A.de~Millo and R.J.~Lipton and A.J.~Perlis",
  title =    "Social Processes and Proofs of Theorems and Programs",
  journal =      CACM,
  year =     "1979",
  OPTkey =   "",
  volume =   "22",
  number =   "5",
  month =    "May",
  OPTpages =     "271 - 280",
  OPTnote =      "",
  OPTannote =    ""
}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%55
%%% Students

@inproceedings{Tian:06,
Author = {Tian, Ye Henry},
Title = {Mechanically Verifying Correctness of CPS Compilation},
BookTitle = {Twelfth Computing: The Australasian Theory Symposium (CATS2006)},
Editor = {Gudmundsson, Joachim and Jay, Barry},
Series= {CRPIT},
Address= {Hobart, Australia},
Publisher = {Australian Computing Society},
Volume = {51},
Pages = {41-51},
Year = {2006} }

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%
% Cayenne
%


@InProceedings{Augustsson:FPCA85,
   author    = {Lennart Augustsson},
   title     = {Compiling Pattern Matching},
   booktitle = {Functional Programming Languages and Computer Architecture (FPCA'85)},
   series = {Lecture Notes in Computer Science (LNCS)},
   editor = {Jouannaud, Jean-Pierre},
   publisher = {Springer},
   pages = {368-381},
   volume = {201},
   year = {1985}
}


@InProceedings{Augustsson98Cayenne,
   author    = {Lennart Augustsson},
   title     = {Cayenne---a Language with Dependent Types},
   booktitle = {3rd International Conference on Functional Programming (ICFP '98)},
   pages     = {239--250},
   year      = {1998},
   publisher = ACM,
   url       = {citeseer.nj.nec.com/augustsson98cayenne.html}
}

%
% Epigram
%

@article{McBride04:ViewFromTheLeft,
 author    = {Conor McBride and James McKinna},
 title     = {The view from the left},
 journal   = jfp,
 volume    = {14},
 number    = {1},
 year      = {2004},
 pages     = {69--111},
 publisher = cup
}

@unpublished{Altenkirch05:Epigram,
  author   = {Thorsten Altenkirch and Conor McBride and James McKinna},
  title    = {Why dependent types matter},
  year     = {2005},
  note     = {Manuscript, available online},
}

@unpublished{epigram-system,
  author   = {Conor McBride},
  title    = {The Epigram Prototype: a nod and two winks},
  month    = {April},
  year     = {2005},
  url      = {www.e-pig.org/downloads/epigram-system.pdf},
  note     = {Manuscript, available online},
}

%
% Wmega / Omega / whatever it's called
%

@Article{Sheard04:LanguagesOfTheFuture,
  author =       {Tim Sheard},
  title =        {Languages of the future},
  journal =    {SIGPLAN Notices},
  pages =     {119--132},
  volume = 39,
  number = 12,
  year =      {2004},
  publisher = {ACM},
  OPTmonth =     dec,
  OPTote = "OOPSLA '04"
}

@inproceedings{Sheard:FOSER2010,
 author = {Sheard, Tim and Stump, Aaron and Weirich, Stephanie},
 title = {Language-based verification will change the world},
 booktitle = {{W}orkshop on {F}uture of {S}oftware {E}ngineering {R}esearch (FoSER'10)},
 year = {2010},
 isbn = {978-1-4503-0427-6},
 location = {Santa Fe, New Mexico, USA},
 pages = {343--348},
 numpages = {6},
 acmid = {1882432},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {dependently typed programming, language-based verification},
} 



@InProceedings{Sheard04:TypeEquality,
  author =       {Tim Sheard and Emir Pasalic},
  title =        {Meta-programming with built-in type equality},
  booktitle =    {Int'l Workshop on Logical Frameworks and Meta-languages (LFM '04)},
  pages =     {106--124},
  year =      {2004},
  OPTmonth =     jul
}

@unpublished{Linger2004,
  title={Programming with static invariants in omega},
  author={Linger, N. and Sheard, T.},
  note={Unpublished},
  year={2004}
}


%
% DML
%

@InProceedings{Xi99popl,
  author    = {Hongwei Xi and Frank Pfenning},
  title     = {Dependent types in practical programming},
  pages     = {214--227},
  booktitle = {26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'99)},
  year      = {1999},
  publisher = ACM,
  keywords  = {fp}
}

@PhdThesis{XiThesis,
  author    = {Hongwei Xi},
  title     = {Dependent types in practical programming},
  school    = {Carnegie Mellon University},
  year      = {1998},
  OPTmonth  = sep
}

@Unpublished{Xi00:REVDependentlyTypedDataStructures,
  author =       {Hongwei Xi},
  title =        {Dependently typed data structures},
  note =         {Revision superseding WAAAPL '99; \url{http://www.cs.bu.edu/~hwxi/academic/papers/DTDS.pdf}},
  annote ={ versions: (1) the original; (2) the one above (.../DTDS.pdf); (3) one dated 2002 and supposedly under consideration
   in J. Func. Prog.: \url{http://www.cs.bu.edu/~hwxi/academic/papers/PwDTDS.pdf}},
  OPTmonth =        {February},
  year =         {2000}
}

%
% Xi's work on termination
%

@InProceedings{Xi01lics,
    author = "Hongwei Xi",
    title = {Dependent Types for Program Termination Verification},
    booktitle = "Logic in Computer Science (LICS '01)",
    year = {2001},
    month = jun,
    pages = "231--242"
}

@article{Xi02:termination,
    author = "Hongwei Xi",
    title = {Dependent Types for Program Termination Verification},
    journal = "Journal of Higher-Order and Symbolic Computation",
    year = 2002,
    month = oct,
    volume = 15,
    pages = "91--131"
}

%
% Xi's ATS, etc.
%

@InProceedings{Xi03:ATS,
author = {Hongwei Xi},
title = {Applied Type System},
booktitle = {TYPES 2003},
year = {2004},
volume={3085},
pages = {394--408},
series = lncs,
publisher = {Springer},
abstract = {{
The framework Pure Type System (PTS) offers a simple and general
approach to designing and formalizing type systems. However, in the
presence of dependent types, there often exist some acute problems that
make it difficult for PTS to accommodate many common realistic
programming features such as general recursion, recursive types, effects
(e.g., exceptions, references, input/output), etc. In this paper, we
propose a new framework Applied Type System (ATS) to allow for designing
and formalizing type systems that can readily support common realistic
programming features. The key salient feature of ATS lies in a complete
separation between statics, in which types are formed and reasoned about,
and dynamics, in which programs are constructed and evaluated. With this
separation, it is no longer possible for a program to occur in a type as is
otherwise allowed in PTS.  We present not only a formal development of
ATS but also mention some examples in support of using ATS as a
framework to form type systems for practical programming.
}}
}

@TechReport{ChH03Pha,
  author =       {James Cheney and Ralf Hinze},
  title =        {First-Class Phantom Types},
  institution =  {Cornell University},
  year =         {2003},
  number =       {CUCIS TR2003-1901}
}

@InProceedings{Chen05:CombiningProgramsWithProofs,
  author =       {Chiyan Chen and Hongwei Xi},
  title =        {Combining programming with theorem proving},
  booktitle =    {10th International Conference on Functional Programming},
  pages =     {66--77},
  year =      {2005},
 editor    = {Olivier Danvy and Benjamin C. Pierce}
}

%
% GADTs
%

@InProceedings{PeytonJones06:GADTs,
  TITLE = "Simple unification-based type inference for {GADTs}",
  AUTHOR = "Simon {Peyton Jones} and Dimitrios Vytiniotis and Stephanie Weirich and Geoffrey Washburn",
  YEAR   = 2006,
  booktitle = {11th ACM SIGPLAN Int'l Conference on Functional Programming (ICFP '06)},
  shortbooktitle = {Int'l Conf.\ Functional Programming (ICFP '06)},
  pages = {50--61},
  MONTH = sep,
  OPTaddress = {Portland, Oregon},
  OPTorganization = {ACM SIGPLAN},
  ABSTRACT = {
Generalized algebraic data types (GADTs), sometimes known as ``guarded recursive data types'' or
``first-class phantom types'', are a simple but powerful generalization of the
data types of Haskell and ML.  Recent works have given compelling examples of the utility of
GADTs, although type inference is known to be difficult.
Our contribution is to show how to exploit programmer-supplied type annotations
to make the type inference task almost embarrassingly easy.
Our main technical innovation is \emph{wobbly types},
which express in a declarative way the uncertainty caused by the
incremental nature of typical type-inference algorithms.
  }
}

@InProceedings{Xi03:guarded,
   author    = {Hongwei Xi and Chiyan Chen and Gang Chen},
   title     = {Guarded recursive datatype constructors},
   booktitle = {30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '03)},
   year      = {2003},
   pages     = {224--235},
   publisher = ACM
}

@inproceedings{Donnelly:Merlin05,
  author    = {Kevin Donnelly and
               Hongwei Xi},
  title     = {Combining higher-order abstract syntax with first-order
               abstract syntax in ATS},
  editor    = {Randy Pollack},
  booktitle     = {{Workshop on Mechanized Reasoning about Languages with Variable
               Binding (MERLIN'05)}},
  year      = {2005},
  pages     = {58-63},
  publisher = {ACM}
}




%
% Nuprl
%

@article{felty1998protocol,
   title     = {{Protocol verification in Nuprl}},
   author    = {Amy P. Felty and Douglas J. Howe and Frank A. Stomp},
   journal   = {Lecture Notes in Computer Science},
   volume    = {1427},
   pages     = {428--439},
   year      = {1998},
   publisher = {Springer}
}

@manual{kreitz2002nuprl,
   title        = {{The Nuprl Proof Development System, Version 5: Reference Manual and User's Guide}},
   author       = {Cristoph Kreitz},
   organisation = {Department of Computer Science, Cornell University},
   year         = {2002},
   note         = {Available online}
}

%
% unsorted
%

@INPROCEEDINGS{Baelde07:Bedwyr,
  title = {The {Bedwyr} system for model checking over
                  syntactic expressions},
  author = {David Baelde and Andrew Gacek and Dale Miller and
                  Gopalan Nadathur and Alwen Tiu},
  booktitle = {21st Conference on Automated Deduction},
  pages = {391--397},
  year = 2007,
  editor = {Frank Pfenning},
  number = 4603,
  series = {LNAI},
  publisher = {Springer},
  pdf = {http://www.cs.umn.edu/~agacek/pubs/baelde07cade.pdf}
}

@INPROCEEDINGS{Baelde:IJCAR10,
  title = {Focused Inductive Theorem Proving},
  author = {David Baelde and Zach Snow and Dale Miller},
  booktitle = {5th International Joint Conference on Automated Reasoning (IJCAR'10)},
  pages = {278-292},
  year = {2010},
  editor = {J{\"u}rgen Giesl and Reiner Haehnle},
  OPTnumber = {},
  series = {Lecture Notes in Artificial Intelligence (LNAI 6173)},
  publisher = {Springer},
}



@Article{Baelde:TOCL11,
  author = 	 {David Baelde},
  title = 	 {Least and greatest fixed points in linear logic},
  journal = 	 {ACM Transactions on Computational Logic},
  year = 	 {2011},
  OPTkey = 	 {},
  volume = 	 {13},
  number = 	 {1},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@InProceedings{Appel01,
  author =   Appel,
  title =    {Foundational Proof-Carrying Code},
  crossref =     {LICS01},
  pages =    {247-258}
}

@inproceedings{Morgenstern:ICFP10,
  author    = {Jamie Morgenstern and
               Daniel R. Licata},
  title     = {Security-typed programming within dependently typed programming},
  editor    = {Paul Hudak and
               Stephanie Weirich},
  title     = {15th ACM SIGPLAN {I}nternational {C}onference
               on {F}unctional {P}rogramming (ICFP'10)},
  year      = {2010},
  pages     = {169-180},
  publisher = {ACM}
}


@InProceedings{Morrisett98,
  author =   Morrisett #{and}# Walker #{and}# Crary #{and}# Glew,
  title =    {From System {F} to Typed Assembly Language},
  crossref =     {POPL98},
  pages =    {85-97},
  abstract =     {We motivate the design of a statically typed assembly
                  language (TAL) and present a type-preserving translation from
                  System F to TAL. The TAL we present is based on a
                  conventional RISC assembly language, but its static type
                  system provides support for enforcing high-level language
                  abstractions, such as closures, tuples, and objects, as well
                  as user-defined abstract data types. The type system ensures
                  that well-typed programs cannot violate these
                  abstractions. In addition, the typing constructs place almost
                  no restrictions on low-level optimizations such as register
                  allocation, instruction selection, or instruction
                  scheduling. Our translation to TAL is specified as a sequence
                  of type-preserving transformations, including CPS and closure
                  conversion phases; type-correct source programs are mapped to
                  type-correct assembly language. A key contribution is an
                  approach to polymorphic closure conversion that is
                  considerably simpler than previous work. The compiler and
                  typed assembly language provide a fully automatic way to
                  produce proof carrying code, suitable for use in systems
                  where untrusted and potentially malicious code must be
                  checked for safety before execution.}
}
@InProceedings{Necula97,
  author =   {George C. Necula},
  title =    {Proof-Carrying Code},
  crossref =     {POPL97},
  sm-url =       {http://foxnet.cs.cmu.edu/papers/necula-popl97.ps},
  abstract =     {This paper describes proof-carrying code (PCC), a mechanism
                  by which a host system can determine with certainty that it
                  is safe to execute a program supplied (possibly in binary
                  form) by an untrusted source. For this to be possible, the
                  untrusted code producer must supply with the code a safety
                  proof that attests to the code's adherence to a previously
                  defined safety policy.  The host can then easily and quickly
                  validate the proof without using cryptography and without
                  consulting any external agents.
                  In order to gain preliminary experience with PCC, we have
                  performed several case studies.  We show in this paper how
                  proof-carrying code might be used to develop safe
                  assembly-language extensions of ML programs. In the context
                  of this case study, we present and prove the adequacy of
                  concrete representations for the safety policy, the safety
                  proofs, and the proof validation.  Finally, we briefly
                  discuss how we use proof-carrying code to develop network
                  packet filters that are faster than similar filters developed
                  using other techniques and are formally guaranteed to be safe
                  with respect to a given operating system safety policy.}
}

@inproceedings{Shao98:imp,
  author =	 Shao #{and}# League #{and}# Monnier,
  title =	 "Implementing Typed Intermediate Languages",
  crossref =	 {ICFP98},
  pages =	 "313--323",
}



@InProceedings{Shao02,
  author =   Shao #{and}# Saha #{and}# Trifonov #{and Nikolaos
                 Papaspyrou},
  title =    {A Type System for Certified Binaries},
  pages =    {217-232},
  crossref =     {POPL02},
  abstract =     {A certified binary is a value together with a proof that
                  the value satisfies a given specification.
                  Existing compilers that generate certified code have
                  focused on simple memory and control-flow safety rather
                  than more advanced properties. In this paper, we present
                  a general framework for explicitly representing complex
                  propositions and proofs in typed intermediate and assembly
                  languages.  The new framework allows us to reason about
                  certified programs that involve effects while still
                  maintaining decidable typechecking.  We show how to
                  integrate an entire proof system (the calculus of
                  inductive constructions) into a compiler intermediate
                  language and how the intermediate language can undergo
                  complex transformations (CPS and closure conversion) while
                  preserving proofs represented in the type system. Our work
                  provides a foundation for the process of automatically
                  generating certified binaries in a type-theoretic
                  framework.}
}

@inproceedings{Shao:FLINT95,
 author = {Shao, Zhong and Appel, Andrew W.},
 title = {A type-based compiler for {S}tandard {ML}},
 booktitle = {ACM SIGPLAN 1995 Conference on Programming
                  Language Design and Implementation (PLDI'95)},
 year = {1995},
 pages = {116--129},
 numpages = {14},
 doi = {10.1145/207110.207123},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@inproceedings{Shao:FLINT97,
  title={An overview of the {FLINT/ML} compiler},
  author={Shao, Z.},
  booktitle={1997 Workshop on Types in Compilation},
  year={1997},
  location={Amsterdam, Netherlands}
}


@InProceedings{TIL96,
  author =   Tarditi #{and}# Morrisett #{and}# Cheng #{and}# Stone
                  #{and}# Harper #{and}# Lee,
  title =    {{TIL}: A Type-Directed Optimizing Compiler for {ML}},
  crossref =     {PLDI96},
  pages =    {181-192}
}

@Manual{BedwyrUserManual,
  title =        {A User Guide to {Bedwyr}},
  author =    {David Baelde and Andrew Gacek and Dale Miller and Gopalan Nadathur and Alwen Tiu},
  OPTorganization = {},
  OPTaddress =   {},
  month = nov,
  year =      {2006},
  url = {http://slimmer.gforge.inria.fr/bedwyr/},
  OPTnote =      {},
  OPTannote =    {}
}

@inproceedings{Gacek:LFMTP09,
title = "Reasoning in {A}bella about Structural Operational Semantics
                  Specifications ",
author = "Andrew Gacek and Dale Miller and Gopalan Nadathur",
booktitle = "Proceedings of the International Workshop on Logical Frameworks
                  and Metalanguages: Theory and Practice (LFMTP 2008)",
publisher = "Elsevier",
series = "Electronic Notes in Theoretical Computer Science (ENTCS)",
volume = "228",
pages = "85 - 100",
year = "2009",
issn = "1571-0661",
keywords = "Structural operational semantics"
}



@Unpublished{Gacek08:AbellaDraft,
   author      = {Andrew Gacek and Dale Miller and Gopalan Nadathur},
   title       = {Combining generic judgments with recursive definitions},
   year        = 2008,
   month       = jan,
   note        = {Draft, arXiv:0802.0865v1 [cs.LO]},
   OPTarxivkey = {arXiv:0802.0865v1 [cs.LO]},
   pdf         = {http://arxiv.org/pdf/0802.0865v1.pdf},
   OPTurl      = {http://arXiv.org/abs/0802.0865v1},
   OPTNOTE     = {superseded by Gacek:LICS08}
}

@INPROCEEDINGS{Gacek:LICS08,
   author      = {Andrew Gacek and Dale Miller and Gopalan Nadathur},
   title       = {Combining generic judgments with recursive definitions},
   booktitle   = {23rd Symposium on Logic in Computer Science},
   year        = {2008},
   editor      = {F. Pfenning},
   publisher   = {IEEE Computer Society Press}
}

@article{Gacek:JAR12,
  author    = {Andrew Gacek and
               Dale Miller and
               Gopalan Nadathur},
  title     = {A Two-Level Logic Approach to Reasoning About Computations},
  journal   = {Journal of Automated Reasoning},
  volume    = {49},
  number    = {2},
  year      = {2012},
  pages     = {241-273}
}


 @INPROCEEDINGS{Gacek:IJCAR08,
  author = {Andrew Gacek},
  title = {The {A}bella Interactive Theorem Prover (System
                  Description)},
  year = 2008,
  booktitle = IJCAR08,
  pages = {154--161},
  publisher = {Springer},
  series = {Lecture Notes in Artificial Intelligence},
  volume = 5195,
  OPTeditor = {A. Armando and P. Baumgartner and G. Dowek},
  OPTpdf = {http://arxiv.org/pdf/0803.2305.pdf},
  OPTslides = {http://www.cs.umn.edu/~agacek/pubs/slides/gacek08ijcar-slides.pdf}
}

@INPROCEEDINGS{Licata:LICS08,
   author      = {Daniel R. Licata and Noam Zeilberger and Robert Harper},
   title       = {Focusing on Binding and Computation},
   booktitle   = {{23rd Symposium on Logic in Computer Science}},
   year        = {2008},
   pages       = {241-252},
   editor      = {F. Pfenning},
   publisher   = {IEEE Computer Society Press}
}

@TechReport{Licata:LICS08-long,
   author      = {Daniel R. Licata and Noam Zeilberger and Robert Harper},
   title       = {Focusing on Binding and Computation},
   institution = {Dept. of Computer Science, Carnegie Mellon University},
   year        = {2008},
   number      = {CMU-CS-08-101},
   OPTannote   = {Long version of LICS '08 paper}
}

@inproceedings{Guillemette:Haskell07,
 author = {Guillemette, Louis-Julien and Monnier, Stefan},
 title = {A type-preserving closure conversion in {H}askell},
 booktitle = {Proceedings of the ACM SIGPLAN {W}orkshop on {H}askell},
 series = {Haskell '07},
 year = {2007},
 pages = {83--92},
 numpages = {10},
 keywords = {compilation, de bruijn, higher-order abstract syntax, typed assembly language},
} 

@inproceedings{Licata:ICFP09,
  author = 	 {Daniel R. Licata and Robert Harper},
  title = 	 {A Universe of Binding and Computation},
  booktitle =    "14th {ACM} {SIGPLAN} {I}nternational {C}onference on {F}unctional {P}rogramming",
  pages = {123-134},
  editor = "Graham Hutton and Andrew P. Tolmach",
  publisher = "ACM Press",
  year = 	 {2009},
}

@INPROCEEDINGS{Minamide:POPL96,
    author = {Yasuhiko Minamide and Greg Morrisett and Robert Harper},
    title = {Typed Closure Conversion},
    booktitle = {In Twenty-Third ACM Symposium on Principles of Programming Languages},
    year = {1996},
    pages = {271--283},
    publisher = {ACM Press}
}

@inproceedings{Berger:LICS91,
author = {Ulrich Berger and Helmut Schwichtenberg},
title = {An Inverse of the Evaluation Functional for Typed lambda-calculus},
booktitle = {Logic in Computer Science},
year = {1991},
pages = {203--211},
masid = {556722}
}

@InCollection{clark78,
  author =       "K. L. Clark",
  title =        "Negation as failure",
  publisher =    "Plenum Press, New York",
  year =         "1978",
  editor =       "J. Gallaire and J. Minker",
  booktitle =    "Logic and Data Bases",
  pages =        "293--322",
}

@inproceedings{Sulzmann:TLDI07,
 author = {Sulzmann, Martin and Chakravarty, Manuel M. T. and Jones, Simon Peyton and Donnelly, Kevin},
 title = {System F with type equality coercions},
 booktitle = {{ACM SIGPLAN International Workshop on Types in Languages Design
                  and Implementation (TLDI'07)}},
 year = {2007},
 pages = {53--66},
 publisher = {ACM},
 keywords = {advanced type features, typed intermediate language},
} 

@incollection {Altenkirch10,
   author = {Altenkirch, Thorsten and Chapman, James and Uustalu, Tarmo},
   affiliation = {University of Nottingham School of Computer Science},
   title = {Monads Need Not Be Endofunctors},
   booktitle = {Foundations of Software Science and Computational Structures},
   series = {Lecture Notes in Computer Science},
   editor = {Ong, Luke},
   publisher = {Springer Berlin / Heidelberg},
   isbn = {},
   pages = {297-311},
   volume = {6014},
   year = {2010}
}

@PhdThesis{LicataThesis,
   author     = {Daniel R. Licata},
   title      = {Dependently Typed Programming with Domain-Specific Logics},
   school     = {Carnegie Mellon University}, 
   year       = {2011}
}

@PhdThesis{DunfieldThesis,
   author     = {Joshua Dunfield},
   title      = {A Unified System of Type Refinements},
   school     = {Carnegie Mellon University},
   year       = {2007},
   OPTkey     = {},
   OPTtype    = {},
   OPTaddress = {},
   OPTmonth   = {},
   note       = {CMU-CS-07-129},
   OPTannote  = {}
}

@InProceedings{Reynolds:subtyping80,
   author     = {John C. Reynolds},
   title      = {Using category theory to design implicit conversions and generic operators},
   booktitle  = {Aarhus Workshop on Semantics-Directed Compiler Generation},
   publisher  = {Springer},
   series     = lncs,
   year       = {1980}
}

@techreport{Pierce97boundedquantification,
   author      = {Benjamin C. Pierce},
   title       = {Bounded Quantification with Bottom},
   institution = {Computer Science Department, Indiana University},
   number      = {TR492},
   year        = {1997}
}

@article{de1972lambda,
  title     = {{Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem}},
  author    = {de Bruijn, N.G.},
  journal   = {Indag. Math},
  volume    = {34},
  number    = {5},
  pages     = {381--392},
  year      = {1972},
  publisher = {Citeseer}
}

@InProceedings{Crary:ExplicitContexts08,
   author    = "Karl Crary",
   title     = "Explicit Contexts in {LF}",
   booktitle = {International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08)},
   month     = jun,
   year      = {2009},
   series    = {Electronic Notes in Theoretical Computer Science (ENTCS)},
   volume    = {228},
   pages     = {53--68},
   publisher = {Elsevier}
}

@inproceedings{Dargaye:CPS07,
  author    = {Zaynah Dargaye and
               Xavier Leroy},
  title     = {Mechanized Verification of CPS Transformations},
  booktitle = {LPAR},
  year      = {2007},
  pages     = {211-225},
  doi       = {10.1007/978-3-540-75560-9_17},
  crossref  = {DBLP:conf/lpar/2007}
}

@proceedings{DBLP:conf/lpar/2007,
  editor    = {Nachum Dershowitz and
               Andrei Voronkov},
  title     = {Logic for Programming, Artificial Intelligence, and Reasoning,
               14th International Conference, LPAR 2007, Yerevan, Armenia,
               October 15-19, 2007, Proceedings},
  booktitle = {LPAR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {4790},
  year      = {2007},
  isbn      = {978-3-540-75558-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@Article{dowek:modulo,
	author = {Dowek, Gilles and Hardin, Th{\'e}r{\`e}se and Kirchner, Claude},
	title = {Theorem Proving Modulo},
	journal = {Journal of Automated Reasoning},
	volume = {31},
	number = {1},
	pages = {33-72},
	year = {2003}
}

@InProceedings{Bove:Agda-TPHOLs09,
  author =       {Ana Bove and Peter Dybjer and Ulf Norell},
  title =        {A Brief Overview of {Agda}---A Functional Language with Dependent Types},
  booktitle =    TPHOLs09,
  pages =     {73--78},
  year =      {2009},
  volume =    {5674},
  series =    lncs,
  publisher = {Springer}
}

@article{Barthe:CPS99,
  author    = {Gilles Barthe and
               John Hatcliff and
               Morten Heine S{\o}rensen},
  title     = {CPS Translations and Applications: The Cube and Beyond},
  journal   = {Higher-Order and Symbolic Computation},
  volume    = {12},
  number    = {2},
  year      = {1999},
  pages     = {125-170},
  doi       = {10.1023/A:1010000206149},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Barthe:WNSN01,
  author    = {Gilles Barthe and
               John Hatcliff and
               Morten Heine S{\o}rensen},
  title     = {Weak normalization implies strong normalization in a class
               of non-dependent pure type systems},
  journal   = {Theor. Comput. Sci.},
  volume    = {269},
  number    = {1-2},
  year      = {2001},
  pages     = {317-361},
  ee        = {10.1016/S0304-3975(01)00012-3},
}

@inproceedings{Reynolds:Defints1972,
  author    = {Reynolds, J. C.},
  title     = {Definitional interpreters for higher-order programming languages},
  booktitle = {{Proceedings of the ACM Annual Conference}},
  year      = {1972},
  month     = aug,
  pages     = {717--740},
  volume    = {2},
  publisher = ACM,
}

@mastersthesis{Steele:MastersThesis,
 author = {Steele,Jr., Guy L.},
 title = {Rabbit: A Compiler for Scheme},
 year = {1978},
 school = {Massachusetts Institute of Technology},
}

@inproceedings{Fischer:1972,
 author = {Fischer, Michael J.},
 title = {Lambda calculus schemata},
 booktitle = {Proceedings of ACM conference on Proving assertions about programs},
 year = {1972},
 location = {Las Cruces, New Mexico, United States},
 pages = {104--109},
 numpages = {6},
 url = {http://doi.acm.org/10.1145/800235.807077},
 doi = {10.1145/800235.807077},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@article{Plotkin:1975,
title = "Call-by-name, call-by-value and the {$\lambda$}-calculus",
journal = "Theoretical Computer Science",
volume = "1",
number = "2",
pages = "125--159",
year = "1975",
doi = "10.1016/0304-3975(75)90017-1",
author = "Plotkin, G.D."
}

@techreport{Nielsen:Defun2000,
  author = {Nielsen, L.R.},
  title = {A denotational investigation of defunctionalization},
  year = 2000,
  institution = {BRICS},
  number = {RS-00-47},
}

@incollection{Banerjee:Trans2001,
   author = {Banerjee, Anindya and Heintze, Nevin and Riecke, Jon},
   title = {Design and Correctness of Program Transformations Based on Control-Flow Analysis},
   booktitle = {Theoretical Aspects of Computer Software},
   series = {Lecture Notes in Computer Science},
   editor = {Kobayashi, Naoki and Pierce, Benjamin},
   publisher = {Springer Berlin / Heidelberg},
   pages = {420-447},
   volume = {2215},
   doi = {10.1007/3-540-45500-0_21},
   year = {2001}
}

@Misc{Pierce:SF10,
  OPTkey = 	 {},
  author = 	 {Benjamin Pierce},
  title = 	 {Software Foundations},
  OPThowpublished = {},
  OPTmonth = 	 {},
  year = 	 {2010},
  note = 	 {\url{http://www.cis.upenn.edu/~bcpierce/sf/}},
  OPTannote = 	 {}
}

@TechReport{LeroyTechReport:POPLmark,
  author = 	 {Xavier Leroy},
  title = 	 {{A} locally nameless solution to the {POPL}mark challenge},
  institution =  {INRIA},
  year = 	 2007,
  number = 	 6098,
  month = 	 {January}}

@Misc{Leroy:POPLmark,
  author = 	 {Xavier Leroy},
  title = 	 {{A} locally nameless solution to the {POPL}mark challenge},
  OPTmonth = 	 {},
  year = 	 {2007},
  note = 	 {\url{http://http://pauillac.inria.fr/~xleroy/POPLmark/locally-nameless/}},
  OPTannote = 	 {}
}

@inproceedings{Boutin:reflection,
  author    = {Samuel Boutin},
  title     = {Using Reflection to Build Efficient and Certified Decision
               Procedures},
  booktitle = {TACS},
  year      = {1997},
  pages     = {515-529},
  ee        = {http://dx.doi.org/10.1007/BFb0014565},
  crossref  = {DBLP:conf/tacs/1997},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/tacs/1997,
  editor    = {Mart\'{\i}n Abadi and
               Takayasu Ito},
  title     = {Theoretical Aspects of Computer Software, Third International
               Symposium, TACS '97, Sendai, Japan, September 23-26, 1997,
               Proceedings},
  booktitle = {TACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1281},
  year      = {1997},
  isbn      = {3-540-63388-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Gonthier:fourcolour,
  author    = {Georges Gonthier},
  title     = {The Four Colour Theorem: Engineering of a Formal Proof},
  booktitle = {ASCM},
  year      = {2007},
  pages     = {333},
  ee        = {http://dx.doi.org/10.1007/978-3-540-87827-8_28},
  crossref  = {DBLP:conf/ascm/2007},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/ascm/2007,
  editor    = {Deepak Kapur},
  title     = {Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore,
               December 15-17, 2007. Revised and Invited Papers},
  booktitle = {ASCM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5081},
  year      = {2008},
  isbn      = {978-3-540-87826-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Gregoire:ring,
  author    = {Benjamin Gr{\'e}goire and
               Assia Mahboubi},
  title     = {Proving Equalities in a Commutative Ring Done Right in Coq},
  booktitle = {TPHOLs},
  year      = {2005},
  pages     = {98-113},
  ee        = {http://dx.doi.org/10.1007/11541868_7},
  crossref  = {DBLP:conf/tphol/2005},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/tphol/2005,
  editor    = {Joe Hurd and
               Thomas F. Melham},
  title     = {Theorem Proving in Higher Order Logics, 18th International
               Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005,
               Proceedings},
  booktitle = {TPHOLs},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3603},
  year      = {2005},
  isbn      = {3-540-28372-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Verma:bdd,
  author    = {Kumar Neeraj Verma and
               Jean Goubault-Larrecq and
               Sanjiva Prasad and
               S. Arun-Kumar},
  title     = {Reflecting BDDs in Coq},
  booktitle = {ASIAN},
  year      = {2000},
  pages     = {162-181},
  ee        = {http://link.springer.de/link/service/series/0558/bibs/1961/19610162.htm},
  crossref  = {conf/asian/2000},
}

@proceedings{conf/asian/2000,
  editor    = {Jifeng He and
               Masahiko Sato},
  title     = {Advances in Computing Science - ASIAN 2000, 6th Asian Computing
               Science Conference,  Penang, Malaysia, November 25-27, 2000,
               Proceedings},
  booktitle = {ASIAN},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {1961},
  year      = {2000},
}

@inproceedings{Thery:rubik,
  author    = {Laurent Th{\'e}ry},
  title     = {Proof Pearl: Revisiting the Mini-rubik in Coq},
  booktitle = {TPHOLs},
  year      = {2008},
  pages     = {310-319},
  ee        = {http://dx.doi.org/10.1007/978-3-540-71067-7_25},
  crossref  = {DBLP:conf/tphol/2008},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/tphol/2008,
  editor    = {Otmane A\"{\i}t Mohamed and
               C{\'e}sar Mu{\~n}oz and
               Sofi{\`e}ne Tahar},
  title     = {Theorem Proving in Higher Order Logics, 21st International
               Conference, TPHOLs 2008, Montreal, Canada, August 18-21,
               2008. Proceedings},
  booktitle = {TPHOLs},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5170},
  year      = {2008},
  isbn      = {978-3-540-71065-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

%% inria-00258384, version 10
%% http://hal.inria.fr/inria-00258384
@techreport{ssreflect,
    url = {http://hal.inria.fr/inria-00258384},
    title = {{A Small Scale Reflection Extension for the Coq system}},
    author = {Gonthier, Georges and Mahboubi, Assia and Tassi, Enrico},
    type = {Technical report},
    institution = {INRIA},
    number = {RR-6455},
    year = {2008}
}

@techreport{Harrison:reflection,
        author          = "John Harrison",
        title           = "Metatheory and Reflection in Theorem Proving:
                           A Survey and Critique",
        institution     = "SRI Cambridge",
        address         = "Millers Yard, Cambridge, UK",
        year            = 1995,
        type            = "Technical Report",
        number          = "CRC-053"
}

@inproceedings{Gonthier:adhoc,
  author    = {Georges Gonthier and
               Beta Ziliani and
               Aleksandar Nanevski and
               Derek Dreyer},
  title     = {How to make ad hoc proof automation less ad hoc},
  booktitle = {ICFP},
  year      = {2011},
  pages     = {163-175},
  ee        = {http://doi.acm.org/10.1145/2034773.2034798},
  crossref  = {DBLP:conf/icfp/2011},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/icfp/2011,
  editor    = {Manuel M. T. Chakravarty and
               Zhenjiang Hu and
               Olivier Danvy},
  title     = {Proceeding of the 16th ACM SIGPLAN international conference
               on Functional Programming, ICFP 2011, Tokyo, Japan, September
               19-21, 2011},
  booktitle = {ICFP},
  publisher = {ACM},
  year      = {2011},
  isbn      = {978-1-4503-0865-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@Misc{ESOP11ElectronicAppendix,
  author =    {Brigitte Pientka and Joshua Dunfield},
  title =     {Electronic appendix to ``{C}overing all bases: design and implementation of case analysis for contextual objects''},
  year =      {2010},
  note =      {\url{http://complogic.cs.mcgill.ca/beluga/coverage_appendix}},
  OPTannote =    {}
}

@Misc{AgdaWiki,
  key = {Agda Wiki},
  title =     {Agda wiki},
  year =      {2009},
  note =      {\url{http://wiki.portal.chalmers.se/agda/}}
}


@Misc{TwelfWiki,
  key = {Twelf Wiki},
  title =     {Twelf wiki},
  year =      {2009},
  note =      {\url{http://twelf.plparty.org/wiki/Main_Page}}
}


%% Proceedings, to which previous articles cross-ref (which is why they
%% need to come last).
@string{ICFP	= {International Conference on Functional Programming}}
@string{LICS    = {Annual Symposium on Logic in Computer Science}}
@string{PLDI    = {Symposium on Programming Languages Design and Implementation}}
@string{POPL    = {Symposium on Principles of Programming Languages}}
@string{TIC	= {International Workshop on Types in Compilation}}

@Proceedings{ICFP98,
  title =	 ICFP,
  booktitle =	 ICFP,
  year =	 1998,
  key =		 "ICFP'98",
  publisher =	 ACM,
  month =	 sep
}
@Proceedings{LICS01,
  title     = LICS,
  booktitle = LICS,
  year      = 2001,
  key       = {LICS'01},
  month     = jun
}
@Proceedings{PLDI96,
  title     = PLDI,
  booktitle = PLDI,
  year      = 1996,
  key       = "{PLDI}'96",
  publisher = ACM,
  address   = {Philadelphia, PA},
  month     = may
}
@Proceedings{POPL02,
  title     = POPL,
  booktitle = POPL,
  year      = 2002,
  month     = jan,
  key       = {POPL'02}
}
@Proceedings{POPL97,
  title     = POPL,
  booktitle = POPL,
  year      = 1997,
  month     = jan,
  key       = {POPL'97}
}
@Proceedings{POPL98,
  title     = POPL,
  booktitle = POPL,
  year      = 1998,
  month     = jan,
  key       = {POPL'98}
}

@article{Tait67,
  added-at = {2003-11-20T00:00:00.000+0100},
  author = {Tait, William},
  date = {2003-11-20},
  description = {dblp},
  interhash = {528787c5b09ac32023402afa682917ae},
  intrahash = {3c6b04dd9b773c42fc09603e025e2ad2},
  journal = {J. Symb. Log.},
  keywords = {dblp},
  number = 2,
  pages = {198-212},
  timestamp = {2003-11-20T00:00:00.000+0100},
  title = {Intensional {I}nterpretations of {F}unctionals of {F}inite {T}ype {I}},
  volume = 32,
  year = 1967
}

@InProceedings{lindley:TLCA2005,
  author =       {Sam Lindley and Ian Stark},
  title =        {Reducibility and $\top\top$-lifting for Computation Types},
  booktitle =    {Typed Lambda Calculi and Applications: Proceedings of the
                  Seventh International Conference TLCA~2005},
  pages =        {262--277},
  year =         2005,
  series =       {Lecture Notes in Computer Science},
  number =       3461,
  publisher =    {Springer-Verlag},
}

@phdthesis{Girard1972,
	type = {These d'état},
	title = {Interprétation fonctionnelle et elimination des coupures de l'arithmétique d'ordre supérieur},
	school = {Université de Paris 7},
	author = {Girard, J. Y},
	year = {1972}
}

@inproceedings{Despeyroux:1994:HAS:645708.664171,
 author = {Despeyroux, Jo\"{e}lle and Hirschowitz, Andr{\'e}},
 title = {Higher-Order Abstract Syntax with Induction in Coq},
 booktitle = {Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning},
 series = {LPAR '94},
 year = {1994},
 isbn = {3-540-58216-9},
 pages = {159--173},
 numpages = {15},
 acmid = {664171},
 publisher = {Springer-Verlag},
 address = {London, UK, UK},
} 



@InProceedings{Pientka:wfrec,
  author = 	 {Brigitte Pientka and Andreas Abel},
  title = 	 {Structural Recursion over Contextual Objects, },
  OPTcrossref =  {},
  OPTkey = 	 {},
 booktitle = {Proceedings of the 13th Typed Lambda Calculi and Applications: Proceedings of the
                  Seventh International Conference (TLCA'15)},
  publisher = {LIPIcs-Leibniz International Proceedings in Informatics},
  OPTpages = 	 {},
  year = 	 {2015},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTorganization = {},
  OPTpublisher = {},
  OPTannote = 	 {}
}


@InProceedings{Pientka:CADE15,
  author = 	 {Brigitte Pientka and Andrew Cave},
  title = 	 {Inductive {Beluga}:{P}rogramming {P}roofs ({System description})},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {25th International Conference on Automated Deduction (CADE-25)},
  OPTpages = 	 {},
  year = 	 {2015},
  OPTeditor = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  publisher = {Springer},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{Felty:orbi-infra,
  author = 	 {Amy P. Felty and Alberto Momigliano and Brigitte Pientka},
  title = 	 {The {N}ext 700 {C}hallenge {P}roblems
                  for {R}easoning with {H}igher-{O}rder {A}bstract {S}yntax
                  {R}epresentations: {P}art 1 - {A} {C}ommon {I}nfrastructure},
  journal = 	 {Journal of Automated Reasoning (under final revisions)},
  year = 	 {2015},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{Felty:orbi-survey,
  author = 	 {Amy P. Felty and Alberto Momigliano and Brigitte Pientka},
  title = 	 {The {N}ext 700 {C}hallenge {P}roblems
                  for {R}easoning with {H}igher-{O}rder {A}bstract {S}yntax
                  {R}epresentations: {P}art 2 - A {S}urvey},
  journal = 	 {Journal of Automated Reasoning},
  year = 	 {2015},
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}




@InProceedings{Pientka:TLCA15,
  author = 	 {Brigitte Pientka and Andreas Abel},
  title = 	 {Structural Recursion over Contextual Objects},
  OPTcrossref =  {},
  OPTkey = 	 {},
  booktitle = {13th International Conference on Typed Lambda Calculi and Applications (TLCA'15)},
  OPTpages = 	 {},
  year = 	 {2015},
  editor = 	 {Thorsten Altenkirch},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTseries = 	 {},
  OPTaddress = 	 {},
  OPTmonth = 	 {},
  OPTorganization = {},
  publisher = {Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@TechReport{Pientka:SR14,
  author =	 {Brigitte Pientka and Andreas Abel},
  title =	 {Well-Founded Recursion over Contextual Objects},
  month =       {February},
  year =        {2015},
  institution = {School of Computer Science, McGill University}
}


@inproceedings{ZhaoNMZ12,
  author    = {Jianzhou Zhao and
               Santosh Nagarakatte and
               Milo M. K. Martin and
               Steve Zdancewic},
  title     = {Formalizing the {LLVM} Intermediate Representation for Verified
               Program Transformations},
  booktitle = {Symposium on
               Principles of Programming Languages},
  year      = {2012},
  pages     = {427--440},
  publisher = {ACM Press}
}

@inproceedings{Appel11,
  author    = {Andrew W. Appel},
  title     = {Verified Software Toolchain},
  booktitle = {Programming Languages and Systems},
  year      = {2011},
  pages     = {1--17},
  series    = lncs,
  publisher = {Springer},
  volume    = {6602}
}

@inproceedings{Appel11-full,
  author    = {Andrew W. Appel},
  title     = {Verified Software Toolchain},
  booktitle = {ESOP},
  year      = {2011},
  pages     = {1--17},
  ee        = {http://dx.doi.org/10.1007/978-3-642-19718-5_1},
  crossref  = {DBLP:conf/esop/2011},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/esop/2011,
  editor    = {Gilles Barthe},
  title     = {Programming Languages and Systems - 20th European Symposium
               on Programming, ESOP 2011, Held as Part of the Joint European
               Conferences on Theory and Practice of Software, ETAPS 2011,
               Saarbr{\"u}cken, Germany, March 26-April 3, 2011. Proceedings},
  booktitle = {ESOP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6602},
  year      = {2011},
  isbn      = {978-3-642-19717-8},
  ee        = {http://dx.doi.org/10.1007/978-3-642-19718-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Leroy-Compcert-CACM,
  author = {Xavier Leroy},
  title = {Formal Verification of a Realistic Compiler},
  journal = {CACM},
  year = 2009,
  volume = 52,
  number = 7,
  pages = {107--115}
}

@article{Leroy-Compcert-CACM-full,
  author = {Xavier Leroy},
  title = {Formal verification of a realistic compiler},
  journal = {Communications of the ACM},
  year = 2009,
  volume = 52,
  number = 7,
  pages = {107--115},
  url = {http://gallium.inria.fr/~xleroy/publi/compcert-CACM.pdf},
  urlpublisher = {http://doi.acm.org/10.1145/1538788.1538814},
  hal = {http://hal.archives-ouvertes.fr/inria-00415861/},
  pubkind = {journal-int-mono},
  abstract = {This paper reports on the development and formal verification (proof
of semantic preservation) of CompCert, a compiler from Clight (a
large subset of the C programming language) to PowerPC assembly code,
using the Coq proof assistant both for programming the compiler and
for proving its correctness.  Such a verified compiler is useful in
the context of critical software and its formal verification: the
verification of the compiler guarantees that the safety properties
proved on the source code hold for the executable compiled code as
well.}
}