%% This BibTeX bibliography file was created using BibDesk.
%% https://bibdesk.sourceforge.io/

%% Created for sozeau at 2020-01-31 17:28:01 +0100 


%% Saved with string encoding Unicode (UTF-8) 


@string{aaecc = {Applicable Algebra in Engineering Communication and Computing}}

@string{acm = {ACM Press}}

@string{acmpress = {ACM Press}}

@string{addresslri = {Univ. Paris-Sud, France}}

@string{ai = {Artificial Intelligence}}

@string{alp90 = {Proc. 2nd Int. Conf. on Algebraic and Logic Programming, LNCS 463}}

@string{alp92 = {Proc. 3rd Int. Conf. on Algebraic and Logic Programming, LNCS 632}}

@string{alp94 = {Proc. 4th Int. Conf. on Algebraic and Logic Programming, LNCS 850}}

@string{alp96 = {Proc. 5th Int. Conf. on Algebraic and Logic Programming, LNCS 1139}}

@string{alpplilp98 = {Proc. Joint Int. Symp. on Programming Languages,Implementations, Logics and Programs (PLILP) and Algebraic and Logic Programming (ALP) conferences}}

@string{amm = {American Mathematical Monthly}}

@string{ap = {Academic Press}}

@string{aplas = {Asian Symposium on Programming Languages and Systems (APLAS)}}

@string{aplas03 = aplas # {, Beijing, China}}

@string{april = {April}}

@string{atopls = {ACM Transactions on Programming Languages and Systems}}

@string{aw = {Addison-Wesley}}

@string{beatcs = {EATCS Bulletin}}

@string{birk = {Birkh{\"a}user}}

@string{cacm = {Communications of the {ACM}}}

@string{cade80 = {Proc. 5th Conf. on Automated Deduction, Les Arcs, France, LNCS 87}}

@string{cade84 = {Proc. 7th Int. Conf. on Automated Deduction, Napa, LNCS 170}}

@string{cade86 = {Proc. 8th Int. Conf. on Automated Deduction, Oxford, England, LNCS 230}}

@string{cade90 = {Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern, LNCS 449}}

@string{cade92 = {Proc. 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY, LNAI 607}}

@string{cav = {International Conference on Computer Aided Verification (CAV)}}

@string{cav02 = cav # {, Copenhagen, Denmark}}

@string{cav96 = cav # {, New Brunswick, New Jersey}}

@string{ccl = {Constraints in Computational Logics}}

@string{ccl94 = {Proc. 1st Int. Conf. on Constraint in Computational Logics, LNCS 845}}

@string{cecsl = {Conference of the European Association for Computer Science Logic}}

@string{crin = {Centre de Recherche en Informatique de Nancy}}

@string{csfw = {IEE Computer Security Foundations Workshop (CSFW)}}

@string{csfw02 = csfw # {, Cape Breton, Nova Scotia}}

@string{csl = {International Workshop on Computer Science Logic (CSL)}}

@string{csl93 = {Proc. Conf. Computer Science Logic}}

@string{csl94 = csl # {, Kazimierz, Poland}}

@string{csl95 = {Proc. Conf. Computer Science Logic}}

@string{csl97 = csl # {, Aarhus, Denmark}}

@string{ctrs90 = {Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, Montreal, LNCS 516}}

@string{ctrs91 = {Proc. Conditional and Typed Rewriting Systems, LNCS 516}}

@string{ctrs92 = {Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems, Pont-{\`a}-Mousson, LNCS 656}}

@string{ctrs93 = {Proc. Conditional Term Rewriting Systems, LNCS 656}}

@string{cup = {Cambridge University Press}}

@string{cwi = {Centrum voor Wiskunde en Informatica}}

@string{dbpl = {Database Programming Languages (DBPL)}}

@string{dbpl05 = dbpl}

@string{diku = {University of Copenhagen, Department of Computer Science}}

@string{disc = {International Symposium on Distributed Computing (DISC)}}

@string{disc06 = disc}

@string{disco90 = {Proc. Int. Symposium on Design and Implementation of Symbolic Computation Systems, LNCS 429}}

@string{dmtcs = {Discrete Mathematics and Theoretical Computer Science}}

@string{ecoop = {European Conference on Object-Oriented Programming (ECOOP)}}

@string{ecoop00 = ecoop # {, Sophia Antipolis and Cannes, France}}

@string{ecoop02 = ecoop # {, Malaga, Spain}}

@string{ecoop03 = ecoop # {, Darmstadt, Germany}}

@string{ecoop04 = ecoop # {, Oslo, Norway}}

@string{ecoop06 = ecoop # {, Nantes, France}}

@string{oopsla = {{ACM} {SIGPLAN} {C}onference on {O}bject {O}riented {P}rogramming: {S}ystems, {L}anguages, and {A}pplications ({OOPSLA})}}

@string{ecoop90 = oopsla # {/} # ecoop # {, Ottawa, Ontario}}

@string{ecoop92 = ecoop}

@string{ecoop95 = ecoop}

@string{ecoop98 = ecoop}

@string{ecoop99 = ecoop # {, Lisbon, Portugal}}

@string{elsevier = {Elsevier}}

@string{enslyon = {Ecole Normale Sup{\'e}rieure de Lyon}}

@string{ensparis = {Ecole Normale Sup{\'e}rieure de Paris}}

@string{entcs = {Electronic Notes in Theoretical Computer Science}}

@string{es = {Elsevier Science Publishers}}

@string{esop = {European Symposium on Programming (ESOP)}}

@string{esop00 = esop # {, Berlin, Germany}}

@string{esop01 = esop # {, Genova, Italy}}

@string{esop02 = esop # {, Grenoble, France}}

@string{esop88 = esop # {, Nancy, France}}

@string{esop92 = esop # {, Rennes, France}}

@string{esop94 = esop # {, Edinburgh, Scotland}}

@string{eup = {Edinburgh Univ. Press}}

@string{fac = {Formal Aspect of Computing}}

@string{flops = {International Symposium on Functional and Logic Programming (FLOPS)}}

@string{flops04 = flops # {, Nara, Japan}}

@string{informal = {{\rm, informal proceedings}}}

@string{fool = {International Workshop on Foundations of Object-Oriented Languages (FOOL)} # informal}

@string{fpca = {ACM Symposium on Functional Programming Languages and Computer Architecture (FPCA)}}

@string{fpca87 = fpca # {, Portland, Oregon}}

@string{fpca89 = fpca # {, London, England}}

@string{fpca93 = fpca # {, Copenhagen, Denmark}}

@string{fpca95 = fpca # {San Diego, California}}

@string{frr = {Rapport de Recherche}}

@string{fsttcs = {Foundations of Software Technology and Theoretical Computer Science (FSTTCS)}}

@string{fsttcs93 = fsttcs # {, Bombay, India}}

@string{greco = {Greco de Programmation}}

@string{gtm = {Graduate Texts in Mathematics}}

@string{haskellw = {ACM Haskell Workshop} # informal}

@string{hoots = {Workshop on Higher Order Operational Techniques in Semantics (HOOTS)}}

@string{iandcomp = {Information and Computation}}

@string{ic = {Information and Computation}}

@string{icalp = {International Colloquium on Automata, Languages and Programming (ICALP)}}

@string{icalp77 = {Proc. 4th Int. Coll. on Automata, Languages and Programming, Turku, Finland}}

@string{icalp78 = {Proc. 5th Int. Coll. on Automata, Languages and Programming, LNCS 62}}

@string{icalp82 = {Proc. 9th Int. Coll. on Automata, Languages and Programming, LNCS 140}}

@string{icalp83 = {Proc. 10th Int. Coll. on Automata, Languages and Programming, LNCS 154}}

@string{icalp85 = {Proc. 12th Int. Coll. on Automata, Languages and Programming, Nafplion, LNCS 194}}

@string{icalp87 = {Proc. 14th Int. Coll. on Automata, Languages and Programming, LNCS 372}}

@string{icalp88 = {Proc. 15th Int. Coll. on Automata, Languages and Programming, LNCS 317}}

@string{icalp89 = {Proc. 16th Int. Coll. on Automata, Languages and Programming, LNCS 372}}

@string{icalp90 = {Proc. 17th Int. Coll. on Automata, Languages and Programming, Warwick, LNCS 443}}

@string{icalp91 = {Proc. 18th Int. Coll. on Automata, Languages and Programming, Madrid, LNCS 510}}

@string{icalp92 = {Proc. 19th Int. Coll. on Automata, Languages and Programming, LNCS 623}}

@string{icalp93 = {Proc. 20th Int. Coll. on Automata, Languages and Programming, LNCS 700}}

@string{icalp94 = {Proc. 21th Int. Coll. on Automata, Languages and Programming, LNCS 820}}

@string{icalp98 = icalp # {, Aalborg, Denmark}}

@string{icalp99 = {Proc. 25th Int. Coll. on Automata, Languages and Programming, To appear}}

@string{icfp = {{ACM} {SIGPLAN} {I}nternational {C}onference on {F}unctional {P}rogramming ({ICFP})}}

@string{icfp00 = icfp # {, Montreal, Canada}}

@string{icfp01 = icfp # {, Firenze, Italy}}

@string{icfp02 = icfp # {, Pittsburgh, Pennsylvania}}

@string{icfp03 = icfp # {, Uppsala, Sweden}}

@string{icfp04 = icfp # {, Snowbird, Utah}}

@string{icfp96 = icfp # {, Philadelphia, Pennsylvania}}

@string{icfp97 = icfp # {, Amsterdam, The Netherlands}}

@string{icfp98 = icfp # {, Baltimore, Maryland}}

@string{icfp99 = icfp # {, Paris, France}}

@string{icomp = {Information and Computation}}

@string{icont = {Information and Control}}

@string{ieeecsp = {{IEEE} Comp. Soc. Press}}

@string{ieeetcom = {IEEE Trans. Communications}}

@string{ieice = {IEICE}}

@string{ijait = {International Journal on Artificial Intelligence Tools}}

@string{ijcis = {International Journal of Computer and Information Sciences}}

@string{ijfcs = {International Journal of Foundations of Computer Science}}

@string{ijpp = {International Journal on Parallel Programming}}

@string{inpg = {Institut National Polytechnique de Grenoble}}

@string{inria = {Institut National de Recherche en Informatique et en Automatique, Unit{\'e} Rocquencourt}}

@string{ipl = {Information Processing Letters}}

@string{issac88 = {Proc. of the 19th Int. Symp. on Symbolic and Algebraic Computation}}

@string{issac89 = {Proc. of the 20th Int. Symp. on Symbolic and Algebraic Computation, Portland, Oregon}}

@string{ja = {Journal of Algebra}}

@string{jacm = {Journal of the {ACM}}}

@string{january = {January}}

@string{jar = {Journal of Automated Reasoning}}

@string{jcss = {Journal of Computer and System Sciences}}

@string{jfla = {Journ{\'e}es Francophones des Langages Applicatifs}}

@string{jflp = {Journal of Functional and Logic Programming}}

@string{jfp = {Journal of Functional Programming}}

@string{jlap = {Journal of Logic and Algebraic Programming}}

@string{jlc = {Journal of Logic and Computation}}

@string{jlp = {Journal of Logic Programming}}

@string{jmcm = {Journal of {M}athematical and Computer Modelling}}

@string{jpaa = {Journal of Pure and Applied Algebra}}

@string{jsc = {Journal of Symbolic Computation}}

@string{jsl = {Journal of Symbolic Logic}}

@string{labri = {LAboratoire Bordelais de Recherche en Informatique}}

@string{lfcompsci = {International Symposium on Logical Foundations of Computer Science (LFCS)}}

@string{lfcompsci94 = lfcompsci # {, St. Petersburg, Russia}}

@string{lfcs = {Laboratory for Foundations of Computer Science, University of Edinburgh}}

@string{lfp = {ACM Symposium on Lisp and Functional Programming (LFP)}}

@string{lfp80 = lfp # {, Stanford, California}}

@string{lfp84 = lfp # {, Austin, Texas}}

@string{lfp86 = lfp # {, Cambridge, Massachusetts}}

@string{lfp88 = lfp # {, Snowbird, Utah}}

@string{lfp90 = lfp}

@string{lfp92 = lfp # {, San Francisco, California}}

@string{lfp94 = lfp # {, Orlando, Florida}}

@string{lics = {IEEE Symposium on Logic in Computer Science (LICS)}}

@string{lics00 = lics}

@string{lics01 = lics # {, Boston, Massachusetts}}

@string{lics02 = lics}

@string{lics03 = lics # {, Ottawa, Canada}}

@string{lics1 = {Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass.}}

@string{lics2 = {Proc. 2nd IEEE Symp. Logic in Computer Science, Ithaca, NY}}

@string{lics3 = {Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh}}

@string{lics4 = {Proc. 4th IEEE Symp. Logic in Computer Science}}

@string{lics5 = {Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia}}

@string{lics6 = {Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam}}

@string{lics7 = {Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz}}

@string{lics86 = lics # {, Cambridge, Massachusetts}}

@string{lics87 = lics # {, Ithaca, New York}}

@string{lics88 = lics # {, Edinburgh, Scotland}}

@string{lics89 = lics # {, Asilomar, California}}

@string{lics90 = lics # {, Philadelphia, Pennsylvania}}

@string{lics91 = lics}

@string{lics92 = lics # {, Santa Cruz, California}}

@string{lics93 = lics}

@string{lics94 = lics}

@string{lics95 = lics}

@string{lics96 = lics # {, New Brunswick, New Jersey}}

@string{lics97 = lics}

@string{lics98 = lics # {, Indianapolis, Indiana}}

@string{lics99 = lics # {, Trento, Italy}}

@string{liens = {Laboratoire d'Informatique de l'{\'E}cole Normale Sup{\'e}rieure}}

@string{lifo = {Laboratoire d'Informatique Fondamentale d'Orl{\'e}ans}}

@string{lip = {Laboratoire de l'Informatique du Parallelisme}}

@string{lmcs = {Logical Methods in Computer Science}}

@string{lnai = {Lecture Notes in Artificial Intelligence}}

@string{lncs = {Lecture Notes in Computer Science}}

@string{lncs104 = {Proc. 5th GI Conf., LNCS 104}}

@string{lncs107 = {Int. Coll. Formalization of Programming Concepts, LNCS 107}}

@string{lncs131 = {Proc. IBM Workshop on Logics of Programs, LNCS 131}}

@string{lncs137 = {Proc. 5th Int. Symp. on Programming, Turin, LNCS 137}}

@string{lncs144 = {Proc. EUROCAM 82, Marseille, LNCS 144}}

@string{lncs145 = {Proc. 6th GI Conf.}}

@string{lncs159 = {Proc. 8th. Coll. on Trees and Algebra in Programming, LNCS 159}}

@string{lncs164 = {Proc. Logics of Programming Workshop}}

@string{lncs173 = {Semantics of Data Types, Sophia-Antipolis, LNCS 173}}

@string{lncs174 = {Proc. EUROSAM 84, Cambridge, LNCS 174}}

@string{lncs185 = {Proc. CAAP 85, LNCS 185}}

@string{lncs197 = {Seminar on Concurrency, CMU-Pittsburgh, LNCS 197}}

@string{lncs201 = {Functional Programming Languages and Computer Architecture, Nancy, LNCS 201}}

@string{lncs202 = {Proc. Rewriting Techniques and Applications 85, Dijon, LNCS 202}}

@string{lncs203 = {Proc. EUROCAL 85, Linz, LNCS 203}}

@string{lncs204 = {Proc. EUROCAL 85, Linz, LNCS 204}}

@string{lncs210 = {Proc. STACS 86, Orsay, LNCS 210}}

@string{lncs213 = {Proc. ESOP 86, Saarbr{\"u}cken, LNCS 213}}

@string{lncs214 = {Proc. CAAP 86, Nice, LNCS 214}}

@string{lncs217 = {Programs as Data Objects, Copenhagen, LNCS 217}}

@string{lncs226 = {Proc. 13th ICALP, Rennes, LNCS 226}}

@string{lncs230 = {Proc. 8th Conf. on Automated Deduction, Oxford, LNCS 230}}

@string{lncs232 = {Fundamentals of Artificial Intelligence, LNCS 232}}

@string{lncs233 = {Proc. Math. Found. Computer Science, Bratislava, LNCS 233}}

@string{lncs241 = {Proc. 6th Conf. on Foundations of Software Technology and Theoretical Computer Science, New Delhi, LNCS 241}}

@string{lncs249 = {Proc. CAAP 87, Pisa, LNCS 249}}

@string{lncs250 = {Proc. CFLP, Pisa, LNCS 250}}

@string{lncs255 = {Petri Nets: Applications and Relationships to Other Models of Concurrency, Bad Honnef, LNCS 255}}

@string{lncs258 = {Proc. PARLE 87, vol. I: Parallel Architectures, Eindhoven, LNCS 258}}

@string{lncs259 = {Proc. PARLE 87, vol. II: Parallel Languages, Eindhoven, LNCS 259}}

@string{lncs272 = {Future Parallel Computers, an advanced course, Pisa, LNCS 272}}

@string{lncs283 = {Proc. Category Theory and Computer Science, LNCS 283}}

@string{lncs287 = {Proc. 7th Conf. Found. of Software Technology and Theoretical Computer Science, Pune, INDIA, LNCS 287}}

@string{lncs294 = {Proc. STACS 88, Bordeaux, LNCS 294}}

@string{lncs298 = {Proc. 3rd Workshop on Mathematical Foundations of Programming Language Semantics, LNCS 298}}

@string{lncs299 = {Proc. CAAP 88, Nancy, LNCS 299}}

@string{lncs300 = {Proc. ESOP 88, Nancy, LNCS 300}}

@string{lncs306 = {Proc. Workshop on Found. of Logic and Functional Programming, Trento, LNCS 306}}

@string{lncs308 = {Proc. 1st Int. Workshop on Conditional Term Rewriting Systems, Orsay, LNCS 308}}

@string{lncs332 = {Recent Trends in Data Type Specifications, S. Sanella and A. Tarleki eds., LNCS 332}}

@string{lncs343 = {Proc. 1st Workshop on Algebraic and Logic Programming, Gaussig, LNCS 343}}

@string{lncs349 = {Proc. STACS 89, Paderborn, LNCS 349}}

@string{lncs351 = {Proc. TAPSOFT 89 (Vol. 1), Barcelona, LNCS 351}}

@string{lncs352 = {Proc. TAPSOFT 89 (Vol. 2), Barcelona, LNCS 352}}

@string{lncs354 = {Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354}}

@string{lncs380 = {Proc. FCT'89, LNCS 380}}

@string{lncs415 = {Proc. STACS 90, Rouen, LNCS 415}}

@string{lncs431 = {Proc. CAAP 90, Copenhague, LNCS 431}}

@string{lncs432 = {Proc. ESOP 90, Copenhague, LNCS 432}}

@string{lncs452 = {Proc. MFCS 90, Bansk{\`{a}} Bystrica, LNCS 452}}

@string{lncs456 = {Proc. PLILP'90, LNCS 456}}

@string{lncs463 = {Proc. Conf. on Algebraic and Logic Programming, Nancy, LNCS 463}}

@string{lncs480 = {Proc. 8th Symp. on Theoretical Aspects of Computer Science, Hamburg, LNCS 480}}

@string{lncs493 = {Proc. TAPSOFT'91---CAAP, LNCS 493}}

@string{lncs535 = {Fundamentals of Artificial Intelligence, P. Jorrand Editor, LNCS 535}}

@string{lncs582 = {Proc. European Symp. on Programming, LNCS 582}}

@string{lncs59 = {Proc. Proc. Eight Colloquium on Trees in Algebra and Programming, LNCS 59}}

@string{lncs78 = {Edinburgh LCF, LNCS 78}}

@string{lncs86 = {Proc. Winter School on Abstract Software Specifications, Copenhagen, LNCS 86}}

@string{lncs99 = {Algebraic Semantics, LNCS 99}}

@string{lncs996 = {Proc. of the 1994 Workshop on Types for Proofs and Programs, LNCS 996}}

@string{lnm = {Lecture Notes in Mathematics}}

@string{lp = {Lisp Pointers}}

@string{lri = {Laboratoire de Recherche en Informatique}}

@string{mcgh = {McGraw-Hill}}

@string{me = {Matthieu Sozeau}}

@string{mfcs15 = {Proc. 15th Mathematical Foundations of Computer Science, Bansk{\`a} Bystrica}}

@string{mfcs16 = {Proc. 16th Mathematical Foundations of Computer Science, Warsaw, LNCS 520}}

@string{mfcs92 = {Proc. 17th Mathematical Foundations of Computer Science, Praha, LNCS}}

@string{mfcs93 = {Proc. 18th Mathematical Foundations of Computer Science}}

@string{mfcs98 = {Proc. 23rd Mathematical Foundations of Computer Science}}

@string{mfps = {Workshop on the Mathematical Foundations of Programming Semantics (MFPS)}}

@string{mfps01 = mfps # {, Aarhus, Denmark}}

@string{mfps89 = mfps # {, New Orleans, Louisiana}}

@string{mfps95 = mfps # {, New Orleans, Louisiana}}

@string{mgh = {McGraw-Hill}}

@string{mit = {MIT Press}}

@string{mp = {MIT Press}}

@string{mitpress = mp}

@string{mlw = {ACM SIGPLAN Workshop on ML} # informal}

@string{mpi = {Max-Planck-Institut f{\"u}r Informatik}}

@string{mpri = {Master Parisien de Recherche en Informatique}}

@string{mscs = {Mathematical Structures in Computer Science}}

@string{mst = {Math. Systems Theory}}

@string{nh = {North Holland}}

@string{njc = {Nordic Journal of Computing}}

@string{no = {No}}

@string{oopsla03 = oopsla # {, Anaheim, California}}

@string{oopslapre96 = {{C}onference on {O}bject {O}riented {P}rogramming: {S}ystems, {L}anguages, and {A}pplications ({OOPSLA})}}

@string{oopsla86 = oopslapre96 # {, Portland, Oregon}}

@string{oopsla89 = oopslapre96 # {, New Orleans, Louisiana}}

@string{oopsla90 = oopslapre96 # {/} # ecoop # {, Ottawa, Ontario}}

@string{oopsla98 = oopsla # {, Vancouver, British Columbia}}

@string{orsay = {Orsay, France}}

@string{osdi = {USENIX Symposium on Operating Systems Design and Implementation (OSDI)}}

@string{osdi00 = osdi # {, San Diego, California}}

@string{osdi96 = osdi # {, Seattle, Washington}}

@string{paste = {ACM SIGPLAN--SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE)}}

@string{paste01 = paste # {, Snowbird, Utah}}

@string{ph = {Prentice Hall}}

@string{phd = {phd thesis}}

@string{pldi = {{ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)}}}

@string{pldi00 = pldi # {, Vancouver, British Columbia, Canada}}

@string{pldi01 = pldi # {, Snowbird, Utah}}

@string{pldi02 = pldi # {, Berlin, Germany}}

@string{pldi03 = pldi # {, San Diego, California}}

@string{pldi88 = pldi # {, {A}tlanta, {G}eorgia}}

@string{pldi89 = pldi # {, Portland, Oregon}}

@string{pldi90 = pldi # {, White Plains, New York}}

@string{pldi91 = pldi # {, Toronto, Ontario}}

@string{pldi92 = pldi # {, San Francisco, California}}

@string{pldi93 = pldi # {, Albuquerque, New Mexico}}

@string{pldi94 = pldi # {, Orlando, Florida}}

@string{pldi95 = pldi # {, La Jolla, California}}

@string{pldi96 = pldi # {, Philadephia, Pennsylvania}}

@string{pldi97 = pldi # {, Las Vegas, Nevada}}

@string{pldi99 = pldi # {, {A}tlanta, {G}eorgia}}

@string{pods = {Principles of Database Systems (PODS)}}

@string{pods06 = pods}

@string{popl = {{ACM} {SIGPLAN--SIGACT} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages ({POPL})}}

@string{popl00 = popl # {, Boston, Massachusetts}}

@string{popl01 = popl # {, London, England}}

@string{popl02 = popl # {, Portland, Oregon}}

@string{popl03 = popl # {, New Orleans, Louisiana}}

@string{popl04 = popl # {, Venice, Italy}}

@string{popl05 = popl # {, Long Beach, California}}

@string{popl08 = popl # {, San Francisco, California}}

@string{popl10 = {Proc. 10th ACM Symp. on Principles of Programming Languages, Austin, Texas}}

@string{popl11 = {Proc. 11th ACM Symp. on Principles of Programming Languages, Salt Lake City}}

@string{popl12 = {Proc. 12th ACM Symp. on Principles of Programming Languages, New Orleans}}

@string{popl13 = {Proc. 13th ACM Symp. on Principles of Programming Languages, St. Petersburg Beach, Florida}}

@string{popl14 = {Proc. 14th ACM Symp. on Principles of Programming Languages, Munich}}

@string{popl15 = {Proc. 15th ACM Symp. on Principles of Programming Languages, San Diego, California}}

@string{popl3 = {Proc. 3rd ACM Symp. on Principles of Programming Languages, Atlanta}}

@string{popl5 = {Proc. 5th ACM Symp. on Principles of Programming Languages, Tucson, Arizona}}

@string{popl6 = {Proc. 6th ACM Symp. on Principles of Programming Languages, San Antonio, Texas}}

@string{popl7 = {Proc. 7th ACM Symp. on Principles of Programming Languages, Las Vegas}}

@string{poplpre92 = {{ACM} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages ({POPL})}}

@string{popl73 = poplpre92 # {, Boston, Massachusetts}}

@string{popl75 = poplpre92 # {, Palo Alto, California}}

@string{popl76 = poplpre92 # {, {A}tlanta, {G}eorgia}}

@string{popl77 = poplpre92 # {, Los Angeles, California}}

@string{popl78 = poplpre92 # {, Tucson, Arizona}}

@string{popl79 = poplpre92 # {, San Antonio, Texas}}

@string{popl80 = poplpre92 # {, Las Vegas, Nevada}}

@string{popl81 = poplpre92 # {, Williamsburg, Virginia}}

@string{popl82 = poplpre92 # {, Albuquerque, New Mexico}}

@string{popl83 = poplpre92 # {, Austin, Texas}}

@string{popl84 = poplpre92 # {, Salt Lake City, Utah}}

@string{popl85 = poplpre92 # {, New Orleans, Louisiana}}

@string{popl86 = poplpre92 # {, St.\ Petersburg Beach, Florida}}

@string{popl87 = poplpre92 # {, Munich, Germany}}

@string{popl88 = poplpre92 # {, San Diego, California}}

@string{popl89 = poplpre92 # {, Austin, Texas}}

@string{popl9 = {Proc. 9th ACM Symp. on Principles of Programming Languages, Albuquerque, New Mexico}}

@string{popl90 = poplpre92 # {, {S}an {F}rancisco, {C}alifornia}}

@string{popl91 = poplpre92 # {, Orlando, Florida}}

@string{popl92 = popl # {, Albuquerque, New Mexico}}

@string{popl93 = popl # {, Charleston, South Carolina}}

@string{popl94 = popl # {, {P}ortland, {O}regon}}

@string{popl95 = popl # {, San Francisco, California}}

@string{popl96 = popl # {, St.~Petersburg Beach, Florida}}

@string{popl97 = popl # {, Paris, France}}

@string{popl98 = popl # {, San Diego, California}}

@string{popl99 = popl # {, San Antonio, Texas}}

@string{pp = {Pergamon Press}}

@string{ppdp = {ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP)}}

@string{ppdp01 = ppdp # {, Firenze, Italy}}

@string{ppdp99 = ppdp # {, Paris France}}

@string{proc = {Proceedings of the}}

@string{r = {Reidel}}

@string{rairo = {R.A.I.R.O.}}

@string{ria = {Revue Fran{\c{c}}aise d'Intelligence Artificielle}}

@string{rr = {Research Report}}

@string{rta = {International Conference on Rewriting Techniques and Applications (RTA)}}

@string{rta03 = rta # {, Valencia, Spain}}

@string{rta85 = {Proc. 1st Rewriting Techniques and Applications, Dijon, LNCS 202}}

@string{rta87 = {Proc. 2nd Rewriting Techniques and Applications, Bordeaux, LNCS 256}}

@string{rta89 = {Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355}}

@string{rta91 = {Proc. 4th Rewriting Techniques and Applications, LNCS 488}}

@string{rta93 = {Proc. 5th Rewriting Techniques and Applications, Montr{\'e}al, LNCS 690}}

@string{rta95 = {Proc. 6th Rewriting Techniques and Applications, Kaiserslautern, LNCS 914}}

@string{rta96 = {Proc. 7th Rewriting Techniques and Applications, New Jersey}}

@string{sa = {Scientific American}}

@string{sas = {International Symposium on Static Analysis (SAS)}}

@string{sas01 = sas # {, Paris, France}}

@string{sas95 = sas # {, Glasgow, Scotland}}

@string{sas96 = sas # {, Aachen, Germany}}

@string{sas97 = sas # {, Paris, France}}

@string{scp = {Science of Computer Programming}}

@string{siamjc = {SIAM Journal on Computing}}

@string{sicomp = {SIAM Journal on Computing}}

@string{signot = {SIGPLAN Notices}}

@string{sosp = {ACM Symposium on Operating Systems Principles (SOSP)}}

@string{sosp93 = sosp # {, Asheville, North Carolina}}

@string{space = {Workshop on Semantics, Program Analysis and Computing Environments for Memory Management (SPACE)} # informal}

@string{spe = {Software - Practice and Experience}}

@string{springer = {Springer-Verlag}}

@string{ssl93 = {Proc. Int. Workshop on Semantics of Specification Languages, Utrecht, October 1993}}

@string{stacs93 = {Proc. 10th Symposium on Theoretical Aspects of Computer Science, W{\"u}rzburg, LNCS}}

@string{sv = {Springer-Verlag}}

@string{symsac = {Proc. ACM Symp. Symbolic and Algebraic Computation}}

@string{symsac71 = {Proc. of the 2nd Symp. on Symbolic and Algebraic Computation}}

@string{symsac86 = {Proc. of the 17th Symp. on Symbolic and Algebraic Computation}}

@string{tacs = {International Symposium on Theoretical Aspects of Computer Software (TACS)}}

@string{tacs01 = tacs # {, Sendai, Japan}}

@string{tacs94 = tacs # {, Sendai, Japan}}

@string{taoop = {C. A. Gunter and J. C. Mitchell, editors, {\em Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design}, MIT Press, 1994}}

@string{tapsoft = {Theory and Practice of Software Development (TAPSOFT)}}

@string{tapsoft93 = tapsoft # {, Orsay, France}}

@string{tapsoft97 = tapsoft # {, Lille, France}}

@string{tcs = {Theoretical Computer Science}}

@string{these = {Th{\`e}se de Doctorat}}

@string{thesedoctorat = {Th{\`e}se de Doctorat}}

@string{theseh = {Th{\`e}se d'habilitation}}

@string{theseinpg = {Th{\`e}se de Doctorat, Institut National Polytechnique de Grenoble, France}}

@string{theselri = {Th{\`e}se de Doctorat, Universit{\'e} de Paris-Sud, France}}

@string{thesenancy = {Th{\`e}se de Doctorat, Universit{\'e} de Nancy I, France}}

@string{tic = {ACM SIGPLAN Workshop on Types in Compilation ({TIC})}}

@string{tic97 = tic # {, Amsterdam, The Netherlands}}

@string{tic98 = tic # {, Kyoto, Japan}}

@string{tlca = {International Conference on Typed Lambda Calculi and Applications (TLCA)}}

@string{tlca01 = tlca # {, Krak{\'{o}}ow, Poland}}

@string{tlca03 = tlca # {, Valencia, Spain}}

@string{tlca93 = tlca # {, Utrecht, The Netherlands}}

@string{tlca97 = tlca # {, Nancy, France}}

@string{tlca99 = tlca # {, L'Aquila, Italy}}

@string{tldi = {ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI)}}

@string{tldi03 = tldi # {, New Orleans, Louisiana}}

@string{tocl = {ACM Transactions on Computational Logic}}

@string{toplas = {ACM Transactions on Programming Languages and Systems}}

@string{tose = {IEEE Transactions on Software Engineering}}

@string{tpa = {Workshop on Types for Program Analysis (TPA)} # informal}

@string{tr = {Tech. Report}}

@string{tsi = {Technique et Science Informatiques}}

@string{types = {International Workshop on Types for Proofs and Programs (TYPES)}}

@string{types93 = types # {, Nijmegen, The Netherlands}}

@string{types98 = types # {, Kloster Irsee, Germany}}

@string{u-lille = {Universit{\'e} des Sciences et Techniques de Lille Flandres Artois}}

@string{univcaen = {Universit{\'e} de Caen}}

@string{univdenisdiderot = {Universit{\'e} Denis Diderot}}

@string{univnancy1 = {Universit{\'e} Henri Poincar{\'e} Nancy 1}}

@string{univparis7 = {Universit{\'e} Paris 7}}

@string{univparisnord = {Universit{\'e} Paris-Nord}}

@string{ups = {Universit{\'e} Paris-Sud}}

@string{ups-orsay = {Universit{\'e} Paris-Sud, Orsay, France}}

@string{wad79 = {Proc. 4th Workshop on Automated Deduction, Austin, Texas}}

@string{webdb = {International Workshop on the Web and Databases (WebDB)}}

@string{xsym = {Database and XML Technologies: International XML Database Symposium (XSym)}}

@string{yes = {Yes}}


@misc{equationscoqpl20,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {Inria},
	Author = {Matthieu Sozeau},
	Date-Added = {2020-01-31 17:26:43 +0100},
	Date-Modified = {2020-01-31 17:27:59 +0100},
	Howpublished = {Talk given at the CoqPL 2020 Workshop},
	Language = {Anglais},
	Month = January,
	Title = {{An Equations Tutorial}},
	Type = {slides},
	Url = {http://www.irif.fr/~sozeau/research/publications/An_Equations_Tutorial-250120-CoqPL20.pdf},
	Year = {2020},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded.pdf}}

@inproceedings{gueneau:hal-02167236,
	Address = {Portland, United States},
	Author = {Gu{\'e}neau, Arma{\"e}l and Jourdan, Jacques-Henri and Chargu{\'e}raud, Arthur and Pottier, Fran{\c c}ois},
	Booktitle = {{ITP 2019 - 10th Conference on Interactive Theorem Proving}},
	Date-Added = {2019-11-03 23:11:34 +0100},
	Date-Modified = {2019-11-03 23:11:34 +0100},
	Hal_Id = {hal-02167236},
	Hal_Version = {v1},
	Keywords = {Complexity analysis ; Interactive deductive program verification},
	Month = Sep,
	Pdf = {https://hal.inria.fr/hal-02167236/file/main.pdf},
	Title = {{Formal Proof and Analysis of an Incremental Cycle Detection Algorithm}},
	Url = {https://hal.inria.fr/hal-02167236},
	Year = {2019},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-02167236}}

@article{DBLP:journals/jfp/RossbergRD14,
	Author = {Andreas Rossberg and Claudio V. Russo and Derek Dreyer},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/jfp/RossbergRD14},
	Date-Added = {2019-10-30 23:03:35 +0100},
	Date-Modified = {2019-10-30 23:03:35 +0100},
	Doi = {10.1017/S0956796814000264},
	Journal = {J. Funct. Program.},
	Number = {5},
	Pages = {529--607},
	Timestamp = {Sat, 27 May 2017 14:24:34 +0200},
	Title = {F-ing modules},
	Url = {https://doi.org/10.1017/S0956796814000264},
	Volume = {24},
	Year = {2014},
	Bdsk-Url-1 = {https://doi.org/10.1017/S0956796814000264}}

@unpublished{tabtansoz19,
	Author = {Nicolas Tabareau and {\'E}ric Tanter and Matthieu Sozeau},
	Date-Added = {2019-09-12 09:47:28 +0200},
	Date-Modified = {2019-09-12 09:58:18 +0200},
	Keywords = {Coq ; Parametricity ; Type structures ; Program reasoning ; Type theory ; Homotopy Type Theory},
	Month = August,
	Note = {Submitted},
	Title = {{The Marriage of Univalence and Parametricity}},
	Url = {https://arxiv.org/abs/1909.05027},
	Year = {2019},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01559073},
	Bdsk-Url-2 = {https://doi.org/10.1145/3234615}}

@misc{equationsreloaded-icfp19-talk,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {Inria Paris & IRIF, Universit{\'e} Paris 7 Denis Diderot},
	Author = {Matthieu Sozeau},
	Date-Added = {2019-08-20 08:01:14 +0200},
	Date-Modified = {2019-08-20 08:02:00 +0200},
	Howpublished = {Talk given at ICFP 2019},
	Language = {Anglais},
	Month = August,
	Title = {{Equations Reloaded}},
	Type = {slides},
	Url = {http://www.irif.fr/~sozeau/research/publications/Equations_Reloaded-ICFP19-190819.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded.pdf}}

@misc{equationsforhott,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {Inria Paris & IRIF, Universit{\'e} Paris 7 Denis Diderot},
	Author = {Matthieu Sozeau},
	Date-Added = {2019-08-14 09:40:58 -0400},
	Date-Modified = {2019-08-14 09:42:56 -0400},
	Howpublished = {Talk given at the Homotopy Type Theory 2019 Conference},
	Language = {Anglais},
	Month = August,
	Title = {{Equations for HoTT}},
	Type = {slides},
	Url = {http://www.irif.fr/~sozeau/research/publications/Equations_for_HoTT-HoTT19-130819.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded.pdf}}

@inproceedings{DBLP.conf/cpp/BauerGLSSS17,
	Author = {Andrej Bauer and Jason Gross and Peter LeFanu Lumsdaine and Michael Shulman and Matthieu Sozeau and Bas Spitters},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/BauerGLSSS17},
	Booktitle = {Proceedings of the 6th {ACM} {SIGPLAN} Conference on Certified Programs and Proofs, {CPP} 2017, Paris, France, January 16-17, 2017},
	Crossref = {DBLP:conf/cpp/2017},
	Date-Added = {2019-07-16 07:42:42 -0400},
	Date-Modified = {2019-07-16 07:43:09 -0400},
	Doi = {10.1145/3018610.3018615},
	Pages = {164--172},
	Publisher = {ACM},
	Timestamp = {Tue, 06 Nov 2018 16:59:23 +0100},
	Title = {The HoTT library: a formalization of homotopy type theory in Coq},
	Url = {https://doi.org/10.1145/3018610.3018615},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1145/3018610.3018615}}

@article{DBLP.journals/pacmpl/TabareauTS18,
	Author = {Nicolas Tabareau and {\'{E}}ric Tanter and Matthieu Sozeau},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/pacmpl/TabareauTS18},
	Date-Added = {2019-07-16 07:33:14 -0400},
	Date-Modified = {2019-07-16 07:33:19 -0400},
	Doi = {10.1145/3236787},
	Journal = {{PACMPL}},
	Number = {{ICFP}},
	Pages = {92:1--92:29},
	Timestamp = {Wed, 21 Nov 2018 12:44:28 +0100},
	Title = {Equivalences for free: univalent parametricity for effective transport},
	Url = {https://doi.org/10.1145/3236787},
	Volume = {2},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1145/3236787}}

@inproceedings{DBLP.conf/cpp/WinterhalterST19,
	Author = {Th{\'{e}}o Winterhalter and Matthieu Sozeau and Nicolas Tabareau},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/WinterhalterST19},
	Booktitle = {Proceedings of the 8th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2019, Cascais, Portugal, January 14-15, 2019},
	Crossref = {DBLP:conf/cpp/2019},
	Date-Added = {2019-07-16 07:29:17 -0400},
	Date-Modified = {2019-07-16 07:30:04 -0400},
	Doi = {10.1145/3293880.3294095},
	Pages = {91--103},
	Timestamp = {Fri, 04 Jan 2019 10:46:45 +0100},
	Title = {Eliminating reflection from type theory},
	Url = {https://doi.org/10.1145/3293880.3294095},
	Year = {2019},
	Bdsk-Url-1 = {https://doi.org/10.1145/3293880.3294095}}

@proceedings{DBLP:conf/cpp/2019,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/2019},
	Date-Added = {2019-07-16 07:29:17 -0400},
	Date-Modified = {2019-07-16 07:29:17 -0400},
	Editor = {Assia Mahboubi and Magnus O. Myreen},
	Isbn = {978-1-4503-6222-1},
	Publisher = {{ACM}},
	Timestamp = {Fri, 04 Jan 2019 10:45:31 +0100},
	Title = {Proceedings of the 8th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2019, Cascais, Portugal, January 14-15, 2019},
	Url = {https://dl.acm.org/citation.cfm?id=3293880},
	Year = {2019},
	Bdsk-Url-1 = {https://dl.acm.org/citation.cfm?id=3293880}}

@misc{coqcoqcodet,
	Author = {Matthieu Sozeau and Simon Boulier and Yannick Forster and Nicolas Tabareau and Th{\'e}o Winterhalter},
	Date-Added = {2019-07-12 13:38:10 -0400},
	Date-Modified = {2019-10-15 00:15:00 +0200},
	Howpublished = {Abstract for the Coq Workshop 2019},
	Month = {July},
	Title = {{Coq Coq Codet! Towards a Verified Toolchain for Coq in MetaCoq}},
	Url = {http://www.irif.fr/~sozeau/research/publications/Coq_Coq_Codet-CoqWS19.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://www.irif.fr/~sozeau/research/publications/drafts/Coq_Coq_Correct.pdf}}

@article{coqcoqcorrect,
	Articleno = {8},
	Author = {Matthieu Sozeau and Simon Boulier and Yannick Forster and Nicolas Tabareau and Th{\'e}o Winterhalter},
	Date-Added = {2019-07-12 13:32:48 -0400},
	Date-Modified = {2019-12-12 11:01:37 +0100},
	Doi = {10.1145/3371076},
	Journal = {{Proceedings of the ACM on Programming Languages}},
	Month = {January},
	Number = {POPL},
	Numpages = {28},
	Title = {{Coq Coq Correct! Verifying Typechecking and Erasure for Coq, in Coq}},
	Url = {http://www.irif.fr/~sozeau/research/publications/Coq_Coq_Correct-POPL20.pdf},
	Volume = {4},
	Year = {2020},
	Bdsk-Url-1 = {http://www.irif.fr/~sozeau/research/publications/Coq_Coq_Correct-POPL20.pdf},
	Bdsk-Url-2 = {https://doi.org/10.1145/3371076}}

@inproceedings{DBLP:conf/popl/LampropoulosGHH17,
	Author = {Leonidas Lampropoulos and Diane Gallois{-}Wong and Catalin Hritcu and John Hughes and Benjamin C. Pierce and Li{-}yao Xia},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/LampropoulosGHH17},
	Booktitle = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of Programming Languages, {POPL} 2017, Paris, France, January 18-20, 2017},
	Crossref = {DBLP:conf/popl/2017},
	Date-Added = {2019-07-10 03:40:25 -0400},
	Date-Modified = {2019-07-10 03:40:25 -0400},
	Pages = {114--129},
	Timestamp = {Tue, 06 Nov 2018 11:07:42 +0100},
	Title = {Beginner's luck: a language for property-based generators},
	Url = {http://dl.acm.org/citation.cfm?id=3009868},
	Year = {2017},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=3009868}}

@proceedings{DBLP:conf/popl/2017,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/2017},
	Date-Added = {2019-07-10 03:40:25 -0400},
	Date-Modified = {2019-07-10 03:40:25 -0400},
	Doi = {10.1145/3009837},
	Editor = {Giuseppe Castagna and Andrew D. Gordon},
	Isbn = {978-1-4503-4660-3},
	Publisher = {{ACM}},
	Timestamp = {Tue, 06 Nov 2018 11:07:42 +0100},
	Title = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of Programming Languages, {POPL} 2017, Paris, France, January 18-20, 2017},
	Url = {https://doi.org/10.1145/3009837},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1145/3009837}}

@inproceedings{DBLP:conf/lics/PedrotT17,
	Author = {Pierre{-}Marie P{\'{e}}drot and Nicolas Tabareau},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/lics/PedrotT17},
	Booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2017, Reykjavik, Iceland, June 20-23, 2017},
	Crossref = {DBLP:conf/lics/2017},
	Date-Added = {2019-07-10 01:38:26 -0400},
	Date-Modified = {2019-07-10 01:38:26 -0400},
	Doi = {10.1109/LICS.2017.8005113},
	Pages = {1--12},
	Timestamp = {Thu, 07 Sep 2017 09:27:11 +0200},
	Title = {An effectful way to eliminate addiction to dependence},
	Url = {https://doi.org/10.1109/LICS.2017.8005113},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1109/LICS.2017.8005113}}

@proceedings{DBLP:conf/lics/2017,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/lics/2017},
	Date-Added = {2019-07-10 01:38:26 -0400},
	Date-Modified = {2019-07-10 01:38:26 -0400},
	Isbn = {978-1-5090-3018-7},
	Publisher = {{IEEE} Computer Society},
	Timestamp = {Tue, 15 Aug 2017 20:32:42 +0200},
	Title = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2017, Reykjavik, Iceland, June 20-23, 2017},
	Url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7999337},
	Year = {2017},
	Bdsk-Url-1 = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7999337}}

@inproceedings{DBLP:conf/popl/AbelPTS13,
	Author = {Andreas Abel and Brigitte Pientka and David Thibodeau and Anton Setzer},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/AbelPTS13},
	Booktitle = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25, 2013},
	Crossref = {DBLP:conf/popl/2013},
	Date-Added = {2019-07-10 01:37:39 -0400},
	Date-Modified = {2019-07-10 01:37:39 -0400},
	Doi = {10.1145/2429069.2429075},
	Pages = {27--38},
	Timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
	Title = {Copatterns: programming infinite structures by observations},
	Url = {https://doi.org/10.1145/2429069.2429075},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1145/2429069.2429075}}

@proceedings{DBLP:conf/popl/2013,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/2013},
	Date-Added = {2019-07-10 01:37:39 -0400},
	Date-Modified = {2019-07-10 01:37:39 -0400},
	Editor = {Roberto Giacobazzi and Radhia Cousot},
	Isbn = {978-1-4503-1832-7},
	Publisher = {{ACM}},
	Timestamp = {Fri, 18 Jan 2013 17:48:28 +0100},
	Title = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25, 2013},
	Url = {http://dl.acm.org/citation.cfm?id=2429069},
	Year = {2013},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=2429069}}

@inproceedings{DBLP:conf/itp/SchaferTS15,
	Author = {Steven Sch{\"{a}}fer and Tobias Tebbi and Gert Smolka},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/SchaferTS15},
	Booktitle = {Interactive Theorem Proving - 6th International Conference, {ITP} 2015, Nanjing, China, August 24-27, 2015, Proceedings},
	Crossref = {DBLP:conf/itp/2015},
	Date-Added = {2019-07-10 01:09:54 -0400},
	Date-Modified = {2019-07-10 01:09:54 -0400},
	Doi = {10.1007/978-3-319-22102-1\_24},
	Pages = {359--374},
	Timestamp = {Tue, 14 May 2019 10:00:37 +0200},
	Title = {Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions},
	Url = {https://doi.org/10.1007/978-3-319-22102-1\_24},
	Year = {2015},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-22102-1%5C_24}}

@proceedings{DBLP:conf/itp/2015,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/2015},
	Date-Added = {2019-07-10 01:09:54 -0400},
	Date-Modified = {2019-07-10 01:09:54 -0400},
	Doi = {10.1007/978-3-319-22102-1},
	Editor = {Christian Urban and Xingyuan Zhang},
	Isbn = {978-3-319-22101-4},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Tue, 14 May 2019 10:00:37 +0200},
	Title = {Interactive Theorem Proving - 6th International Conference, {ITP} 2015, Nanjing, China, August 24-27, 2015, Proceedings},
	Url = {https://doi.org/10.1007/978-3-319-22102-1},
	Volume = {9236},
	Year = {2015},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-22102-1}}

@misc{scheplerbij,
	Author = {Daniel Schepler},
	Date-Added = {2019-07-08 13:51:50 -0400},
	Date-Modified = {2019-07-08 13:55:32 -0400},
	Howpublished = {Post on coq-club},
	Month = {December},
	Title = {{Bijective function implies equal types is provably inconsistent with functional extensionality in Coq}},
	Url = {https://sympa.inria.fr/sympa/arc/coq-club/2013-12/msg00114.html},
	Year = {2013},
	Bdsk-Url-1 = {https://sympa.inria.fr/sympa/arc/coq-club/2013-12/msg00114.html}}

@misc{equationsreloadedartifact,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {Inria Paris & IRIF, Universit{\'e} Paris 7 Denis Diderot},
	Author = {Matthieu Sozeau and Cyprien Mangin},
	Date-Added = {2019-07-08 11:17:31 -0400},
	Date-Modified = {2019-07-08 12:27:40 -0400},
	Doi = {10.1145/3342526},
	Howpublished = {{Available on the ACM DL}},
	Month = August,
	Title = {{Equations Reloaded Accompanying Material}},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded.pdf}}

@misc{matthieu_sozeau_2019_3012649,
	Author = {Matthieu Sozeau and Cyprien Mangin},
	Date-Added = {2019-06-25 17:19:24 -0400},
	Date-Modified = {2019-06-25 17:19:24 -0400},
	Doi = {10.5281/zenodo.3012649},
	Month = may,
	Title = {Equations v1.2},
	Url = {https://doi.org/10.5281/zenodo.3012649},
	Year = 2019,
	Bdsk-Url-1 = {https://doi.org/10.5281/zenodo.3012649}}

@misc{forstersozeau19,
	Author = {{Yannick Forster and Matthieu Sozeau}},
	Date-Added = {2019-06-11 11:19:55 -0400},
	Date-Modified = {2019-06-18 15:57:35 -0400},
	Journal = {Frontiers of Realizability},
	Month = {August},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/},
	Read = {Oui},
	Title = {{A mechanically verified proof erasure for Coq}},
	Year = {2009},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inproceedings{DBLP:conf/popl/StrubSFC12,
	Author = {Pierre{-}Yves Strub and Nikhil Swamy and C{\'{e}}dric Fournet and Juan Chen},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/StrubSFC12},
	Booktitle = {Proceedings of the 39th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012},
	Crossref = {DBLP:conf/popl/2012},
	Date-Added = {2019-06-10 06:08:40 -0400},
	Date-Modified = {2019-06-10 06:08:40 -0400},
	Doi = {10.1145/2103656.2103723},
	Pages = {571--584},
	Timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
	Title = {Self-certification: bootstrapping certified typecheckers in F* with Coq},
	Url = {https://doi.org/10.1145/2103656.2103723},
	Year = {2012},
	Bdsk-Url-1 = {https://doi.org/10.1145/2103656.2103723}}

@proceedings{DBLP:conf/popl/2012,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/popl/2012},
	Date-Added = {2019-06-10 06:08:40 -0400},
	Date-Modified = {2019-06-10 06:08:40 -0400},
	Editor = {John Field and Michael Hicks},
	Isbn = {978-1-4503-1083-3},
	Publisher = {{ACM}},
	Timestamp = {Sun, 03 Dec 2017 00:17:33 +0100},
	Title = {Proceedings of the 39th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012},
	Url = {http://dl.acm.org/citation.cfm?id=2103656},
	Year = {2012},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=2103656}}

@inproceedings{DBLP:conf/cade/Krauss06,
	Author = {Alexander Krauss},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cade/Krauss06},
	Booktitle = {Automated Reasoning, Third International Joint Conference, {IJCAR} 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings},
	Crossref = {DBLP:conf/cade/2006},
	Date-Added = {2019-05-31 23:09:29 +0200},
	Date-Modified = {2019-05-31 23:09:29 +0200},
	Doi = {10.1007/11814771\_48},
	Pages = {589--603},
	Timestamp = {Tue, 14 May 2019 10:00:39 +0200},
	Title = {Partial Recursive Functions in Higher-Order Logic},
	Url = {https://doi.org/10.1007/11814771\_48},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1007/11814771%5C_48}}

@proceedings{DBLP:conf/cade/2006,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cade/2006},
	Date-Added = {2019-05-31 23:09:29 +0200},
	Date-Modified = {2019-05-31 23:09:29 +0200},
	Doi = {10.1007/11814771},
	Editor = {Ulrich Furbach and Natarajan Shankar},
	Isbn = {3-540-37187-7},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Tue, 14 May 2019 10:00:39 +0200},
	Title = {Automated Reasoning, Third International Joint Conference, {IJCAR} 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings},
	Url = {https://doi.org/10.1007/11814771},
	Volume = {4130},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1007/11814771}}

@article{paulson1986constructing,
	Author = {Paulson, Lawrence C},
	Date-Added = {2019-05-31 20:39:18 +0200},
	Date-Modified = {2019-05-31 20:42:12 +0200},
	Journal = {Journal of Symbolic Computation},
	Number = {4},
	Pages = {325--355},
	Publisher = {Elsevier},
	Title = {{Constructing Recursion operators in Intuitionistic Type Theory}},
	Url = {https://www.sciencedirect.com/science/article/pii/S0747717186800025/pdf?md5=4df038c66455b64726734b09ad0ea894&isDTMRedir=Y&pid=1-s2.0-S0747717186800025-main.pdf&_valck=1},
	Volume = {2},
	Year = {1986},
	Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S0747717186800025/pdf?md5=4df038c66455b64726734b09ad0ea894&isDTMRedir=Y&pid=1-s2.0-S0747717186800025-main.pdf&_valck=1}}

@misc{sozeau.MetaCoqNomadic,
	Address = {Paris, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2019-05-23 18:07:22 +0200},
	Date-Modified = {2019-05-23 18:07:56 +0200},
	Howpublished = {Talk given at Nomadic Labs},
	Month = {May},
	Pdf = {http://www.irif.fr/~sozeau/research/publications/The_MetaCoq_Project-NomadicLabs-230519.pdf},
	Read = {Oui},
	Title = {{The MetaCoq Project}},
	Type = {slides},
	Year = {2019},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@article{DBLP:journals/pacmpl/KaiserZKRD18,
	Author = {Jan{-}Oliver Kaiser and Beta Ziliani and Robbert Krebbers and Yann R{\'{e}}gis{-}Gianas and Derek Dreyer},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/pacmpl/KaiserZKRD18},
	Date-Added = {2019-05-22 20:17:59 +0200},
	Date-Modified = {2019-05-22 20:17:59 +0200},
	Doi = {10.1145/3236773},
	Journal = {{PACMPL}},
	Number = {{ICFP}},
	Pages = {78:1--78:31},
	Timestamp = {Wed, 21 Nov 2018 12:44:28 +0100},
	Title = {Mtac2: typed tactics for backward reasoning in Coq},
	Url = {https://doi.org/10.1145/3236773},
	Volume = {2},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1145/3236773}}

@inproceedings{helix.CoqPL,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Address = {Cascais, Portugal},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Vadim Zaliva and Matthieu Sozeau},
	Booktitle = {CoqPL},
	Date-Added = {2019-05-22 20:14:45 +0200},
	Date-Modified = {2019-05-22 20:16:03 +0200},
	Language = {Anglais},
	Month = January,
	Title = {{Reification of shallow-embedded DSLs in Coq with automated verification}},
	Url = {http://www.crocodile.org/lord/vzaliva-CoqPL19.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://conf.researchr.org/event/CoqPL-2017/main-certicoq-a-verified-compiler-for-coq},
	Bdsk-Url-7 = {http://www.crocodile.org/lord/vzaliva-CoqPL19.pdf}}

@unpublished{metacoqproject,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Matthieu Sozeau and Abhishek Anand and Simon Boulier and Cyril Cohen and Yannick Forster and Fabian Kunze and Gregory Malecha and Nicolas Tabareau and Th{\'e}o Winterhalter},
	Date-Added = {2019-05-22 20:02:37 +0200},
	Date-Modified = {2019-10-15 00:13:09 +0200},
	Language = {Anglais},
	Month = April,
	Note = {{In revision}},
	Title = {{The MetaCoq Project}},
	Url = {http://www.irif.fr/~sozeau/research/publications/drafts/The_MetaCoq_Project.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/The_MetaCoq_Project.pdf}}

@inproceedings{DBLP:conf/cpp/MullenPWTG18,
	Author = {Eric Mullen and Stuart Pernsteiner and James R. Wilcox and Zachary Tatlock and Dan Grossman},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/MullenPWTG18},
	Booktitle = {Proceedings of the 7th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2018, Los Angeles, CA, USA, January 8-9, 2018},
	Crossref = {DBLP:conf/cpp/2018},
	Date-Added = {2019-05-22 19:39:18 +0200},
	Date-Modified = {2019-05-22 19:39:18 +0200},
	Doi = {10.1145/3167089},
	Pages = {172--185},
	Timestamp = {Wed, 21 Nov 2018 12:44:26 +0100},
	Title = {{\OE}uf: minimizing the Coq extraction {TCB}},
	Url = {https://doi.org/10.1145/3167089},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1145/3167089}}

@unpublished{forster:itp19,
	Author = {Yannick Forster and Fabian Kunze},
	Date-Added = {2019-05-22 19:32:50 +0200},
	Date-Modified = {2019-05-22 19:34:21 +0200},
	Month = {April},
	Title = {{A certifying extraction with time bounds from Coq to call-by-value λ-calculus}},
	Url = {http://www.ps.uni-saarland.de/Publications/documents/ForsterKunze_2019_Certifying-extraction.pdf},
	Year = {2019},
	Bdsk-Url-1 = {http://www.ps.uni-saarland.de/Publications/documents/ForsterKunze_2019_Certifying-extraction.pdf}}

@phdthesis{streicherhabil,
	Author = {Thomas Streicher},
	Date-Added = {2019-03-01 19:10:53 +0100},
	Date-Modified = {2019-03-01 19:24:26 +0100},
	School = {LMU M{\"u}nchen},
	Title = {Semantical Investigations into Intensional Type Theory},
	Type = {Habilitationsschrift},
	Year = {1993}}

@article{DBLP:journals/jfp/CockxD18,
	Author = {Jesper Cockx and Dominique Devriese},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/jfp/CockxD18},
	Date-Added = {2019-03-01 13:59:51 +0100},
	Date-Modified = {2019-03-01 13:59:51 +0100},
	Doi = {10.1017/S095679681800014X},
	Journal = {J. Funct. Program.},
	Pages = {e12},
	Timestamp = {Fri, 02 Nov 2018 09:31:48 +0100},
	Title = {Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory},
	Url = {https://doi.org/10.1017/S095679681800014X},
	Volume = {28},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1017/S095679681800014X}}

@book{mathcomp,
	Author = {Assia Mahboubi and Enrico Tassi and Yves Bertot and Georges Gonthier},
	Date-Added = {2019-02-26 18:19:22 +0100},
	Date-Modified = {2019-02-26 18:24:48 +0100},
	Title = {{Mathematical Components}},
	Year = {2018}}

@inproceedings{pedrot:hal-01840643,
	Address = {Thessaloniki, Greece},
	Author = {P{\'e}drot, Pierre-Marie and Tabareau, Nicolas},
	Booktitle = {{ESOP 2018 - 27th European Symposium on Programming}},
	Date-Added = {2019-02-25 15:28:43 +0100},
	Date-Modified = {2019-02-25 15:28:43 +0100},
	Doi = {10.1007/978-3-319-89884-1\_9},
	Hal_Id = {hal-01840643},
	Hal_Version = {v1},
	Month = Apr,
	Pages = {245-271},
	Pdf = {https://hal.inria.fr/hal-01840643/file/main.pdf},
	Publisher = {{Springer}},
	Series = {LNCS},
	Title = {{Failure is Not an Option An Exceptional Type Theory}},
	Url = {https://hal.inria.fr/hal-01840643},
	Volume = {10801},
	Year = {2018},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01840643},
	Bdsk-Url-2 = {https://doi.org/10.1007/978-3-319-89884-1%5C_9}}

@inproceedings{DBLP:conf/haskell/VazouLP17,
	Author = {Niki Vazou and Leonidas Lampropoulos and Jeff Polakow},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/haskell/VazouLP17},
	Booktitle = {Proceedings of the 10th {ACM} {SIGPLAN} International Symposium on Haskell, Oxford, United Kingdom, September 7-8, 2017},
	Crossref = {DBLP:conf/haskell/2017},
	Date-Added = {2019-02-23 13:02:05 +0100},
	Date-Modified = {2019-02-23 13:02:05 +0100},
	Doi = {10.1145/3122955.3122963},
	Pages = {63--74},
	Timestamp = {Tue, 06 Nov 2018 16:58:22 +0100},
	Title = {A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq},
	Url = {https://doi.org/10.1145/3122955.3122963},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1145/3122955.3122963}}

@proceedings{DBLP:conf/haskell/2017,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/haskell/2017},
	Date-Added = {2019-02-23 13:02:05 +0100},
	Date-Modified = {2019-02-23 13:02:05 +0100},
	Doi = {10.1145/3122955},
	Editor = {Iavor S. Diatchki},
	Isbn = {978-1-4503-5182-9},
	Publisher = {{ACM}},
	Timestamp = {Tue, 06 Nov 2018 16:58:22 +0100},
	Title = {Proceedings of the 10th {ACM} {SIGPLAN} International Symposium on Haskell, Oxford, United Kingdom, September 7-8, 2017},
	Url = {https://doi.org/10.1145/3122955},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1145/3122955}}

@article{DBLP:journals/pacmpl/CockxA18,
	Author = {Jesper Cockx and Andreas Abel},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/pacmpl/CockxA18},
	Date-Added = {2019-02-22 17:01:35 +0100},
	Date-Modified = {2019-02-22 17:01:35 +0100},
	Doi = {10.1145/3236770},
	Journal = {{PACMPL}},
	Number = {{ICFP}},
	Pages = {75:1--75:30},
	Timestamp = {Wed, 21 Nov 2018 12:44:28 +0100},
	Title = {Elaborating dependent (co)pattern matching},
	Url = {https://doi.org/10.1145/3236770},
	Volume = {2},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1145/3236770}}

@article{gilbert:hal-01859964,
	Author = {Gilbert, Ga{\"e}tan and Cockx, Jesper and Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2019-02-22 16:45:34 +0100},
	Date-Modified = {2019-02-22 16:45:34 +0100},
	Doi = {10.1145/329031610.1145/3290316},
	Hal_Id = {hal-01859964},
	Hal_Version = {v2},
	Journal = {{Proceedings of the ACM on Programming Languages}},
	Month = Jan,
	Pages = {1-28},
	Pdf = {https://hal.inria.fr/hal-01859964/file/main_popl.pdf},
	Publisher = {{ACM}},
	Series = {POPL'19},
	Title = {{Definitional Proof-Irrelevance without K}},
	Url = {https://hal.inria.fr/hal-01859964},
	Year = {2019},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01859964},
	Bdsk-Url-2 = {https://doi.org/10.1145/329031610.1145/3290316}}

@article{tabareau.hal-01559073,
	Author = {Tabareau, Nicolas and Tanter, {\'E}ric and Sozeau, Matthieu},
	Date-Added = {2019-02-22 16:44:46 +0100},
	Date-Modified = {2019-07-16 07:32:36 -0400},
	Doi = {10.1145/3234615},
	Hal_Id = {hal-01559073},
	Hal_Version = {v5},
	Journal = {{Proceedings of the ACM on Programming Languages}},
	Keywords = {Coq ; Parametricity ; Type structures ; Program reasoning ; Type theory ; Homotopy Type Theory},
	Month = Sep,
	Pages = {1-29},
	Pdf = {https://hal.inria.fr/hal-01559073/file/main_icfp.pdf},
	Publisher = {{ACM}},
	Series = {ICFP'18},
	Title = {{Equivalences for Free}},
	Url = {https://hal.inria.fr/hal-01559073},
	Year = {2018},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01559073},
	Bdsk-Url-2 = {https://doi.org/10.1145/3234615}}

@article{DBLP:journals/pacmpl/PoulsenRTKV18,
	Author = {Casper Bach Poulsen and Arjen Rouvoet and Andrew Tolmach and Robbert Krebbers and Eelco Visser},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/pacmpl/PoulsenRTKV18},
	Date-Added = {2019-02-22 16:33:20 +0100},
	Date-Modified = {2019-02-22 16:33:20 +0100},
	Doi = {10.1145/3158104},
	Journal = {{PACMPL}},
	Number = {{POPL}},
	Pages = {16:1--16:34},
	Timestamp = {Tue, 06 Nov 2018 12:51:05 +0100},
	Title = {Intrinsically-typed definitional interpreters for imperative languages},
	Url = {https://doi.org/10.1145/3158104},
	Volume = {2},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1145/3158104}}

@inproceedings{DBLP:conf/itp/VytiniotisCW12,
	Author = {Dimitrios Vytiniotis and Thierry Coquand and David Wahlstedt},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/VytiniotisCW12},
	Booktitle = {Interactive Theorem Proving - Third International Conference, {ITP} 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings},
	Crossref = {DBLP:conf/itp/2012},
	Date-Added = {2019-02-22 14:36:21 +0100},
	Date-Modified = {2019-02-22 14:36:21 +0100},
	Doi = {10.1007/978-3-642-32347-8\_17},
	Pages = {250--265},
	Timestamp = {Sun, 21 May 2017 00:18:59 +0200},
	Title = {Stop When You Are Almost-Full - Adventures in Constructive Termination},
	Url = {https://doi.org/10.1007/978-3-642-32347-8\_17},
	Year = {2012},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-32347-8%5C_17}}

@phdthesis{hancockphd,
	Author = {Peter Hancock},
	Date-Added = {2019-02-22 14:29:34 +0100},
	Date-Modified = {2019-02-22 14:30:51 +0100},
	School = {{LFCS}},
	Title = {Ordinals and Interactive Programs},
	Url = {http://www.lfcs.inf.ed.ac.uk/reports/00/ECS-LFCS-00-421/index.html},
	Year = {2000},
	Bdsk-Url-1 = {http://www.lfcs.inf.ed.ac.uk/reports/00/ECS-LFCS-00-421/index.html}}

@inproceedings{hughes1996proving,
	Author = {Hughes, John and Pareto, Lars and Sabry, Amr},
	Booktitle = {POPL},
	Date-Added = {2019-02-21 11:30:58 +0100},
	Date-Modified = {2019-02-21 11:30:58 +0100},
	Pages = {410--423},
	Title = {Proving the correctness of reactive systems using sized types},
	Volume = {96},
	Year = {1996}}

@inproceedings{abel2017sized,
	Author = {Andreas Abel and Andrea Vezzosi and Theo Winterhalter},
	Booktitle = {POPL},
	Date-Added = {2019-02-21 11:24:21 +0100},
	Date-Modified = {2019-02-21 11:31:42 +0100},
	Pages = {410--423},
	Title = {Normalization by evaluation for sized dependent types},
	Volume = {96},
	Year = {1996}}

@phdthesis{pareto1998sized,
	Author = {Pareto, Lars},
	Date-Added = {2019-02-21 11:22:19 +0100},
	Date-Modified = {2019-02-21 11:22:25 +0100},
	Publisher = {Citeseer},
	Title = {Sized types}}

@misc{sozeau.M12019,
	Author = {{Matthieu Sozeau}},
	Date-Added = {2019-02-12 16:15:46 +0100},
	Date-Modified = {2019-02-12 16:16:52 +0100},
	Howpublished = {S{\'e}minaire Introduction {\`a} la Recherche, Universit{\'e} Paris Diderot},
	Keywords = {Coq},
	Month = {February 12th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/research/publications/Programmation_certifi{\'e}e_et_assistants_de_preuve-120219.pdf},
	Title = {{Programmation certifi{\'e}e et assistants de preuve}},
	Type = {slides},
	Year = {2019}}

@misc{sozeau.SPropDeducteam,
	Address = {Cachan, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2019-01-31 18:45:23 +0100},
	Date-Modified = {2019-01-31 18:46:01 +0100},
	Howpublished = {Talk given at the Deducteam seminar},
	Month = {January},
	Pdf = {http://www.irif.fr/~sozeau/research/publications/Definitional_Proof-Irrelevance_without_K-Deducteam-310119.pdf},
	Read = {Oui},
	Title = {{Definitional Proof-Irrelevance without K}},
	Type = {slides},
	Year = {2019},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{the_coq_development_team_2018,
	Author = {The Coq Development Team},
	Date-Added = {2018-12-20 21:09:02 +0100},
	Date-Modified = {2018-12-20 21:09:12 +0100},
	Doi = {10.5281/zenodo.1219885},
	Month = {Apr},
	Publisher = {Zenodo},
	Title = {The Coq Proof Assistant, version 8.8.0},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.5281/zenodo.1219885}}

@misc{sozeau.CdF18,
	Address = {Paris, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2018-12-12 16:18:00 +0100},
	Date-Modified = {2018-12-12 16:19:03 +0100},
	Howpublished = {S{\'e}minaire au Coll{\`e}ge de France},
	Month = {12 D{\'e}cembre},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Programmer_avec_Coq-CdF-121218.pdf},
	Read = {Oui},
	Title = {{Programmer avec Coq: filtrage d{\'e}pendant et r{\'e}cursion}},
	Type = {slides},
	Year = {2018}}

@phdthesis{DBLP:phd/hal/PaulinMohring89,
	Author = {Christine Paulin{-}Mohring},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/phd/hal/PaulinMohring89},
	Date-Added = {2018-12-07 00:13:54 +0100},
	Date-Modified = {2018-12-07 00:13:54 +0100},
	School = {Paris Diderot University, France},
	Timestamp = {Tue, 12 Jul 2016 16:30:40 +0200},
	Title = {Extraction de programmes dans le Calcul des Constructions. (Program Extraction in the Calculus of Constructions)},
	Url = {https://tel.archives-ouvertes.fr/tel-00431825},
	Year = {1989},
	Bdsk-Url-1 = {https://tel.archives-ouvertes.fr/tel-00431825}}

@misc{sozeau.SPropPPS,
	Address = {Paris, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2018-11-09 20:06:54 +0100},
	Date-Modified = {2018-11-09 20:07:40 +0100},
	Howpublished = {Talk given at the PPS Days, IRIF},
	Month = {November},
	Pdf = {http://www.irif.fr/~sozeau/research/publications/A_Universe_of_Strict_Propositions_in_Type_Theory-PPS-091118.pdf},
	Read = {Oui},
	Title = {{A Universe of Strict Propositions in Type Theory}},
	Type = {slides},
	Year = {2018},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.MetaCoqLRI,
	Address = {Gif-sur-Yvette, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2018-10-26 19:00:42 +0200},
	Date-Modified = {2018-10-26 19:01:48 +0200},
	Howpublished = {Talk given at the VALS Seminar, LRI},
	Month = {October},
	Pdf = {http://www.irif.fr/~sozeau/research/publications/The_MetaCoq_Project-LRI-261018.pdf},
	Read = {Oui},
	Title = {{The MetaCoq Project}},
	Type = {slides},
	Year = {2018},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inproceedings{DBLP:conf/itp/ForsterS17,
	Author = {Yannick Forster and Gert Smolka},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/ForsterS17},
	Booktitle = {Interactive Theorem Proving - 8th International Conference, {ITP} 2017, Bras{\'{\i}}lia, Brazil, September 26-29, 2017, Proceedings},
	Crossref = {DBLP:conf/itp/2017},
	Date-Added = {2018-10-25 14:23:41 +0200},
	Date-Modified = {2018-10-25 14:23:41 +0200},
	Doi = {10.1007/978-3-319-66107-0\_13},
	Pages = {189--206},
	Timestamp = {Tue, 12 Sep 2017 12:29:08 +0200},
	Title = {Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq},
	Url = {https://doi.org/10.1007/978-3-319-66107-0\_13},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-66107-0%5C_13}}

@proceedings{DBLP:conf/itp/2017,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/2017},
	Date-Added = {2018-10-25 14:23:41 +0200},
	Date-Modified = {2018-10-25 14:23:41 +0200},
	Doi = {10.1007/978-3-319-66107-0},
	Editor = {Mauricio Ayala{-}Rinc{\'{o}}n and C{\'{e}}sar A. Mu{\~{n}}oz},
	Isbn = {978-3-319-66106-3},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Wed, 06 Sep 2017 14:53:52 +0200},
	Title = {Interactive Theorem Proving - 8th International Conference, {ITP} 2017, Bras{\'{\i}}lia, Brazil, September 26-29, 2017, Proceedings},
	Url = {https://doi.org/10.1007/978-3-319-66107-0},
	Volume = {10499},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-66107-0}}

@article{DBLP:journals/corr/abs-1806-03205,
	Archiveprefix = {arXiv},
	Author = {Fabian Kunze and Gert Smolka and Yannick Forster},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/corr/abs-1806-03205},
	Date-Added = {2018-10-24 22:44:03 +0200},
	Date-Modified = {2018-10-24 22:44:03 +0200},
	Eprint = {1806.03205},
	Journal = {CoRR},
	Timestamp = {Mon, 13 Aug 2018 16:46:47 +0200},
	Title = {Formal Small-step Verification of a Call-by-value Lambda Calculus Machine},
	Url = {http://arxiv.org/abs/1806.03205},
	Volume = {abs/1806.03205},
	Year = {2018},
	Bdsk-Url-1 = {http://arxiv.org/abs/1806.03205}}

@article{DBLP:journals/jfp/ZilianiDKNV15,
	Author = {Beta Ziliani and Derek Dreyer and Neelakantan R. Krishnaswami and Aleksandar Nanevski and Viktor Vafeiadis},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/jfp/ZilianiDKNV15},
	Date-Added = {2018-10-24 21:50:00 +0200},
	Date-Modified = {2018-10-24 21:50:00 +0200},
	Doi = {10.1017/S0956796815000118},
	Journal = {J. Funct. Program.},
	Timestamp = {Thu, 15 Jun 2017 21:30:55 +0200},
	Title = {Mtac: {A} monad for typed tactic programming in Coq},
	Url = {https://doi.org/10.1017/S0956796815000118},
	Volume = {25},
	Year = {2015},
	Bdsk-Url-1 = {https://doi.org/10.1017/S0956796815000118}}

@inproceedings{DBLP.conf/itp/AnandBCST18,
	Author = {Abhishek Anand and Simon Boulier and Cyril Cohen and Matthieu Sozeau and Nicolas Tabareau},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/AnandBCST18},
	Booktitle = {{ITP} 2018},
	Crossref = {DBLP:conf/itp/2018},
	Date-Added = {2018-10-16 17:05:18 +0000},
	Date-Modified = {2019-07-16 07:40:01 -0400},
	Doi = {10.1007/978-3-319-94821-8\_2},
	Month = {July},
	Pages = {20--39},
	Publisher = {{Springer}},
	Series = {LNCS},
	Timestamp = {Wed, 03 Oct 2018 12:55:05 +0200},
	Title = {Towards Certified Meta-Programming with Typed Template-Coq},
	Url = {https://hal.inria.fr/hal-01809681},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-94821-8%5C_2},
	Bdsk-Url-2 = {https://hal.inria.fr/hal-01809681}}

@proceedings{DBLP:conf/itp/2018,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/itp/2018},
	Date-Added = {2018-10-16 17:05:18 +0000},
	Date-Modified = {2018-10-16 17:05:18 +0000},
	Doi = {10.1007/978-3-319-94821-8},
	Editor = {Jeremy Avigad and Assia Mahboubi},
	Isbn = {978-3-319-94820-1},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Thu, 05 Jul 2018 14:28:25 +0200},
	Title = {Interactive Theorem Proving - 9th International Conference, {ITP} 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
	Url = {https://doi.org/10.1007/978-3-319-94821-8},
	Volume = {10895},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-94821-8}}

@inproceedings{DBLP.conf/rta/TimanyS18,
	Author = {Amin Timany and Matthieu Sozeau},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/rta/TimanyS18},
	Booktitle = {3rd International Conference on Formal Structures for Computation and Deduction, {FSCD} 2018, July 9-12, 2018, Oxford, {UK}},
	Crossref = {DBLP:conf/rta/2018},
	Date-Added = {2018-10-16 16:59:08 +0000},
	Date-Modified = {2019-07-16 07:40:52 -0400},
	Doi = {10.4230/LIPIcs.FSCD.2018.29},
	Pages = {29:1--29:16},
	Series = {LIPIcs},
	Timestamp = {Thu, 23 Aug 2018 15:56:40 +0200},
	Title = {Cumulative Inductive Types In Coq},
	Url = {https://doi.org/10.4230/LIPIcs.FSCD.2018.29},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.4230/LIPIcs.FSCD.2018.29}}

@inproceedings{gilbert.hal-01859964,
	Address = {Lisbon, Portugal},
	Author = {Gilbert, Ga{\"e}tan and Cockx, Jesper and Sozeau, Matthieu and Tabareau, Nicolas},
	Booktitle = {{46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019)}},
	Date-Added = {2018-10-16 16:14:16 +0000},
	Date-Modified = {2018-10-16 16:26:58 +0000},
	Hal_Id = {hal-01859964},
	Hal_Version = {v1},
	Month = Jan,
	Pdf = {https://hal.inria.fr/hal-01859964/file/main_popl.pdf},
	Series = {POPL},
	Title = {{Definitional Proof-Irrelevance without K}},
	Url = {https://hal.inria.fr/hal-01859964},
	Year = {2019},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01859964}}

@misc{sozeau.usaarland18,
	Address = {Saarbr{\"u}cken, Germany},
	Author = {{Matthieu Sozeau}},
	Date-Added = {2018-04-26 13:17:48 +0000},
	Date-Modified = {2018-04-26 13:25:13 +0000},
	Howpublished = {Lecture notes for a guest lecture given at Saarland University},
	Month = {April},
	Title = {{A Gentle Introduction to Equations Or How to Match Regexps with Dependently-Typed Continuations}},
	Type = {slides},
	Url = {http://www.irif.fr/~sozeau/research/publications/A_Gentle_Introduction_to_Equations-USaarland-260418.pdf},
	Year = {2018},
	Bdsk-Url-1 = {http://www.irif.fr/~sozeau/research/publications/A_Gentle_Introduction_to_Equations-USaarland-260418.pdf}}

@article{winterhaltertabsoz18,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Author = {Winterhalter, Th{\'e}o and Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2018-04-12 08:41:48 +0000},
	Date-Modified = {2018-12-13 21:58:50 +0100},
	Language = {Anglais},
	Month = October,
	Note = {{Accepted at CPP'19}},
	Title = {{Eliminating Reflection from Type Theory}},
	Url = {http://www.irif.fr/~sozeau/research/publications/drafts/Eliminating_Reflection_from_Type_Theory.pdf},
	Year = {2018},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Eliminating_Reflection_from_Type_Theory_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Eliminating_Reflection_from_Type_Theory.pdf}}

@article{equationsreloaded,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {Inria Paris & IRIF, Universit{\'e} Paris 7 Denis Diderot},
	Author = {Matthieu Sozeau and Cyprien Mangin},
	Date-Added = {2018-04-12 08:37:47 +0000},
	Date-Modified = {2019-07-18 11:31:35 -0400},
	Doi = {10.1145/3341690},
	Journal = {{PACMPL}},
	Language = {Anglais},
	Month = August,
	Number = {ICFP},
	Pages = {86-115},
	Title = {{Equations Reloaded: High-Level Dependently-Typed Programming and Proving in Coq}},
	Url = {http://www.irif.fr/~sozeau/research/publications/Equations_Reloaded-ICFP19.pdf},
	Volume = {3},
	Year = {2019},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded_ICFP.pdf},
	Bdsk-Url-7 = {http://www.irif.fr/~sozeau/research/publications/drafts/Equations_Reloaded.pdf}}

@inproceedings{DBLP:conf/csl/Abel06,
	Author = {Andreas Abel},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/csl/Abel06},
	Booktitle = {Computer Science Logic, 20th International Workshop, {CSL} 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings},
	Crossref = {DBLP:conf/csl/2006},
	Date-Added = {2018-03-16 03:24:05 +0000},
	Date-Modified = {2018-03-16 03:24:05 +0000},
	Doi = {10.1007/11874683_5},
	Pages = {72--88},
	Timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
	Title = {Semi-continuous Sized Types and Termination},
	Url = {https://doi.org/10.1007/11874683_5},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1007/11874683_5}}

@proceedings{DBLP:conf/csl/2006,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/csl/2006},
	Date-Added = {2018-03-16 03:24:05 +0000},
	Date-Modified = {2018-03-16 03:24:05 +0000},
	Doi = {10.1007/11874683},
	Editor = {Zolt{\'{a}}n {\'{E}}sik},
	Isbn = {3-540-45458-6},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
	Title = {Computer Science Logic, 20th International Workshop, {CSL} 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings},
	Url = {https://doi.org/10.1007/11874683},
	Volume = {4207},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1007/11874683}}

@article{DBLP:journals/lmcs/Abel08,
	Author = {Andreas Abel},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/lmcs/Abel08},
	Date-Added = {2018-03-16 03:23:34 +0000},
	Date-Modified = {2018-03-16 03:23:34 +0000},
	Doi = {10.2168/LMCS-4(2:3)2008},
	Journal = {Logical Methods in Computer Science},
	Number = {2},
	Timestamp = {Sat, 20 May 2017 00:22:52 +0200},
	Title = {Semi-Continuous Sized Types and Termination},
	Url = {https://doi.org/10.2168/LMCS-4(2:3)2008},
	Volume = {4},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.2168/LMCS-4(2:3)2008}}

@article{DBLP:journals/pacmpl/0001VW17,
	Author = {Andreas Abel and Andrea Vezzosi and Th{\'{e}}o Winterhalter},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/pacmpl/0001VW17},
	Date-Added = {2018-03-16 03:20:38 +0000},
	Date-Modified = {2018-03-16 03:20:38 +0000},
	Doi = {10.1145/3110277},
	Journal = {{PACMPL}},
	Number = {{ICFP}},
	Pages = {33:1--33:30},
	Timestamp = {Tue, 12 Sep 2017 16:16:51 +0200},
	Title = {Normalization by evaluation for sized dependent types},
	Url = {http://doi.acm.org/10.1145/3110277},
	Volume = {1},
	Year = {2017},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/3110277},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/3110277}}

@inproceedings{DBLP:conf/cpp/Spector-Zabusky18,
	Author = {Antal Spector{-}Zabusky and Joachim Breitner and Christine Rizkallah and Stephanie Weirich},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/Spector-Zabusky18},
	Booktitle = {Proceedings of the 7th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2018, Los Angeles, CA, USA, January 8-9, 2018},
	Crossref = {DBLP:conf/cpp/2018},
	Date-Added = {2018-03-15 12:40:54 +0000},
	Date-Modified = {2018-03-15 12:40:54 +0000},
	Doi = {10.1145/3167092},
	Pages = {14--27},
	Timestamp = {Sat, 30 Dec 2017 17:34:07 +0100},
	Title = {Total Haskell is reasonable Coq},
	Url = {http://doi.acm.org/10.1145/3167092},
	Year = {2018},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/3167092},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/3167092}}

@article{DBLP:journals/corr/CohenCHM16,
	Archiveprefix = {arXiv},
	Author = {Cyril Cohen and Thierry Coquand and Simon Huber and Anders M{\"{o}}rtberg},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/corr/CohenCHM16},
	Date-Added = {2018-03-15 12:35:02 +0000},
	Date-Modified = {2018-03-15 12:35:02 +0000},
	Eprint = {1611.02108},
	Journal = {CoRR},
	Timestamp = {Wed, 07 Jun 2017 14:41:32 +0200},
	Title = {Cubical Type Theory: a constructive interpretation of the univalence axiom},
	Url = {http://arxiv.org/abs/1611.02108},
	Volume = {abs/1611.02108},
	Year = {2016},
	Bdsk-Url-1 = {http://arxiv.org/abs/1611.02108}}

@inproceedings{martinlof1971hauptsatz,
	Author = {Martin-L{\"o}f, Per},
	Booktitle = {Proceedings of the 2nd Scandinavian logic symposium},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Editor = {Fenstad, Jan Erik},
	Pages = {179 -- 216},
	Publisher = {North-Holland},
	Series = {Studies in Logic and the Foundations of Mathematics},
	Title = {Hauptsatz for the intuitionistic theory of iterated inductive definitions},
	Volume = {63},
	Year = 1971}

@incollection{Martin-Lof-1972,
	Author = {Martin-L{\"o}f, Per},
	Booktitle = {Twenty-five years of constructive type theory ({V}enice, 1995)},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Editor = {Giovanni Sambin and Jan M. Smith},
	Mrclass = {03B15 (03F55)},
	Mrnumber = 1686864,
	Pages = {127--172},
	Publisher = {Oxford University Press},
	Series = {Oxford Logic Guides},
	Title = {An intuitionistic theory of types},
	Volume = 36,
	Year = 1998}

@incollection{Martin-Lof-1973,
	Author = {Martin-L{\"o}f, Per},
	Booktitle = {Logic Colloquium '73, Proceedings of the Logic Colloquium},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Editor = {H.E. Rose and J.C. Shepherdson},
	Mrclass = {02C15 (02D99)},
	Mrnumber = {0387009 (52 \#7856)},
	Mrreviewer = {Horst Luckhardt},
	Pages = {73--118},
	Publisher = {North-Holland},
	Series = {Studies in Logic and the Foundations of Mathematics},
	Title = {An intuitionistic theory of types: predicative part},
	Volume = 80,
	Year = 1975}

@techreport{hml75,
	Address = {Stockholm, Sweden},
	Author = {Hancock, Peter and Martin-L\"{o}f, Per},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Institution = {University of Stockholm},
	Number = 3,
	Title = {Syntax and semantics of the language of primitive recursive functions},
	Year = 1975}

@incollection{Martin-Lof-1979,
	Author = {Martin-L{\"o}f, Per},
	Booktitle = {Logic, Methodology and Philosophy of Science VI, Proceedings of the Sixth International Congress of Logic, Methodology and Philosophy of Science, Hannover 1979},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Doi = {10.1016/S0049-237X(09)70189-2},
	Editor = {L. Jonathan Cohen and Jerzy {{\L}o{\'s}} and Helmut Pfeiffer and Klaus-Peter Podewski},
	Mrclass = {03F50 (03B70 03F55 68Q45)},
	Mrnumber = {682410 (85d:03112)},
	Mrreviewer = {B. H. Mayoh},
	Pages = {153--175},
	Publisher = {North-Holland},
	Series = {Studies in Logic and the Foundations of Mathematics},
	Title = {Constructive mathematics and computer programming},
	Url = {http://dx.doi.org/10.1016/S0049-237X(09)70189-2},
	Volume = 104,
	Year = 1982,
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/S0049-237X(09)70189-2}}

@book{martin-lof:bibliopolis,
	Author = {Martin-L{\"o}f, Per},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Isbn = {88-7088-105-9},
	Mrclass = {03B15 (03F50 03F55)},
	Mrnumber = {769301 (86j:03005)},
	Mrreviewer = {M. M. Richter},
	Pages = {iv+91},
	Publisher = {Bibliopolis},
	Series = {Studies in Proof Theory},
	Subtitle = {Notes by Giovanni Sambin},
	Title = {Intuitionistic type theory},
	Volume = {1},
	Year = {1984}}

@article{martin2006100,
	Author = {Martin-L{\"o}f, Per},
	Date-Added = {2018-03-15 11:20:22 +0000},
	Date-Modified = {2018-03-15 11:20:22 +0000},
	Journal = {The Computer Journal},
	Number = {3},
	Pages = {345--350},
	Publisher = {BCS},
	Title = {100 years of {Z}ermelo's axiom of choice: what was the problem with it?},
	Volume = {49},
	Year = {2006}}

@inproceedings{DBLP:conf/lpar/JouannaudS17,
	Author = {Jean{-}Pierre Jouannaud and Pierre{-}Yves Strub},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/lpar/JouannaudS17},
	Booktitle = {LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017},
	Crossref = {DBLP:conf/lpar/2017},
	Date-Added = {2018-03-08 17:44:46 +0000},
	Date-Modified = {2018-03-08 17:44:46 +0000},
	Pages = {474--489},
	Timestamp = {Thu, 23 Nov 2017 16:56:11 +0100},
	Title = {Coq without Type Casts: {A} Complete Proof of Coq Modulo Theory},
	Url = {http://www.easychair.org/publications/paper/340342},
	Year = {2017},
	Bdsk-Url-1 = {http://www.easychair.org/publications/paper/340342}}

@proceedings{DBLP:conf/lpar/2017,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/lpar/2017},
	Date-Added = {2018-03-08 17:44:46 +0000},
	Date-Modified = {2018-03-08 17:44:46 +0000},
	Editor = {Thomas Eiter and David Sands},
	Publisher = {EasyChair},
	Series = {EPiC Series in Computing},
	Timestamp = {Thu, 23 Nov 2017 16:56:11 +0100},
	Title = {LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017},
	Url = {http://www.easychair.org/publications/volume/LPAR-21},
	Volume = {46},
	Year = {2017},
	Bdsk-Url-1 = {http://www.easychair.org/publications/volume/LPAR-21}}

@article{DBLP:journals/jfp/0001P16,
	Author = {Andreas Abel and Brigitte Pientka},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/journals/jfp/0001P16},
	Date-Added = {2018-03-04 15:44:11 +0000},
	Date-Modified = {2018-03-04 15:44:11 +0000},
	Doi = {10.1017/S0956796816000022},
	Journal = {J. Funct. Program.},
	Pages = {e2},
	Timestamp = {Sat, 27 May 2017 14:24:34 +0200},
	Title = {Well-founded recursion with copatterns and sized types},
	Url = {https://doi.org/10.1017/S0956796816000022},
	Volume = {26},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.1017/S0956796816000022}}

@phdthesis{DBLP:phd/hal/Lescuyer11,
	Author = {St{\'{e}}phane Lescuyer},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/phd/hal/Lescuyer11},
	Date-Added = {2018-03-04 15:28:41 +0000},
	Date-Modified = {2018-03-04 15:28:58 +0000},
	School = {University of Paris-Sud, Orsay, France},
	Timestamp = {Mon, 11 Jul 2016 18:16:19 +0200},
	Title = {Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq},
	Url = {https://tel.archives-ouvertes.fr/tel-00713668},
	Year = {2011},
	Bdsk-Url-1 = {https://tel.archives-ouvertes.fr/tel-00713668}}

@inproceedings{DBLP:conf/csl/BirkedalBCGSV16,
	Author = {Lars Birkedal and Ales Bizjak and Ranald Clouston and Hans Bugge Grathwohl and Bas Spitters and Andrea Vezzosi},
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/csl/BirkedalBCGSV16},
	Booktitle = {25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016, August 29 - September 1, 2016, Marseille, France},
	Crossref = {DBLP:conf/csl/2016},
	Date-Added = {2018-03-04 12:35:00 +0000},
	Date-Modified = {2018-03-04 12:35:00 +0000},
	Doi = {10.4230/LIPIcs.CSL.2016.23},
	Pages = {23:1--23:17},
	Timestamp = {Wed, 27 Sep 2017 13:54:28 +0200},
	Title = {Guarded Cubical Type Theory: Path Equality for Guarded Recursion},
	Url = {https://doi.org/10.4230/LIPIcs.CSL.2016.23},
	Year = {2016},
	Bdsk-Url-1 = {https://doi.org/10.4230/LIPIcs.CSL.2016.23}}

@inproceedings{DBLP:conf/popl/SwamyHKRDFBFSKZ16,
	Author = {Nikhil Swamy and Catalin Hritcu and Chantal Keller and Aseem Rastogi and Antoine Delignat{-}Lavaud and Simon Forest and Karthikeyan Bhargavan and C{\'{e}}dric Fournet and Pierre{-}Yves Strub and Markulf Kohlweiss and Jean Karim Zinzindohoue and Santiago Zanella B{\'{e}}guelin},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/popl/SwamyHKRDFBFSKZ16},
	Booktitle = {Proceedings of the 43rd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2016, St. Petersburg, FL, USA, January 20 - 22, 2016},
	Crossref = {DBLP:conf/popl/2016},
	Date-Added = {2018-02-22 13:03:47 +0000},
	Date-Modified = {2018-02-22 13:03:47 +0000},
	Doi = {10.1145/2837614.2837655},
	Pages = {256--270},
	Timestamp = {Wed, 09 Mar 2016 08:11:59 +0100},
	Title = {Dependent types and multi-monadic effects in {F}},
	Url = {http://doi.acm.org/10.1145/2837614.2837655},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2837614.2837655},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/2837614.2837655}}

@inproceedings{DBLP:conf/lics/DagandM13,
	Author = {Pierre{-}{\'{E}}variste Dagand and Conor McBride},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/lics/DagandM13},
	Booktitle = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2013, New Orleans, LA, USA, June 25-28, 2013},
	Crossref = {DBLP:conf/lics/2013},
	Date-Added = {2018-02-22 12:55:56 +0000},
	Date-Modified = {2018-02-22 12:55:56 +0000},
	Doi = {10.1109/LICS.2013.60},
	Pages = {530--539},
	Timestamp = {Thu, 25 May 2017 00:42:41 +0200},
	Title = {A Categorical Treatment of Ornaments},
	Url = {https://doi.org/10.1109/LICS.2013.60},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1109/LICS.2013.60}}

@proceedings{DBLP:conf/lics/2013,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/lics/2013},
	Date-Added = {2018-02-22 12:55:56 +0000},
	Date-Modified = {2018-02-22 12:55:56 +0000},
	Isbn = {978-1-4799-0413-6},
	Publisher = {{IEEE} Computer Society},
	Timestamp = {Wed, 27 May 2015 19:02:35 +0200},
	Title = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2013, New Orleans, LA, USA, June 25-28, 2013},
	Url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6570844},
	Year = {2013},
	Bdsk-Url-1 = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6570844}}

@article{DBLP:journals/jfp/Dagand17,
	Author = {Pierre{-}{\'{E}}variste Dagand},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/journals/jfp/Dagand17},
	Date-Added = {2018-02-22 12:55:12 +0000},
	Date-Modified = {2018-02-22 12:55:12 +0000},
	Doi = {10.1017/S0956796816000356},
	Journal = {J. Funct. Program.},
	Pages = {e9},
	Timestamp = {Sat, 27 May 2017 14:24:34 +0200},
	Title = {The essence of ornaments},
	Url = {https://doi.org/10.1017/S0956796816000356},
	Volume = {27},
	Year = {2017},
	Bdsk-Url-1 = {https://doi.org/10.1017/S0956796816000356}}

@inproceedings{templatecoq18,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Author = {Abhishek Anand and Simon Boulier and Cyril Cohen and Matthieu Sozeau and Nicolas Tabareau},
	Booktitle = {ITP},
	Date-Added = {2018-02-07 11:11:14 +0000},
	Date-Modified = {2018-10-16 16:48:53 +0000},
	Language = {Anglais},
	Month = January,
	Note = {{Accepted}},
	Title = {{Towards Certified Meta Programming with Typed Template-Coq}},
	Url = {https://hal.inria.fr/hal-01809681},
	Year = {2018},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Towards_Certified_Meta-Programming_with_Typed_Template-Coq.pdf},
	Bdsk-Url-7 = {https://hal.inria.fr/hal-01809681}}

@inproceedings{timanysoz18,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Address = {Oxford, England},
	Author = {Amin Timany and Matthieu Sozeau},
	Booktitle = {FSCD},
	Date-Added = {2018-02-07 11:07:33 +0000},
	Date-Modified = {2018-04-12 08:47:46 +0000},
	Language = {Anglais},
	Month = August,
	Note = {{Accepted}},
	Title = {{Cumulative Inductive Types in Coq}},
	Url = {http://www.irif.fr/~sozeau/research/publications/drafts/Cumulative_Inductive_Types_in_Coq_v2.pdf},
	Year = {2018},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Cumulative_Inductive_Types_in_Coq_v2.pdf}}

@misc{sozeauEUTypes18,
	Address = {Nijmegen, Netherlands},
	Author = {Matthieu Sozeau},
	Date-Added = {2018-02-07 10:39:03 +0000},
	Date-Modified = {2018-02-07 10:57:36 +0000},
	Howpublished = {Talk given at the EUTypes 2018 Working Meeting},
	Month = {January},
	Read = {Oui},
	Title = {Nested, Well-Founded and Mutual recursion in Equations},
	Type = {slides},
	Url = {https://eutypes.cs.ru.nl/eutypes_pmwiki/uploads/Meetings/Sozeau.pdf},
	Year = {2018},
	Bdsk-Url-1 = {https://popl18.sigplan.org/event/pepm-2018-equations-from-clauses-to-splittings-to-functions-poster-demo-talk-},
	Bdsk-Url-2 = {https://eutypes.cs.ru.nl/eutypes_pmwiki/uploads/Meetings/Sozeau.pdf}}

@inproceedings{sozeauCoqCoqPL18,
	Address = {Los Angeles, CA, USA},
	Author = {Matthieu Sozeau and Maxime D{\'e}n{\`e}s and Yves Bertot},
	Booktitle = {CoqPL'18},
	Date-Added = {2018-02-07 10:33:32 +0000},
	Date-Modified = {2018-02-07 10:34:40 +0000},
	Month = {January},
	Read = {Oui},
	Title = {{Coq dev talk}},
	Url = {https://popl18.sigplan.org/event/coqpl-2018-session-with-the-coq-development-team},
	Year = {2018},
	Bdsk-Url-1 = {https://popl18.sigplan.org/event/pepm-2018-equations-from-clauses-to-splittings-to-functions-poster-demo-talk-},
	Bdsk-Url-2 = {https://popl18.sigplan.org/event/coqpl-2018-session-with-the-coq-development-team}}

@inproceedings{sozeauCoqPL18,
	Address = {Los Angeles, CA, USA},
	Author = {Simon Boulier and Matthieu Sozeau and Nicolas Tabareau and Abhishek Anand},
	Booktitle = {CoqPL'18},
	Date-Added = {2018-02-07 10:31:30 +0000},
	Date-Modified = {2018-02-07 10:33:30 +0000},
	Month = {January},
	Read = {Oui},
	Title = {{Typed Template Coq}},
	Url = {https://popl18.sigplan.org/event/coqpl-2018-typed-template-coq},
	Year = {2018},
	Bdsk-Url-1 = {https://popl18.sigplan.org/event/pepm-2018-equations-from-clauses-to-splittings-to-functions-poster-demo-talk-},
	Bdsk-Url-2 = {https://popl18.sigplan.org/event/coqpl-2018-typed-template-coq}}

@misc{matthieu_sozeau_2017_1117298,
	Author = {{Matthieu Sozeau and Cyprien Mangin}},
	Date-Added = {2018-02-07 10:22:21 +0000},
	Date-Modified = {2018-02-07 10:23:53 +0000},
	Doi = {10.5281/zenodo.1117298},
	Month = dec,
	Title = {{Equations 1.0 for Coq 8.7}},
	Url = {https://doi.org/10.5281/zenodo.1117298},
	Year = 2017,
	Bdsk-Url-1 = {https://doi.org/10.5281/zenodo.1117298}}

@inproceedings{malecha2016easy-and-efficient,
	Address = {Berlin, Heidelberg},
	Author = {Malecha, Gregory and Bengtson, Jesper},
	Booktitle = {ESOP},
	Date-Added = {2018-02-02 13:29:13 +0000},
	Date-Modified = {2018-10-25 14:29:30 +0200},
	Doi = {10.1007/978-3-662-49498-1_21},
	Editor = {Thiemann, Peter},
	Isbn = {978-3-662-49498-1},
	Pages = {532--559},
	Publisher = {Springer Berlin Heidelberg},
	Title = {Extensible and Efficient Automation Through Reflective Tactics},
	Url = {http://dx.doi.org/10.1007/978-3-662-49498-1_21},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-662-49498-1_21}}

@inproceedings{10.1007/978-3-642-14052-5_8,
	Abstract = {Coq has within its logic a programming language that can be used to replace many deduction steps into a single computation, this is the so-called reflection. In this paper, we present two extensions of the evaluation mechanism that preserve its correctness and make it possible to deal with cpu-intensive tasks such as proof checking of SAT traces.},
	Address = {Berlin, Heidelberg},
	Author = {Armand, Micha{\"e}l and Gr{\'e}goire, Benjamin and Spiwack, Arnaud and Th{\'e}ry, Laurent},
	Booktitle = {Interactive Theorem Proving},
	Date-Added = {2018-02-02 12:04:02 +0000},
	Date-Modified = {2018-02-02 12:04:02 +0000},
	Editor = {Kaufmann, Matt and Paulson, Lawrence C.},
	Isbn = {978-3-642-14052-5},
	Pages = {83--98},
	Publisher = {Springer Berlin Heidelberg},
	Title = {Extending Coq with Imperative Features and Its Application to SAT Verification},
	Year = {2010}}

@article{DBLP:journals/pacmpl/0001OV18,
	Author = {Andreas Abel and Joakim {\"{O}}hman and Andrea Vezzosi},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/journals/pacmpl/0001OV18},
	Date-Added = {2018-02-02 10:20:10 +0000},
	Date-Modified = {2018-02-02 10:20:10 +0000},
	Doi = {10.1145/3158111},
	Journal = {{PACMPL}},
	Number = {{POPL}},
	Pages = {23:1--23:29},
	Timestamp = {Fri, 05 Jan 2018 12:57:30 +0100},
	Title = {Decidability of conversion for type theory in type theory},
	Url = {http://doi.acm.org/10.1145/3158111},
	Volume = {2},
	Year = {2018},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/3158111},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/3158111}}

@article{ziliani_sozeau_2017,
	Author = {ZILIANI, BETA and SOZEAU, MATTHIEU},
	Date-Added = {2018-02-02 09:54:57 +0000},
	Date-Modified = {2018-02-02 09:54:57 +0000},
	Doi = {10.1017/S0956796817000028},
	Journal = {Journal of Functional Programming},
	Pages = {e10},
	Publisher = {Cambridge University Press},
	Title = {A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading},
	Volume = {27},
	Year = {2017},
	Bdsk-Url-1 = {https://dx.doi.org/10.1017/S0956796817000028}}

@phdthesis{boutillier:tel-01054723,
	Author = {Boutillier, Pierre},
	Date-Added = {2018-01-26 09:50:37 +0000},
	Date-Modified = {2018-01-26 09:50:37 +0000},
	Hal_Id = {tel-01054723},
	Hal_Version = {v1},
	Keywords = {Coq (software) ; Proof assistant ; Induction (logic) ; Pattern-matching ; Coq (logiciel) ; Assistants de preuve ; Langages de programmation -- S{\'e}mantique ; Induction (logique) ; filtrage},
	Month = Feb,
	Pdf = {https://tel.archives-ouvertes.fr/tel-01054723/file/these_boutillier.pdf},
	School = {{Universit{\'e} Paris-Diderot - Paris VII}},
	Title = {{New tool to compute with inductive in Coq}},
	Type = {Theses},
	Url = {https://tel.archives-ouvertes.fr/tel-01054723},
	Year = {2014},
	Bdsk-Url-1 = {https://tel.archives-ouvertes.fr/tel-01054723}}

@phdthesis{DBLP:phd/hal/Boutillier14,
	Author = {Pierre Boutillier},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/phd/hal/Boutillier14},
	Date-Added = {2018-01-26 09:49:59 +0000},
	Date-Modified = {2018-01-26 09:49:59 +0000},
	School = {Paris Diderot University, France},
	Timestamp = {Thu, 30 Jun 2016 14:34:56 +0200},
	Title = {De nouveaux outils pour calculer avec des inductifs en Coq. (New tool to compute with inductive in Coq)},
	Url = {https://tel.archives-ouvertes.fr/tel-01054723},
	Year = {2014},
	Bdsk-Url-1 = {https://tel.archives-ouvertes.fr/tel-01054723}}

@misc{the_coq_development_team_2017_1133970,
	Author = {{The Coq Development Team}},
	Date-Added = {2018-01-25 16:12:01 +0000},
	Date-Modified = {2018-01-26 09:53:27 +0000},
	Doi = {10.5281/zenodo.1133970},
	Month = dec,
	Title = {{The Coq Proof Assistant, version 8.7.1}},
	Url = {https://doi.org/10.5281/zenodo.1133970},
	Year = 2017,
	Bdsk-Url-1 = {https://dx.doi.org/10.5281/zenodo.1133970},
	Bdsk-Url-2 = {https://doi.org/10.5281/zenodo.1133970}}

@article{Wu2014,
	Abstract = {There are numerous textbooks on regular languages. Many of them focus on finite automata for proving properties. Unfortunately, automata are not so straightforward to formalise in theorem provers. The reason is that natural representations for automata are graphs, matrices or functions, none of which are inductive datatypes. Regular expressions can be defined straightforwardly as a datatype and a corresponding reasoning infrastructure comes for free in theorem provers. We show in this paper that a central result from formal language theory---the Myhill-Nerode Theorem---can be recreated using only regular expressions. From this theorem many closure properties of regular languages follow.},
	Author = {Wu, Chunhan and Zhang, Xingyuan and Urban, Christian},
	Date-Added = {2018-01-20 16:45:48 +0000},
	Date-Modified = {2018-01-20 16:45:48 +0000},
	Day = {01},
	Doi = {10.1007/s10817-013-9297-2},
	Issn = {1573-0670},
	Journal = {Journal of Automated Reasoning},
	Month = {Apr},
	Number = {4},
	Pages = {451--480},
	Title = {A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions},
	Url = {https://doi.org/10.1007/s10817-013-9297-2},
	Volume = {52},
	Year = {2014},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10817-013-9297-2}}

@article{Owens2008,
	Abstract = {Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifications, and proofs. However, a possibly unfamiliar aspect of working in such an environment is that formally establishing program termination is necessary. In many cases, termination can be automatically proved, but there are useful programs that diverge and others that always terminate but have difficult termination proofs. We discuss techniques that support the expression of such programs as logical functions.},
	Author = {Owens, Scott and Slind, Konrad},
	Date-Added = {2018-01-20 16:43:45 +0000},
	Date-Modified = {2018-01-20 16:43:45 +0000},
	Day = {01},
	Doi = {10.1007/s10990-008-9038-0},
	Issn = {1573-0557},
	Journal = {Higher-Order and Symbolic Computation},
	Month = {Dec},
	Number = {4},
	Pages = {377--409},
	Title = {Adapting functional programs to higher order logic},
	Url = {https://doi.org/10.1007/s10990-008-9038-0},
	Volume = {21},
	Year = {2008},
	Bdsk-Url-1 = {https://doi.org/10.1007/s10990-008-9038-0}}

@article{yi_2006,
	Author = {YI, KWANGKEUN},
	Date-Added = {2018-01-20 16:42:10 +0000},
	Date-Modified = {2018-01-20 16:42:10 +0000},
	Doi = {10.1017/S0956796806006149},
	Journal = {Journal of Functional Programming},
	Number = {6},
	Pages = {663--670},
	Publisher = {Cambridge University Press},
	Title = {EDUCATIONAL PEARL: `Proof-directed debugging' revisited for a first-order version},
	Volume = {16},
	Year = {2006},
	Bdsk-Url-1 = {https://dx.doi.org/10.1017/S0956796806006149}}

@inproceedings{DBLP:conf/cpp/CoquandS11,
	Author = {Thierry Coquand and Vincent Siles},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/cpp/CoquandS11},
	Booktitle = {Certified Programs and Proofs - First International Conference, {CPP} 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings},
	Crossref = {DBLP:conf/cpp/2011},
	Date-Added = {2018-01-20 16:31:49 +0000},
	Date-Modified = {2018-01-20 16:31:49 +0000},
	Doi = {10.1007/978-3-642-25379-9_11},
	Pages = {119--134},
	Timestamp = {Thu, 25 May 2017 00:42:11 +0200},
	Title = {A Decision Procedure for Regular Expression Equivalence in Type Theory},
	Url = {https://doi.org/10.1007/978-3-642-25379-9_11},
	Year = {2011},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-25379-9_11}}

@inproceedings{DBLP:conf/popl/Weirich17,
	Author = {Stephanie Weirich},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/popl/Weirich17},
	Booktitle = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of Programming Languages, {POPL} 2017, Paris, France, January 18-20, 2017},
	Crossref = {DBLP:conf/popl/2017},
	Date-Added = {2018-01-20 16:29:24 +0000},
	Date-Modified = {2018-01-20 16:29:24 +0000},
	Pages = {1},
	Timestamp = {Wed, 28 Dec 2016 13:22:29 +0100},
	Title = {The influence of dependent types (keynote)},
	Url = {http://dl.acm.org/citation.cfm?id=3009923},
	Year = {2017},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=3009923}}

@article{Brzozowski:1964:DRE:321239.321249,
	Acmid = {321249},
	Address = {New York, NY, USA},
	Author = {Brzozowski, Janusz A.},
	Date-Added = {2018-01-20 13:41:40 +0000},
	Date-Modified = {2018-01-20 16:04:37 +0000},
	Doi = {10.1145/321239.321249},
	Issn = {0004-5411},
	Issue_Date = {Oct. 1964},
	Journal = {J. ACM},
	Month = oct,
	Number = {4},
	Pages = {481--494},
	Publisher = {ACM},
	Title = {Derivatives of Regular Expressions},
	Url = {http://doi.acm.org/10.1145/321239.321249},
	Volume = {11},
	Year = {1964},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/321239.321249},
	Bdsk-Url-2 = {https://dx.doi.org/10.1145/321239.321249}}

@article{Harper:1999:PD:968578.968582,
	Acmid = {968582},
	Address = {New York, NY, USA},
	Author = {Harper, Robert},
	Date-Added = {2018-01-20 13:28:57 +0000},
	Date-Modified = {2018-01-20 16:04:56 +0000},
	Doi = {10.1017/S0956796899003378},
	Issn = {0956-7968},
	Issue_Date = {July 1999},
	Journal = {J. Funct. Program.},
	Month = jul,
	Number = {4},
	Pages = {463--469},
	Publisher = {Cambridge University Press},
	Title = {{Proof-Directed Debugging}},
	Url = {http://dx.doi.org/10.1017/S0956796899003378},
	Volume = {9},
	Year = {1999},
	Bdsk-Url-1 = {http://dx.doi.org/10.1017/S0956796899003378}}

@inproceedings{DBLP:conf/cpp/DoczkalKS13,
	Author = {Christian Doczkal and Jan{-}Oliver Kaiser and Gert Smolka},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/cpp/DoczkalKS13},
	Booktitle = {Certified Programs and Proofs - Third International Conference, {CPP} 2013, Melbourne, VIC, Australia, December 11-13, 2013, Proceedings},
	Crossref = {DBLP:conf/cpp/2013},
	Date-Added = {2018-01-20 12:47:25 +0000},
	Date-Modified = {2018-01-20 12:47:25 +0000},
	Doi = {10.1007/978-3-319-03545-1_6},
	Pages = {82--97},
	Timestamp = {Thu, 25 May 2017 00:42:11 +0200},
	Title = {A Constructive Theory of Regular Languages in Coq},
	Url = {https://doi.org/10.1007/978-3-319-03545-1_6},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-03545-1_6}}

@proceedings{DBLP:conf/cpp/2013,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/cpp/2013},
	Date-Added = {2018-01-20 12:47:18 +0000},
	Date-Modified = {2018-01-20 12:47:18 +0000},
	Doi = {10.1007/978-3-319-03545-1},
	Editor = {Georges Gonthier and Michael Norrish},
	Isbn = {978-3-319-03544-4},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Thu, 25 May 2017 00:42:11 +0200},
	Title = {Certified Programs and Proofs - Third International Conference, {CPP} 2013, Melbourne, VIC, Australia, December 11-13, 2013, Proceedings},
	Url = {https://doi.org/10.1007/978-3-319-03545-1},
	Volume = {8307},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-03545-1}}

@techreport{timany.hal-01615123,
	Author = {Timany, Amin and Sozeau, Matthieu},
	Date-Added = {2017-12-15 14:07:01 +0000},
	Date-Modified = {2017-12-15 14:10:24 +0000},
	Hal_Id = {hal-01615123},
	Hal_Version = {v1},
	Institution = {{KU Leuven, Belgium ; Inria Paris}},
	Keywords = {logic ; metatheory ; calculus of constructions ; set theory ; th{\'e}orie des ensembles ; logique ; m{\'e}tath{\'e}orie ; Coq ; calcul des constructions},
	Month = Oct,
	Number = {RR-9105},
	Pages = {30},
	Pdf = {https://hal.inria.fr/hal-01615123/file/RR-9105.pdf},
	Title = {{Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)}},
	Type = {Research Report},
	Url = {https://hal.inria.fr/hal-01615123},
	Year = {2017},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01615123}}

@misc{manginsozeauPEPM2018,
	Address = {Los Angeles, CA, USA},
	Author = {Cyprien Mangin and Matthieu Sozeau},
	Date-Added = {2017-12-14 07:32:08 +0000},
	Date-Modified = {2018-02-07 10:56:11 +0000},
	Howpublished = {Talk and Poster at PEPM 2018 - ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation},
	Month = {January},
	Read = {Oui},
	Title = {Equations: From Clauses to Splittings to Functions},
	Type = {slides},
	Url = {https://popl18.sigplan.org/event/pepm-2018-equations-from-clauses-to-splittings-to-functions-poster-demo-talk-},
	Year = {2018},
	Bdsk-Url-1 = {https://popl18.sigplan.org/event/pepm-2018-equations-from-clauses-to-splittings-to-functions-poster-demo-talk-}}

@mastersthesis{winterhalter:hal-01626651,
	Author = {Winterhalter, Th{\'e}o},
	Date-Added = {2017-10-31 13:25:40 +0000},
	Date-Modified = {2017-10-31 13:25:40 +0000},
	Hal_Id = {hal-01626651},
	Hal_Version = {v1},
	Month = Sep,
	Pdf = {https://hal.inria.fr/hal-01626651/file/main.pdf},
	School = {{ENS Cachan}},
	Title = {{A Restricted Version of Reflection Compatible with Univalent Homotopy Type Theory}},
	Url = {https://hal.inria.fr/hal-01626651},
	Year = {2017},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01626651}}

@misc{sozeau.Coq/univs/GeocalTalk,
	Author = {Matthieu Sozeau},
	Date-Added = {2017-11-14 19:17:29 +0000},
	Date-Modified = {2017-11-14 19:18:44 +0000},
	Howpublished = {Talk at G{\'e}ocal-LAC days, Nantes, France},
	Keywords = {Coq Universes},
	Month = {November 14th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Cumulative_Inductive_Types_in_Coq-GeocalLAC-141117.pdf},
	Title = {{Cumulative Inductive Types in Coq}},
	Type = {slides},
	Year = {2017}}

@phdthesis{2016arXiv160605916B,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2016arXiv160605916B},
	Archiveprefix = {arXiv},
	Author = {{Brunerie}, G.},
	Date-Added = {2017-11-08 11:29:28 +0000},
	Date-Modified = {2017-11-08 11:31:48 +0000},
	Eprint = {1606.05916},
	Journal = {ArXiv e-prints},
	Keywords = {Mathematics - Algebraic Topology, Computer Science - Logic in Computer Science, Mathematics - Logic},
	Month = jun,
	Primaryclass = {math.AT},
	School = {{Laboratoire J.A. Dieudonn{\'e}}},
	Title = {{On the homotopy groups of spheres in homotopy type theory}},
	Url = {https://arxiv.org/abs/1606.05916},
	Year = 2016,
	Bdsk-Url-1 = {https://arxiv.org/abs/1606.05916}}

@inproceedings{DBLP:conf/popl/AltenkirchK16,
	Author = {Thorsten Altenkirch and Ambrus Kaposi},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/popl/AltenkirchK16},
	Booktitle = {{POPL} 2016, St. Petersburg, FL, USA, January 20 - 22, 2016},
	Date-Added = {2017-11-07 13:49:23 +0000},
	Date-Modified = {2017-11-07 13:49:23 +0000},
	Doi = {10.1145/2837614.2837638},
	Pages = {18--29},
	Timestamp = {Thu, 15 Jun 2017 21:39:12 +0200},
	Title = {Type theory in type theory using quotient inductive types},
	Url = {http://doi.acm.org/10.1145/2837614.2837638},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2837614.2837638},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2837614.2837638}}

@proceedings{DBLP:conf/popl/2016,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/popl/2016},
	Date-Added = {2017-11-07 13:49:23 +0000},
	Date-Modified = {2017-11-07 13:49:23 +0000},
	Editor = {Rastislav Bod{\'{\i}}k and Rupak Majumdar},
	Isbn = {978-1-4503-3549-2},
	Publisher = {{ACM}},
	Timestamp = {Wed, 09 Mar 2016 08:11:59 +0100},
	Title = {Proceedings of the 43rd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2016, St. Petersburg, FL, USA, January 20 - 22, 2016},
	Url = {http://dl.acm.org/citation.cfm?id=2837614},
	Year = {2016},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=2837614}}

@inproceedings{boulier:hal-01445835,
	Address = {Paris, France},
	Author = {Boulier, Simon and P{\'e}drot, Pierre-Marie and Tabareau, Nicolas},
	Booktitle = {{Certified Programs and Proofs (CPP 2017)}},
	Date-Added = {2017-11-07 13:42:15 +0000},
	Date-Modified = {2017-11-07 13:42:15 +0000},
	Doi = {10.1145/3018610.3018620},
	Hal_Id = {hal-01445835},
	Hal_Version = {v1},
	Keywords = {Program translation ; Dependent type theory},
	Month = Jan,
	Pages = {182 - 194},
	Pdf = {https://hal.inria.fr/hal-01445835/file/main.pdf},
	Title = {{The next 700 syntactical models of type theory}},
	Url = {https://hal.inria.fr/hal-01445835},
	Year = {2017},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01445835},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/3018610.3018620}}

@article{2017arXiv170501163A,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2017arXiv170501163A},
	Archiveprefix = {arXiv},
	Author = {{Anand}, A. and {Morrisett}, G.},
	Date-Added = {2017-10-19 10:35:52 +0000},
	Date-Modified = {2017-10-19 10:35:52 +0000},
	Eprint = {1705.01163},
	Journal = {ArXiv e-prints},
	Keywords = {Computer Science - Logic in Computer Science},
	Month = may,
	Primaryclass = {cs.LO},
	Title = {{Revisiting Parametricity: Inductives and Uniformity of Propositions}},
	Year = 2017}

@inproceedings{AnandMCoqPL2018,
	Address = {Los Angeles, CA, USA},
	Author = {{Anand}, A. and {Morrisett}, G.},
	Booktitle = {CoqPL'18},
	Date-Added = {2017-12-05 16:50:21 +0000},
	Date-Modified = {2017-12-05 16:51:11 +0000},
	Month = January,
	Primaryclass = {cs.LO},
	Title = {{Revisiting Parametricity: Inductives and Uniformity of Propositions}},
	Year = 2018}

@inproceedings{forsterkunze16,
	Author = {Yannick Forster and Fabian Kunze},
	Booktitle = {Coq Workshop 2016},
	Date-Added = {2017-10-17 10:13:53 +0000},
	Date-Modified = {2017-10-17 10:18:25 +0000},
	Title = {{Verified Extraction from Coq to a Lambda-Calculus}},
	Url = {https://www.ps.uni-saarland.de/~forster/coq-workshop-16/abstract-coq-ws-16.pdf},
	Year = {2016},
	Bdsk-Url-1 = {https://www.ps.uni-saarland.de/~forster/coq-workshop-16/abstract-coq-ws-16.pdf}}

@unpublished{timanysoz17,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Timany, Amin and Sozeau, Matthieu},
	Date-Added = {2017-10-11 22:53:08 +0000},
	Date-Modified = {2017-10-11 22:53:51 +0000},
	Language = {Anglais},
	Month = October,
	Note = {{Submitted}},
	Title = {{Cumulative Inductive Types in Coq}},
	Url = {http://www.irif.fr/~sozeau/research/publications/drafts/Cumulative_Inductive_Types_in_Coq.pdf},
	Year = {2017},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://www.irif.fr/~sozeau/research/publications/drafts/Cumulative_Inductive_Types_in_Coq.pdf}}

@inbook{Monin2013,
	Abstract = {When reasoning on formulas involving large-size inductively defined relations, such as the semantics of a real programming language, many steps require the inversion of a hypothesis. The built-in ``inversion'' tactic of Coq can then be used, but it suffers from severe controllability, maintenance and efficiency issues, which makes it unusable in practice in large applications.},
	Address = {Berlin, Heidelberg},
	Author = {Monin, Jean-Fran{\c{c}}ois and Shi, Xiaomu},
	Booktitle = {Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings},
	Date-Added = {2017-10-11 13:43:21 +0000},
	Date-Modified = {2017-10-11 13:43:21 +0000},
	Doi = {10.1007/978-3-642-39634-2_25},
	Editor = {Blazy, Sandrine and Paulin-Mohring, Christine and Pichardie, David},
	Isbn = {978-3-642-39634-2},
	Pages = {338--353},
	Publisher = {Springer Berlin Heidelberg},
	Title = {Handcrafted Inversions Made Operational on Operational Semantics},
	Url = {https://doi.org/10.1007/978-3-642-39634-2_25},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-39634-2_25},
	Bdsk-Url-2 = {http://dx.doi.org/10.1007/978-3-642-39634-2_25}}

@misc{agda,
	Author = {The Agda Team},
	Date-Added = {2017-10-11 11:29:44 +0000},
	Date-Modified = {2017-10-11 11:33:56 +0000},
	Title = {Agda},
	Url = {http://wiki.portal.chalmers.se/agda/pmwiki.php},
	Bdsk-Url-1 = {http://wiki.portal.chalmers.se/agda/pmwiki.php}}

@article{PLMS:PLMS0370,
	Author = {van den Berg, Benno and Garner, Richard},
	Date-Added = {2017-10-11 11:09:06 +0000},
	Date-Modified = {2017-10-11 11:09:06 +0000},
	Doi = {10.1112/plms/pdq026},
	Issn = {1460-244X},
	Journal = {Proceedings of the London Mathematical Society},
	Number = {2},
	Pages = {370--394},
	Publisher = {Oxford University Press},
	Title = {Types are weak ω-groupoids},
	Url = {http://dx.doi.org/10.1112/plms/pdq026},
	Volume = {102},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1112/plms/pdq026}}

@inproceedings{DBLP:conf/cpp/CockxD17,
	Author = {Jesper Cockx and Dominique Devriese},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/cpp/CockxD17},
	Booktitle = {Proceedings of the 6th {ACM} {SIGPLAN} Conference on Certified Programs and Proofs, {CPP} 2017, Paris, France, January 16-17, 2017},
	Crossref = {DBLP:conf/cpp/2017},
	Date-Added = {2017-10-11 10:32:42 +0000},
	Date-Modified = {2017-10-11 10:32:42 +0000},
	Doi = {10.1145/3018610.3018612},
	Pages = {173--181},
	Timestamp = {Thu, 15 Jun 2017 21:38:39 +0200},
	Title = {Lifting proof-relevant unification to higher dimensions},
	Url = {http://doi.acm.org/10.1145/3018610.3018612},
	Year = {2017},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/3018610.3018612},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/3018610.3018612}}

@proceedings{DBLP:conf/cpp/2017,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/cpp/2017},
	Date-Added = {2017-10-11 10:32:42 +0000},
	Date-Modified = {2017-10-11 10:32:42 +0000},
	Doi = {10.1145/3018610},
	Editor = {Yves Bertot and Viktor Vafeiadis},
	Isbn = {978-1-4503-4705-1},
	Publisher = {{ACM}},
	Timestamp = {Mon, 02 Jan 2017 14:41:55 +0100},
	Title = {Proceedings of the 6th {ACM} {SIGPLAN} Conference on Certified Programs and Proofs, {CPP} 2017, Paris, France, January 16-17, 2017},
	Url = {http://doi.acm.org/10.1145/3018610},
	Year = {2017},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/3018610},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/3018610}}

@inproceedings{DBLP:conf/icfp/CockxDP14,
	Author = {Jesper Cockx and Dominique Devriese and Frank Piessens},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/icfp/CockxDP14},
	Booktitle = {Proceedings of the 19th {ACM} {SIGPLAN} international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014},
	Crossref = {DBLP:conf/icfp/2014},
	Date-Added = {2017-10-11 10:32:42 +0000},
	Date-Modified = {2017-10-11 10:32:42 +0000},
	Doi = {10.1145/2628136.2628139},
	Pages = {257--268},
	Timestamp = {Sun, 04 Jun 2017 10:05:10 +0200},
	Title = {Pattern matching without {K}},
	Url = {http://doi.acm.org/10.1145/2628136.2628139},
	Year = {2014},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2628136.2628139},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2628136.2628139}}

@proceedings{DBLP:conf/icfp/2014,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/icfp/2014},
	Date-Added = {2017-10-11 10:32:42 +0000},
	Date-Modified = {2017-10-11 10:32:42 +0000},
	Editor = {Johan Jeuring and Manuel M. T. Chakravarty},
	Isbn = {978-1-4503-2873-9},
	Publisher = {{ACM}},
	Timestamp = {Thu, 20 Nov 2014 18:05:13 +0100},
	Title = {Proceedings of the 19th {ACM} {SIGPLAN} international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014},
	Url = {http://dl.acm.org/citation.cfm?id=2628136},
	Year = {2014},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=2628136}}

@phdthesis{DBLP:phd/basesearch/Cockx17,
	Author = {Jesper Cockx},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/phd/basesearch/Cockx17},
	Date-Added = {2017-10-11 10:32:42 +0000},
	Date-Modified = {2017-10-11 10:32:42 +0000},
	School = {Katholieke Universiteit Leuven, Belgium},
	Timestamp = {Tue, 27 Jun 2017 16:33:36 +0200},
	Title = {Dependent Pattern Matching and Proof-Relevant Unification},
	Url = {https://lirias.kuleuven.be/handle/123456789/583556},
	Year = {2017},
	Bdsk-Url-1 = {https://lirias.kuleuven.be/handle/123456789/583556}}

@misc{lean,
	Author = {Avigad, Jeremy and Ebner, Gabriel and Ullrich, Sebastian},
	Date-Added = {2017-10-11 10:31:34 +0000},
	Date-Modified = {2017-10-11 10:31:34 +0000},
	Month = {October},
	Note = {Available at \url{https://leanprover.github.io/reference/lean_reference.pdf}},
	Title = {{The Lean Reference Manual, release 3.3.0}},
	Year = {2017}}

@article{2017arXiv170607526R,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2017arXiv170607526R},
	Archiveprefix = {arXiv},
	Author = {{Rijke}, E. and {Shulman}, M. and {Spitters}, B.},
	Date-Added = {2017-10-08 12:22:15 +0000},
	Date-Modified = {2017-10-08 12:22:15 +0000},
	Eprint = {1706.07526},
	Journal = {ArXiv e-prints},
	Keywords = {Mathematics - Category Theory, Computer Science - Logic in Computer Science, Mathematics - Logic, 03B15, 03B35, 03B45, 03B70, 03F65, 03G30, 18A32, 18B25, 18C35, 18C50, 18D30, F.3.1, F.4.1},
	Month = jun,
	Primaryclass = {math.CT},
	Title = {{Modalities in homotopy type theory}},
	Year = 2017}

@phdthesis{Pau96b,
	Author = {Christine Paulin-Mohring},
	Date-Added = {2017-10-08 09:50:38 +0000},
	Date-Modified = {2019-07-08 13:57:11 -0400},
	Month = dec,
	School = {Universit{\'e} Claude Bernard Lyon I},
	Title = {D{\'e}finitions Inductives en Th{\'e}orie des Types d'Ordre Sup{\'e}rieur},
	Type = {Habilitation {\`a} diriger les recherches},
	Url = {http://www.lri.fr/~paulin/PUBLIS/habilitation.ps.gz},
	Year = 1996,
	Bdsk-Url-1 = {http://www.lri.fr/~paulin/PUBLIS/habilitation.ps.gz}}

@inproceedings{timanyTYPES17,
	Address = {Budapest, Hungary},
	Author = {{Amin Timany and Matthieu Sozeau and Bart Jacobs}},
	Booktitle = {TYPES 2017 Proceedings},
	Date-Added = {2017-06-27 12:44:50 +0000},
	Date-Modified = {2017-06-27 12:49:15 +0000},
	Keywords = {Coq},
	Month = {May},
	Pdf = {http://types2017.elte.hu/proc.pdf#page=105},
	Title = {{Cumulative Inductive Types in Coq}},
	Year = {2017}}

@misc{sozeau.Coq/EJCP/2017,
	Author = {{Matthieu Sozeau}},
	Date-Added = {2017-06-27 12:36:21 +0000},
	Date-Modified = {2017-06-27 12:37:34 +0000},
	Howpublished = {Lecture notes for a course given at EJCP'17 in Toulouse},
	Keywords = {Coq},
	Month = {June 27th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/research/publications/Introduction_to_Type_Theory-EJCP-270617.pdf},
	Title = {{Introduction to Type Theory and Interactive Theorem Proving in Coq}},
	Type = {slides},
	Year = {2017}}

@inproceedings{DBLP:journals/corr/ManginS15,
	Author = {Cyprien Mangin and Matthieu Sozeau},
	Booktitle = {Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice, {LFMTP} 2015, Berlin, Germany, 1 August 2015.},
	Crossref = {DBLP:journals/corr/CervesatoC15},
	Date-Added = {2017-03-05 12:50:54 +0000},
	Date-Modified = {2017-03-05 12:50:54 +0000},
	Doi = {10.4204/EPTCS.185.5},
	Pages = {71--86},
	Title = {{Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study}},
	Url = {http://dx.doi.org/10.4204/EPTCS.185.5},
	Year = {2015},
	Bdsk-Url-1 = {http://dx.doi.org/10.4204/EPTCS.185.5}}

@article{DBLP:journals/entcs/Lasson14,
	Author = {Marc Lasson},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/journals/entcs/Lasson14},
	Date-Added = {2017-02-15 16:25:32 +0000},
	Date-Modified = {2017-02-15 16:25:32 +0000},
	Doi = {10.1016/j.entcs.2014.10.013},
	Journal = {Electr. Notes Theor. Comput. Sci.},
	Pages = {229--244},
	Timestamp = {Tue, 04 Nov 2014 10:58:51 +0100},
	Title = {Canonicity of Weak {\(\omega\)}-groupoid Laws Using Parametricity Theory},
	Url = {http://dx.doi.org/10.1016/j.entcs.2014.10.013},
	Volume = {308},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.entcs.2014.10.013}}

@inproceedings{certicoq.CoqPL,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Address = {Paris, France},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Abhishek Anand and Andrew Appel and Greg Morrisett and Zoe Paraskevopoulou and Randy Pollack and Olivier Savary Belanger and Matthieu Sozeau and Matthew Weaver},
	Booktitle = {CoqPL},
	Date-Added = {2017-02-01 17:46:34 +0000},
	Date-Modified = {2018-03-04 15:50:14 +0000},
	Language = {Anglais},
	Month = January,
	Title = {{CertiCoq: A verified compiler for Coq}},
	Url = {http://conf.researchr.org/event/CoqPL-2017/main-certicoq-a-verified-compiler-for-coq},
	Year = {2017},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185},
	Bdsk-Url-6 = {http://conf.researchr.org/event/CoqPL-2017/main-certicoq-a-verified-compiler-for-coq}}

@mastersthesis{lewertowski.hal-01250862,
	Author = {Lewertowski, Gabriel},
	Date-Added = {2016-11-09 07:03:18 +0000},
	Date-Modified = {2016-11-09 07:10:49 +0000},
	Hal_Id = {hal-01250862},
	Hal_Version = {v1},
	Month = Sep,
	Pdf = {https://hal.inria.fr/hal-01250862/file/rapport%20%281%29.pdf},
	School = {{Univerist{\'e} Paris Diderot Paris 7}},
	Title = {{Ensembles nominaux dans Coq/SSreflect}},
	Url = {https://hal.inria.fr/hal-01250862},
	Year = {2015},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01250862}}

@mastersthesis{mangin.hal-01250855,
	Author = {Mangin, Cyprien},
	Date-Added = {2016-11-09 06:50:53 +0000},
	Date-Modified = {2016-11-09 07:10:58 +0000},
	Hal_Id = {hal-01250855},
	Hal_Version = {v1},
	Month = Aug,
	Pdf = {https://hal.inria.fr/hal-01250855/file/main%20%286%29.pdf},
	School = {{Universit{\'e} Paris 7 Denis Diderot}},
	Title = {{Eliminating Dependent Pattern-Matching in Coq}},
	Url = {https://hal.inria.fr/hal-01250855},
	Year = {2015},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01250855}}

@inproceedings{conf/lics/JaberLPST16,
	Author = {Guilhem Jaber and Gabriel Lewertowski and Pierre{-}Marie P{\'{e}}drot and Matthieu Sozeau and Nicolas Tabareau},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/lics/JaberLPST16},
	Booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
	Crossref = {DBLP:conf/lics/2016},
	Date-Added = {2016-11-09 06:40:31 +0000},
	Date-Modified = {2016-11-09 06:44:46 +0000},
	Doi = {10.1145/2933575.2935320},
	Pages = {367--376},
	Timestamp = {Thu, 27 Oct 2016 11:27:54 +0200},
	Title = {The Definitional Side of the Forcing},
	Url = {http://doi.acm.org/10.1145/2933575.2935320},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2933575.2935320},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2933575.2935320}}

@proceedings{DBLP:conf/lics/2016,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/lics/2016},
	Date-Added = {2016-11-09 06:40:31 +0000},
	Date-Modified = {2016-11-09 06:40:31 +0000},
	Doi = {10.1145/2933575},
	Editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar},
	Isbn = {978-1-4503-4391-6},
	Publisher = {{ACM}},
	Timestamp = {Thu, 27 Oct 2016 11:23:41 +0200},
	Title = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
	Url = {http://doi.acm.org/10.1145/2933575},
	Year = {2016},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2933575},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2933575}}

@article{2016arXiv161004591B,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2016arXiv161004591B},
	Archiveprefix = {arXiv},
	Author = {{Bauer, A. and Gross, J. and LeFanu Lumsdaine, P. and Shulman, M. and Sozeau, M. and Spitters, B.}},
	Date-Added = {2016-11-09 06:26:34 +0000},
	Date-Modified = {2016-11-17 07:43:23 +0000},
	Eprint = {1610.04591},
	Journal = {ArXiv e-prints},
	Keywords = {Computer Science - Logic in Computer Science, Mathematics - Logic, 03B70, 03B15, 55U35, F.4.1},
	Month = oct,
	Note = {Accepted at CPP'17},
	Primaryclass = {cs.LO},
	Title = {{The HoTT Library: A formalization of homotopy type theory in Coq}},
	Url = {https://arxiv.org/abs/1610.04591},
	Year = 2016,
	Bdsk-Url-1 = {https://arxiv.org/abs/1610.04591}}

@article{zilsoz17unif.JFP,
	Author = {Beta Ziliani and Matthieu Sozeau},
	Date-Added = {2016-11-09 06:23:07 +0000},
	Date-Modified = {2018-02-02 10:02:05 +0000},
	Doi = {10.1017/S0956796817000028},
	Journal = {Journal of Functional Programming},
	Pages = {e10},
	Publisher = {Cambridge University Press},
	Title = {{A Comprehensible Guide to a New Unifier for CIC Including Universe Polymorphism and Overloading}},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/unification-jfp.pdf},
	Volume = {27},
	Year = {2017},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/unif.pdf},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/unification-jfp.pdf},
	Bdsk-Url-3 = {https://doi.org/10.1017/S0956796817000028}}

@misc{sozeau.Coq/dev/CoqWS16,
	Author = {{Matthieu Sozeau}},
	Date-Added = {2016-08-26 13:19:26 +0000},
	Date-Modified = {2016-08-26 13:21:18 +0000},
	Howpublished = {Talk at the Coq Workshop in Nancy, France},
	Keywords = {Coq},
	Month = {August 26th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/research/publications/Coq_8.6-CoqWS16-260816.pdf},
	Title = {{Coq 8.6}},
	Type = {slides},
	Year = {2016}}

@misc{sozeau16cluf,
	Author = {Matthieu Sozeau},
	Date-Added = {2016-07-28 10:41:44 +0000},
	Date-Modified = {2016-07-28 10:45:37 +0000},
	Howpublished = {Invited talk at the Categorical Logic and Univalent Foundations workshop, Leeds, UK},
	Month = {July 28th},
	Read = {Oui},
	Title = {{Forcing Translations in Type Theory}},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Forcing_Translations_in_Type_Theory-CLUF-280716.pdf},
	Year = {2016},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_support_for_HoTT-HoTTUF-290615.pdf},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Forcing_Translations_in_Type_Theory-CLUF-280716.pdf}}

@misc{sozeau16icms,
	Author = {Matthieu Sozeau},
	Date-Added = {2016-07-15 14:07:05 +0000},
	Date-Modified = {2016-07-20 10:48:57 +0000},
	Howpublished = {Invited talk at the International Conference on Mathematical Software in Berlin, Germany},
	Month = {July 14th},
	Read = {Oui},
	Title = {{Coq for HoTT}},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_for_HoTT-ICMS16-140716.pdf},
	Year = {2016},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_support_for_HoTT-HoTTUF-290615.pdf},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_for_HoTT-ICMS16-140716.pdf}}

@misc{sozeau.Coq/dev/DeepSpec16,
	Author = {{Maxime D{\'e}n{\`e}s, Matthieu Sozeau}},
	Date-Added = {2016-06-10 10:19:46 +0000},
	Date-Modified = {2016-06-10 10:22:30 +0000},
	Howpublished = {Talk at the DeepSpec Kickoff Workshop in Princeton, NJ, USA},
	Keywords = {Coq Universes},
	Month = {June 8th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/research/publications/Coq_8.6-DeepSpec16-080616.pdf},
	Title = {{Coq 8.6}},
	Type = {slides},
	Year = {2016}}

@misc{sozeau.Coq/univs/CIW16,
	Author = {Matthieu Sozeau},
	Date-Added = {2016-06-10 09:28:12 +0000},
	Date-Modified = {2016-06-10 09:31:26 +0000},
	Howpublished = {Talk at the Second Coq Implementors Workshop, Sophia-Antipolis, France},
	Keywords = {Coq Universes},
	Month = {June 2nd},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_in_Coq_for_the_OCaml_hacker-CIW16-020616.pdf},
	Title = {{Universe Polymorphism for the OCaml hacker}},
	Type = {slides},
	Year = {2016}}

@misc{sozeau.Coq/Equations/Dagstuhl16,
	Author = {Matthieu Sozeau},
	Date-Added = {2016-06-10 08:06:36 +0000},
	Date-Modified = {2016-06-10 08:08:05 +0000},
	Howpublished = {Talk at Dagstuhl},
	Keywords = {dependent types pattern matching unification},
	Month = {March},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_a_function_definition_toolbox_for_Coq-Dagstuhl-290316.pdf},
	Read = {Oui},
	Title = {{Equations: a function definition toolbox for Coq}},
	Type = {slides},
	Year = {2016},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/dev/Coq16,
	Address = {St Petersburg, FL},
	Author = {Maxime D{\'e}n{\`e}s, Matthieu Sozeau},
	Date-Added = {2016-06-10 08:02:10 +0000},
	Date-Modified = {2016-06-10 08:03:13 +0000},
	Howpublished = {Talk given at the second CoqPL Workshop},
	Month = {January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_8.5_at_work-CoqPL16-230116.pdf},
	Read = {Oui},
	Title = {{Coq 8.5 at work}},
	Type = {slides},
	Year = {2016},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{zilsoz.unicoq/ICFP15,
	Address = {Vancouver, Canada},
	Author = {Matthieu Sozeau},
	Date-Added = {2015-09-02 15:54:14 +0000},
	Date-Modified = {2015-09-02 15:55:13 +0000},
	Howpublished = {Talk given at ICFP'15},
	Month = {September},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_Unification_Algorithm_for_Coq_featuring_Universe_Polymorphism_and_Overloading-ICFP15-010915.pdf},
	Read = {Oui},
	Title = {{A Unification Algorithm for Coq featuring Universe Polymorphism and Overloading}},
	Type = {slides},
	Year = {2015},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau15hottuf,
	Author = {Matthieu Sozeau},
	Date-Added = {2015-06-29 12:53:42 +0000},
	Date-Modified = {2016-07-15 14:09:53 +0000},
	Howpublished = {Invited talk at the HoTT/UF workshop in Warsaw, Poland},
	Month = {June},
	Read = {Oui},
	Title = {{Coq support for HoTT}},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_support_for_HoTT-HoTTUF-290615.pdf},
	Year = {2015},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_support_for_HoTT-HoTTUF-290615.pdf}}

@misc{sozeau15epit,
	Abstract = {Les classes de types ont d{\'e}montr{\'e} leur utilit{\'e} pour la programmation
polymorphique de haut-niveau en Haskell et la construction de
hi{\'e}rarchies de structures math{\'e}matiques dans l'assistant de preuve
Isabelle. Ce m{\'e}canisme de surcharge tr{\`e}s versatile peut se g{\'e}n{\'e}raliser
aux types d{\'e}pendants et offre alors de nouvelles formes de g{\'e}n{\'e}ricit{\'e}.
Il permet aussi d'int{\'e}grer une forme de programmation logique au moment
du typage.  On pr{\'e}sentera une impl{\'e}mentation l{\'e}g{\`e}re d'un syst{\`e}me de
classes de types de premi{\`e}re classe dans Coq, bas{\'e}e sur un
enrichissement de constructions existantes du langage Gallina. On
illustrera ce nouvel outil par des exemples mettant en oeuvre les
classes pour programmer, prouver et organiser les d{\'e}veloppements en Coq.
},
	Author = {Matthieu Sozeau},
	Date-Added = {2015-06-02 09:16:11 +0000},
	Date-Modified = {2015-06-02 09:24:09 +0000},
	Howpublished = {Lecture at the "{\'E}cole de Printemps d'Informatique Th{\'e}orique 2015" in Fr{\'e}jus, France},
	Month = {May},
	Pdf = {https://raw.githubusercontent.com/yurug/coqepit/master/support/day2/cours3.pdf},
	Read = {Oui},
	Title = {{Functional Programming and Proving in Coq}},
	Type = {slides},
	Year = {2015}}

@misc{sozeau.Coq/univs/TYPES18,
	Author = {Matthieu Sozeau},
	Date-Added = {2018-06-20 10:33:34 +0000},
	Date-Modified = {2018-06-20 10:34:53 +0000},
	Howpublished = {Invited talk at the TYPES 2018 conference, Braga, Portugal},
	Keywords = {Coq Universes},
	Month = {June 20th},
	Pdf = {http://www.pps.univ-paris-diderot.fr/~sozeau/research/publications/The_Predicative_Polymorphic_Cumulative_Calculus_of_Inductive_Constructions_and_its_implementation-TYPES18-200618.pdf},
	Title = {{The Predicative, Polymorphic, Cumulative Calculus of Inductive Constructions and its implementation}},
	Type = {slides},
	Year = {2018}}

@inproceedings{mansoz15fpred.LFMTP,
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Mangin, Cyprien and Sozeau, Matthieu},
	Booktitle = {Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice},
	Date-Added = {2015-05-08 16:53:24 +0000},
	Date-Modified = {2016-07-28 11:02:55 +0000},
	Doi = {10.4204/EPTCS.185},
	Language = {Anglais},
	Month = may,
	Note = {{LFMTP'15}},
	Series = {{EPTCS}},
	Title = {{Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study}},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Volume = {185},
	Year = {2015},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Bdsk-Url-4 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations_for_Hereditary_Substitution_in_Leivants_Predicative_System_F:_a_case_study.pdf},
	Bdsk-Url-5 = {http://dx.doi.org/10.4204/EPTCS.185}}

@inproceedings{DBLP:conf/itp/MalechaCB14,
	Author = {Gregory Malecha and Adam Chlipala and Thomas Braibant},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/itp/MalechaCB14},
	Booktitle = {Interactive Theorem Proving - 5th International Conference, {ITP} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
	Crossref = {DBLP:conf/itp/2014},
	Date-Added = {2015-05-08 09:41:58 +0000},
	Date-Modified = {2015-05-08 09:41:58 +0000},
	Doi = {10.1007/978-3-319-08970-6_24},
	Pages = {374--389},
	Timestamp = {Mon, 30 Jun 2014 12:30:02 +0200},
	Title = {Compositional Computational Reflection},
	Url = {http://dx.doi.org/10.1007/978-3-319-08970-6_24},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-319-08970-6_24}}

@unpublished{soztab15intern.ITP,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2015-04-29 18:05:48 +0000},
	Date-Modified = {2015-04-29 18:10:29 +0000},
	Language = {Anglais},
	Month = Feb,
	Title = {{Internalizing Intensional Type Theory}},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf},
	Year = {2015},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/internalizingITT.pdf}}

@misc{zilsoz15unif.talk.MIT,
	Author = {Matthieu Sozeau},
	Date-Added = {2015-04-29 18:01:01 +0000},
	Date-Modified = {2015-04-29 18:14:06 +0000},
	Howpublished = {Talk given at MIT, Cambridge, MA},
	Month = {April 29th},
	Title = {A Predictable Unification Algorithm for Coq},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_Predictable_Unification_Algorithm_for_Coq-MIT-290415.pdf},
	Year = {2015},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_Predictable_Unification_Algorithm_for_Coq-MIT-290415.pdf}}

@inproceedings{zilsoz15unif.ICFP,
	Author = {Beta Ziliani and Matthieu Sozeau},
	Booktitle = {ACM SIGPLAN International Conference on Functional Programming 2015},
	Date-Added = {2015-04-29 17:59:19 +0000},
	Date-Modified = {2015-09-02 16:10:16 +0000},
	Title = {A Unification Algorithm for Coq featuring Universe Polymorphism and Overloading},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_Unification_Algorithm_for_Coq_featuring_Universe_Polymorphism_and_Overloading-ICFP15.pdf},
	Year = {2015},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/unif.pdf},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_Unification_Algorithm_for_Coq_featuring_Universe_Polymorphism_and_Overloading-ICFP15.pdf}}

@article{licatacubical,
	Author = {Licata, Daniel R and Brunerie, Guillaume},
	Date-Added = {2015-04-28 21:49:39 +0000},
	Date-Modified = {2015-04-28 21:52:06 +0000},
	Journal = {LICS},
	Title = {{A Cubical Approach to Synthetic Homotopy Theory}},
	Url = {http://dlicata.web.wesleyan.edu/pubs/lb15cubicalsynth/lb15cubicalsynth.pdf},
	Year = {2015},
	Bdsk-Url-1 = {http://dlicata.web.wesleyan.edu/pubs/lb15cubicalsynth/lb15cubicalsynth.pdf}}

@unpublished{shullumhit,
	Author = {{Mike Shulman and Peter LeFanu Lumsdaine}},
	Date-Added = {2015-04-28 21:24:49 +0000},
	Date-Modified = {2015-04-28 21:26:13 +0000},
	Title = {{Semantics of Higher Inductive Types}},
	Year = {2012}}

@inproceedings{DBLP:conf/popl/Sojakova15,
	Author = {Kristina Sojakova},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/popl/Sojakova15},
	Booktitle = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015},
	Crossref = {DBLP:conf/popl/2015},
	Date-Added = {2015-04-28 21:22:36 +0000},
	Date-Modified = {2015-04-28 21:22:36 +0000},
	Doi = {10.1145/2676726.2676983},
	Pages = {31--42},
	Timestamp = {Sat, 20 Dec 2014 16:58:56 +0100},
	Title = {Higher Inductive Types as Homotopy-Initial Algebras},
	Url = {http://doi.acm.org/10.1145/2676726.2676983},
	Year = {2015},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2676726.2676983},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2676726.2676983}}

@proceedings{DBLP:conf/popl/2015,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/popl/2015},
	Date-Added = {2015-04-28 21:22:36 +0000},
	Date-Modified = {2015-04-28 21:22:36 +0000},
	Editor = {Sriram K. Rajamani and David Walker},
	Isbn = {978-1-4503-3300-9},
	Publisher = {{ACM}},
	Timestamp = {Sat, 20 Dec 2014 16:56:16 +0100},
	Title = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015},
	Url = {http://dl.acm.org/citation.cfm?id=2676726},
	Year = {2015},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=2676726}}

@book{chlipala2011certified,
	Author = {Chlipala, Adam},
	Date-Added = {2015-04-28 21:08:38 +0000},
	Date-Modified = {2015-04-28 21:51:19 +0000},
	Number = {11},
	Publisher = {MIT Press},
	Title = {{Certified Programming with Dependent Types}},
	Volume = {20},
	Year = {2011}}

@phdthesis{eades2014semantic,
	Author = {Eades III, Harley D},
	Date-Added = {2015-04-23 09:19:41 +0000},
	Date-Modified = {2015-04-23 09:22:35 +0000},
	School = {The University of Iowa},
	Title = {The semantic analysis of advanced programming languages},
	Url = {http://metatheorem.org/wp-content/papers/thesis.pdf},
	Year = {2014},
	Bdsk-Url-1 = {http://metatheorem.org/wp-content/papers/thesis.pdf}}

@conference{eadespstt10,
	Address = {Edinburgh, Scotland},
	Author = {Harley D. Eades III and Aaron Stump},
	Booktitle = {International Workshop on Proof-Search in Type Theories},
	Date-Added = {2015-04-23 08:56:47 +0000},
	Date-Modified = {2015-04-23 09:22:49 +0000},
	Month = {July},
	Organization = {A FLoC workshop},
	Pdf = {http://homepage.divms.uiowa.edu/~astump/papers/pstt-2010.pdf},
	Title = {{Hereditary Substitution for Stratified System F}},
	Url = {http://homepage.divms.uiowa.edu/~astump/papers/pstt-2010.pdf},
	Year = {2010},
	Bdsk-Url-1 = {http://homepage.divms.uiowa.edu/~astump/papers/pstt-2010.pdf}}

@inproceedings{DBLP:journals/corr/EadesS13,
	Author = {Harley D. Eades III and Aaron Stump},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/EadesS13},
	Booktitle = {Proceedings First Workshop on Control Operators and their Semantics, {COS} 2013, Eindhoven, The Netherlands, June 24-25, 2013.},
	Crossref = {DBLP:journals/corr/deLiguoroS13},
	Date-Added = {2015-04-23 08:50:49 +0000},
	Date-Modified = {2015-04-23 08:50:49 +0000},
	Doi = {10.4204/EPTCS.127.4},
	Pages = {45--65},
	Timestamp = {Mon, 28 Oct 2013 16:56:55 +0100},
	Title = {Hereditary Substitution for the {\(\lambda\)}{\(\Delta\)}-Calculus},
	Url = {http://dx.doi.org/10.4204/EPTCS.127.4},
	Year = {2013},
	Bdsk-Url-1 = {http://dx.doi.org/10.4204/EPTCS.127.4}}

@proceedings{DBLP:journals/corr/deLiguoroS13,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/deLiguoroS13},
	Date-Added = {2015-04-23 08:50:49 +0000},
	Date-Modified = {2015-04-23 08:50:49 +0000},
	Doi = {10.4204/EPTCS.127},
	Editor = {Ugo de'Liguoro and Alexis Saurin},
	Series = {{EPTCS}},
	Timestamp = {Mon, 28 Oct 2013 16:56:55 +0100},
	Title = {Proceedings First Workshop on Control Operators and their Semantics, {COS} 2013, Eindhoven, The Netherlands, June 24-25, 2013},
	Url = {http://dx.doi.org/10.4204/EPTCS.127},
	Volume = {127},
	Year = {2013},
	Bdsk-Url-1 = {http://dx.doi.org/10.4204/EPTCS.127}}

@article{DBLP:journals/corr/abs-1202-4905,
	Author = {Andrea Asperti and Wilmer Ricciotti and Claudio Sacerdoti Coen and Enrico Tassi},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1202-4905},
	Date-Added = {2015-02-23 23:29:05 +0000},
	Date-Modified = {2015-02-23 23:29:18 +0000},
	Doi = {10.2168/LMCS-8(1:18)2012},
	Journal = {LMCS},
	Number = {1},
	Timestamp = {Fri, 22 Jun 4460306 20:59:12 +},
	Title = {{A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions}},
	Url = {http://dx.doi.org/10.2168/LMCS-8(1:18)2012},
	Volume = {8},
	Year = {2012},
	Bdsk-Url-1 = {http://dx.doi.org/10.2168/LMCS-8(1:18)2012}}

@article{BoveKraussSozeau2011,
	Author = {Ana Bove and Alexander Krauss and Matthieu Sozeau},
	Date-Added = {2015-02-19 00:49:38 +0000},
	Date-Modified = {2019-02-23 13:24:09 +0100},
	Doi = {10.1017/S0960129514000115},
	Issn = {1469-8072},
	Journal = {Mathematical Structures in Computer Science},
	Month = {2},
	Numpages = {51},
	Pages = {1--51},
	Title = {Partiality and recursion in interactive theorem provers -- an overview},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Partiality_and_Recursion_in_Interactive_Theorem_Provers_-_An_Overview.pdf},
	Volume = {FirstView},
	Year = {2015},
	Bdsk-Url-1 = {http://journals.cambridge.org/article_S0960129514000115},
	Bdsk-Url-2 = {http://dx.doi.org/10.1017/S0960129514000115},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Partiality_and_Recursion_in_Interactive_Theorem_Provers_-_An_Overview.pdf}}

@mastersthesis{haselwarter:hal-01114573,
	Author = {Haselwarter, Philipp},
	Date-Added = {2015-02-18 23:36:32 +0000},
	Date-Modified = {2015-02-18 23:36:32 +0000},
	Hal_Id = {hal-01114573},
	Hal_Version = {v1},
	Month = Sep,
	School = {{Universit{\'e} Paris 7}},
	Title = {{Towards a Proof-Irrelevant Calculus of Inductive Constructions}},
	Url = {https://hal.inria.fr/hal-01114573},
	Year = {2014},
	Bdsk-Url-1 = {https://hal.inria.fr/hal-01114573}}

@unpublished{assaf:ccexpl,
	Author = {Ali Assaf},
	Date-Added = {2015-02-03 16:32:21 +0000},
	Date-Modified = {2015-02-03 16:32:47 +0000},
	Month = {2014},
	Title = {{A calculus of constructions with explicit subtyping}}}

@unpublished{altenkirch:ctt,
	Author = {Thorsten Altenkirch and Ambrus Kaposi},
	Date-Added = {2015-02-03 14:50:08 +0000},
	Date-Modified = {2015-02-03 14:51:00 +0000},
	Month = {August},
	Note = {Draft},
	Title = {{A syntax for cubical type theory}},
	Year = {2014}}

@misc{licata:cubicaltt,
	Author = {Dan Licata and Guillaume Brunerie},
	Date-Added = {2015-02-03 14:47:22 +0000},
	Date-Modified = {2015-02-03 14:49:16 +0000},
	Howpublished = {{Talk at the Oxford Homotopy Type Theory Workshop}},
	Month = {November},
	Title = {{A Cubical Infinite-Dimensional Type Theory}},
	Url = {https://www.youtube.com/watch?v=lt8JgGRw7gg&list=UU7qaZ5pg0l0cDKb1y4yhHRQ},
	Year = {2014},
	Bdsk-Url-1 = {https://www.youtube.com/watch?v=lt8JgGRw7gg&list=UU7qaZ5pg0l0cDKb1y4yhHRQ}}

@inproceedings{DBLP-conf/itp/SozeauT14,
	Author = {Matthieu Sozeau and Nicolas Tabareau},
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/itp/SozeauT14},
	Booktitle = {Interactive Theorem Proving - 5th International Conference, {ITP} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
	Crossref = {DBLP:conf/itp/2014},
	Date-Added = {2015-01-18 18:29:24 +0000},
	Date-Modified = {2015-02-19 00:29:58 +0000},
	Doi = {10.1007/978-3-319-08970-6_32},
	Pages = {499--514},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_in_Coq.pdf},
	Timestamp = {Mon, 30 Jun 2014 12:30:02 +0200},
	Title = {{Universe Polymorphism in Coq}},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-319-08970-6_32}}

@misc{sozeau.Coq/dev/CoqPL15,
	Address = {Mumbai, India},
	Author = {Matthieu Sozeau},
	Date-Added = {2015-01-18 17:51:37 +0000},
	Date-Modified = {2015-01-18 17:52:23 +0000},
	Howpublished = {Talk given at the First CoqPL workshop},
	Month = {January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq-dev-talk-CoqPL-180115.pdf},
	Read = {Oui},
	Title = {{Coq dev talk}},
	Type = {slides},
	Year = {2015},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@article{MLTTpred,
	Author = {Per Martin-L{\"o}f},
	Date-Added = {2014-10-17 14:54:56 +0000},
	Date-Modified = {2014-10-17 14:56:55 +0000},
	Journal = {Logic Colloquium '73},
	Number = {80},
	Pages = {73--118},
	Title = {{An intuitionistic theory of types: predicative part}},
	Volume = {Studies in Logic and the Foundations of Mathematics},
	Year = {1975}}

@misc{sozeau.Coq/dev/Coq14,
	Address = {Vienna, Austria},
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:53:38 +0000},
	Date-Modified = {2014-07-29 15:54:36 +0000},
	Howpublished = {Talk given at the Sixth Coq Workshop},
	Keywords = {rewriting setoid typeclasses},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq-8.5-Coq6-180714.pdf},
	Read = {Oui},
	Title = {{Coq 8.5: What's New, What's Next?}},
	Type = {slides},
	Year = {2014},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/unif/UNIF14,
	Address = {Vienna, Austria},
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:50:01 +0000},
	Date-Modified = {2014-07-29 15:51:44 +0000},
	Howpublished = {Talk given at the UNIF workshop},
	Keywords = {rewriting setoid typeclasses},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Towards_A_Better_Behaved_Unification_Algorithm_for_Coq-UNIF14-130714.pdf},
	Read = {Oui},
	Title = {{Towards A Better Behaved Unification Algorithm for Coq}},
	Type = {slides},
	Year = {2014},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/rewrite/TYPES14,
	Address = {Paris, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:48:22 +0000},
	Date-Modified = {2014-07-29 15:49:33 +0000},
	Howpublished = {Talk given at TYPES'14},
	Keywords = {rewriting setoid typeclasses},
	Month = {May},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Proof-Relevant_Rewriting_Strategies-TYPES14-130514.pdf},
	Read = {Oui},
	Title = {{Proof-Relevant Rewriting Strategies}},
	Type = {slides},
	Year = {2014},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/rewrite/Coq14,
	Address = {Vienna, Austria},
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:46:54 +0000},
	Date-Modified = {2014-07-29 15:55:09 +0000},
	Howpublished = {Talk given at the Sixth Coq Workshop},
	Keywords = {rewriting setoid typeclasses},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Proof-Relevant_Rewriting_Strategies-Coq6-170714.pdf},
	Read = {Oui},
	Title = {{Proof-relevant rewriting strategies}},
	Type = {slides},
	Year = {2014},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/univs/ITP14talk,
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:40:40 +0000},
	Date-Modified = {2014-07-29 15:41:30 +0000},
	Howpublished = {Talk at ITP'14, Vienna, Austria},
	Keywords = {Coq Universes},
	Month = {July 16th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_in_Coq-ITP14-160714.pdf},
	Title = {{Universe Polymorphism in Coq}},
	Type = {slides},
	Year = {2014}}

@misc{sozeau.Coq/univs/AIM14,
	Author = {Matthieu Sozeau},
	Date-Added = {2014-07-29 15:33:15 +0000},
	Date-Modified = {2014-07-29 15:34:55 +0000},
	Howpublished = {Invited talk at the Agda Implementers Meeting, Paris, France},
	Keywords = {Coq Universes},
	Month = {May 27th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_Subtyping_and_Unification-AIM-270514.pdf},
	Title = {{Universe Polymorphism: Subtyping and Unification}},
	Type = {slides},
	Year = {2014}}

@inproceedings{DBLP:conf/tldi/AspertiG12,
	Author = {Andrea Asperti and Ferruccio Guidi},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLDI},
	Crossref = {DBLP:conf/tldi/2012},
	Date-Added = {2014-05-26 13:48:39 +0000},
	Date-Modified = {2014-05-26 13:48:39 +0000},
	Ee = {http://doi.acm.org/10.1145/2103786.2103797},
	Pages = {79-90},
	Title = {Type systems for dummies},
	Year = {2012}}

@proceedings{DBLP:conf/tldi/2012,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLDI},
	Date-Added = {2014-05-26 13:48:39 +0000},
	Date-Modified = {2014-05-26 13:48:39 +0000},
	Editor = {Benjamin C. Pierce},
	Ee = {http://dl.acm.org/citation.cfm?id=2103786},
	Isbn = {978-1-4503-1120-5},
	Publisher = {ACM},
	Title = {Proceedings of TLDI 2012: The Seventh ACM SIGPLAN Workshop on Types in Languages Design and Implementation, Philadelphia, PA, USA, Saturday, January 28, 2012},
	Year = {2012}}

@misc{sozeau.groupoidint/Deducteam,
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2014-04-24 11:24:28 +0000},
	Date-Modified = {2014-04-24 11:27:46 +0000},
	Howpublished = {Talk given at the Deducteam seminar, Paris},
	Language = {Anglais},
	Month = April,
	Title = {{Towards an Internalization of the Groupoid Model of Type Theory}},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Towards_an_Internalization_of_the_Groupoid_Model_of_Type_Theory-Deducteam-250414.pdf},
	Year = {2014},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Bdsk-Url-3 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Towards_an_Internalization_of_the_Groupoid_Model_of_Type_Theory-Deducteam-250414.pdf}}

@article{2013arXiv1303.0584A,
	Adsnote = {Provided by the SAO/NASA Astrophysics Data System},
	Adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1303.0584A},
	Archiveprefix = {arXiv},
	Author = {{Ahrens}, B. and {Kapulkin}, C. and {Shulman}, M.},
	Date-Added = {2014-02-11 15:09:34 +0000},
	Date-Modified = {2014-02-11 15:13:46 +0000},
	Eprint = {1303.0584},
	Journal = {ArXiv e-prints},
	Keywords = {Mathematics - Category Theory, Mathematics - Logic, 18A15},
	Month = mar,
	Primaryclass = {math.CT},
	Title = {{Univalent categories and the Rezk completion}},
	Url = {http://arxiv.org/abs/1303.0584},
	Year = 2013,
	Bdsk-Url-1 = {http://arxiv.org/abs/1303.0584}}

@unpublished{sozeau.groupoidint,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2014-02-10 14:36:15 +0000},
	Date-Modified = {2014-04-24 11:27:28 +0000},
	Language = {Anglais},
	Month = Feb,
	Note = {Under revision},
	Title = {{Towards an Internalization of the Groupoid Model of Type Theory}},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf},
	Year = {2014},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/groupoidint.pdf}}

@phdthesis{garillot:pastel-00649586,
	Abstract = {{Cette th{\`e}se pr{\'e}sente des avanc{\'e}es dans l'utilisation des Structures Canoniques, un m{\'e}canisme du langage de programmation de l'assistant de preuve Coq, {\'e}quivalent {\`a} la notion de classes de types. Elle fournit un nouveau mod{\`e}le pour le d{\'e}veloppement de hi{\'e}rarchies math{\'e}matiques {\`a} l'aide d'enregistrements d{\'e}pendants, et, en guise d'illustration, fournit une reformulation de la preuve formelle de correction du cryptosyst{\`e}me RSA, offrant des m{\'e}thodes de raisonnement alg{\'e}brique ainsi que la repr{\'e}sentation en th{\'e}orie des types des notions math{\'e}matiques n{\'e}cessaires (incluant les groupes cycliques, les groupes d'automorphisme, les isomorphismes de groupe). Nous produisons une extension du m{\'e}canisme d'inf{\'e}rence de Structures Canoniques {\`a} l'aide de types fant{\^o}mes, et l'appliquons au traitement de fonctions partielles. Ensuite, nous consid{\'e}rons un traitement g{\'e}n{\'e}rique de plusieurs formes de d{\'e}finitions de sous-groupes rencontr{\'e}es au long de la preuve du th{\'e}or{\`e}me de Feit-Thomspon, une large librairie d'alg{\`e}bre formelle d{\'e}velopp{\'e}e au sein de l'{\'e}quipe Mathematical Components au laboratoire commun MSR-INRIA. Nous montrons qu'un traitement unifi{\'e} de ces 16 sous-groupes nous permet de raccourcir la preuve de leur propri{\'e}t{\'e}s {\'e}l{\'e}mentaires, et d'obtenir des d{\'e}finitions offrant une meilleure compositionnalit{\'e}. Nous formalisons une correspondance entre l'{\'e}tude de ces fonctorielles, et des propri{\'e}t{\'e} de th{\'e}orie des groupes usuelles, telles que repr{\'e}sent{\'e}es par la classe des groupes qui les v{\'e}rifie. Nous concluons en explorant les possibilit{\'e}s d'analyse de la fonctorialit{\'e} de ces d{\'e}finitions par l'inspection de leur type, et sugg{\'e}rons une voie d'approche vers l'obtention d'instances d'un r{\'e}sultat de param{\'e}tricit{\'e} en Coq.}},
	Affiliation = {Microsoft Research - Inria Joint Centre - MSR - INRIA},
	Author = {Garillot, Fran{\c c}ois},
	Date-Added = {2014-02-10 13:57:19 +0000},
	Date-Modified = {2014-02-10 13:59:38 +0000},
	Hal_Id = {pastel-00649586},
	Keywords = {th{\'e}orie de la preuve, th{\'e}orie des types, programmation g{\'e}n{\'e}rique, classes de types, composants math{\'e}matiques, langages de programmation, assistants de preuve, Coq},
	Language = {Anglais},
	Month = Dec,
	Pdf = {http://pastel.archives-ouvertes.fr/pastel-00649586/PDF/manuscript.pdf},
	School = {Ecole Polytechnique X},
	Title = {{Generic Proof Tools and Finite Group Theory}},
	Url = {http://pastel.archives-ouvertes.fr/pastel-00649586},
	Year = {2011},
	Bdsk-Url-1 = {http://pastel.archives-ouvertes.fr/pastel-00649586}}

@incollection{dybjer:internaltt,
	Author = {Dybjer, Peter},
	Booktitle = {Types for Proofs and Programs},
	Date-Added = {2014-02-10 13:32:10 +0000},
	Date-Modified = {2014-02-10 14:10:19 +0000},
	Doi = {10.1007/3-540-61780-9_66},
	Editor = {Berardi, Stefano and Coppo, Mario},
	Isbn = {978-3-540-61780-8},
	Pages = {120-134},
	Publisher = {Springer Berlin Heidelberg},
	Series = {LNCS},
	Title = {Internal type theory},
	Url = {http://dx.doi.org/10.1007/3-540-61780-9_66},
	Volume = {1158},
	Year = {1996},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/3-540-61780-9_66}}

@article{coquand:cubical,
	Author = {Marc Bezem and Thierry Coquand and Simon Huber},
	Date-Added = {2014-02-10 13:24:43 +0000},
	Date-Modified = {2014-02-10 14:19:03 +0000},
	Month = {December},
	Title = {A Model of Type Theory in Cubical Sets},
	Url = {http://www.cse.chalmers.se/~coquand/mod1.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http:%5C%5Cuf-ias-2012.wikispaces.com/file/view/semi.pdf},
	Bdsk-Url-2 = {http://www.cse.chalmers.se/~coquand/mod1.pdf}}

@article{DBLP:journals/aml/Palmgren12,
	Author = {Erik Palmgren},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2014-02-10 12:05:03 +0000},
	Date-Modified = {2014-02-10 12:06:06 +0000},
	Ee = {http://dx.doi.org/10.1007/s00153-011-0252-9},
	Journal = {Arch. Math. Log.},
	Number = {1-2},
	Pages = {35-47},
	Title = {Proof-relevance of families of setoids and identity in type theory},
	Url = {http://www2.math.uu.se/~palmgren/pfsitt-rev.pdf},
	Volume = {51},
	Year = {2012},
	Bdsk-Url-1 = {http://www2.math.uu.se/~palmgren/pfsitt-rev.pdf}}

@inproceedings{DBLP:bibsonomy_cupart,
	Author = {Martin Hofmann},
	Booktitle = {Semantics and Logics of Computation},
	Date-Added = {2014-01-29 13:56:50 +0000},
	Date-Modified = {2014-10-17 17:43:47 +0000},
	Pages = {241-298},
	Title = {Syntax and Semantics of Dependent Types},
	Url = {http://www.tcs.ifi.lmu.de/mitarbeiter/martin-hofmann/pdfs/syntaxandsemanticsof-dependenttypes.pdf},
	Year = {1997},
	Bdsk-Url-1 = {http://www.tcs.ifi.lmu.de/mitarbeiter/martin-hofmann/pdfs/syntaxandsemanticsof-dependenttypes.pdf}}

@url{HoTT/HoTT,
	Author = {{The HoTT Development Team}},
	Date-Added = {2014-01-29 12:24:47 +0000},
	Date-Modified = {2014-01-29 12:29:32 +0000},
	Title = {{Homotopy Type Theory in Coq}},
	Url = {http://github.com/HoTT/HoTT},
	Bdsk-Url-1 = {http://github.com/HoTT/HoTT}}

@inproceedings{sozeau.Coq/univs/ITP14,
	Abstract = {
Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for 
specifying with abstract structures by quantification on contexts. However, 
both systems are limited by second-class implementations of these constructs,
and these limitations are only overcomed by ad-hoc extensions to 
the respective systems. We propose an embedding of type classes into a 
dependent type theory that is first-class and supports some of the most 
popular extensions right away. The implementation is correspondingly 
cheap, general and very well integrated inside the system, as we have 
experimented in Coq. We show how it can be used to help structured 
programming and proving by way of examples.},
	Address = {Vienna, Austria},
	Author = {Matthieu Sozeau and Nicolas Tabareau},
	Booktitle = {ITP'14},
	Date-Added = {2014-01-29 12:20:18 +0000},
	Date-Modified = {2014-04-18 08:40:09 +0000},
	Keywords = {Universes},
	Note = {To appear},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_in_Coq.pdf},
	Read = {Oui},
	Title = {{Universe Polymorphism in Coq}},
	Year = {2014}}

@manual{coq:refman:8.4,
	Author = {{The {Coq} development team}},
	Date-Added = {2014-01-29 12:15:56 +0000},
	Date-Modified = {2014-01-29 12:17:45 +0000},
	Organization = {Inria},
	Publisher = {Inria πr²},
	Read = {Oui},
	Title = {Coq 8.4 Reference Manual},
	Url = {http://coq.inria.fr/distrib/V8.4pl3/refman/},
	Year = {2012},
	Bdsk-Url-1 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/Reference-Manual027.html},
	Bdsk-Url-2 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/},
	Bdsk-Url-3 = {http://coq.inria.fr/distrib/V8.4pl3/refman/}}

@article{tierney1972sheaf,
	Author = {Tierney, M.},
	Date-Added = {2014-01-29 12:06:03 +0000},
	Date-Modified = {2014-01-29 12:06:03 +0000},
	Journal = {LNM 274},
	Pages = {13--42},
	Publisher = {Springer},
	Title = {{Sheaf theory and the continuum hypothesis}},
	Year = {1972}}

@inproceedings{pottier-fork,
	Author = {Pottier, F.},
	Booktitle = {Proceedings of the 38th {ACM} Symposium on Principles of Programming Languages},
	Date-Added = {2014-01-29 12:05:50 +0000},
	Date-Modified = {2014-01-29 12:05:50 +0000},
	Title = {A typed store-passing translation for general references},
	Year = {2011}}

@article{appel2001indexed,
	Author = {Appel, A.W. and McAllester, D.},
	Date-Added = {2014-01-29 12:05:41 +0000},
	Date-Modified = {2014-01-29 12:05:41 +0000},
	Issn = {0164-0925},
	Journal = {ACM Transactions on Programming Languages and Systems (TOPLAS)},
	Number = {5},
	Pages = {657--683},
	Publisher = {ACM},
	Title = {{An indexed model of recursive types for foundational proof-carrying code}},
	Volume = {23},
	Year = {2001}}

@inproceedings{plotkin1993logic,
	Author = {Plotkin, G. and Abadi, M.},
	Booktitle = {Typed Lambda Calculi and Applications},
	Date-Added = {2014-01-29 12:05:09 +0000},
	Date-Modified = {2014-01-29 12:05:09 +0000},
	Title = {{A logic for parametric polymorphism}},
	Year = {1993}}

@book{cohen1966,
	Author = {Cohen, P.J. and Davis, M.},
	Date-Added = {2014-01-29 12:04:54 +0000},
	Date-Modified = {2014-01-29 12:04:54 +0000},
	Publisher = {WA Benjamin New York},
	Title = {{Set theory and the continuum hypothesis}},
	Year = {1966}}

@article{streicher-forcing,
	Author = {Streicher, T.},
	Date-Added = {2014-01-29 12:04:33 +0000},
	Date-Modified = {2014-01-29 12:04:33 +0000},
	Journal = {S{\'e}minaire R{\'e}alisabilit{\'e} {\`a} Chamb{\'e}ry},
	Title = {{Forcing within Classical Realizability}},
	Year = {2010}}

@article{krivine-realizability,
	Author = {Krivine, JL},
	Date-Added = {2014-01-29 12:04:16 +0000},
	Date-Modified = {2014-01-29 12:04:16 +0000},
	Journal = {Panoramas et syntheses, Soci{\'e}t{\'e} Math{\'e}matique de France},
	Title = {{Realizability in classical logic. Course notes of a series of lectures given in the University of Marseille, may 2004 (last revision: july 2005)}}}

@unpublished{krivine:forcing,
	Author = {{K}rivine, {J}ean-{L}ouis},
	Date-Added = {2014-01-29 12:04:16 +0000},
	Date-Modified = {2014-01-29 12:04:16 +0000},
	Hal_Id = {hal-00321410},
	Title = {{S}tructures de r{\'e}alisabilit{\'e}, {RAM} et ultrafiltre sur {N}},
	Url = {http://hal.archives-ouvertes.fr/hal-00321410/PDF/Structures_de_realisabilite_2_HAL.pdf},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00321410/PDF/Structures_de_realisabilite_2_HAL.pdf}}

@incollection{PittsAM:operfl,
	Author = {A.~M.~Pitts and I.~D.~B.~Stark},
	Booktitle = {Higher Order Operational Techniques in Semantics},
	Date-Added = {2014-01-29 12:04:06 +0000},
	Date-Modified = {2014-01-29 12:04:06 +0000},
	Hidecomment = {PAGES={227--273}},
	Publisher = {CUP},
	Title = {Operational Reasoning for Functions with Local State},
	Year = 1998}

@inproceedings{icfp2010,
	Author = {Dreyer, D. and Neis, G. and Birkedal, L.},
	Booktitle = {Proceedings of the 15th ACM International Conference on Functional programming},
	Date-Added = {2014-01-29 12:03:51 +0000},
	Date-Modified = {2014-01-29 12:03:51 +0000},
	Title = {{The impact of higher-order state and control effects on local relational reasoning}},
	Year = {2010}}

@inproceedings{ladr,
	Author = {Dreyer, D. and Neis, G. and Rossberg, A. and Birkedal, L.},
	Booktitle = {Proceedings of the 38th ACM Symposium on Principles of Programming Languages},
	Date-Added = {2014-01-29 12:03:42 +0000},
	Date-Modified = {2014-01-29 12:03:42 +0000},
	Title = {{A relational modal logic for higher-order stateful ADTs}},
	Year = {2010}}

@unpublished{topostree,
	Author = {Birkedal, L. and M{\o}gelberg, R. and Schwinghammer, J. and St{\o}vring, K.},
	Date-Added = {2014-01-29 12:03:30 +0000},
	Date-Modified = {2014-01-29 12:03:30 +0000},
	Title = {First steps in synthetic guarded domain theory: step-indexing in the topos of trees},
	Year = {2011}}

@inproceedings{popl2011,
	Author = {Birkedal, L. and Reus, B. and Schwinghammer, J. and St{\o}vring, K. and Thamsborg, J. and Yang, H.},
	Booktitle = {Proceedings of the 38th ACM Symposium on Principles of Programming Languages},
	Date-Added = {2014-01-29 12:03:27 +0000},
	Date-Modified = {2014-01-29 12:03:27 +0000},
	Title = {{Step-indexed Kripke models over recursive worlds}},
	Year = {2011}}

@unpublished{jaber11,
	Author = {Jaber, G. and Tabareau, N.},
	Date-Added = {2014-01-29 12:03:10 +0000},
	Date-Modified = {2014-01-29 12:03:10 +0000},
	Note = {\texttt{http://tabareau.fr/FLR}},
	Title = {Decomposing Logical Relations with Forcing (technical appendix)},
	Year = 2011}

@article{coquand2010note,
	Author = {Coquand, T. and Jaber, G.},
	Date-Added = {2014-01-29 12:03:08 +0000},
	Date-Modified = {2014-01-29 12:03:08 +0000},
	Journal = {Fundamenta Informaticae},
	Number = {1},
	Pages = {43--52},
	Publisher = {IOS Press},
	Title = {{A Note on Forcing and Type Theory}},
	Volume = {100},
	Year = {2010}}

@inproceedings{vmm,
	Author = {Appel, A.W. and Melli{\`e}s, P.-A. and Richards, C.D. and Vouillon, J.},
	Booktitle = {Proceedings of the 34th ACM Symposium on Principles of Programming Languages},
	Date-Added = {2014-01-29 12:02:52 +0000},
	Date-Modified = {2014-01-29 12:02:52 +0000},
	Title = {{A very modal model of a modern, major, general type system}},
	Year = {2007}}

@phdthesis{ahmed04,
	Address = {Princeton, NJ, USA},
	Author = {A.~Ahmed},
	Date-Added = {2014-01-29 12:02:26 +0000},
	Date-Modified = {2014-01-29 12:02:26 +0000},
	Order_No = {AAI3136691},
	School = {Princeton University},
	Title = {Semantics of types for mutable state},
	Year = {2004}}

@article{ahmed2006step,
	Author = {Ahmed, A.},
	Date-Added = {2014-01-29 12:02:26 +0000},
	Date-Modified = {2014-01-29 12:02:26 +0000},
	Journal = {Programming Languages and Systems},
	Pages = {69--83},
	Publisher = {Springer},
	Title = {{Step-indexed syntactic logical relations for recursive and quantified types}},
	Year = {2006}}

@inproceedings{amal:statedep,
	Author = {Ahmed, A.W. and Dreyer, D. and Rossberg, A.},
	Booktitle = {Proceedings of the 36th ACM Symposium on Principles of Programming Languages},
	Date-Added = {2014-01-29 12:02:26 +0000},
	Date-Modified = {2014-01-29 12:02:26 +0000},
	Title = {State-Dependent Representation Independence},
	Year = {2009}}

@inproceedings{lslr,
	Author = {Dreyer, D. and Ahmed, A. and Birkedal, L.},
	Booktitle = {Proceedings of the 24th Annual IEEE Symposium on Logic In Computer Science},
	Date-Added = {2014-01-29 12:02:26 +0000},
	Date-Modified = {2014-01-29 12:02:26 +0000},
	Title = {{Logical step-indexed logical relations}},
	Year = {2009}}

@incollection{groupoid-interp,
	Address = {New York},
	Author = {Hofmann, Martin and Streicher, Thomas},
	Booktitle = {Twenty-five years of constructive type theory ({V}enice, 1995)},
	Date-Added = {2014-01-29 12:01:09 +0000},
	Date-Modified = {2014-02-10 14:06:49 +0000},
	Mrclass = {03B15 (68N15 68Q55)},
	Mrnumber = {1686862},
	Pages = {83--111},
	Publisher = {Oxford Univ. Press},
	Series = {Oxford Logic Guides},
	Title = {{The Groupoid Interpretation of Type Theory}},
	Url = {http://www.tcs.informatik.uni-muenchen.de/lehre/SS97/types-vl/venedig.ps},
	Volume = {36},
	Year = {1998},
	Bdsk-Url-1 = {http://www.tcs.informatik.uni-muenchen.de/lehre/SS97/types-vl/venedig.ps}}

@unpublished{coq_unival_axiom,
	Author = {Bauer, Andrej and LeFanu Lumsdaine, Peter},
	Date-Added = {2014-01-29 11:57:55 +0000},
	Date-Modified = {2014-02-10 12:13:51 +0000},
	Note = {{}},
	Title = {{A Coq proof that Univalence Axioms implies Functional Extensionality}},
	Url = {http://ncatlab.org/nlab/files/BauerLumsdaineUnivalence.pdf},
	Year = 2011,
	Bdsk-Url-1 = {http://ncatlab.org/nlab/files/BauerLumsdaineUnivalence.pdf}}

@inproceedings{DBLP:conf/popl/LicataH12,
	Author = {Daniel R. Licata and Robert Harper},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Crossref = {DBLP:conf/popl/2012},
	Date-Added = {2014-01-29 11:57:42 +0000},
	Date-Modified = {2014-01-29 11:57:42 +0000},
	Ee = {http://doi.acm.org/10.1145/2103656.2103697},
	Pages = {337-348},
	Title = {{Canonicity for 2-dimensional type theory}},
	Year = {2012}}

@inproceedings{DBLP:conf/csl/KellerL12,
	Author = {Chantal Keller and Marc Lasson},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/2012},
	Date-Added = {2014-01-29 11:57:17 +0000},
	Date-Modified = {2014-01-29 11:57:17 +0000},
	Ee = {http://dx.doi.org/10.4230/LIPIcs.CSL.2012.381},
	Pages = {381-395},
	Title = {{Parametricity in an Impredicative Sort}},
	Year = {2012}}

@article{barras:_gener_takeut_gandy_inter,
	Author = {Bruno Barras and Thierry Coquand and Simon Huber},
	Date-Added = {2014-01-29 11:56:17 +0000},
	Date-Modified = {2014-02-10 13:16:47 +0000},
	Title = {A Generalization of Takeuti-Gandy Interpretation},
	Url = {http://uf-ias-2012.wikispaces.com/file/view/semi.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http:%5C%5Cuf-ias-2012.wikispaces.com/file/view/semi.pdf},
	Bdsk-Url-2 = {http://uf-ias-2012.wikispaces.com/file/view/semi.pdf}}

@article{cheng2012weak,
	Author = {Cheng, Eugenia and Leinster, Tom},
	Date-Added = {2014-01-29 11:55:50 +0000},
	Date-Modified = {2014-01-29 11:55:50 +0000},
	Title = {Weak $\omega$-categories via terminal coalgebras},
	Url = {http://arxiv.org/abs/1212.5853},
	Year = {2012},
	Bdsk-Url-1 = {http://arxiv.org/abs/1212.5853}}

@incollection{krauss:Edberg,
	Author = {Kraus, Nicolai and Escard{\'o}, Mart{\'\i}n and Coquand, Thierry and Altenkirch, Thorsten},
	Booktitle = {Typed Lambda Calculi and Applications},
	Date-Added = {2014-01-28 07:23:16 +0000},
	Date-Modified = {2014-01-28 07:23:16 +0000},
	Doi = {10.1007/978-3-642-38946-7_14},
	Editor = {Hasegawa, Masahito},
	Isbn = {978-3-642-38945-0},
	Pages = {173-188},
	Publisher = {Springer Berlin Heidelberg},
	Series = {Lecture Notes in Computer Science},
	Title = {Generalizations of Hedberg's Theorem},
	Url = {http://dx.doi.org/10.1007/978-3-642-38946-7_14},
	Volume = {7941},
	Year = {2013},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-38946-7_14}}

@misc{sozeau.Coq/POPL14,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS},
	Author = {Matthieu Sozeau},
	Date-Added = {2014-01-23 22:43:14 +0000},
	Date-Modified = {2014-01-23 22:50:45 +0000},
	Howpublished = {SIGPLAN Programming Language Software Award 2013 talk, at POPL'14, San Diego},
	Language = {Anglais},
	Month = {January 23rd},
	Title = {{Coq -- Recent History}},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_-_Recent_History-230114-POPL14.pdf},
	Year = {2014},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_-_Recent_History-230114-POPL14.pdf}}

@article{DBLP:journals/corr/abs-1111-0123,
	Author = {Gyesik Lee and Benjamin Werner},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2014-01-16 07:18:11 +0000},
	Date-Modified = {2014-01-16 07:18:11 +0000},
	Ee = {http://dx.doi.org/10.2168/LMCS-7(4:5)2011},
	Journal = {Logical Methods in Computer Science},
	Number = {4},
	Title = {Proof-irrelevant model of CC with predicative induction and judgmental equality},
	Volume = {7},
	Year = {2011}}

@article{brackets,
	Added-At = {2010-08-25T08:47:38.000+0200},
	Author = {Awodey, Steven and Bauer, Andrej},
	Bibsource = {{DBLP, http://dblp.uni-trier.de}},
	Biburl = {http://www.bibsonomy.org/bibtex/218684c0604e5579fb5bf11e9a19d7185/miguel.pagano},
	Date-Added = {2014-01-16 07:16:06 +0000},
	Date-Modified = {2014-01-16 07:16:06 +0000},
	Ee = {{http://dx.doi.org/10.1093/logcom/14.4.447}},
	Interhash = {bfb43fd48c29ea65435ed57f71627217},
	Intrahash = {18684c0604e5579fb5bf11e9a19d7185},
	Journal = {{J. Log. Comput.}},
	Keywords = {imported},
	Number = {{4}},
	Pages = {447-471},
	Printed = {{TT}},
	Timestamp = {2010-08-25T08:47:38.000+0200},
	Title = {{Propositions as [Types]}},
	Volume = {{14}},
	Year = {{2004}}}

@article{abelScherer:types10,
	Author = {Andreas Abel and Gabriel Scherer},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2014-01-15 13:53:35 +0000},
	Date-Modified = {2014-01-15 13:54:13 +0000},
	Ee = {http://dx.doi.org/10.2168/LMCS-8(1:29)2012},
	Journal = lmcs,
	Note = {TYPES'10 special issue.},
	Number = 1,
	Pages = {1--36},
	Title = {{On Irrelevance and Algorithmic Equality in Predicative Type Theory}},
	Volume = 8,
	Year = 2012}

@article{DBLP:journals/corr/HerbelinS13,
	Author = {Hugo Herbelin and Arnaud Spiwack},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2014-01-15 13:52:24 +0000},
	Date-Modified = {2014-01-15 13:52:24 +0000},
	Ee = {http://arxiv.org/abs/1309.5767},
	Journal = {CoRR},
	Title = {The Rooster and the Syntactic Bracket},
	Volume = {abs/1309.5767},
	Year = {2013}}

@misc{sozeau.Coq/univs/coqwg13,
	Author = {Matthieu Sozeau},
	Date-Added = {2013-11-29 11:04:21 +0000},
	Date-Modified = {2015-02-19 00:37:47 +0000},
	Howpublished = {Talk given at the Coq Working Group, Paris, France},
	Keywords = {Coq Universes},
	Month = {November 26th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_and_Fast_Projections-CoqWG-261113.pdf},
	Title = {{Universe Polymorphism and Fast Projections}},
	Type = {slides},
	Year = {2013}}

@misc{sozeau.Coq/univs/typex13,
	Author = {Matthieu Sozeau},
	Date-Added = {2013-12-17 12:09:35 +0000},
	Date-Modified = {2013-12-17 12:11:05 +0000},
	Howpublished = {Talk given at the Typex Meeting, Paris},
	Keywords = {Coq Universes},
	Month = {December 17th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_Subtyping_and_Unification-TYPEX-171213.pdf},
	Read = {Oui},
	Title = {{Universe Polymorphism: Subtyping and Unification}},
	Type = {slides},
	Year = {2013}}

@inbook{chan:arith,
	Author = {Tat-Hung Chan},
	Chapter = {Appendix D},
	Crossref = {DBLP:books/sp/ConstableJE82},
	Date-Added = {2013-07-08 10:05:48 +0000},
	Date-Modified = {2013-07-08 10:07:53 +0000},
	Pages = {227--264},
	Title = {{An Algorithm For Checking PL/CV Arithmetic Inferences}}}

@book{DBLP:books/sp/ConstableJE82,
	Author = {Robert L. Constable and Scott Johnson and C. D. Eichenlaub},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2013-07-08 10:05:40 +0000},
	Date-Modified = {2014-01-30 06:28:09 +0000},
	Ee = {http://dx.doi.org/10.1007/3-540-11492-0},
	Isbn = {3-540-11492-0},
	Publisher = {Springer},
	Series = {LNCS},
	Title = {An Introduction to the PL/CV2 Programming Logic},
	Volume = {135},
	Year = {1982}}

@inproceedings{DBLP:conf/itp/BengtsonJB12,
	Author = {Jesper Bengtson and Jonas Braband Jensen and Lars Birkedal},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ITP},
	Crossref = {DBLP:conf/itp/2012},
	Date-Added = {2013-10-18 14:39:23 +0000},
	Date-Modified = {2013-10-18 14:39:23 +0000},
	Ee = {http://dx.doi.org/10.1007/978-3-642-32347-8_21},
	Pages = {315-331},
	Title = {Charge! - A Framework for Higher-Order Separation Logic in Coq},
	Year = {2012}}

@proceedings{DBLP:conf/itp/2012,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ITP},
	Date-Added = {2013-10-18 14:39:23 +0000},
	Date-Modified = {2013-10-18 14:39:23 +0000},
	Editor = {Lennart Beringer and Amy P. Felty},
	Ee = {http://dx.doi.org/10.1007/978-3-642-32347-8},
	Isbn = {978-3-642-32346-1},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings},
	Volume = {7406},
	Year = {2012}}

@book{hottbook,
	Address = {Institute for Advanced Study},
	Author = {{The Univalent Foundations Program}},
	Date-Modified = {2014-01-30 06:29:17 +0000},
	Title = {Homotopy Type Theory: Univalent Foundations for Mathematics},
	Url = {http://homotopytypetheory.org/book},
	Year = 2013,
	Bdsk-Url-1 = {http://homotopytypetheory.org/book}}

@misc{sozeau.Coq/univs/types13,
	Author = {Matthieu Sozeau},
	Date-Added = {2013-04-26 15:22:11 +0000},
	Date-Modified = {2013-04-26 15:23:01 +0000},
	Howpublished = {Talk given at TYPES'13, Toulouse, France},
	Keywords = {Coq Universes},
	Month = {April 25th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_and_Inference_in_Coq-TYPES13-250413.pdf},
	Read = {Oui},
	Title = {{Universe Polymorphism and Inference in Coq}},
	Type = {slides},
	Year = {2013}}

@phdthesis{Girard:1972fk,
	Author = {J.-Y. Girard},
	Date-Added = {2013-03-31 20:13:48 +0000},
	Date-Modified = {2013-03-31 20:13:48 +0000},
	School = {Universit\'e Paris~7},
	Title = {Interpr\'etation fonctionnelle et \'elimination des coupures de l'arithm\'etique d'ordre sup\'erieur},
	Year = {1972}}

@inproceedings{Abel:2011fk,
	Author = {Andreas Abel and Brigitte Pientka},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Crossref = {DBLP:conf/tlca/2011},
	Date-Added = {2013-03-19 12:38:54 +0000},
	Date-Modified = {2013-03-19 12:38:54 +0000},
	Ee = {http://dx.doi.org/10.1007/978-3-642-21691-6_5},
	Pages = {10-26},
	Title = {Higher-Order Dynamic Pattern Unification for Dependent Types and Records},
	Year = {2011}}

@misc{sozeau.UnivalenceForFree-GTTypes,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Matthieu Sozeau},
	Date-Added = {2013-03-14 15:47:04 +0000},
	Date-Modified = {2014-01-16 10:19:48 +0000},
	Howpublished = {Talk given at the Types and Realizability Working Group, Paris},
	Language = {Anglais},
	Month = march,
	Title = {{Univalence for free}},
	Type = {slides},
	Url = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Univalence_for_Free-GTTypes-130313.pdf},
	Year = {2013},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589},
	Bdsk-Url-2 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Univalence_for_Free-GTTypes-130313.pdf}}

@unpublished{Sozeau:2013fk,
	Abstract = {{We present an internalization of the 2-groupoid interpretation of the calculus of construction that allows to realize the univalence axiom, proof irrelevance and reasoning modulo. As an example, we show that in our setting, the type of Church integers is equal to the inductive type of natural numbers.}},
	Affiliation = {PI.R2 - INRIA Paris - Rocquencourt , Preuves, Programmes et Syst{\`e}mes - PPS , ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA},
	Author = {Sozeau, Matthieu and Tabareau, Nicolas},
	Date-Added = {2013-02-20 10:44:17 +0000},
	Date-Modified = {2013-02-20 10:44:17 +0000},
	Hal_Id = {hal-00786589},
	Language = {Anglais},
	Month = Feb,
	Pdf = {http://hal.archives-ouvertes.fr/hal-00786589/PDF/main.pdf},
	Title = {{Univalence for free}},
	Url = {http://hal.archives-ouvertes.fr/hal-00786589},
	Year = {2013},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00786589}}

@misc{sozeau.Coq/classes/MPRI13,
	Author = {Matthieu Sozeau},
	Date-Added = {2013-02-14 10:29:58 +0000},
	Date-Modified = {2013-02-14 10:40:38 +0000},
	Keywords = {type classes coq},
	Month = {February},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/teaching/Classes/Modular-MPRI13.pdf},
	Read = {Oui},
	Title = {{Modular and Generic development in Coq}},
	Type = {slides},
	Year = {2013},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inbook{Voevodsky:2011yq,
	Author = {Voevodsky, Vladimir},
	Booktitle = {Logic, Language, Information and Computation},
	Booktitle1 = {Lecture Notes in Computer Science},
	Date = {2011 %@ 978-3-642-20919-2},
	Date-Added = {2013-01-31 14:57:51 +0000},
	Date-Modified = {2013-10-18 14:27:14 +0000},
	Date1 = {2011-01-01},
	Pages = {4-4},
	Publisher = {Springer Berlin Heidelberg},
	Title = {Univalent Foundations of Mathematics},
	Type = {10.1007/978-3-642-20920-8_4},
	Url = {http://dx.doi.org/10.1007/978-3-642-20920-8_4},
	Volume = {6642},
	Year = {2011},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-20920-8_4}}

@article{Pelayo:2012uq,
	Abstract = {Recent discoveries have been made connecting abstract homotopy theory and the field of type theory from logic and theoretical computer science. This has given rise to a new field, which has been christened "homotopy type theory". In this direction, Vladimir Voevodsky observed that it is possible to model type theory using simplicial sets and that this model satisfies an additional property, called the Univalence Axiom, which has a number of striking consequences. He has subsequently advocated a program, which he calls univalent foundations, of developing mathematics in the setting of type theory with the Univalence Axiom and possibly other additional axioms motivated by the simplicial set model. Because type theory possesses good computational properties, this program can be carried out in a computer proof assistant. In this paper we give an introduction to homotopy type theory in Voevodsky's setting, paying attention to both theoretical and practical issues. In particular, the paper serves as an introduction to both the general ideas of homotopy type theory as well as to some of the concrete details of Voevodsky's work using the well-known proof assistant Coq. The paper is written for a general audience of mathematicians with basic knowledge of algebraic topology; the paper does not assume any preliminary knowledge of type theory, logic, or computer science.},
	Author = {{\'A}lvaro Pelayo and Michael A. Warren},
	Date-Added = {2013-01-31 14:52:42 +0000},
	Date-Modified = {2013-01-31 14:52:42 +0000},
	Eprint = {1210.5658},
	Month = {10},
	Title = {Homotopy type theory and Voevodsky's univalent foundations},
	Url = {http://arxiv.org/abs/1210.5658},
	Year = {2012},
	Bdsk-Url-1 = {http://arxiv.org/abs/1210.5658}}

@article{DBLP:journals/corr/abs-0812-0409,
	Author = {Peter LeFanu Lumsdaine},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2013-01-31 14:49:49 +0000},
	Date-Modified = {2013-01-31 14:49:49 +0000},
	Ee = {http://dx.doi.org/10.2168/LMCS-6(3:24)2010},
	Journal = {Logical Methods in Computer Science},
	Number = {3},
	Title = {Weak omega-categories from intensional type theory},
	Volume = {6},
	Year = {2010}}

@inproceedings{DBLP:conf/csl/AltenkirchR12,
	Author = {Thorsten Altenkirch and Ondrej Rypacek},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/2012},
	Date-Added = {2013-01-31 14:47:40 +0000},
	Date-Modified = {2013-01-31 14:47:40 +0000},
	Ee = {http://dx.doi.org/10.4230/LIPIcs.CSL.2012.16},
	Pages = {16-30},
	Title = {A Syntactical Approach to Weak omega-Groupoids},
	Year = {2012}}

@misc{sozeau12forcingplugin,
	Author = {Sozeau, Matthieu and Tabareau, Nicolas and Jaber, Guilhem},
	Date-Added = {2012-12-19 22:16:07 +0000},
	Date-Modified = {2012-12-22 00:44:46 +0000},
	Title = {{Forcing in Coq}},
	Url = {http://github.com/mattam82/Forcing},
	Year = {2012},
	Bdsk-Url-1 = {http://github.com/mattam82/Forcing}}

@article{chlipalappdt10,
	Author = {Adam Chlipala},
	Date-Added = {2012-12-19 21:55:58 +0000},
	Date-Modified = {2012-12-19 21:57:42 +0000},
	Journal = {Journal of Formalized Reasoning},
	Number = {2},
	Pages = {1--93},
	Title = {{An Introduction to Programming and Proving with Dependent Types in Coq}},
	Url = {http://jfr.unibo.it/article/view/1978},
	Volume = {3},
	Year = {2010},
	Bdsk-Url-1 = {http://jfr.unibo.it/article/view/1978}}

@misc{sozeau.Coq/classes/ias12b,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-12-10 18:58:00 +0000},
	Date-Modified = {2012-12-10 19:12:23 +0000},
	Howpublished = {Tutorial given at the IAS, Princeton, NJ},
	Keywords = {type classes coq},
	Month = {December 10th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-IAS-101212.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2012},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inproceedings{DBLP:conf/icfp/DevrieseP11,
	Author = {Dominique Devriese and Frank Piessens},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ICFP},
	Crossref = {DBLP:conf/icfp/2011},
	Date-Added = {2012-12-10 18:17:12 +0000},
	Date-Modified = {2012-12-10 18:17:12 +0000},
	Ee = {http://doi.acm.org/10.1145/2034773.2034796},
	Pages = {143-155},
	Title = {On the bright side of type classes: instance arguments in Agda},
	Year = {2011}}

@inproceedings{DBLP:conf/icfp/GonthierZND11,
	Author = {Georges Gonthier and Beta Ziliani and Aleksandar Nanevski and Derek Dreyer},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ICFP},
	Crossref = {DBLP:conf/icfp/2011},
	Date-Added = {2012-12-08 23:19:55 +0000},
	Date-Modified = {2012-12-21 07:02:19 +0000},
	Ee = {http://doi.acm.org/10.1145/2034773.2034798},
	Pages = {163-175},
	Title = {{How to make ad hoc proof automation less ad hoc}},
	Year = {2011}}

@misc{sozeau.Coq/univs/ias12,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-12-07 19:50:16 +0000},
	Date-Modified = {2012-12-07 19:52:12 +0000},
	Howpublished = {Talk given at the Institute for Advanced Study, Princeton, NJ},
	Keywords = {Coq Universes},
	Month = {December 5th},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Universe_Polymorphism_and_Inference_in_Coq-IAS-051212.pdf},
	Read = {Oui},
	Title = {{Universe Polymorphism and Inference in Coq}},
	Type = {slides},
	Year = {2012}}

@article{DBLP:journals/mscs/SpittersW11,
	Author = {Bas Spitters and Eelis van der Weegen},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2012-11-22 02:59:58 +0000},
	Date-Modified = {2012-11-22 02:59:58 +0000},
	Ee = {http://dx.doi.org/10.1017/S0960129511000119},
	Journal = {Mathematical Structures in Computer Science},
	Number = {4},
	Pages = {795-825},
	Title = {Type classes for mathematics in type theory},
	Volume = {21},
	Year = {2011}}

@article{DBLP:journals/jar/AspertiCTZ07,
	Author = {Andrea Asperti and Claudio Sacerdoti Coen and Enrico Tassi and Stefano Zacchiroli},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2012-11-22 02:58:41 +0000},
	Date-Modified = {2012-11-22 02:58:41 +0000},
	Ee = {http://dx.doi.org/10.1007/s10817-007-9070-5},
	Journal = {J. Autom. Reasoning},
	Number = {2},
	Pages = {109-139},
	Title = {User Interaction with the Matita Proof Assistant},
	Volume = {39},
	Year = {2007}}

@article{DBLP:journals/tcs/HarperP91,
	Author = {Robert Harper and Robert Pollack},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2012-11-22 02:56:35 +0000},
	Date-Modified = {2012-11-22 02:56:35 +0000},
	Ee = {http://dx.doi.org/10.1016/0304-3975(90)90108-T},
	Journal = {Theor. Comput. Sci.},
	Number = {1},
	Pages = {107-136},
	Title = {Type Checking with Universes},
	Volume = {89},
	Year = {1991}}

@misc{sozeau.Coq/classes/Penn12,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-10-08 15:05:48 +0000},
	Date-Modified = {2012-10-08 15:06:45 +0000},
	Howpublished = {Lecture at the "Advanced Martial Arts in Coq" course at University of Pennsylvania},
	Keywords = {type classes coq},
	Month = {October},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-Penn-081012.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2012},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/classes/IAS12,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-10-08 15:04:57 +0000},
	Date-Modified = {2012-10-08 15:05:38 +0000},
	Howpublished = {Talk given at the IAS seminar in Princeton, NJ},
	Keywords = {type classes coq},
	Month = {October},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-IAS-031012.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2012},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/Equations/Tallinn12,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-10-08 14:52:15 +0000},
	Date-Modified = {2012-10-08 14:53:30 +0000},
	Howpublished = {Talk given at the Institute of Cybernetics, Tallinn, Estonia},
	Keywords = {dependent types pattern matching unification},
	Month = {May},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-Tallinn-310512.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Suite},
	Type = {slides},
	Year = {2012},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{CasteranSozeau-GentleIntro,
	Author = {Pierre Cast{\'e}ran and Matthieu Sozeau},
	Date-Added = {2012-10-08 03:26:25 +0000},
	Date-Modified = {2014-01-16 10:16:04 +0000},
	Keywords = {Type classes},
	Month = {May},
	Title = {{A Gentle Introduction to Type Classes and Rewriting in Coq}},
	Url = {http://www.labri.fr/perso/casteran/CoqArt/TypeClassesTut/typeclassestut.pdf},
	Year = {2012},
	Bdsk-Url-1 = {http://www.labri.fr/perso/casteran/CoqArt/TypeClassesTut/typeclassestut.pdf}}

@inproceedings{geneves-tphols04,
	Address = {Salt Lake City, Utah, United States},
	Author = {Pierre Genev\`es and Jean-Yves Vion-Dury},
	Booktitle = {TPHOLs '04: Emerging Trends Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics},
	Date-Added = {2012-09-26 15:58:36 +0000},
	Date-Modified = {2012-09-26 15:58:36 +0000},
	Location = {Park City, Utah, United States},
	Month = {August},
	Pages = {181-198},
	Publisher = {University Of Utah},
	Title = {{XPath} Formal Semantics and Beyond: A {Coq}-Based Approach},
	Year = {2004}}

@inproceedings{hal-00685150,
	Abstract = {{This paper presents an intuitionistic forcing translation for the Calculus of Constructions (CoC), a translation that corresponds to an internalization of the presheaf construction in CoC. Depending on the chosen set of forcing conditions, the resulting type system can be extended with extra logical principles. The translation is proven correct-in the sense that it preserves type checking-and has been implemented in Coq. As a case study, we show how the forcing translation on integers (which corresponds to the internalization of the topos of trees) allows us to define general inductive types in Coq, without the strict positivity condition. Using such general inductive types, we can construct a shallow embedding of the pure \lambda-calculus in Coq, without defining an axiom on the existence of an universal domain. We also build another forcing layer where we prove the negation of the continuum hypothesis.}},
	Address = {Dubrovnik, Croatie},
	Affiliation = {ASCOLA - INRIA - EMN , Laboratoire d'Informatique de Nantes Atlantique - LINA , PI.R2 - INRIA Paris - Rocquencourt},
	Audience = {internationale},
	Author = {Jaber, Guilhem and Tabareau, Nicolas and Sozeau, Matthieu},
	Booktitle = {{Proceedings of LICS'12}},
	Date-Added = {2012-05-19 17:11:27 +0200},
	Date-Modified = {2012-10-07 19:26:33 +0000},
	Hal_Id = {hal-00685150},
	Language = {Anglais},
	Month = Jun,
	Pdf = {http://hal.archives-ouvertes.fr/hal-00685150/PDF/forcing\_lics.pdf},
	Title = {{Extending Type Theory with Forcing}},
	Url = {http://hal.archives-ouvertes.fr/hal-00685150},
	Year = {2012},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/hal-00685150}}

@misc{sozeau.Coq/classes/JFLA12,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-02-08 01:41:37 +0100},
	Date-Modified = {2012-02-08 01:43:34 +0100},
	Howpublished = {Lecture notes for a course given at JFLA'12 in Carnac, France},
	Keywords = {type classes coq},
	Month = {February},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-JFLA-040212.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2012},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/classes/Kent11,
	Author = {Matthieu Sozeau},
	Date-Added = {2012-01-31 18:32:35 +0100},
	Date-Modified = {2012-01-31 18:33:16 +0100},
	Howpublished = {Talk given at the PLAS seminar in Canterbury - UK},
	Keywords = {type classes coq},
	Month = {November},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-Kent-071111.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2011},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/classes/IMDEA11,
	Author = {Matthieu Sozeau},
	Date-Added = {2011-10-24 11:46:41 +0200},
	Date-Modified = {2011-10-24 11:48:45 +0200},
	Howpublished = {Talk given at the IMDEA seminar in Madrid - Spain},
	Keywords = {type classes coq},
	Month = {October},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-IMDEA-201011.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2011},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/classes/PPS11,
	Author = {Matthieu Sozeau},
	Date-Added = {2011-10-24 11:41:07 +0200},
	Date-Modified = {2012-02-08 01:46:18 +0100},
	Howpublished = {Talk given at the PPS days in Trouville - France},
	Keywords = {type classes coq},
	Month = {September},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Coq_with_Classes-PPS-050911.pdf},
	Read = {Oui},
	Title = {{Coq with Classes}},
	Type = {slides},
	Year = {2011},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/Equations/Shonan11,
	Author = {Matthieu Sozeau},
	Date-Added = {2011-10-24 11:37:29 +0200},
	Date-Modified = {2011-10-24 11:39:39 +0200},
	Howpublished = {Talk given at the DTP meeting in Shonan - Japan},
	Keywords = {dependent types pattern matching unification},
	Month = {September},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-Shonan-150911.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Suite},
	Type = {slides},
	Year = {2011},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@article{3108,
	Author = {Jael Kriener and Andy King},
	Date-Added = {2011-09-26 13:11:11 +0200},
	Date-Modified = {2011-09-26 13:11:11 +0200},
	Journal = {Theory and Practice of Logic Programming},
	Keywords = {abstract interpretation, backwards analysis, boolean formulae, constraints, cut, determinacy inference, Prolog},
	Month = {July},
	Number = {4-5},
	Pages = {537-553},
	Publication_Type = {article},
	Publisher = {Cambridge University Press},
	Submission_Id = {18724_1304501874},
	Title = {Red{A}lert: {D}eterminacy {I}nference for {P}rolog},
	Url = {http://www.cs.kent.ac.uk/pubs/2011/3108},
	Volume = {11},
	Year = {2011},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.kent.ac.uk/pubs/2011/3108}}

@inproceedings{SPIWACK:2010:INRIA-00502500:1,
	Abstract = {{The Coq proof assistant is a large development, a lot of which happens to be more or less dependent on the type of tactics. To be able to perform tweaks in this type more easily in the future, we propose an API for building tactics which doesn't need to expose the type of tactics and yet has a fairly small amount of primitives. This API accompanies an entirely new implementation of the core tactic engine of Coq which aims at handling more gracefully existential variables (aka. metavariables) in proofs - like in more recent proof assistants like Matita and Agda2. We shall, then, leverage this newly acquired independence of the concrete type of tactics from the API to add backtracking abilities.}},
	Address = {Edinburgh, Royaume-Uni},
	Affiliation = {Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - TypiCal - INRIA Saclay - Ile de France - INRIA - CNRS : UMR - Polytechnique - X},
	Audience = {internationale},
	Author = {Spiwack, Arnaud},
	Booktitle = {{Proof Search in Type Theory}},
	Date-Added = {2011-09-26 12:57:27 +0200},
	Date-Modified = {2011-09-26 12:57:27 +0200},
	Hal_Id = {inria-00502500},
	Language = {Anglais},
	Pdf = {http://hal.inria.fr/inria-00502500/PDF/tactics.pdf},
	Title = {{An abstract type for constructing tactics in Coq}},
	Url = {http://hal.inria.fr/inria-00502500/en/},
	Year = {2010},
	Bdsk-Url-1 = {http://hal.inria.fr/inria-00502500/en/}}

@article{Coen:2007:TSS:1243520.1243826,
	Acmid = {1243826},
	Address = {Amsterdam, The Netherlands, The Netherlands},
	Author = {Coen, Claudio Sacerdoti and Tassi, Enrico and Zacchiroli, Stefano},
	Date-Added = {2011-09-26 12:52:51 +0200},
	Date-Modified = {2011-09-26 12:52:51 +0200},
	Doi = {10.1016/j.entcs.2006.09.026},
	Issn = {1571-0661},
	Issue = {2},
	Journal = {Electron. Notes Theor. Comput. Sci.},
	Keywords = {Interactive Theorem Proving, Small Step Semantics, Tacticals},
	Month = {May},
	Numpages = {18},
	Pages = {125--142},
	Publisher = {Elsevier Science Publishers B. V.},
	Title = {Tinycals: Step by Step Tacticals},
	Url = {http://dl.acm.org/citation.cfm?id=1243520.1243826},
	Volume = {174},
	Year = {2007},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=1243520.1243826},
	Bdsk-Url-2 = {http://dx.doi.org/10.1016/j.entcs.2006.09.026}}

@misc{sozeau.Coq/Equations/Chalmers11,
	Author = {Matthieu Sozeau},
	Date-Added = {2011-08-18 10:30:13 +0200},
	Date-Modified = {2011-08-18 10:31:24 +0200},
	Howpublished = {Talk given at University of Chalmers - Gothenburg},
	Keywords = {dependent types pattern matching unification},
	Month = {January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-Chalmers-190111.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Type = {slides},
	Year = {2011},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inproceedings{DBLP:conf/tphol/Courant02,
	Author = {Judica{\"e}l Courant},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2002},
	Date-Added = {2011-02-24 16:59:19 +0100},
	Date-Modified = {2011-02-24 16:59:43 +0100},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2410/24100115.htm},
	Pages = {115-130},
	Title = {{Explicit Universes for the Calculus of Constructions}},
	Year = {2002}}

@proceedings{DBLP:conf/tphol/2002,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2011-02-24 16:59:19 +0100},
	Date-Modified = {2014-01-30 06:28:47 +0000},
	Isbn = {3-540-44039-9},
	Publisher = {Springer},
	Series = {LNCS},
	Title = {Theorem Proving in Higher Order Logics, 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002, Proceedings},
	Volume = {2410},
	Year = {2002}}

@article{AspertiCompact,
	Author = {Andrea Asperti and Wilmer Ricciotti and Claudio Sacerdoti Coen and Enrico Tassi},
	Date-Added = {2011-02-24 16:56:48 +0100},
	Date-Modified = {2011-02-24 16:58:02 +0100},
	Journal = {Journal Sadhana},
	Pages = {71--144},
	Title = {A compact kernel for the calculus of inductive constructions},
	Volume = {34},
	Year = {2009}}

@article{HerbelinUniverses,
	Author = {Hugo Herbelin},
	Date-Added = {2011-02-24 16:51:56 +0100},
	Date-Modified = {2011-02-24 16:54:03 +0100},
	Note = {Manuscript},
	Title = {{Type Inference with Algebraic Universes in the Calculus of Inductive Constructions}},
	Url = {http://pauillac.inria.fr/~herbelin/publis/univalgcci.pdf},
	Year = {2005},
	Bdsk-Url-1 = {http://pauillac.inria.fr/~herbelin/publis/univalgcci.pdf}}

@inproceedings{tphols2000-Balaa,
	Author = {Antonia Balaa and Yves Bertot},
	Crossref = {tphols2000},
	Date-Added = {2011-01-18 10:48:47 +0100},
	Date-Modified = {2011-01-18 10:48:47 +0100},
	Pages = {1--16},
	Title = {Fix-point Equations for Well-Founded Recursion in Type Theory}}

@inproceedings{BerVKom08,
	Address = {New York, NY, USA},
	Author = {Yves Bertot and Vladimir Komendantsky},
	Booktitle = {PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming},
	Date-Added = {2011-01-18 10:48:05 +0100},
	Date-Modified = {2011-01-18 10:48:05 +0100},
	Doi = {http://doi.acm.org/10.1145/1389449.1389461},
	Isbn = {978-1-60558-117-0},
	Location = {Valencia, Spain},
	Pages = {89--96},
	Publisher = {ACM},
	Title = {Fixed point semantics and partial recursion in Coq},
	Url = {http://hal.inria.fr/inria-00190975/},
	X-Editorial-Board = {yes},
	X-International-Audience = {yes},
	X-Proceedings = {yes},
	Year = {2008},
	Bdsk-Url-1 = {http://hal.inria.fr/inria-00190975/},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1389449.1389461}}

@misc{sozeau.Coq/Equations/TYPES10,
	Author = {Matthieu Sozeau},
	Date-Added = {2010-10-18 16:02:31 +0200},
	Date-Modified = {2010-10-18 16:11:59 +0200},
	Howpublished = {Talk given at TYPES'10, Warsaw, Poland},
	Keywords = {dependent types pattern matching unification},
	Month = {October},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-TYPES10-151010.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Type = {slides},
	Year = {2010}}

@misc{sozeau.Coq/Equations/UPenn10,
	Author = {Matthieu Sozeau},
	Date-Added = {2010-10-14 12:26:42 +0200},
	Date-Modified = {2010-10-14 12:30:00 +0200},
	Howpublished = {Talk given at the University of Pennsylvania PLClub},
	Keywords = {dependent types pattern matching unification},
	Month = {September},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-UPenn-240910.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Type = {slides},
	Year = {2010},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/Equations/ITP10slides,
	Author = {Matthieu Sozeau},
	Date-Added = {2010-10-14 12:25:13 +0200},
	Date-Modified = {2010-10-18 16:12:29 +0200},
	Howpublished = {Talk given at ITP'10, Edinburgh, UK},
	Keywords = {dependent types pattern matching unification},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-ITP10-140710.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Type = {slides},
	Year = {2010},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/Elaborations/DTP10,
	Author = {Matthieu Sozeau},
	Date-Added = {2010-07-13 01:47:24 +0100},
	Date-Modified = {2010-07-13 01:50:36 +0100},
	Howpublished = {Invited Talk at DTP'10 - Edinburgh, UK},
	Keywords = {dependent types pattern matching unification},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Elaborations_in_Type_Theory-DTP10-100710.pdf},
	Read = {Oui},
	Title = {Elaborations in Type Theory},
	Type = {slides},
	Year = {2010},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@inproceedings{BartheGZ09,
	Author = {Gilles Barthe and Benjamin Gr\'egoire and Santiago Zanella},
	Booktitle = {36th symposium Principles of Programming Languages},
	Date-Added = {2010-02-18 14:02:30 -0500},
	Date-Modified = {2010-02-18 14:02:30 -0500},
	Month = jan,
	Publisher = {ACM Press},
	Title = {Formal Certification of Code-Based Cryptographic Proofs},
	Topic = {CRYPTO},
	Url = {http://www-sop.inria.fr/everest/personnel/Benjamin.Gregoire/Publi/popl09.pdf},
	Year = 2009,
	Bdsk-Url-1 = {http://www-sop.inria.fr/everest/personnel/Benjamin.Gregoire/Publi/popl09.pdf}}

@webpage{CertiCrypt,
	Date-Added = {2010-02-18 14:01:39 -0500},
	Date-Modified = {2010-02-18 14:01:47 -0500},
	Url = {http://www.msr-inria.inria.fr/projects/sec/certicrypt/index.html},
	Bdsk-Url-1 = {http://www.msr-inria.inria.fr/projects/sec/certicrypt/index.html}}

@inproceedings{1432087,
	Address = {Berlin, Heidelberg},
	Author = {Barthe, Gilles and Gr\'{e}goire, Benjamin and Riba, Colin},
	Booktitle = {CSL '08: Proceedings of the 22nd international workshop on Computer Science Logic},
	Date-Added = {2010-02-11 13:00:46 -0500},
	Date-Modified = {2010-02-11 13:00:46 -0500},
	Doi = {http://dx.doi.org/10.1007/978-3-540-87531-4_35},
	Isbn = {978-3-540-87530-7},
	Location = {Bertinoro, Italy},
	Pages = {493--507},
	Publisher = {Springer-Verlag},
	Title = {Type-Based Termination with Sized Products},
	Year = {2008},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-87531-4_35}}

@inproceedings{BartheGP06,
	Author = {Gilles Barthe and Benjamin Gr{\'e}goire and Fernando Pastawski},
	Booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings},
	Date-Added = {2010-02-04 01:02:40 -0500},
	Date-Modified = {2010-02-04 01:02:40 -0500},
	Pages = {257-271},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {CIC\^: Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions},
	Topic = {TYPETHEORY},
	Volume = {4246},
	Year = {2006}}

@inproceedings{BartheGR08,
	Author = {Gilles Barthe and Benjamin Gr\'egoire and Colin Riba},
	Booktitle = {17th EACSL Annual Conference on Computer Science Logic, 15th-19th September 2008, Bertinoro, Italy},
	Date-Added = {2010-02-04 00:24:51 -0500},
	Date-Modified = {2010-02-04 00:24:51 -0500},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Type-Based Termination with Sized Products},
	Topic = {TYPETHEORY},
	Year = {2008}}

@proceedings{DBLP:conf/ppdp/2008,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PPDP},
	Date-Added = {2010-02-04 00:00:07 -0500},
	Date-Modified = {2010-02-04 00:00:07 -0500},
	Editor = {Sergio Antoy and Elvira Albert},
	Isbn = {978-1-60558-117-0},
	Publisher = {ACM},
	Title = {Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain},
	Year = {2008}}

@inproceedings{DBLP:conf/types/BertotK08,
	Author = {Yves Bertot and Ekaterina Komendantskaya},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2008},
	Date-Added = {2010-02-03 23:59:08 -0500},
	Date-Modified = {2010-02-03 23:59:08 -0500},
	Ee = {http://dx.doi.org/10.1007/978-3-642-02444-3_14},
	Pages = {220-236},
	Title = {Using Structural Recursion for Corecursion},
	Year = {2008}}

@proceedings{DBLP:conf/types/2008,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2010-02-03 23:59:08 -0500},
	Date-Modified = {2010-02-03 23:59:08 -0500},
	Editor = {Stefano Berardi and Ferruccio Damiani and Ugo de'Liguoro},
	Ee = {http://dx.doi.org/10.1007/978-3-642-02444-3},
	Isbn = {978-3-642-02443-6},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers},
	Volume = {5497},
	Year = {2009}}

@webpage{ForMath,
	Author = {ForMath},
	Date-Added = {2010-02-03 11:57:20 -0500},
	Date-Modified = {2010-02-03 12:38:48 -0500},
	Title = {Formalization of Mathematics},
	Url = {http://www.formath.cs.ru.nl/},
	Bdsk-Url-1 = {http://www.formath.cs.ru.nl/}}

@inproceedings{DBLP:conf/tphol/GarillotGMR09,
	Author = {Fran\c{c}ois Garillot and Georges Gonthier and Assia Mahboubi and Laurence Rideau},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2009},
	Date-Added = {2010-02-03 11:52:24 -0500},
	Date-Modified = {2010-02-03 11:52:24 -0500},
	Ee = {http://dx.doi.org/10.1007/978-3-642-03359-9_23},
	Pages = {327-342},
	Title = {Packaging Mathematical Structures},
	Year = {2009}}

@phdthesis{tassi:phd,
	Author = {Enrico Tassi},
	Date-Added = {2010-02-02 11:54:16 -0500},
	Date-Modified = {2010-02-02 11:56:17 -0500},
	Month = {March},
	Pdf = {http://www.msr-inria.inria.fr/~gares/thesis.pdf},
	Read = {Oui},
	School = {University of Bologna},
	Title = {Interactive Theorem Provers: issues faced as a user and tackled as a developer},
	Url = {http://www.cs.unibo.it/pub/TR/UBLCS/ABSTRACTS/2008.bib?ncstrl.cabernet//BOLOGNA-UBLCS-2008-03},
	Year = {2008},
	Bdsk-Url-1 = {http://www.cs.unibo.it/pub/TR/UBLCS/ABSTRACTS/2008.bib?ncstrl.cabernet//BOLOGNA-UBLCS-2008-03}}

@article{Wilson:2009auto,
	Author = {Sean Wilson and Jacques Fleuriot and Alan Smaill},
	Date-Added = {2010-02-02 11:24:21 -0500},
	Date-Modified = {2010-02-02 11:26:51 -0500},
	Journal = {Special Issue of Fundamenta Informaticae on Dependently Typed Programming},
	Note = {To appear},
	Rating = {4},
	Read = {Oui},
	Title = {Automation for Dependently Typed Functional Programming},
	Url = {http://homepages.inf.ed.ac.uk/s0091720/Wilson2009AutomationForDependentlyTypedFunctionProgramming.pdf},
	Year = {2009},
	Bdsk-Url-1 = {http://homepages.inf.ed.ac.uk/s0091720/Wilson2009AutomationForDependentlyTypedFunctionProgramming.pdf}}

@webpage{GoNative,
	Date-Added = {2010-02-02 11:11:41 -0500},
	Date-Modified = {2010-02-02 11:13:25 -0500},
	Key = {GoNative},
	Title = {GoNative},
	Url = {http://sos.cse.lehigh.edu/gonative/},
	Bdsk-Url-1 = {http://sos.cse.lehigh.edu/gonative/}}

@inproceedings{chlipala:icfp09,
	Address = {New York, NY, USA},
	Author = {Chlipala, Adam and Malecha, Gregory and Morrisett, Greg and Shinnar, Avraham and Wisnesky, Ryan},
	Booktitle = {ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2010-02-01 16:22:26 -0500},
	Date-Modified = {2010-02-01 16:22:45 -0500},
	Doi = {http://doi.acm.org/10.1145/1596550.1596565},
	Isbn = {978-1-60558-332-7},
	Location = {Edinburgh, Scotland},
	Pages = {79--90},
	Publisher = {ACM},
	Title = {Effective interactive proofs for higher-order imperative programs},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1596565&type=mp4&coll=Portal&dl=ACM&CFID=74245116&CFTOKEN=67325694},
	Year = {2009},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1596565&type=mp4&coll=Portal&dl=ACM&CFID=74245116&CFTOKEN=67325694},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1596550.1596565}}

@article{DBLP:journals/mscs/AspertiGN09,
	Author = {Andrea Asperti and Herman Geuvers and Raja Natarajan},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2010-01-30 18:05:30 -0500},
	Date-Modified = {2010-01-30 18:05:30 -0500},
	Ee = {http://dx.doi.org/10.1017/S0960129509990041},
	Journal = {Mathematical Structures in Computer Science},
	Number = {5},
	Pages = {877-896},
	Title = {Social processes, program verification and all that},
	Volume = {19},
	Year = {2009}}

@inproceedings{DBLP:conf/sosp/KleinEHACDEEKNSTW09,
	Author = {Gerwin Klein and Kevin Elphinstone and Gernot Heiser and June Andronick and David Cock and Philip Derrin and Dhammika Elkaduwe and Kai Engelhardt and Rafal Kolanski and Michael Norrish and Thomas Sewell and Harvey Tuch and Simon Winwood},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {SOSP},
	Crossref = {DBLP:conf/sosp/2009},
	Date-Added = {2010-01-30 15:51:01 -0500},
	Date-Modified = {2010-01-30 15:51:01 -0500},
	Ee = {http://doi.acm.org/10.1145/1629575.1629596},
	Pages = {207-220},
	Title = {seL4: formal verification of an OS kernel},
	Year = {2009}}

@proceedings{DBLP:conf/sosp/2009,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {SOSP},
	Date-Added = {2010-01-30 15:51:01 -0500},
	Date-Modified = {2010-01-30 15:51:01 -0500},
	Editor = {Jeanna Neefe Matthews and Thomas E. Anderson},
	Isbn = {978-1-60558-752-3},
	Publisher = {ACM},
	Title = {Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, SOSP 2009, Big Sky, Montana, USA, October 11-14, 2009},
	Year = {2009}}

@misc{spitters:algclass,
	Author = {Bas Spitters and Eelis van der Weegen},
	Date-Added = {2010-01-29 13:59:35 -0500},
	Date-Modified = {2010-01-29 14:01:16 -0500},
	Howpublished = {Submitted},
	Keywords = {Type classes},
	Month = {January},
	Title = {Developing the algebraic hierarchy using type classes},
	Url = {http://www.xs4all.nl/~weegen/eelis/research/math-classes/},
	Year = {2010},
	Bdsk-Url-1 = {http://www.xs4all.nl/~weegen/eelis/research/math-classes/}}

@inproceedings{DBLP:conf/plpv/Megacz07,
	Author = {Adam Megacz},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PLPV},
	Crossref = {DBLP:conf/plpv/2007},
	Date-Added = {2010-01-28 16:27:55 -0500},
	Date-Modified = {2010-01-28 16:27:55 -0500},
	Ee = {http://doi.acm.org/10.1145/1292597.1292601},
	Pages = {11-20},
	Title = {A coinductive monad for prop-bounded recursion},
	Year = {2007}}

@inproceedings{swierstra:hoare-state-monad,
	Author = {Wouter Swierstra},
	Booktitle = {Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLS 2009},
	Date-Added = {2010-01-28 16:21:27 -0500},
	Date-Modified = {2010-01-28 16:21:27 -0500},
	Editor = {Tobias Nipkow and Christian Urban},
	Publisher = {Spring Verlag},
	Series = {Lecture Notes in Computer Science},
	Title = {A Hoare Logic for the State Monad},
	Volume = {5674},
	Year = {2009}}

@inproceedings{DBLP:conf/plpv/StumpDPSS09,
	Author = {Aaron Stump and Morgan Deters and Adam Petcher and Todd Schiller and Timothy W. Simpson},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PLPV},
	Crossref = {DBLP:conf/plpv/2009},
	Date-Added = {2010-01-28 15:23:09 -0500},
	Date-Modified = {2010-01-28 15:23:09 -0500},
	Ee = {http://doi.acm.org/10.1145/1481848.1481856},
	Pages = {49-58},
	Title = {Verified programming in Guru},
	Year = {2009}}

@proceedings{DBLP:conf/plpv/2009,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PLPV},
	Date-Added = {2010-01-28 15:23:09 -0500},
	Date-Modified = {2010-01-28 15:23:09 -0500},
	Editor = {Thorsten Altenkirch and Todd D. Millstein},
	Isbn = {978-1-60558-330-3},
	Publisher = {ACM},
	Title = {Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, PLPV 2009, Savannah, GA, USA, January 20, 2009},
	Year = {2009}}

@unpublished{alti:pisigma-new,
	Author = {Thorsten Altenkirch and Nils Anders Danielsson and Andres L\"oh and Nicolas Oury},
	Date-Added = {2010-01-28 12:02:15 -0500},
	Date-Modified = {2010-01-29 14:03:07 -0500},
	Month = {November},
	Note = {Accepted at FLOPS 2010},
	Title = {PiSigma: Dependent Types Without the Sugar},
	Year = {2009}}

@misc{sozeau.Coq/Equations/PPS10,
	Author = {Matthieu Sozeau},
	Date-Added = {2010-01-22 16:34:15 +0100},
	Date-Modified = {2010-02-01 17:38:56 -0500},
	Howpublished = {Talk given at PPS - Universit{\'e} Paris 7},
	Keywords = {dependent types pattern matching unification},
	Month = {January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-PPS-130110.pdf},
	Read = {Oui},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Type = {slides},
	Year = {2010},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@article{DBLP:journals/entcs/KirchnerM07,
	Author = {Florent Kirchner and C{\'e}sar Mu{\~n}oz},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2010-01-04 16:46:24 +0100},
	Date-Modified = {2010-01-04 17:47:40 +0100},
	Ee = {http://dx.doi.org/10.1016/j.entcs.2006.10.057},
	Journal = {Electr. Notes Theor. Comput. Sci.},
	Number = {11},
	Pages = {47-58},
	Title = {{PVS\#: Streamlined Tacticals for PVS}},
	Volume = {174},
	Year = {2007}}

@inproceedings{DBLP:conf/frocos/LescuyerC09,
	Author = {St{\'e}phane Lescuyer and Sylvain Conchon},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FroCos},
	Crossref = {DBLP:conf/frocos/2009},
	Date-Added = {2009-12-30 20:38:35 +0100},
	Date-Modified = {2009-12-30 20:38:35 +0100},
	Ee = {http://dx.doi.org/10.1007/978-3-642-04222-5_18},
	Pages = {287-303},
	Title = {Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme},
	Year = {2009}}

@proceedings{DBLP:conf/frocos/2009,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FroCoS},
	Date-Added = {2009-12-30 20:38:35 +0100},
	Date-Modified = {2009-12-30 20:38:35 +0100},
	Editor = {Silvio Ghilardi and Roberto Sebastiani},
	Ee = {http://dx.doi.org/10.1007/978-3-642-04222-5},
	Isbn = {978-3-642-04221-8},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings},
	Volume = {5749},
	Year = {2009}}

@article{lescuyer10jfla,
	Author = {St{\'e}phane Lescuyer},
	Date-Added = {2009-12-30 20:22:04 +0100},
	Date-Modified = {2009-12-30 20:24:19 +0100},
	Journal = {21{\`e}mes Journ{\'e}es Francophones des Langages Applicatifs},
	Title = {Conteneurs de premi{\`e}re classe en Coq},
	Year = {2010}}

@article{braibantKleen,
	Abstract = {Rewriting is an essential tool for computer-based reasoning, both automated and assisted. 
It is so because rewriting is a general notion that permits to model a wide range of problems and 
provides means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in 
arbitrary contexts, generalizing the usual equational reasoning to reasoning modulo arbitrary relations. 
This can be done provided the necessary proofs that functions appearing in goals are congruent with 
respect to specific relations. We present a new implementation of generalized rewriting in the Coq proof 
assistant, making essential use of the expressive power of dependent types and a recently implemented 
type class mechanism. The tactic improves on and generalizes previous versions by supporting natively 
higher-order functions, polymorphism and subrelations. The type class system inspired from Haskell 
provides a perfect interface between the user and such tactics, making them easily extensible.},
	Author = {Thomas Braibant and Damien Pous},
	Date-Added = {2009-12-30 20:16:51 +0100},
	Date-Modified = {2009-12-30 20:18:59 +0100},
	Journal = {1st Coq Workshop proceedings},
	Month = {August},
	Read = {Oui},
	Title = {{A Tactic for Deciding Kleen Algebras}},
	Url = {http://hal.archives-ouvertes.fr/docs/00/38/30/70/PDF/CoqTacticForKleeneAlgebras.pdf},
	Year = {2009},
	Bdsk-Url-1 = {http://hal.archives-ouvertes.fr/docs/00/38/30/70/PDF/CoqTacticForKleeneAlgebras.pdf}}

@inproceedings{dockins09:sa,
	Author = {Robert Dockins and Aquinas Hobor and Andrew W. Appel},
	Booktitle = {The 7th Asian Symposium on Programming Languages and Systems},
	Date-Added = {2009-12-30 19:15:11 +0100},
	Date-Modified = {2009-12-30 19:15:11 +0100},
	Pages = {{to appear}},
	Publisher = {Springer ENTCS},
	Title = {A Fresh Look at Separation Algebras and Share Accounting},
	Url = {http://msl.cs.princeton.edu/fresh-sa.pdf},
	Year = 2009,
	Bdsk-Url-1 = {http://msl.cs.princeton.edu/fresh-sa.pdf}}

@article{sozeau.Coq/rewrite/JFR,
	Abstract = {Rewriting is an essential tool for computer-based reasoning, both automated and assisted. 
It is so because rewriting is a general notion that permits to model a wide range of problems and 
provides means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in 
arbitrary contexts, generalizing the usual equational reasoning to reasoning modulo arbitrary relations. 
This can be done provided the necessary proofs that functions appearing in goals are congruent with 
respect to specific relations. We present a new implementation of generalized rewriting in the Coq proof 
assistant, making essential use of the expressive power of dependent types and a recently implemented 
type class mechanism. The tactic improves on and generalizes previous versions by supporting natively 
higher-order functions, polymorphism and subrelations. The type class system inspired from Haskell 
provides a perfect interface between the user and such tactics, making them easily extensible.},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-12-27 19:24:23 +0100},
	Date-Modified = {2010-01-04 11:57:16 +0100},
	Journal = {Journal of Formalized Reasoning},
	Keywords = {rewriting setoid typeclasses},
	Month = {December},
	Number = {1},
	Pages = {41-62},
	Pdf = {http://jfr.cib.unibo.it/article/view/1574/1077},
	Read = {Oui},
	Title = {{A New Look at Generalized Rewriting in Type Theory}},
	Volume = {2},
	Year = {2009}}

@article{journals/mscs/BoveC05,
	Author = {Ana Bove and Venanzio Capretta},
	Bibdate = {2005-09-16},
	Bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/mscs/mscs15.html#BoveC05},
	Date-Added = {2009-12-25 23:04:30 +0100},
	Date-Modified = {2009-12-25 23:04:30 +0100},
	Journal = {Mathematical Structures in Computer Science},
	Number = {4},
	Pages = {671--708},
	Title = {Modelling general recursion in type theory},
	Url = {http://dx.doi.org/10.1017/S0960129505004822},
	Volume = {15},
	Year = {2005},
	Bdsk-Url-1 = {http://dx.doi.org/10.1017/S0960129505004822}}

@inproceedings{conf/types/BarrasCGHS08,
	Author = {Bruno Barras and Pierre Corbineau and Benjamin Gr{\'e}goire and Hugo Herbelin and Jorge Luis Sacchini},
	Bibdate = {2009-06-13},
	Bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/types/types2008.html#BarrasCGHS08},
	Booktitle = {TYPES},
	Date-Added = {2009-12-25 23:00:06 +0100},
	Date-Modified = {2009-12-25 23:03:06 +0100},
	Editor = {Stefano Berardi and Ferruccio Damiani and Ugo de'Liguoro},
	Isbn = {978-3-642-02443-6},
	Pages = {32--48},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {A New Elimination Rule for the Calculus of Inductive Constructions},
	Url = {http://dx.doi.org/10.1007/978-3-642-02444-3},
	Volume = {5497},
	Year = {2008},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-642-02444-3}}

@inproceedings{GADTcomplete,
	Abstract = {GADTs have proven to be an invaluable language extension, for ensuring data invariants and program correctness among others. Unfortunately, they pose a tough problem for type inference: we lose the principal-type property, which is necessary for modular type inference.},
	Address = {New York, NY, USA},
	Author = {Schrijvers, Tom and Jones, Simon P. and Sulzmann, Martin and Vytiniotis, Dimitrios},
	Booktitle = {ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming},
	Citeulike-Article-Id = {6347287},
	Citeulike-Linkout-0 = {http://portal.acm.org/citation.cfm?id=1596550.1596599},
	Citeulike-Linkout-1 = {http://dx.doi.org/10.1145/1596550.1596599},
	Date-Added = {2009-12-25 22:53:21 +0100},
	Date-Modified = {2009-12-25 22:53:44 +0100},
	Doi = {10.1145/1596550.1596599},
	Isbn = {978-1-60558-332-7},
	Keywords = {haskell, type checking},
	Location = {Edinburgh, Scotland},
	Pages = {341--352},
	Posted-At = {2009-12-10 09:21:58},
	Priority = {2},
	Publisher = {ACM},
	Title = {Complete and decidable type inference for GADTs},
	Url = {http://dx.doi.org/10.1145/1596550.1596599},
	Year = {2009},
	Bdsk-Url-1 = {http://dx.doi.org/10.1145/1596550.1596599}}

@inproceedings{DBLP:conf/tphol/AspertiRCT09,
	Author = {Andrea Asperti and Wilmer Ricciotti and Claudio Sacerdoti Coen and Enrico Tassi},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2009},
	Date-Added = {2009-12-23 15:52:59 +0100},
	Date-Modified = {2009-12-23 15:52:59 +0100},
	Ee = {http://dx.doi.org/10.1007/978-3-642-03359-9_8},
	Pages = {84-98},
	Title = {Hints in Unification},
	Year = {2009}}

@inproceedings{DBLP:conf/tphol/McCreight09,
	Author = {Andrew McCreight},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2009},
	Date-Added = {2009-12-23 04:22:15 +0100},
	Date-Modified = {2009-12-23 04:22:15 +0100},
	Ee = {http://dx.doi.org/10.1007/978-3-642-03359-9_24},
	Pages = {343-358},
	Title = {Practical Tactics for Separation Logic},
	Year = {2009}}

@inproceedings{DBLP:conf/fpca/Augustsson85,
	Author = {Lennart Augustsson},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FPCA},
	Date-Added = {2009-11-08 23:36:58 -0500},
	Date-Modified = {2009-11-08 23:38:21 -0500},
	Doi = {10.1007/3-540-15975-4},
	Pages = {368-381},
	Title = {Compiling Pattern Matching},
	Year = {1985},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/3-540-15975-4}}

@book{IntrotoHAT,
	Date-Added = {2009-09-08 14:35:45 -0400},
	Date-Modified = {2009-09-08 14:35:45 -0400},
	Editor = {M. J. C. Gordon and T. F. Melham},
	Publisher = {Cambridge University Press},
	Title = {Introduction to {HOL}: A theorem proving environment for higher order logic},
	Url = {http://www.dcs.glasgow.ac.uk/~tfm/HOLbook.html},
	Year = {1993},
	Bdsk-Url-1 = {http://www.dcs.glasgow.ac.uk/~tfm/HOLbook.html}}

@misc{Constable86implementingmathematics,
	Author = {Robert L. Constable and Stuart F. Allen and S. F. Allen and H. M. Bromley and W. R. Cleaveland and J. F. Cremer and R. W. Harper and Douglas J. Howe and T. B. Knoblock and N. P. Mendler and P. Panangaden and Scott F. Smith and James T. Sasaki and S. F. Smith},
	Date-Added = {2009-09-08 14:29:23 -0400},
	Date-Modified = {2009-09-08 14:29:23 -0400},
	Title = {Implementing Mathematics with The Nuprl Proof Development System},
	Year = {1986}}

@misc{sozeau.Coq/rewrite/types09,
	Abstract = {Rewriting is an essential tool for computer-based reasoning, both automated and assisted. 
It is so because rewriting is a general notion that permits to model a wide range of problems and 
provides means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in 
arbitrary contexts, generalizing the usual equational reasoning to reasoning modulo arbitrary relations. 
This can be done provided the necessary proofs that functions appearing in goals are congruent with 
respect to specific relations. We present a new implementation of generalized rewriting in the Coq proof 
assistant, making essential use of the expressive power of dependent types and a recently implemented 
type class mechanism. The tactic improves on and generalizes previous versions by supporting natively 
higher-order functions, polymorphism and subrelations. The type class system inspired from Haskell 
provides a perfect interface between the user and such tactics, making them easily extensible.},
	Address = {Aussois, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-08-22 11:11:35 +0200},
	Date-Modified = {2009-08-22 11:19:56 +0200},
	Howpublished = {TYPES'09},
	Keywords = {rewriting setoid typeclasses},
	Month = {May},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_New_Look_at_Generalized_Rewriting_in_Type_Theory-TYPES09-130509.pdf},
	Read = {Oui},
	Title = {{A New Look at Generalized Rewriting in Type Theory}},
	Type = {slides},
	Year = {2009},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@misc{sozeau.Coq/rewrite/coq09,
	Abstract = {Rewriting is an essential tool for computer-based reasoning, both automated and assisted. 
It is so because rewriting is a general notion that permits to model a wide range of problems and 
provides means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in 
arbitrary contexts, generalizing the usual equational reasoning to reasoning modulo arbitrary relations. 
This can be done provided the necessary proofs that functions appearing in goals are congruent with 
respect to specific relations. We present a new implementation of generalized rewriting in the Coq proof 
assistant, making essential use of the expressive power of dependent types and a recently implemented 
type class mechanism. The tactic improves on and generalizes previous versions by supporting natively 
higher-order functions, polymorphism and subrelations. The type class system inspired from Haskell 
provides a perfect interface between the user and such tactics, making them easily extensible.},
	Address = {Munich, Germany},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-08-22 11:09:30 +0200},
	Date-Modified = {2009-08-22 11:19:37 +0200},
	Howpublished = {Talk given at the First Coq Workshop},
	Keywords = {rewriting setoid typeclasses},
	Month = {August},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_New_Look_at_Generalized_Rewriting_in_Type_Theory-Coq09-210809.pdf},
	Read = {Oui},
	Title = {{A New Look at Generalized Rewriting in Type Theory}},
	Type = {slides},
	Year = {2009},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@unpublished{wilson:supporting,
	Author = {Sean Wilson and Jacques Fleuriot and Alan Smaill},
	Date-Added = {2009-04-20 11:56:56 -0400},
	Date-Modified = {2010-02-02 11:28:27 -0500},
	Note = {Draft},
	Title = {Supporting Dependently Typed Functional Programming with Testing and User-Assisted Proof Automation},
	Url = {http://homepages.inf.ed.ac.uk/s0091720/Wilson2009TAPDraft.pdf},
	Year = {2010},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://homepages.inf.ed.ac.uk/s0091720/Wilson2009TAPDraft.pdf}}

@inproceedings{Luttik97specificationof,
	Author = {Sebastiaan P. Luttik and Eelco Visser},
	Booktitle = {2nd International Workshop on the Theory and Practice of Algebraic Specifications (ASF+SDF'97), Electronic Workshops in Computing},
	Date-Added = {2009-04-20 11:54:16 -0400},
	Date-Modified = {2009-04-20 11:55:54 -0400},
	Publisher = {Springer-Verlag},
	Read = {Oui},
	Title = {Specification of Rewriting Strategies},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.4049},
	Year = {1997},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.4049}}

@article{Lengrand:2006td,
	Abstract = {Based on natural deduction, Pure Type Systems (  ) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent Calculi (  ) by enriching a sequent calculus due to Herbelin, adapted to proof-search and strongly related to natural deduction.    are equipped with a normalisation procedure, adapted from Herbelin's and defined by local rewrite rules as in Cut-elimination, using explicit substitutions. It satisfies Subject Reduction and it is confluent. A  is logically equivalent to its corresponding  , and the former is strongly normalising if and only if the latter is.    We show how the conversion rules can be incorporated inside logical rules (as in syntax-directed rules for type checking), so that basic proof-search tactics in type theory are merely the root-first application of our inference rules.    Keywords: Type theory,  , sequent calculus, proof-search, strong normalisation.   },
	Author = {Lengrand, St{\'e}phane and Dyckhoff, Roy and McKinna, James},
	Date-Added = {2009-04-03 17:45:00 -0400},
	Date-Modified = {2009-04-03 17:45:10 -0400},
	Journal = {Computer Science Logic},
	M3 = {10.1007/11874683{\_}29},
	Pages = {441--455},
	Read = {Oui},
	Title = {A Sequent Calculus for Type Theory},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/11874683_29},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11874683_29}}

@inproceedings{351258,
	Address = {New York, NY, USA},
	Author = {Hinze, Ralf},
	Booktitle = {ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2009-04-03 17:41:34 -0400},
	Date-Modified = {2014-07-29 16:07:05 +0000},
	Doi = {http://doi.acm.org/10.1145/351240.351258},
	Isbn = {1-58113-202-6},
	Pages = {186--197},
	Publisher = {ACM},
	Title = {Deriving backtracking monad transformers},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=351258&type=pdf&coll=Portal&dl=GUIDE&CFID=28832090&CFTOKEN=51771456},
	Year = {2000},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=351258&type=pdf&coll=Portal&dl=GUIDE&CFID=28832090&CFTOKEN=51771456},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/351240.351258}}

@inproceedings{1086390,
	Address = {New York, NY, USA},
	Author = {Kiselyov,, Oleg and Shan,, Chung-chieh and Friedman,, Daniel P. and Sabry,, Amr},
	Booktitle = {ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2009-04-03 17:39:46 -0400},
	Date-Modified = {2009-04-03 17:39:46 -0400},
	Doi = {http://doi.acm.org/10.1145/1086365.1086390},
	Isbn = {1-59593-064-7},
	Location = {Tallinn, Estonia},
	Pages = {192--203},
	Publisher = {ACM},
	Title = {Backtracking, interleaving, and terminating monad transformers: (functional pearl)},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1086390&type=pdf&coll=Portal&dl=GUIDE&CFID=28832090&CFTOKEN=51771456},
	Year = {2005},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1086390&type=pdf&coll=Portal&dl=GUIDE&CFID=28832090&CFTOKEN=51771456},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1086365.1086390}}

@misc{sozeau.Coq/Programing/PPS09,
	Address = {Paris, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-02-25 23:28:21 +0100},
	Date-Modified = {2009-02-25 23:30:25 +0100},
	Howpublished = {PPS Seminar},
	Keywords = {dependent types, Coq, Program},
	Month = {26th February},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Programming_with_Dependent_Types_in_Coq-PPS-260209.pdf},
	Read = {Oui},
	Title = {{Programming with Dependent Types in Coq}},
	Type = {slides},
	Year = {2009}}

@inproceedings{DBLP:conf/mpc/AbelCD08,
	Author = {Andreas Abel and Thierry Coquand and Peter Dybjer},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MPC},
	Crossref = {DBLP:conf/mpc/2008},
	Date-Added = {2009-02-06 10:13:33 +0100},
	Date-Modified = {2009-02-06 10:13:59 +0100},
	Ee = {http://dx.doi.org/10.1007/978-3-540-70594-9_4},
	Pages = {29-56},
	Pdf = {http://www.tcs.informatik.uni-muenchen.de/~abel/mpc08.pdf},
	Title = {Verifying a Semantic beta-eta-Conversion Test for Martin-L{\"o}f Type Theory},
	Year = {2008}}

@proceedings{DBLP:conf/mpc/2008,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MPC},
	Date-Added = {2009-02-06 10:13:33 +0100},
	Date-Modified = {2009-02-06 10:13:33 +0100},
	Editor = {Philippe Audebaud and Christine Paulin-Mohring},
	Isbn = {978-3-540-70593-2},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Mathematics of Program Construction, 9th International Conference, MPC 2008, Marseille, France, July 15-18, 2008. Proceedings},
	Volume = {5133},
	Year = {2008}}

@article{Ganzinger:2004iq,
	Abstract = {Indexing data structures have a crucial impact on the performance of automated theorem provers. Examples are discrimination trees, which are like tries where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by means of a limited kind of context variables, common subterms also can be shared, even if they occur below different function symbols. Apart from introducing the concept, we also provide evidence for its practical value. We show how context trees can be implemented by means of abstract machine instructions. Experiments with benchmarks for forward matching show that our implementation is competitive with tightly coded current state-of-the-art implementations of the other main techniques. In particular, space consumption of context trees is significantly less than for other index structures.},
	Author = {Ganzinger, Harald and Nieuwenhuis, Robert and Nivela, Pilar},
	Date-Added = {2009-02-05 17:25:06 +0100},
	Date-Modified = {2009-02-05 17:25:06 +0100},
	Day = {01},
	Journal = {Journal of Automated Reasoning},
	M3 = {10.1023/B:JARS.0000029963.64213.ac},
	Month = {02},
	Number = {2},
	Pages = {103--120},
	Title = {Fast Term Indexing with Coded Context Trees},
	Ty = {JOUR},
	Url = {http://dx.doi.org/10.1023/B:JARS.0000029963.64213.ac},
	Volume = {32},
	Year = {2004},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1023/B:JARS.0000029963.64213.ac}}

@article{Riazanov:2008cv,
	Abstract = {Code trees {$[$}8{$]$} is an indexing technique used for implementing several indexed operations on terms in the theorem prover Vampire {$[$}5{$]$}. Code trees offer greater flexibility than discrimination trees. In this paper we review a new, considerably faster, version of code trees based on a different representation of the query term. We also introduce a partially adaptive version of code trees. },
	Author = {Riazanov, Alexandre and Voronkov, Andrei},
	Date-Added = {2009-02-05 17:22:08 +0100},
	Date-Modified = {2009-02-05 17:22:08 +0100},
	Journal = {Logics in Artificial Intelligence},
	M3 = {10.1007/3-540-40006-0{\_}15},
	Pages = {209--223},
	Title = {Partially Adaptive Code Trees},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/3-540-40006-0_15},
	Year = {2008},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/3-540-40006-0_15}}

@article{Graf:1995tg,
	Abstract = {Sophisticated maintenance and retrieval of first-order predicate calculus terms is a major key to efficient automated reasoning. We present a new indexing technique, which accelerates the speed of the basic retrieval operations such as finding complementary literals in resolution theorem proving or finding critical pairs during completion. Subsumption and reduction are also supported. Moreover, the new technique not only provides maintenance and efficient retrieval of terms but also of idem-potent substitutions. Substitution trees achieve maximal search speed paired with minimal memory requirements in various experiments and outperform traditional techniques such as path indexing, discrimination tree indexing, and abstraction trees by combining their advantages and adding some new features.},
	Author = {Graf, Peter},
	Date-Added = {2009-02-05 17:19:52 +0100},
	Date-Modified = {2009-02-09 20:03:51 +0100},
	Journal = {Rewriting Techniques and Applications},
	M3 = {10.1007/3-540-59200-8{\_}52},
	Pages = {117--131},
	Rating = {3},
	Read = {Oui},
	Title = {Substitution tree indexing},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/3-540-59200-8_52},
	Year = {1995},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/3-540-59200-8_52}}

@article{McCune:1992lg,
	Abstract = {This article addresses the problem of indexing and retrieving first-order predicate calculus terms in the context of automated deduction programs. The four retrieval operations of concern are to find variants, generalizations, instances, and terms that unify with a given term. Discrimination-tree indexing is reviewed, and several variations are presented. The path-indexing method is also reviewed. Experiments were conducted on large sets of terms to determine how the properties of the terms affect the performance of the two indexing methods. Results of the experiments are presented.},
	Author = {McCune, William},
	Date-Added = {2009-02-05 17:15:44 +0100},
	Date-Modified = {2009-02-09 21:01:54 +0100},
	Day = {01},
	Journal = {Journal of Automated Reasoning},
	M3 = {10.1007/BF00245458},
	Month = {10},
	Number = {2},
	Pages = {147--167},
	Rating = {3},
	Read = {Oui},
	Title = {Experiments with discrimination-tree indexing and path indexing for term retrieval},
	Ty = {JOUR},
	Url = {http://dx.doi.org/10.1007/BF00245458},
	Volume = {9},
	Year = {1992},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF00245458}}

@inproceedings{sozeau.Coq/classes/ctpc,
	Abstract = {Les classes de types (Type Classes) ont remport{\'e} un grand
succ{\`e}s dans le langage de programmation fonctionnelle Haskell et
l'assistant de preuve Isabelle, comme solution permettant de
surcharger des notations et sp{\'e}cifier avec des structures
abstraites en quantifiant sur les contextes. Nous pr{\'e}sentons un
plongement superficiel des classes de types dans une th{\'e}orie des types
d{\'e}pendants qui fait des classes des objets de premi{\`e}re classe et
supporte directement les extensions les plus populaires de Haskell.
L'impl{\'e}mentation du syst{\`e}me est l{\'e}g{\`e}re et s'appuie sur des
constructions existantes du langage qui sont simplement raffin{\'e}es pour
obtenir un ensemble bien int{\'e}gr{\'e} {\`a} l'environnement Coq. On
pr{\'e}sente sur des exemples comment ce syst{\`e}me peut {\^e}tre utilis{\'e} pour 
la programmation et la preuve.
},
	Address = {Toulouse, France},
	Author = {Matthieu Sozeau and Nicolas Oury},
	Booktitle = {Journ{\'e}es Nationales du GDR GPL},
	Date-Added = {2009-01-30 17:08:36 +0100},
	Date-Modified = {2009-07-15 22:19:46 +0200},
	Keywords = {Type classes},
	Month = {January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Classes_de_types_de_premiere_classe.pdf},
	Read = {Oui},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-GDR_GPL-300109.pdf},
	Title = {{Classes de types de premi{\`e}re classe}},
	Year = {2009},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-71067-7_23}}

@misc{sozeau.Coq/classes/GDRGPL09,
	Abstract = {Les classes de types ont d{\'e}montr{\'e} leur utilit{\'e} pour la programmation
polymorphique de haut-niveau en Haskell et la construction de
hi{\'e}rarchies de structures math{\'e}matiques dans l'assistant de preuve
Isabelle. Ce m{\'e}canisme de surcharge tr{\`e}s versatile peut se g{\'e}n{\'e}raliser
aux types d{\'e}pendants et offre alors de nouvelles formes de g{\'e}n{\'e}ricit{\'e}.
Il permet aussi d'int{\'e}grer une forme de programmation logique au moment
du typage.  On pr{\'e}sentera une impl{\'e}mentation l{\'e}g{\`e}re d'un syst{\`e}me de
classes de types de premi{\`e}re classe dans Coq, bas{\'e}e sur un
enrichissement de constructions existantes du langage Gallina. On
illustrera ce nouvel outil par des exemples mettant en oeuvre les
classes pour programmer, prouver et organiser les d{\'e}veloppements en Coq.
},
	Address = {ENSEEIHT - Toulouse},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-01-30 17:02:43 +0100},
	Date-Modified = {2009-01-30 17:05:51 +0100},
	Howpublished = {Talk given at the {GDR GPL}},
	Keywords = {Type classes},
	Month = {30th January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-GDR_GPL-300109.pdf},
	Read = {Oui},
	Title = {{F}irst-{C}lass {T}ype {C}lasses},
	Type = {slides},
	Year = {2009}}

@misc{sozeau.Coq/Programing/Orleans09,
	Address = {Orl{\'e}ans, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-01-26 18:19:58 +0100},
	Date-Modified = {2009-01-26 18:21:45 +0100},
	Howpublished = {LIFO Seminar},
	Month = {26th January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/An_Environment_for_Proving_and_Programming-LIFO-260109.pdf},
	Read = {Oui},
	Title = {{An Environment for Proving and Programming}},
	Type = {slides},
	Year = {2009}}

@article{pottier-njc-00,
	Author = {Fran{\c c}ois Pottier},
	Date-Added = {2009-01-26 11:45:26 +0100},
	Date-Modified = {2009-01-26 11:45:43 +0100},
	Journal = njc,
	Month = nov,
	Number = {4},
	Pages = {312--347},
	Title = {A Versatile Constraint-Based Type Inference System},
	Url = {http://cristal.inria.fr/~fpottier/publis/fpottier-njc-2000.ps.gz},
	Volume = {7},
	Year = {2000},
	Bdsk-Url-1 = {http://cristal.inria.fr/~fpottier/publis/fpottier-njc-2000.ps.gz}}

@misc{sozeau.Coq/Programing/Nijmegen09,
	Address = {Nijmegen, Netherlands},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-01-21 11:59:32 +0100},
	Date-Modified = {2009-01-26 18:20:32 +0100},
	Howpublished = {ICIS Seminar},
	Month = {20th January},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/An_Environment_for_Programming_with_Dependent_Types-Nijmegen-200109.pdf},
	Read = {Oui},
	Title = {{An Environment for Programming with Dependent Types}},
	Type = {slides},
	Year = {2009}}

@article{sozeau.Coq/rewrite/newlook,
	Abstract = {Rewriting is an essential tool for computer-based reasoning, both automated and assisted. 
It is so because rewriting is a general notion that permits to model a wide range of problems and 
provides means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in 
arbitrary contexts, generalizing the usual equational reasoning to reasoning modulo arbitrary relations. 
This can be done provided the necessary proofs that functions appearing in goals are congruent with 
respect to specific relations. We present a new implementation of generalized rewriting in the Coq proof 
assistant, making essential use of the expressive power of dependent types and a recently implemented 
type class mechanism. The tactic improves on and generalizes previous versions by supporting natively 
higher-order functions, polymorphism and subrelations. The type class system inspired from Haskell 
provides a perfect interface between the user and such tactics, making them easily extensible.},
	Author = {Matthieu Sozeau},
	Date-Added = {2009-01-19 11:51:48 +0100},
	Date-Modified = {2009-08-22 11:13:06 +0200},
	Journal = {1st Coq Workshop proceedings},
	Keywords = {rewriting setoid typeclasses},
	Month = {August},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_New_Look_at_Generalized_Rewriting_in_Type_Theory.pdf},
	Read = {Oui},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/A_New_Look_at_Generalized_Rewriting_in_Type_Theory-Coq09-210809.pdf},
	Title = {{A New Look at Generalized Rewriting in Type Theory}},
	Year = {2009},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@article{werner:ProofIrrelevanceJAR,
	Abstract = {We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is particularly useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the subset types of the theory of PVS. Finally we show that in these theories, because of the additional extentionality, the axiom of choice implies the decidability of equality, that is, almost classical logic. },
	Author = {Werner, Benjamin},
	Date-Added = {2009-01-13 23:35:01 +0100},
	Date-Modified = {2009-01-13 23:36:30 +0100},
	Journal = {Journal of Automated Reasoning},
	M3 = {10.1007/11814771{\_}49},
	Pages = {604--618},
	Title = {{On the Strength of Proof-Irrelevant Type Theories}},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/11814771_49},
	Year = {2006},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11814771_49}}

@misc{sozeau.Coq/Programing/nottingham08,
	Address = {Nottingham, UK},
	Author = me,
	Date-Added = {2009-01-12 22:40:32 +0100},
	Date-Modified = {2009-01-12 22:43:01 +0100},
	Howpublished = {Talk given at the {F}oundations of {P}rogramming seminar},
	Month = {15th February},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_in_Coq-nottingham-150208.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing in {C}oq},
	Type = {slides},
	Year = {2008}}

@article{hoare:challenge,
	Address = {New York, NY, USA},
	Author = {Tony Hoare},
	Date-Added = {2009-01-06 12:51:14 +0100},
	Date-Modified = {2009-01-06 12:51:23 +0100},
	Doi = {http://doi.acm.org/10.1145/602382.602403},
	Issn = {0004-5411},
	Journal = {J. ACM},
	Number = {1},
	Pages = {63--69},
	Publisher = {ACM},
	Title = {The verifying compiler: A grand challenge for computing research},
	Volume = {50},
	Year = {2003},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/602382.602403}}

@inproceedings{nanevsky08icfp,
	Address = {Victoria, BC, Canada},
	Author = {Aleksandar Nanevski and Greg Morrisett and Avraham Shinnar and Paul Govereau and Lars Birkedal},
	Booktitle = {ICFP '08: Proceeding of the 13th ACM SIGPLAN International Conference on Functional Programming},
	Date-Added = {2008-12-31 12:33:11 +0100},
	Date-Modified = {2008-12-31 12:35:11 +0100},
	Doi = {http://doi.acm.org/10.1145/1411204.1411237},
	Isbn = {978-1-59593-919-7},
	Pages = {229--240},
	Publisher = {ACM},
	Read = {Oui},
	Title = {Ynot: dependent types for imperative programs},
	Year = {2008},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/1411204.1411237}}

@techreport{Salvesen91cr,
	Author = {Anne Salvesen},
	Date-Added = {2008-12-26 00:02:42 +0100},
	Date-Modified = {2008-12-26 00:05:36 +0100},
	Note = {Submitted for journal publication},
	Read = {Oui},
	Title = {{The Church-Rosser Property for Pure Type Systems with βη-reduction}},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.860},
	Year = {1991},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.860}}

@phdthesis{goguen.PhD,
	Author = {Healfdene Goguen},
	Date-Added = {2008-12-25 23:31:59 +0100},
	Date-Modified = {2008-12-26 00:00:58 +0100},
	Read = {Oui},
	School = {University of Edinburgh},
	Title = {{A Typed Operational Semantics for Type Theory}},
	Url = {http://www.lfcs.inf.ed.ac.uk/reports/94/ECS-LFCS-94-304/index.html},
	Year = {1994},
	Bdsk-Url-1 = {http://www.lfcs.inf.ed.ac.uk/reports/94/ECS-LFCS-94-304/index.html}}

@inproceedings{DBLP:conf/tlca/Goguen95,
	Author = {Healfdene Goguen},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Crossref = {DBLP:conf/tlca/1995},
	Date-Added = {2008-12-25 23:28:28 +0100},
	Date-Modified = {2008-12-25 23:28:28 +0100},
	Pages = {186-200},
	Title = {Typed Operational Semantics},
	Year = {1995}}

@proceedings{DBLP:conf/tlca/1995,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Date-Added = {2008-12-25 23:28:28 +0100},
	Date-Modified = {2008-12-25 23:28:28 +0100},
	Editor = {Mariangiola Dezani-Ciancaglini and Gordon D. Plotkin},
	Isbn = {3-540-59048-X},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, UK, April 10-12, 1995, Proceedings},
	Volume = {902},
	Year = {1995}}

@phdthesis{alti:phd93,
	Author = {Thorsten Altenkirch},
	Date-Added = {2008-12-25 22:15:01 +0100},
	Date-Modified = {2008-12-25 22:15:01 +0100},
	Month = {November},
	School = {University of Edinburgh},
	Title = {Constructions, Inductive Types and Strong Normalization},
	Year = {1993}}

@inproceedings{DBLP:conf/csl/BartheM96,
	Author = {Gilles Barthe and Paul-Andr{\'e} Melli{\`e}s},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/1996},
	Date-Added = {2008-12-25 22:06:08 +0100},
	Date-Modified = {2008-12-25 22:06:33 +0100},
	Pages = {34-57},
	Read = {Oui},
	Title = {On the Subject Reduction Property for Algebraic Type Systems},
	Url = {http://www.pps.jussieu.fr/~mellies/papers/csl96.ps.gz},
	Year = {1996},
	Bdsk-Url-1 = {http://www.pps.jussieu.fr/~mellies/papers/csl96.ps.gz}}

@inproceedings{DBLP:conf/types/MelliesW96,
	Author = {Paul-Andr{\'e} Melli{\`e}s and Benjamin Werner},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1996},
	Date-Added = {2008-12-25 22:04:51 +0100},
	Date-Modified = {2008-12-25 22:05:35 +0100},
	Pages = {254-276},
	Read = {Oui},
	Title = {A Generic Normalisation Proof for Pure Type Systems},
	Url = {http://www.pps.jussieu.fr/~mellies/papers/pts.ps},
	Year = {1996},
	Bdsk-Url-1 = {http://www.pps.jussieu.fr/~mellies/papers/pts.ps}}

@inproceedings{weegen08types,
	Author = {Eelis van der Weegen and James McKinna},
	Booktitle = {TYPES'08},
	Date-Added = {2008-12-16 20:37:13 +0100},
	Date-Modified = {2008-12-16 20:39:55 +0100},
	Read = {Oui},
	Title = {{A Machine-checked Proof of the Average-case Complexity of Quicksort in Coq}},
	Url = {http://www.xs4all.nl/~weegen/eelis/research/quicksort/},
	Year = {2008},
	Bdsk-Url-1 = {http://www.xs4all.nl/~weegen/eelis/research/quicksort/}}

@inproceedings{oury-swierstra:power-of-pi,
	Address = {Victoria, BC, Canada},
	Author = {Nicolas Oury and Wouter Swierstra},
	Booktitle = {ICFP '08: Proceeding of the 13th ACM SIGPLAN International Conference on Functional Programming},
	Date-Added = {2008-12-14 18:31:10 +0100},
	Date-Modified = {2008-12-14 18:32:40 +0100},
	Doi = {http://doi.acm.org/10.1145/1411204.1411213},
	Isbn = {978-1-59593-919-7},
	Pages = {39--50},
	Pdf = {http://www.cs.nott.ac.uk/~wss/Publications/ThePowerOfPi.pdf},
	Publisher = {ACM},
	Title = {The {Power} of {Pi}},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1411213&type=pdf&coll=Portal&dl=GUIDE&CFID=15142937&CFTOKEN=76020526},
	Year = {2008},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1411213&type=pdf&coll=Portal&dl=GUIDE&CFID=15142937&CFTOKEN=76020526},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1411204.1411213}}

@misc{sozeau.thesis-slides,
	Address = {Orsay, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-12-09 22:27:26 +0100},
	Date-Modified = {2008-12-26 15:36:30 +0100},
	Howpublished = {Thesis Defense},
	Month = {8th December},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/An_Environment_for_Programming_with_Dependent_Types-LRI-081208.pdf},
	Read = {Oui},
	School = {Paris 11 University},
	Title = {{An Environment for Programming with Dependent Types}},
	Type = {slides},
	Year = {2008}}

@inproceedings{bentonTLDI09,
	Author = {Nick Benton and Nicolas Tabareau},
	Booktitle = {TLDI},
	Date-Added = {2008-12-05 20:10:32 +0100},
	Date-Modified = {2009-01-07 22:32:52 +0100},
	Title = {{Compiling Functional Types to Relational Specifications for Low Level Imperative Code}},
	Url = {http://research.microsoft.com/~nick/tldi02d-benton.pdf},
	Year = {2009},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://research.microsoft.com/~nick/tldi02d-benton.pdf}}

@inproceedings{sozeau.Coq/Equations/ITP10,
	Author = {Matthieu Sozeau},
	Booktitle = {First International Conference on Interactive Theorem Proving},
	Date-Added = {2008-11-06 12:39:36 +0100},
	Date-Modified = {2010-07-19 11:40:30 -0400},
	Month = {July},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler.pdf},
	Publisher = {Springer},
	Read = {Oui},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Equations:_A_Dependent_Pattern-Matching_Compiler-ITP10-140710.pdf},
	Title = {Equations: A Dependent Pattern-Matching Compiler},
	Year = {2010},
	Bdsk-Url-1 = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/Equations.pdf}}

@phdthesis{sozeau.thesis,
	Address = {Orsay, France},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-11-06 11:12:10 +0100},
	Date-Modified = {2008-12-26 15:38:14 +0100},
	Month = {December},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/thesis-sozeau.pdf},
	Read = {Oui},
	School = {Universit{\'e} Paris 11},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/An_Environment_for_Programming_with_Dependent_Types-LRI-081208.pdf},
	Title = {Un environnement pour la programmation avec types d{\'e}pendants},
	Year = {2008}}

@misc{sozeau.Coq/classes/Gallium08,
	Abstract = {Les classes de types ont d{\'e}montr{\'e} leur utilit{\'e} pour la programmation
polymorphique de haut-niveau en Haskell et la construction de
hi{\'e}rarchies de structures math{\'e}matiques dans l'assistant de preuve
Isabelle. Ce m{\'e}canisme de surcharge tr{\`e}s versatile peut se g{\'e}n{\'e}raliser
aux types d{\'e}pendants et offre alors de nouvelles formes de g{\'e}n{\'e}ricit{\'e}.
Il permet aussi d'int{\'e}grer une forme de programmation logique au moment
du typage.  On pr{\'e}sentera une impl{\'e}mentation l{\'e}g{\`e}re d'un syst{\`e}me de
classes de types de premi{\`e}re classe dans Coq, bas{\'e}e sur un
enrichissement de constructions existantes du langage Gallina. On
illustrera ce nouvel outil par des exemples mettant en oeuvre les
classes pour programmer, prouver et organiser les d{\'e}veloppements en Coq.
},
	Address = {Rocquencourt},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-11-03 15:40:49 +0100},
	Date-Modified = {2008-11-06 14:11:29 +0100},
	Howpublished = {Talk given at the {G}allium seminar},
	Keywords = {Type classes},
	Month = {3rd November},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-Gallium-031108.pdf},
	Read = {Oui},
	Title = {{F}irst-{C}lass {T}ype {C}lasses},
	Type = {slides},
	Year = {2008}}

@inproceedings{CS07,
	Author = {Thierry Coquand and Arnaud Spiwack},
	Booktitle = {Proceedings of 14th Symposium, Calculemus 2007, 6th International Conference, MKM 2007},
	Date-Added = {2008-10-20 10:38:32 +0200},
	Date-Modified = {2008-10-20 10:38:58 +0200},
	Publisher = {Springer},
	Read = {Oui},
	Title = {Towards Constructive Homological Algebra in Type Theory},
	Url = {http://arnaud.spiwack.free.fr/papers/tchaitt.pdf},
	Year = {2007},
	Bdsk-Url-1 = {http://arnaud.spiwack.free.fr/papers/tchaitt.pdf}}

@phdthesis{Brady:2005nu,
	Author = {Edwin C. Brady},
	Date-Added = {2008-10-17 01:05:51 +0200},
	Date-Modified = {2008-10-17 01:14:52 +0200},
	School = {University of Durham},
	Title = {Practical Implementation of a Dependently Typed Functional Programming Language},
	Url = {http://www.cs.st-andrews.ac.uk/~eb/writings/thesis.ps.gz},
	Year = {2005},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.st-andrews.ac.uk/~eb/writings/thesis.ps.gz}}

@phdthesis{werner94these,
	Author = {Benjamin Werner},
	Date-Added = {2008-10-17 00:54:06 +0200},
	Date-Modified = {2008-10-17 01:03:57 +0200},
	Read = {Oui},
	School = {Universit{\'e} Paris 7},
	Title = {Une Th{\'e}orie des Constructions Inductives},
	Topics = {logic},
	Type = thesedoctorat,
	Url = {http://cat.inist.fr/?aModele=afficheN&cpsidt=1815936},
	Year = 1994,
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://cat.inist.fr/?aModele=afficheN&cpsidt=1815936}}

@phdthesis{ZumkellerPhD,
	Author = {Roland Zumkeller},
	Date-Added = {2008-10-17 00:39:50 +0200},
	Date-Modified = {2008-10-17 00:42:43 +0200},
	Month = {October},
	Read = {Oui},
	School = {{\'E}cole Polytechnique},
	Title = {Global Optimization in Type Theory},
	Url = {http://roland.zumkeller.googlepages.com/thesis-zumkeller.pdf},
	Year = {2008},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://roland.zumkeller.googlepages.com/thesis-zumkeller.pdf}}

@inproceedings{Aydemir08,
	Author = {Brian Aydemir and Arthur Chargu\'{e}raud and Benjamin C. Pierce and Randy Pollack and Stephanie Weirich},
	Bcp = yes,
	Booktitle = popl08,
	Date-Added = {2008-10-14 19:37:09 +0200},
	Date-Modified = {2008-10-14 19:37:43 +0200},
	Keys = {poplmark},
	Month = jan,
	Pages = {3--15},
	Plclub = yes,
	Publisher = {ACM},
	Read = {Oui},
	Short = {http://www.cis.upenn.edu/~bcpierce/papers/binders.pdf},
	Title = {Engineering formal metatheory},
	Url = {http://www.cis.upenn.edu/~bcpierce/papers/binders.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://www.cis.upenn.edu/~bcpierce/papers/binders.pdf}}

@mastersthesis{puech:master,
	Author = {Matthias Puech},
	Date-Added = {2008-10-14 16:01:25 +0200},
	Date-Modified = {2008-10-14 16:03:11 +0200},
	Month = {Septembre},
	Read = {Oui},
	School = {Universit{\'e} Paris 7},
	Title = {Reconnaissance automatique de structures math{\'e}matiques dans l'assistant de preuve Coq},
	Url = {http://mqtthiqs.hd.free.fr/~mqtt/rapport/rapport.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://mqtthiqs.hd.free.fr/~mqtt/rapport/rapport.pdf}}

@inproceedings{LTAC,
	Author = {Delahaye, David},
	Booktitle = {Proceedings of Logic for Programming and Automated Reasoning (LPAR), Reunion Island (France)},
	Date-Added = {2008-10-13 20:11:53 +0200},
	Date-Modified = {2008-10-13 23:04:48 +0200},
	Month = {November},
	Pages = {85--95},
	Publisher = {Springer-Verlag},
	Series = {LNCS/LNAI},
	Title = {A {T}actic {L}anguage for the {S}ystem {{\textsf Coq}}},
	Url = {http://cedric.cnam.fr/~delahaye/publications/LPAR2000-ltac.ps.gz},
	Volume = 1955,
	Year = 2000,
	Bdsk-Url-1 = {http://cedric.cnam.fr/~delahaye/publications/LPAR2000-ltac.ps.gz}}

@article{barthe:computational,
	Address = {New York, NY, USA},
	Author = {Gilles Barthe},
	Date-Added = {2008-10-13 13:41:15 +0200},
	Date-Modified = {2008-10-13 13:46:05 +0200},
	Doi = {http://dx.doi.org/10.1017/S0960129505004901},
	Issn = {0960-1295},
	Journal = {Mathematical. Structures in Comp. Sci.},
	Number = {5},
	Pages = {839--874},
	Publisher = {Cambridge University Press},
	Title = {A computational view of implicit coercions in type theory},
	Volume = {15},
	Year = {2005},
	Bdsk-Url-1 = {http://dx.doi.org/10.1017/S0960129505004901}}

@unpublished{lh07extensible,
	Author = {Daniel R. Licata and Robert Harper},
	Date-Added = {2008-10-13 13:32:18 +0200},
	Date-Modified = {2008-10-14 16:04:35 +0200},
	Note = {Submitted to POPL'08},
	Read = {Oui},
	Title = {An Extensible Theory of Indexed Types},
	Url = {http://www.cs.cmu.edu/~drl/pubs/lh07extensible/lh07extensible.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://www.cs.cmu.edu/~drl/pubs/lh07extensible/lh07extensible.pdf}}

@article{Coquand:2008zx,
	Abstract = {Around thirty years ago, P. Martin-L{\"o}f {$[$}12{$]$} suggested that the intuitionistic theory of types, originally designed as a formal system for constructive mathematics, could be viewed as a programming language. The conclusion of this paper stresses the mutual benefit of relating constructive mathematics and computer programming. In one direction one gets a precise system of notations for both statements and proofs, and one obtains the computerization of abstract intuitionistic mathematics that was asked by Bishop [2]. In the other direction, computer programming ``gets access to the whole conceptual apparatus of pure mathematics''. },
	Author = {Thierry Coquand},
	Date-Added = {2008-10-13 13:27:38 +0200},
	Date-Modified = {2008-10-13 14:37:30 +0200},
	Journal = {Programming Languages and Systems},
	M3 = {10.1007/978-3-540-78739-6{\_}12},
	Pages = {146--147},
	Title = {Constructive Mathematics and Functional Programming (Abstract)},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/978-3-540-78739-6_12},
	Year = {2008},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-78739-6_12}}

@misc{proute:liens,
	Author = {Alain Prout{\'e}},
	Date-Added = {2008-10-13 13:20:40 +0200},
	Date-Modified = {2008-10-13 13:22:09 +0200},
	Howpublished = {Conf{\'e}rence faite {\`a} l'Universit{\'e} de la M{\'e}diterrann{\'e}e},
	Month = {mai},
	Read = {Oui},
	Title = {Sur quelques liens entre th{\'e}orie des topos et th{\'e}orie de la d{\'e}monstration},
	Url = {http://iml.univ-mrs.fr/ldp/Seminaire/documents0607/proute.pdf},
	Year = {2007},
	Bdsk-Url-1 = {http://iml.univ-mrs.fr/ldp/Seminaire/documents0607/proute.pdf}}

@misc{wilson:dtp08,
	Author = {Sean Wilson},
	Date-Added = {2008-10-13 13:16:26 +0200},
	Date-Modified = {2008-10-13 13:18:03 +0200},
	Howpublished = {Talk given at DTP'08},
	Month = {February},
	Read = {Oui},
	Title = {Supporting the Development of Dependently Typed Functional Programs},
	Url = {http://sneezy.cs.nott.ac.uk/darcs/DTP08/slides/Sean.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://sneezy.cs.nott.ac.uk/darcs/DTP08/slides/Sean.pdf}}

@inproceedings{razetfem,
	Author = {Beno{\^\i}t Razet},
	Booktitle = {Mathematically Structured Functional Programming},
	Date-Added = {2008-10-13 13:10:07 +0200},
	Date-Modified = {2009-02-05 12:48:36 +0100},
	Note = {To appear},
	Pdf = {http://pauillac.inria.fr/~razet/PDF/razet_msfp08.pdf},
	Read = {Oui},
	Series = {Electronic Notes in Theoretical Computer Science},
	Title = {{Simulating Finite Eilenberg Machines with a Reactive Engine}},
	Year = {2008}}

@inproceedings{conf/fossacs/BartheP01,
	Abstract = { We propose a theoretical foundation for proof reuse, 
               based on the novel idea of a computational interpretation of 
               type isomorphisms.

              },
	Author = {Gilles Barthe and Olivier Pons},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FoSSaCS},
	Crossref = {fossacs2001},
	Date-Added = {2008-10-13 12:38:42 +0200},
	Date-Modified = {2008-10-13 12:54:55 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2030/20300057.htm},
	Pages = {57-71},
	Ps = {http://www3.iie.cnam.fr/~pons/PAPERS/fossacs01.ps.gz},
	Title = {Type Isomorphisms and Proof Reuse in Dependent Type Theory.},
	Topics = {team},
	Type_Publi = {icolcomlec},
	Url = {http://www3.iie.cnam.fr/~pons/PAPERS/fossacs01.pdf},
	Year = {2001},
	Bdsk-Url-1 = {http://www3.iie.cnam.fr/~pons/PAPERS/fossacs01.pdf}}

@inproceedings{REYNOLDS80,
	Abstract = {A generalization of many-sorted algebras, called category-sorted
algebras, is defined and applied to the language-design problem of avoiding
anomalies in the interaction of implicit conversions and generic operators.
The definition of a simple imperative language (without any binding mechanisms)
is used as an example.},
	Address = {Berlin},
	Author = {Reynolds, John C.},
	Booksubtitle = {Proceedings of a Workshop},
	Booktitle = {Semantics-Directed Compiler Generation},
	Checked = {22 August 1990},
	Date-Added = {2008-10-13 11:28:20 +0200},
	Date-Modified = {2008-10-13 11:28:20 +0200},
	Dates = {January 14--18},
	Editor = {Neil D. Jones},
	Filename = {cattheodesign},
	Pages = {211--258},
	Place = {Aarhus, Denmark},
	Publisher = {Springer-Verlag},
	Reprint = {Reprinted in \authorcite{Gunter and Mitchell} \crosscite[pages~25--64]{GUNTER94}},
	Series = {Lecture Notes in Computer Science},
	Title = {Using Category Theory to Design Implicit Conversions and Generic Operators},
	Updated = {9 May 2001},
	Volume = {94},
	Year = {1980}}

@article{breazu91a,
	Address = {biblioth{\`e}que D{\'e}mons},
	Author = {Val Breazu-Tannen and Thierry Coquand and Carl A. Gunter},
	Date-Added = {2008-10-13 11:21:36 +0200},
	Date-Modified = {2008-10-13 11:21:36 +0200},
	Journal = {INofrmation and computation},
	Number = 1,
	Pages = {172-221},
	Title = {Inheritance as implicit coercion},
	Volume = 93,
	Year = 1991}

@inproceedings{Gregoire-Leroy-02,
	Abstract = {Motivated by applications to proof assistants based on dependent
types, we develop and prove correct a strong reducer and
$\beta$-equivalence checker for the $\lambda$-calculus with products,
sums, and guarded fixpoints.  Our approach is based on compilation to
the bytecode of an abstract machine performing weak reductions on
non-closed terms, derived with minimal modifications from the ZAM
machine used in the Objective Caml bytecode interpreter, and
complemented by a recursive ``read back'' procedure.  An
implementation in the Coq proof assistant demonstrates important
speed-ups compared with the original interpreter-based implementation
of strong reduction in Coq.},
	Author = {Benjamin Gr{\'e}goire and Xavier Leroy},
	Crossref = {icfp02},
	Date-Added = {2008-10-12 16:18:19 +0200},
	Date-Modified = {2008-10-13 14:41:19 +0200},
	Pages = {235--246},
	Title = {A compiled implementation of strong reduction},
	Url = {http://pauillac.inria.fr/~xleroy/publi/strong-reduction.pdf},
	Bdsk-Url-1 = {http://pauillac.inria.fr/~xleroy/publi/strong-reduction.pdf}}

@article{debruijn72,
	Author = {Nikolas. G. de Bruijn},
	Date-Added = {2008-10-12 10:26:13 +0200},
	Date-Modified = {2008-10-12 10:26:13 +0200},
	Journal = {Proc. of the Koninklijke Nederlands Akademie},
	Number = 5,
	Pages = {380--392},
	Title = {Lambda Calculus with nameless dummies, a tool for automatic formula manipulation, with application to the {Church-Rosser} theorem},
	Volume = 75,
	Year = 1972}

@misc{PiSigma,
	Author = {Nicolas Oury and Thorsten Altenkirch},
	Date-Added = {2008-10-11 23:25:42 +0200},
	Date-Modified = {2008-10-13 14:44:33 +0200},
	Howpublished = {Prototype available on the web},
	Title = {PiSigma},
	Url = {http://sneezy.cs.nott.ac.uk/cgi-bin/PiSigma},
	Year = {2008},
	Bdsk-Url-1 = {http://sneezy.cs.nott.ac.uk/cgi-bin/PiSigma}}

@article{kaplan-tarjan-99,
	Author = {Haim Kaplan and Robert E. Tarjan},
	Date-Added = {2008-10-11 20:42:51 +0200},
	Date-Modified = {2008-10-11 20:42:51 +0200},
	Journal = jacm,
	Number = {5},
	Pages = {577--603},
	Title = {Purely functional, real-time deques with catenation},
	Url = {http://www.math.tau.ac.il/~haimk/bob.ps},
	Volume = {46},
	Year = {1999},
	Bdsk-Url-1 = {http://www.math.tau.ac.il/~haimk/bob.ps}}

@phdthesis{ChlipalaPhD,
	Author = {Adam Chlipala},
	Date-Added = {2008-10-11 15:40:51 +0200},
	Date-Modified = {2008-10-11 15:46:21 +0200},
	Number = {UCB/EECS-2007-113},
	School = {University of California at Berkeley},
	Title = {Implementing Certified Programming Language Tools in Dependent Type Theory},
	Type = {{Technical Report}},
	Url = {http://adam.chlipala.net/papers/ChlipalaPhD/},
	Year = {2007},
	Bdsk-Url-1 = {http://adam.chlipala.net/papers/ChlipalaPhD/}}

@incollection{barendregt92,
	Author = {Henk Barendregt},
	Booktitle = {Handbook of Logic in Computer Science},
	Date-Added = {2008-10-11 13:33:30 +0200},
	Date-Modified = {2008-10-11 23:44:54 +0200},
	Doi = {10.1.1.26.4391},
	Editor = {{Abramsky et al.}},
	Publisher = {Oxford Univ. Press},
	Title = {Typed lambda calculi},
	Topics = {lambda-calculus},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4391&rep=rep1&type=pdf},
	Year = 1993,
	Bdsk-Url-1 = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4391&rep=rep1&type=pdf},
	Bdsk-Url-2 = {http://dx.doi.org/10.1.1.26.4391}}

@misc{mpriextract,
	Author = {Christine Paulin-Mohring},
	Date-Added = {2008-10-11 11:30:04 +0200},
	Date-Modified = {2008-10-11 14:27:19 +0200},
	Howpublished = {Notes de cours du MPRI},
	Title = {Extraction de programmes et r{\'e}alisabilit{\'e}},
	Url = {http://logical.inria.fr/mpri/notes/cours006.html},
	Year = {2008},
	Bdsk-Url-1 = {http://logical.inria.fr/mpri/notes/cours006.html}}

@book{girard:pointaveugle,
	Author = {Jean-Yves Girard},
	Date-Added = {2008-10-10 17:39:54 +0200},
	Date-Modified = {2008-10-13 14:41:00 +0200},
	Month = {Juillet},
	Publisher = {Hermann},
	Series = {Visions des sciences},
	Title = {Le point aveugle: tome 1. Cours de Logique, Vers la perfection.},
	Url = {http://iml.univ-mrs.fr/~girard/},
	Volume = {1},
	Year = {2006},
	Bdsk-Url-1 = {http://iml.univ-mrs.fr/~girard/}}

@book{fromfregetogodel,
	Abstract = {{<p>  The fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for the first time. Modern logic, heralded by Leibniz, may be said to have been initiated by Boole, De Morgan, and Jevons, but it was the publication in 1879 of Gottlob Frege's <i>Begriffsschrift</i> that opened a great epoch in the history of logic by presenting, in full-fledged form, the propositional calculus and quantification theory.  </p><p>  Frege's book, translated in its entirety, begins the present volume. The emergence of two new fields, set theory and foundations of mathematics, on the borders of logic, mathematics, and philosophy, is depicted by the texts that follow. Peano and Dedekind illustrate the trend that led to <i>Principia Mathematica</i>. Burali-Forti, Cantor, Russell, Richard, and K\"{o}nig mark the appearance of the modern paradoxes. Hilbert, Russell, and Zermelo show various ways of overcoming these paradoxes and initiate, respectively, proof theory, the theory of types, and axiomatic set theory. Skolem generalizes L\"{o}wenheim's theorem, and he  and Fraenkel amend Zermelo's axiomatization of set theory, while von Neumann offers a somewhat different system. The controversy between Hubert and Brouwer during the twenties is presented in papers of theirs and in others by Weyl, Bernays, Ackermann, and Kolmogorov. The volume concludes with papers by Herbrand and by G\"{o}del, including the latter's famous incompleteness paper.  </p><p>  Of the forty-five contributions here collected all but five are presented <i>in extenso</i>. Those not originally written in English have been translated with exemplary care and exactness; the translators are themselves mathematical logicians as well as skilled interpreters of sometimes obscure texts. Each paper is introduced by a note that sets it in perspective, explains its importance, and points out difficulties in interpretation. Editorial comments and footnotes are interpolated where needed, and an extensive bibliography is included.  </p>}},
	Author = {van Heijenoort, Jean},
	Citeulike-Article-Id = {616905},
	Date-Added = {2008-10-10 16:29:59 +0200},
	Date-Modified = {2008-10-10 16:30:11 +0200},
	Howpublished = {Paperback},
	Isbn = {0674324498},
	Keywords = {frege, godel, logic},
	Month = {January},
	Posted-At = {2006-05-07 22:17:38},
	Priority = {2},
	Publisher = {{Harvard University Press}},
	Title = {From Frege to G\"{o}del : A Source Book in Mathematical Logic, 1879-1931 (Source Books in the History of the Sciences)},
	Url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/0674324498},
	Year = {2002},
	Bdsk-Url-1 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20%5C&amp;path=ASIN/0674324498}}

@inproceedings{DBLP:conf/types/Geuvers94,
	Author = {Herman Geuvers},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1994},
	Date-Added = {2008-10-09 16:29:47 +0200},
	Date-Modified = {2008-10-09 16:33:04 +0200},
	Pages = {14-38},
	Title = {A short and flexible proof of Strong Normalization for the Calculus of Constructions},
	Url = {http://www.cs.ru.nl/~herman/PUBS/BRABasSNCC.ps.gz},
	Year = {1994},
	Bdsk-Url-1 = {http://www.cs.ru.nl/~herman/PUBS/BRABasSNCC.ps.gz}}

@proceedings{DBLP:conf/types/1994,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-10-09 16:29:47 +0200},
	Date-Modified = {2008-10-09 16:29:47 +0200},
	Editor = {Peter Dybjer and Bengt Nordstr{\"o}m and Jan M. Smith},
	Isbn = {3-540-60579-7},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Workshop TYPES'94, B{\aa}stad, Sweden, June 6-10, 1994, Selected Papers},
	Volume = {996},
	Year = {1995}}

@inproceedings{DBLP:conf/lics/GeuversW94,
	Author = {Herman Geuvers and Benjamin Werner},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {LICS},
	Crossref = {DBLP:conf/lics/LICS9},
	Date-Added = {2008-10-09 16:10:11 +0200},
	Date-Modified = {2008-10-09 16:10:42 +0200},
	Pages = {320-329},
	Title = {On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study},
	Url = {http://www.cs.ru.nl/~herman/PUBS/LICS94_FixCR.ps.gz},
	Year = {1994},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.ru.nl/~herman/PUBS/LICS94_FixCR.ps.gz}}

@inproceedings{chargueraud-pottier-08,
	Author = {Arthur Chargu{\'e}raud and Fran{\c c}ois Pottier},
	Booktitle = icfp,
	Date-Added = {2008-10-09 15:49:05 +0200},
	Date-Modified = {2008-12-04 15:56:07 +0100},
	Month = sep,
	Title = {Functional Translation of a Calculus of Capabilities},
	Url = {http://cristal.inria.fr/~fpottier/publis/chargueraud-pottier-capabilities.pdf},
	Year = {2008},
	Bdsk-Url-1 = {http://cristal.inria.fr/~fpottier/publis/chargueraud-pottier-capabilities.pdf}}

@article{filliatre-00,
	Author = {Jean-Christophe Filli{\^a}tre},
	Date-Added = {2008-10-09 15:48:40 +0200},
	Date-Modified = {2008-10-09 15:51:48 +0200},
	Journal = jfp,
	Month = jul,
	Number = {4},
	Pages = {709--745},
	Title = {Verification of Non-Functional Programs using Interpretations in Type Theory},
	Url = {http://www.lri.fr/~filliatr/ftp/publis/jphd.ps.gz},
	Volume = {13},
	Year = {2003},
	Bdsk-Url-1 = {http://www.lri.fr/~filliatr/ftp/publis/jphd.ps.gz}}

@inproceedings{sage-06,
	Author = {Jessica Gronski and Kenneth Knowles and Aaron Tomb and Stephen N. Freund and Cormac Flanagan},
	Booktitle = {Scheme and Functional Programming},
	Date-Added = {2008-10-09 15:42:28 +0200},
	Date-Modified = {2008-10-09 15:42:28 +0200},
	Month = sep,
	Title = {{Sage}: Hybrid Checking for Flexible Specifications},
	Url = {http://www.cs.williams.edu/~freund/papers/06-sfp.pdf},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.williams.edu/~freund/papers/06-sfp.pdf}}

@article{DBLP:journals/entcs/LovasP08,
	Author = {William Lovas and Frank Pfenning},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-10-09 15:20:41 +0200},
	Date-Modified = {2008-10-09 15:20:41 +0200},
	Ee = {http://dx.doi.org/10.1016/j.entcs.2007.09.021},
	Journal = {Electr. Notes Theor. Comput. Sci.},
	Pages = {113-128},
	Title = {A Bidirectional Refinement Type System for LF},
	Volume = {196},
	Year = {2008}}

@phdthesis{McKinnaPhD,
	Author = {James Hugh McKinna},
	Date-Added = {2008-10-09 14:37:07 +0200},
	Date-Modified = {2008-10-09 14:40:05 +0200},
	Read = {Oui},
	School = {Edinburgh University},
	Title = {Deliverables: a categorical approach to program development in type theory},
	Url = {http://www.lfcs.inf.ed.ac.uk/reports/92/ECS-LFCS-92-247/},
	Year = {1992},
	Bdsk-Url-1 = {http://www.lfcs.inf.ed.ac.uk/reports/92/ECS-LFCS-92-247/}}

@inproceedings{DBLP:conf/mkm/Cruz-FilipeGW04,
	Author = {Lu\'{\i}s Cruz-Filipe and Herman Geuvers and Freek Wiedijk},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MKM},
	Crossref = {DBLP:conf/mkm/2004},
	Date-Added = {2008-10-09 13:56:04 +0200},
	Date-Modified = {2008-10-09 13:57:13 +0200},
	Ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3119{\&}spage=88},
	Pages = {88-103},
	Title = {C-CoRN, the Constructive Coq Repository at Nijmegen},
	Url = {http://www.cs.ru.nl/~herman/PUBS/ccorn.pdf},
	Year = {2004},
	Bdsk-Url-1 = {http://www.cs.ru.nl/~herman/PUBS/ccorn.pdf}}

@proceedings{DBLP:conf/mkm/2004,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MKM},
	Date-Added = {2008-10-09 13:56:04 +0200},
	Date-Modified = {2008-10-09 13:56:04 +0200},
	Editor = {Andrea Asperti and Grzegorz Bancerek and Andrzej Trybulec},
	Isbn = {3-540-23029-7},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings},
	Volume = {3119},
	Year = {2004}}

@article{DBLP:journals/corr/abs-0809-1552,
	Author = {Russell O'Connor and Bas Spitters},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-10-09 13:51:21 +0200},
	Date-Modified = {2008-10-09 13:51:21 +0200},
	Ee = {http://arxiv.org/abs/0809.1552},
	Journal = {CoRR},
	Title = {A computer verified, monadic, functional implementation of the integral},
	Volume = {abs/0809.1552},
	Year = {2008}}

@phdthesis{CaprettaPhD,
	Address = {The Netherlands},
	Author = {Venanzio Capretta},
	Date-Added = {2008-10-09 13:45:50 +0200},
	Date-Modified = {2008-10-09 13:46:47 +0200},
	Keywords = {setoids type theory},
	Month = {April},
	School = {University of Nijmegen},
	Title = {Abstraction and Computation},
	Url = {http://www.cs.ru.nl/~venanzio/publications/Abstraction_Computation.pdf},
	Year = {2002},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.ru.nl/~venanzio/publications/Abstraction_Computation.pdf}}

@article{barthe03jfp,
	Author = {Gilles Barthe and Venanzio Capretta and Olivier Pons},
	Date-Added = {2008-10-09 13:34:21 +0200},
	Date-Modified = {2008-10-09 13:34:21 +0200},
	Journal = jfp,
	Number = {2},
	Pages = {261--293},
	Title = {Setoids in type theory},
	Url = {http://www3.iie.cnam.fr/~pons/PAPERS/setoid.ps.gz},
	Volume = {13},
	Year = {2003},
	Bdsk-Url-1 = {http://www3.iie.cnam.fr/~pons/PAPERS/setoid.ps.gz}}

@book{JacobsB:cltt,
	Author = {Jacobs, Bart},
	Date-Added = {2008-10-09 13:17:06 +0200},
	Date-Modified = {2008-10-13 14:41:35 +0200},
	Publisher = {Elsevier Science},
	Read = {Oui},
	Title = {Categorical Logic and Type Theory},
	Url = {http://www.cs.ru.nl/B.Jacobs/CLT/bookinfo.html},
	Year = 1999,
	Bdsk-Url-1 = {http://www.cs.ru.nl/B.Jacobs/CLT/bookinfo.html}}

@inproceedings{DBLP:conf/types/Hofmann93,
	Author = {Martin Hofmann},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1993},
	Date-Added = {2008-10-09 13:12:56 +0200},
	Date-Modified = {2008-10-09 13:14:12 +0200},
	Pages = {166-190},
	Title = {Elimination of Extensionality in Martin-L{\"o}f Type Theory},
	Url = {http://www.springerlink.com/content/p29l737l49117u34/},
	Year = {1993},
	Bdsk-Url-1 = {http://www.springerlink.com/content/p29l737l49117u34/}}

@book{MARTINLOF84,
	Address = {Naples, Italy},
	Author = {Martin-L{\"o}f, Per},
	Checked = {19 January 1988},
	Date-Added = {2008-10-09 13:03:43 +0200},
	Date-Modified = {2008-10-09 13:03:43 +0200},
	Isbn = {88-7088-105-9},
	Pages = {ix+91},
	Publisher = {Bibliopolis},
	Title = {Intuitionistic Type Theory},
	Year = {1984}}

@inproceedings{DBLP:conf/lics/SalvesenS88,
	Author = {Anne Salvesen and Jan M. Smith},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {LICS},
	Crossref = {DBLP:conf/lics/LICS3},
	Date-Added = {2008-10-09 12:55:45 +0200},
	Date-Modified = {2008-10-09 12:56:14 +0200},
	Pages = {384-391},
	Pdf = {https://eprints.kfupm.edu.sa/71405/1/71405.pdf},
	Title = {The Strength of the Subset Type in Martin-L{\"o}f's Type Theory},
	Year = {1988}}

@proceedings{DBLP:conf/lics/LICS3,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {LICS},
	Date-Added = {2008-10-09 12:55:45 +0200},
	Date-Modified = {2008-10-09 12:55:45 +0200},
	Publisher = {IEEE Computer Society},
	Title = {Proceedings, Third Annual Symposium on Logic in Computer Science, 5-8 July 1988, Edinburgh, Scotland, UK},
	Year = {1988}}

@article{pierce-turner-00,
	Author = {Benjamin C. Pierce and David N. Turner},
	Date-Added = {2008-10-08 22:17:53 +0200},
	Date-Modified = {2008-10-08 22:17:53 +0200},
	Journal = toplas,
	Month = jan,
	Number = {1},
	Pages = {1--44},
	Title = {Local Type Inference},
	Url = {http://doi.acm.org/10.1145/345099.345100},
	Volume = {22},
	Year = {2000},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/345099.345100}}

@inproceedings{freeman91,
	Address = {HC 602},
	Author = {Tim Freeman and Frank Pfenning},
	Booktitle = {Proc. {ACM} {SIGPLAN} Conf. on Programming Language Design and Implementation},
	Date-Added = {2008-10-08 22:14:29 +0200},
	Date-Modified = {2008-10-09 14:58:51 +0200},
	Title = {Refinement Types for {ML}},
	Url = {http://www.cs.cmu.edu/~fp/papers/pldi91.pdf},
	Year = 1991,
	Bdsk-Url-1 = {http://www.cs.cmu.edu/~fp/papers/pldi91.pdf}}

@article{simplify05,
	Author = {David Detlefs and Greg Nelson and James B. Saxe},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-10-08 21:28:06 +0200},
	Date-Modified = {2008-10-08 21:28:06 +0200},
	Ee = {http://doi.acm.org/10.1145/1066100.1066102},
	Journal = {J. ACM},
	Number = {3},
	Pages = {365-473},
	Title = {Simplify: a theorem prover for program checking.},
	Volume = {52},
	Year = {2005}}

@inproceedings{DBLP:conf/types/MagnussonN93,
	Author = {Lena Magnusson and Bengt Nordstr{\"o}m},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1993},
	Date-Added = {2008-10-08 10:45:41 +0200},
	Date-Modified = {2008-10-08 10:47:30 +0200},
	Pages = {213-237},
	Title = {The ALF Proof Editor and Its Proof Engine},
	Url = {http://www.springerlink.com/content/f437316686106358/},
	Year = {1993},
	Bdsk-Url-1 = {http://www.springerlink.com/content/f437316686106358/}}

@phdthesis{CornesPhD,
	Author = {Cristina Cornes},
	Date-Added = {2008-10-08 09:11:04 +0200},
	Date-Modified = {2019-10-18 15:02:57 +0200},
	Keywords = {dependent types pattern matching unification},
	Month = {Novembre},
	School = {Universit\'e Paris 7},
	Title = {Conception d'un langage de haut niveau de repr{\'e}sentation de preuves: R{\'e}currence par filtrage de motifs, Unification en pr{\'e}sesence de types inductifs primitifs, Synth{\`e}se de lemmes d'inversion},
	Year = {1997},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.fing.edu.uy/~cornes/Papers/These.ps}}

@inproceedings{Leroy-compcert-06,
	Abstract = {This paper reports on the development and formal certification (proof
of semantic preservation) of a compiler from Cminor (a C-like
imperative language) to PowerPC assembly code, using the Coq proof
assistant both for programming the compiler and for proving its
correctness.  Such a certified compiler is useful in the context of
formal methods applied to the certification of critical software: the
certification of the compiler guarantees that the safety properties
proved on the source code hold for the executable compiled code as well.},
	Author = {Xavier Leroy},
	Booktitle = {33rd symposium Principles of Programming Languages},
	Date-Added = {2008-10-07 15:11:08 +0200},
	Date-Modified = {2008-10-07 15:11:08 +0200},
	Pages = {42--54},
	Publisher = {ACM Press},
	Title = {Formal certification of a compiler back-end, or: programming a compiler with a proof assistant},
	Url = {http://gallium.inria.fr/~xleroy/publi/compiler-certif.pdf},
	Urlpublisher = {http://doi.acm.org/10.1145/1111037.1111042},
	Xtopic = {compcert},
	Year = 2006,
	Bdsk-Url-1 = {http://gallium.inria.fr/~xleroy/publi/compiler-certif.pdf}}

@unpublished{Leroy-backend-08,
	Abstract = {
This article describes the development and formal verification (proof
of semantic preservation) of a compiler back-end from Cminor (a simple
imperative intermediate 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
formal methods applied to the certification of critical software: the
verification of the compiler guarantees that the safety properties
proved on the source code hold for the executable compiled code as
well.  (Much extended and revised version of \cite{Leroy-compcert-06}.)},
	Author = {Xavier Leroy},
	Date-Added = {2008-10-07 15:08:56 +0200},
	Date-Modified = {2008-10-07 15:08:56 +0200},
	Month = JUL,
	Note = {Submitted},
	Title = {A formally verified compiler back-end},
	Url = {http://gallium.inria.fr/~xleroy/publi/compcert-backend.pdf},
	Xtopic = {compcert},
	Year = 2008,
	Bdsk-Url-1 = {http://gallium.inria.fr/~xleroy/publi/compcert-backend.pdf}}

@inproceedings{DBLP:conf/fm/BlazyDL06,
	Author = {Sandrine Blazy and Zaynah Dargaye and Xavier Leroy},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FM},
	Crossref = {DBLP:conf/fm/2006},
	Date-Added = {2008-10-07 14:57:27 +0200},
	Date-Modified = {2008-10-07 14:57:44 +0200},
	Ee = {http://dx.doi.org/10.1007/11813040_31},
	Pages = {460-475},
	Pdf = {http://gallium.inria.fr/~dargaye/publications/cfront.pdf},
	Title = {Formal Verification of a C Compiler Front-End},
	Year = {2006}}

@proceedings{DBLP:conf/fm/2006,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FM},
	Date-Added = {2008-10-07 14:57:27 +0200},
	Date-Modified = {2008-10-07 14:57:27 +0200},
	Editor = {Jayadev Misra and Tobias Nipkow and Emil Sekerinski},
	Isbn = {3-540-37215-6},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings},
	Volume = {4085},
	Year = {2006}}

@mastersthesis{glondu:master,
	Author = {St{\'e}phane Glondu},
	Date-Added = {2008-10-07 14:53:55 +0200},
	Date-Modified = {2008-10-07 14:54:48 +0200},
	School = {Universit{\'e} Paris 7},
	Title = {Garantie formelle de correction pour l'extraction Coq},
	Url = {http://stephane.glondu.net/rapport2007.pdf},
	Year = {2007},
	Bdsk-Url-1 = {http://stephane.glondu.net/rapport2007.pdf}}

@misc{compcert,
	Author = {Gallium and Marelle and CEDRIC and PPS},
	Date-Added = {2008-10-07 14:47:44 +0200},
	Date-Modified = {2008-10-07 15:23:24 +0200},
	Howpublished = {Compilers You Can \emph{Formally} Trust},
	Title = {The {C}omp{C}ert project},
	Url = {http://compcert.inria.fr/index.html},
	Year = {2008},
	Bdsk-Url-1 = {http://compcert.inria.fr/index.html}}

@inproceedings{CPwTP-icfp05,
	Abstract = {{
Applied Type System (ATS) is recently proposed as a framework for
designing and formalizing (advanced) type systems in support of practical
programming. In ATS, the definition of type equality involves a
constraint relation, which may or may not be algorithmically decidable.  To
support practical programming, we adopted a design in the past that imposes
certain restrictions on the syntactic form of constraints so that some
effective means can be found for solving constraints automatically.
Evidently, this is a rather {\em ad hoc} design in its nature.  In this
paper, we rectify the situation by presenting a fundamentally different
design, which we claim to be both novel and practical. Instead of imposing
syntactical restrictions on constraints, we provide a means for the
programmer to construct proofs that attest to the validity of
constraints. In particular, we are to accommodate a programming paradigm
that enables the programmer to combine programming with theorem proving.
Also we present some concrete examples in support of the practicality this
design.
}},
	Address = {Tallinn, Estonia},
	Author = {Chiyan Chen and Hongwei Xi},
	Booktitle = {Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming},
	Date-Added = {2008-10-07 14:20:56 +0200},
	Date-Modified = {2008-10-07 14:21:20 +0200},
	Month = {September},
	Pages = {66--77},
	Pdf = {http://www.cs.bu.edu/~hwxi/academic/papers/icfp05.pdf},
	Read = {Oui},
	Title = {{Combining Programming with Theorem Proving}},
	Year = 2005}

@article{Barthe:2006gp,
	Abstract = {We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the intended function as an inductive relation. Then it proves that the relation actually represents a function, which is by construction the function that we are trying to define. Then, we generate induction and inversion principles, and a fixpoint equation for proving other properties of the function. Our tool builds upon state-of-the-art techniques for defining recursive functions, and can also be used to generate executable functions from inductive descriptions of their graph. We illustrate the benefits of our tool on two case studies. },
	Author = {Barthe, Gilles and Forest, Julien and Pichardie, David and Rusu, Vlad},
	Date-Added = {2008-10-07 00:22:10 +0200},
	Date-Modified = {2008-10-07 11:57:06 +0200},
	Doi = {10.1007/11737414_9},
	Journal = {Functional and Logic Programming},
	Pages = {114--129},
	Pdf = {http://www.irisa.fr/vertecs/Publis/Ps/2006-FLOPS.pdf},
	Title = {{D}efining and {R}easoning {A}bout {R}ecursive {F}unctions: {A} {P}ractical {T}ool for the {C}oq {P}roof {A}ssistant},
	Year = {2006},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11737414_9}}

@inproceedings{DBLP:conf/tphol/Barras00,
	Author = {Bruno Barras},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2000},
	Date-Added = {2008-10-07 00:13:39 +0200},
	Date-Modified = {2008-10-07 11:58:31 +0200},
	Pages = {17-37},
	Title = {Programming and {C}omputing in {HOL}},
	Url = {http://www.springerlink.com/content/m115j378141x6234/},
	Year = {2000},
	Bdsk-Url-1 = {http://www.springerlink.com/content/m115j378141x6234/}}

@inproceedings{DBLP:conf/popl/McKinna06,
	Author = {James McKinna},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Crossref = {DBLP:conf/popl/2006},
	Date-Added = {2008-10-06 23:34:36 +0200},
	Date-Modified = {2008-10-06 23:34:36 +0200},
	Ee = {http://doi.acm.org/10.1145/1111037.1111038},
	Pages = {1},
	Title = {Why dependent types matter},
	Year = {2006}}

@proceedings{DBLP:conf/popl/2006,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Date-Added = {2008-10-06 23:34:36 +0200},
	Date-Modified = {2008-10-06 23:34:36 +0200},
	Editor = {J. Gregory Morrisett and Simon L. Peyton Jones},
	Isbn = {1-59593-027-2},
	Publisher = {ACM},
	Title = {Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006},
	Year = {2006}}

@inproceedings{DBLP:conf/mfcs/McKinnaB93,
	Author = {James McKinna and Rod M. Burstall},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MFCS},
	Crossref = {DBLP:conf/mfcs/1993},
	Date-Added = {2008-10-06 23:31:58 +0200},
	Date-Modified = {2008-10-06 23:32:23 +0200},
	Pages = {32-67},
	Title = {Deliverables: A Categorial Approach to Program Development in Type Theory},
	Url = {http://www.lfcs.inf.ed.ac.uk/reports/92/ECS-LFCS-92-242/ECS-LFCS-92-242.ps},
	Year = {1993},
	Bdsk-Url-1 = {http://www.lfcs.inf.ed.ac.uk/reports/92/ECS-LFCS-92-242/ECS-LFCS-92-242.ps}}

@proceedings{DBLP:conf/mfcs/1993,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MFCS},
	Date-Added = {2008-10-06 23:31:58 +0200},
	Date-Modified = {2008-10-06 23:31:58 +0200},
	Editor = {Andrzej M. Borzyszkowski and Stefan Sokolowski},
	Isbn = {3-540-57182-5},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings},
	Volume = {711},
	Year = {1993}}

@inproceedings{DBLP:conf/types/McBride96,
	Author = {Conor McBride},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1996},
	Date-Added = {2008-10-06 23:26:41 +0200},
	Date-Modified = {2008-10-07 14:14:07 +0200},
	Pages = {236-253},
	Title = {Inverting {I}nductively {D}efined {R}elations in {LEGO}},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.7471&rep=rep1&type=pdf},
	Year = {1996},
	Bdsk-Url-1 = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.7471&rep=rep1&type=pdf}}

@inproceedings{MartinLofP:ittpp,
	Author = {Per Martin-L{\"o}f},
	Booktitle = {Logic Colloquium 1973},
	Date-Added = {2008-10-06 22:54:14 +0200},
	Date-Modified = {2008-10-06 23:26:31 +0200},
	Editors = {Rose, E.H. and Sheperdson J.C.},
	Pages = {73--118},
	Poublisher = {North-Holland},
	Title = {An intuitionistic theory of types, Predicative part},
	Year = {1975}}

@article{DowekHardinKirchner,
	Author = {Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude Kirchner},
	Date-Added = {2008-10-06 19:47:52 +0200},
	Date-Modified = {2008-10-13 14:38:23 +0200},
	Journal = jar,
	Pages = {33--72},
	Title = {Theorem Proving Modulo},
	Topics = {logical},
	Url = {http://www.inria.fr/rrrt/rr-3400.html},
	Volume = 31,
	Year = 2003,
	Bdsk-Url-1 = {http://www.inria.fr/rrrt/rr-3400.html}}

@phdthesis{dowek91phd,
	Author = {Gilles Dowek},
	Date-Added = {2008-10-06 19:45:27 +0200},
	Date-Modified = {2008-10-07 14:09:44 +0200},
	School = {Universit\'e Paris 7},
	Title = {D{\'e}monstration automatique dans le calcul des constructions},
	Type = thesedoctorat,
	Url = {http://cat.inist.fr/?aModele=afficheN&cpsidt=151166},
	Year = 1991,
	Bdsk-Url-1 = {http://cat.inist.fr/?aModele=afficheN&cpsidt=151166}}

@inproceedings{DBLP:conf/icalp/Gimenez98,
	Author = {Eduardo Gim{\'e}nez},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ICALP},
	Crossref = {DBLP:conf/icalp/1998},
	Date-Added = {2008-10-06 14:57:05 +0200},
	Date-Modified = {2008-10-06 14:58:04 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/1443/14430397.htm},
	Pages = {397-408},
	Pdf = {https://eprints.kfupm.edu.sa/67190/1/67190.pdf},
	Title = {Structural Recursive Definitions in Type Theory},
	Year = {1998}}

@proceedings{DBLP:conf/icalp/1998,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ICALP},
	Date-Added = {2008-10-06 14:57:05 +0200},
	Date-Modified = {2008-10-06 14:57:05 +0200},
	Editor = {Kim Guldstrand Larsen and Sven Skyum and Glynn Winskel},
	Isbn = {3-540-64781-3},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
	Volume = {1443},
	Year = {1998}}

@phdthesis{boutin97These,
	Author = {Samuel Boutin},
	Date-Added = {2008-10-05 17:56:36 +0200},
	Date-Modified = {2008-10-17 00:51:41 +0200},
	Month = {April},
	Read = {Oui},
	School = {Paris 7},
	Title = {R{\'e}flexions sur les quotients},
	Type = {th{\`e}se d'Universit{\'e}},
	Url = {http://pauillac.inria.fr/~boutin/publi_w/these.ps.gz},
	Year = {1997},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://pauillac.inria.fr/~boutin/publi_w/these.ps.gz}}

@inproceedings{DBLP:conf/types/CornesT95,
	Author = {Cristina Cornes and Delphine Terrasse},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/1995},
	Date-Added = {2008-10-05 17:05:24 +0200},
	Date-Modified = {2008-10-07 11:58:04 +0200},
	Pages = {85-104},
	Title = {Automating {I}nversion of {I}nductive {P}redicates in {C}oq},
	Url = {http://www.fing.edu.uy/~cornes/Papers/inversion.ps.gz},
	Year = {1995},
	Bdsk-Url-1 = {http://www.fing.edu.uy/~cornes/Papers/inversion.ps.gz}}

@manual{coq:refman:8.2,
	Author = {{The {Coq} development team}},
	Date-Added = {2008-10-05 12:08:54 +0200},
	Date-Modified = {2008-10-05 12:09:56 +0200},
	Organization = {INRIA},
	Publisher = {INRIA TypiCal},
	Read = {Oui},
	Title = {Coq 8.2 Reference Manual},
	Url = {http://coq.inria.fr/V8.2beta4/doc/refman/html/},
	Year = {2008},
	Bdsk-Url-1 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/Reference-Manual027.html},
	Bdsk-Url-2 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/}}

@misc{coquand92baastad,
	Author = {Thierry Coquand},
	Date-Added = {2008-10-04 23:17:56 +0200},
	Date-Modified = {2008-10-13 14:37:16 +0200},
	Note = {Proceedings of the Workshop on Logical Frameworks},
	Title = {Pattern Matching with Dependent Types},
	Url = {http://www.cs.chalmers.se/~coquand/pattern.ps},
	Year = 1992,
	Bdsk-Url-1 = {http://www.cs.chalmers.se/~coquand/pattern.ps}}

@inproceedings{coquand86,
	Address = {HC 145},
	Author = {Thierry Coquand},
	Crossref = {lics86},
	Date-Added = {2008-10-04 23:17:33 +0200},
	Date-Modified = {2008-10-04 23:17:33 +0200},
	Title = {An analysis of {G}irard's Paradox},
	Topics = {logic},
	Year = 1986}

@inproceedings{DBLP:conf/csl/BlanquiJS07,
	Author = {Fr{\'e}d{\'e}ric Blanqui and Jean-Pierre Jouannaud and Pierre-Yves Strub},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/2007},
	Date-Added = {2008-10-04 15:45:48 +0200},
	Date-Modified = {2008-10-04 15:45:48 +0200},
	Ee = {http://dx.doi.org/10.1007/978-3-540-74915-8_26},
	Pages = {328-342},
	Title = {Building Decision Procedures in the Calculus of Inductive Constructions},
	Year = {2007}}

@proceedings{DBLP:conf/csl/2007,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Date-Added = {2008-10-04 15:45:48 +0200},
	Date-Modified = {2008-10-04 15:45:48 +0200},
	Editor = {Jacques Duparc and Thomas A. Henzinger},
	Isbn = {978-3-540-74914-1},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings},
	Volume = {4646},
	Year = {2007}}

@phdthesis{GimenezPhD,
	Author = {Carlos Eduardo Gim{\'e}nez},
	Date-Added = {2008-10-04 15:25:18 +0200},
	Date-Modified = {2019-10-18 14:55:43 +0200},
	Month = {D{\'e}cembre},
	Read = {Oui},
	School = {Ecole Normale Sup\'{e}rieure de Lyon},
	Title = {Un calcul de constructions infinies et son application {\`a} la v{\'e}rification de syst{\`e}mes communicants},
	Url = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD96-11.ps.Z},
	Year = {1996},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {ftp://ftp.inria.fr/INRIA/LogiCal/Eduardo.Gimenez/thesis.ps.gz}}

@inproceedings{Let2008,
	Author = {Pierre Letouzey},
	Booktitle = {{Logic and Theory of Algorithms, Fourth Conference on Computability in Europe, CiE 2008}},
	Date-Added = {2008-10-02 13:00:50 +0200},
	Date-Modified = {2008-10-13 14:42:56 +0200},
	Editor = {A. Beckmann and C. Dimitracopoulos and B. L{\"o}we},
	Pdf = {http://www.pps.jussieu.fr/~letouzey/download/letouzey_extr_cie08.pdf},
	Publisher = {Springer-Verlag},
	Read = {Oui},
	Series = {Lecture Notes in Computer Science},
	Title = {{Coq Extraction, an Overview}},
	Volume = 5028,
	Year = 2008}

@phdthesis{hofmann95These,
	Author = {Martin Hofmann},
	Date-Added = {2008-10-02 12:43:18 +0200},
	Date-Modified = {2008-10-13 14:42:34 +0200},
	School = {Edinburgh university},
	Title = {Extensional concepts in intensional type theory},
	Type = {PhD thesis},
	Url = {http://www.lfcs.inf.ed.ac.uk/reports/95/ECS-LFCS-95-327/},
	Year = {1995},
	Bdsk-Url-1 = {http://www.lfcs.inf.ed.ac.uk/reports/95/ECS-LFCS-95-327/}}

@article{hoffmann82toplas,
	Author = {C. M. Hoffmann and Michael J. O'Donnell},
	Date-Added = {2008-10-02 11:38:43 +0200},
	Date-Modified = {2008-10-02 11:38:43 +0200},
	Journal = {Transactions on Programming Languages and Systems},
	Month = jan,
	Number = 1,
	Pages = {83--112},
	Title = {Programming with equations},
	Volume = 4,
	Year = 1982}

@inproceedings{sheard-04,
	Author = {Tim Sheard},
	Booktitle = oopsla,
	Date-Added = {2008-10-01 16:42:17 +0200},
	Date-Modified = {2008-10-01 16:42:17 +0200},
	Month = oct,
	Pages = {116--119},
	Title = {Languages of the Future},
	Url = {http://doi.acm.org/10.1145/1028664.1028711},
	Year = {2004},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/1028664.1028711}}

@misc{ICFPC07,
	Author = {ICFPC},
	Date-Added = {2008-10-01 16:34:01 +0200},
	Date-Modified = {2008-10-04 22:42:52 +0200},
	Month = {juillet},
	Note = {Organized by the Software Technology group at Utrecht University},
	Title = {The 10th ICFP Programming Contest},
	Url = {http://save-endo.cs.uu.nl/},
	Year = {2007},
	Bdsk-Url-1 = {http://save-endo.cs.uu.nl/}}

@article{DBLP:journals/jsyml/Dybjer00,
	Author = {Peter Dybjer},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-10-01 16:32:51 +0200},
	Date-Modified = {2008-10-01 16:32:51 +0200},
	Journal = {J. Symb. Log.},
	Number = {2},
	Pages = {525-549},
	Title = {A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory},
	Volume = {65},
	Year = {2000}}

@inproceedings{okasaki-96,
	Author = {Chris Okasaki},
	Booktitle = icfp,
	Date-Added = {2008-10-01 16:29:00 +0200},
	Date-Modified = {2008-10-01 16:29:00 +0200},
	Month = may,
	Pages = {62--72},
	Title = {The role of lazy evaluation in amortized data structures},
	Url = {http://www.eecs.usma.edu/webs/people/okasaki/icfp96.ps},
	Year = {1996},
	Bdsk-Url-1 = {http://www.eecs.usma.edu/webs/people/okasaki/icfp96.ps}}

@techreport{okasaki-phd-96,
	Author = {Chris Okasaki},
	Date-Added = {2008-10-01 16:28:06 +0200},
	Date-Modified = {2008-10-01 16:28:06 +0200},
	Institution = {School of Computer Science, Carnegie Mellon University},
	Month = sep,
	Number = {CMU-CS-96-177},
	Title = {Purely Functional Data Structures},
	Url = {http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf},
	Year = {1996},
	Bdsk-Url-1 = {http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf}}

@inproceedings{FilLet2004,
	Author = {Jean-Christophe Filli{\^a}tre and Pierre Letouzey},
	Booktitle = {{European Symposium on Programing, ESOP'2004}},
	Date-Added = {2008-10-01 16:23:17 +0200},
	Date-Modified = {2008-10-13 14:37:55 +0200},
	Editor = {D. Schmidt},
	Publisher = {Springer-Verlag},
	Series = {Lecture Notes in Computer Science},
	Title = {{Functors for Proofs and Programs}},
	Url = {http://www.lri.fr/~filliatr/ftp/publis/fpp.ps.gz},
	Volume = 2986,
	Year = 2004,
	Bdsk-Url-1 = {http://www.lri.fr/~filliatr/ftp/publis/fpp.ps.gz}}

@inproceedings{DBLP:conf/fossacs/BarrasB08,
	Author = {Bruno Barras and Bruno Bernardo},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FoSSaCS},
	Crossref = {DBLP:conf/fossacs/2008},
	Date-Added = {2008-10-01 16:07:07 +0200},
	Date-Modified = {2008-10-01 16:07:07 +0200},
	Ee = {http://dx.doi.org/10.1007/978-3-540-78499-9_26},
	Pages = {365-379},
	Title = {The Implicit Calculus of Constructions as a Programming Language with Dependent Types},
	Year = {2008}}

@proceedings{DBLP:conf/fossacs/2008,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FoSSaCS},
	Date-Added = {2008-10-01 16:07:07 +0200},
	Date-Modified = {2008-10-01 16:07:07 +0200},
	Editor = {Roberto M. Amadio},
	Isbn = {978-3-540-78497-5},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings},
	Volume = {4962},
	Year = {2008}}

@article{DBLP:journals/spe/BoehmAP95,
	Author = {Hans-Juergen Boehm and Russell R. Atkinson and Michael F. Plass},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-10-01 15:58:12 +0200},
	Date-Modified = {2008-10-01 15:58:27 +0200},
	Journal = {Softw., Pract. Exper.},
	Number = {12},
	Pages = {1315-1330},
	Pdf = {http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol25/issue12/spe986.pdf},
	Title = {Ropes: An Alternative to Strings},
	Volume = {25},
	Year = {1995}}

@inproceedings{CruLet2005,
	Author = {Lu\'{\i}s Cruz-Filipe and Pierre Letouzey},
	Booktitle = {{12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus'2005}},
	Date-Added = {2008-10-01 15:38:11 +0200},
	Date-Modified = {2008-10-13 14:36:51 +0200},
	Note = {{To appear}},
	Pdf = {http://www.pps.jussieu.fr/~letouzey/download/lcf_pl_extr05.pdf},
	Title = {{A Large-Scale Experiment in Executing Extracted Programs}},
	Year = 2005}

@inproceedings{DBLP:conf/lics/HofmannS94,
	Author = {Martin Hofmann and Thomas Streicher},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {LICS},
	Crossref = {DBLP:conf/lics/LICS9},
	Date-Added = {2008-09-28 22:17:46 +0200},
	Date-Modified = {2008-10-02 12:49:27 +0200},
	Pages = {208-212},
	Read = {Oui},
	Title = {A Groupoid Model Refutes Uniqueness of Identity Proofs},
	Url = {http://www.tcs.informatik.uni-muenchen.de/~mhofmann/SH.dvi.gz},
	Year = {1994},
	Bdsk-Url-1 = {http://www.tcs.informatik.uni-muenchen.de/~mhofmann/SH.dvi.gz}}

@book{Streicher91,
	Author = {Thomas Streicher},
	Date-Added = {2008-09-28 22:15:52 +0200},
	Date-Modified = {2008-09-28 22:15:52 +0200},
	Publisher = springer,
	Title = {Semantics of Type Theory},
	Year = 1991}

@unpublished{ghani-hosc07,
	Author = {Neil Ghani and Patricia Johann},
	Date-Added = {2008-09-28 13:16:26 +0200},
	Date-Modified = {2008-10-01 16:47:05 +0200},
	Note = {Submitted to the Journal of Higher Order and Symbolic Computation},
	Pdf = {http://www.cs.nott.ac.uk/~nxg/papers/ghani-hosc08.pdf},
	Title = {Programming with Nested Types: A Principled Approach.},
	Year = {2007}}

@inproceedings{ghani-popl07,
	Author = {Neil Ghani and Patricia Johann},
	Booktitle = {Proceedings of Principles and Programming Languages (POPL), 2008},
	Date-Added = {2008-09-28 13:16:03 +0200},
	Date-Modified = {2008-09-28 13:17:25 +0200},
	Pages = {297-308},
	Pdf = {http://www.cs.nott.ac.uk/~nxg/papers/ghani-popl08.pdf},
	Read = {Oui},
	Title = {Foundations for Structured Programming with GADTs},
	Year = {2008}}

@inbook{sozeau.Coq/manual/setoid,
	Author = {Matthieu Sozeau},
	Chapter = {User defined equalities and relations},
	Date-Added = {2008-09-26 10:31:45 +0200},
	Date-Modified = {2018-12-20 21:14:38 +0100},
	Publisher = {Inria},
	Read = {Oui},
	Title = {Coq Reference Manual},
	Url = {http://coq.inria.fr/V8.2rc2/doc/refman/html/Reference-Manual029.html},
	Year = {2008--2018},
	Bdsk-Url-1 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/Reference-Manual029.html},
	Bdsk-Url-2 = {http://coq.inria.fr/V8.2rc2/doc/refman/html/Reference-Manual029.html}}

@inbook{sozeau.Coq/manual/Program,
	Author = {Matthieu Sozeau},
	Chapter = {Program},
	Date-Added = {2008-09-26 10:27:18 +0200},
	Date-Modified = {2018-12-20 21:14:15 +0100},
	Publisher = {Inria},
	Read = {Oui},
	Title = {Coq Reference Manual},
	Url = {http://coq.inria.fr/V8.2rc2/doc/refman/html/Reference-Manual027.html},
	Year = {2008--2018},
	Bdsk-Url-1 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/Reference-Manual027.html},
	Bdsk-Url-2 = {http://coq.inria.fr/V8.2rc2/doc/refman/html/Reference-Manual027.html}}

@inbook{sozeau.Coq/manual/typeclasses,
	Author = {Matthieu Sozeau},
	Chapter = {Type Classes},
	Date-Added = {2008-09-26 10:18:40 +0200},
	Date-Modified = {2018-12-20 21:14:30 +0100},
	Publisher = {Inria},
	Read = {Oui},
	Title = {Coq Reference Manual},
	Url = {http://coq.inria.fr/doc/refman/html/Reference-Manual024.html},
	Year = {2008--2018},
	Bdsk-Url-1 = {http://coq.inria.fr/V8.2beta4/doc/refman/html/Reference-Manual024.html},
	Bdsk-Url-2 = {http://coq.inria.fr/V8.2rc2/doc/refman/html/Reference-Manual024.html},
	Bdsk-Url-3 = {http://coq.inria.fr/doc/refman/html/Reference-Manual024.html}}

@article{swierstra:la-carte,
	Author = {Wouter Swierstra},
	Date-Added = {2008-09-11 15:54:19 +0200},
	Date-Modified = {2008-09-11 15:54:41 +0200},
	Journal = {Journal of Functional Programming},
	Month = {July},
	Number = {4},
	Pages = {423--436},
	Pdf = {http://www.cs.nott.ac.uk/~wss/Publications/DataTypesALaCarte.pdf},
	Read = {Oui},
	Title = {Data types \`a la carte},
	Volume = {18},
	Year = {2008}}

@inproceedings{altenkirch-mcbride-wierstra:ott-now,
	Address = {Freiburg, Germany},
	Author = {Thorsten Altenkirch and Conor McBride and Wouter Swierstra},
	Booktitle = {PLPV'07},
	Date-Added = {2008-09-11 15:53:26 +0200},
	Date-Modified = {2014-02-10 14:17:15 +0000},
	Pdf = {http://www.cs.nott.ac.uk/~txa/publ/obseqnow.pdf},
	Read = {Oui},
	Title = {Observational Equality, Now!},
	Year = {2007},
	Bdsk-File-1 = { }}

@phdthesis{ParentPhd,
	Author = {Catherine Parent},
	Date-Added = {2008-09-10 22:42:06 +0200},
	Date-Modified = {2008-09-10 22:44:10 +0200},
	Read = {Oui},
	School = {ENS Lyon},
	Title = {Synth{\`e}se de preuves de programmes dans le Calcul des Constructions Inductives},
	Url = {http://www-verimag.imag.fr/~parent/These/main.ps},
	Year = {1995},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www-verimag.imag.fr/~parent/These/main.ps}}

@phdthesis{LetouzeyPhd,
	Author = {Pierre Letouzey},
	Date-Added = {2008-09-10 22:10:33 +0200},
	Date-Modified = {2008-10-01 15:39:49 +0200},
	Month = jul,
	School = ups,
	Title = {Programmation fonctionnelle certifi{\'e}e: l'extraction de programmes dans l'assistant {Coq}},
	Topics = {team},
	Type = these,
	Type_Publi = {these},
	Url = {http://www.pps.jussieu.fr/~letouzey/download/these_letouzey.pdf},
	Year = 2004,
	Bdsk-Url-1 = {http://www.pps.jussieu.fr/~letouzey/download/these_letouzey.pdf}}

@article{journals/toplas/Castagna95,
	Address = {New York, NY, USA},
	Author = {Giuseppe Castagna},
	Date-Added = {2008-09-10 21:54:03 +0200},
	Date-Modified = {2008-09-10 22:14:05 +0200},
	Doi = {http://doi.acm.org/10.1145/203095.203096},
	Issn = {0164-0925},
	Journal = {ACM Trans. Program. Lang. Syst.},
	Number = {3},
	Pages = {431--447},
	Publisher = {ACM},
	Read = {Oui},
	Title = {Covariance and contravariance: conflict without a cause},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=203096&type=pdf&coll=GUIDE&dl=GUIDE&CFID=2321643&CFTOKEN=26586263},
	Volume = {17},
	Year = {1995},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=203096&type=pdf&coll=GUIDE&dl=GUIDE&CFID=2321643&CFTOKEN=26586263},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/203095.203096}}

@inproceedings{augustsson98cayenne,
	Address = {Baltimore, Maryland, United States},
	Author = {Lennart Augustsson},
	Booktitle = {ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2008-09-10 20:59:52 +0200},
	Date-Modified = {2008-09-10 21:01:15 +0200},
	Doi = {http://doi.acm.org/10.1145/289423.289451},
	Isbn = {1-58113-024-4},
	Pages = {239--250},
	Publisher = {ACM},
	Title = {Cayenne --- a language with dependent types},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=289451&type=pdf&coll=GUIDE&dl=GUIDE&CFID=2351448&CFTOKEN=28940269},
	Year = {1998},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=289451&type=pdf&coll=GUIDE&dl=GUIDE&CFID=2351448&CFTOKEN=28940269},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/289423.289451}}

@inproceedings{DBLP:conf/types/GianantonioM02,
	Author = {Pietro Di Gianantonio and Marino Miculan},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2002},
	Date-Added = {2008-09-09 23:12:48 +0200},
	Date-Modified = {2008-09-09 23:12:48 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2646/26460148.htm},
	Pages = {148-161},
	Title = {A Unifying Approach to Recursive and Co-recursive Definitions},
	Year = {2002},
	Bdsk-File-1 = { }}

@misc{sozeau.Coq/order,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-09-09 16:47:41 +0200},
	Date-Modified = {2008-09-09 16:49:36 +0200},
	Howpublished = {Coq development},
	Read = {Oui},
	Title = {{O}rder theory using type classes in {C}oq},
	Web = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/coq},
	Year = {2008}}

@misc{fulger:labels,
	Address = {Tallinn, Estonia},
	Author = {Diana Fulger},
	Date-Added = {2008-09-09 16:01:40 +0200},
	Date-Modified = {2008-09-09 16:03:30 +0200},
	Howpublished = {Talk at the EffTT Small TYPES Workshop},
	Month = {December},
	Pdf = {http://cs.ioc.ee/efftt/fulger-slides.pdf},
	Title = {Reasoning about effects: tree labelling},
	Year = {2007},
	Bdsk-File-1 = { }}

@inproceedings{REYNOLDS83,
	Author = {Reynolds, John C.},
	Booktitle = {Information Processing 83, Paris, France},
	Checked = {checked January 1988},
	Date-Added = {2008-09-09 11:10:27 +0200},
	Date-Modified = {2008-09-10 20:32:56 +0200},
	Editor = {R. E. A. Mason},
	Fulladdress = {Amsterdam},
	Fullpublisher = {Elsevier Science Publishers B. V. (North-Holland)},
	Pages = {513--523},
	Publisher = elsevier,
	Source = {reynolds bib, with corrections from physical copy},
	Title = {Types, Abstraction, and Parametric Polymorphism},
	Url = {http://mathgate.info/cebrown/notes/reynolds83.php},
	Year = {1983},
	Bdsk-Url-1 = {http://mathgate.info/cebrown/notes/reynolds83.php}}

@article{mcbride:concon,
	Abstract = {We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constructions follow a two-level approach---they require less work than the standard techniques which inspired them [11,8]. Moreover, given a suitably heterogeneous notion of equality, they extend without difficulty to inductive families of datatypes. These constructions are vital components of the translation from dependently typed programs in pattern matching style [7] to the equivalent programs expressed in terms of induction principles [21] and as such play a crucial behind-the-scenes rle in Epigram [25]. },
	Author = {McBride, Conor and Goguen, Healfdene and McKinna, James},
	Date-Added = {2008-09-07 01:31:03 +0200},
	Date-Modified = {2008-10-07 01:22:26 +0200},
	Doi = {10.1007/11617990_12},
	Journal = {Types for Proofs and Programs},
	Pages = {186--200},
	Pdf = {http://www.e-pig.org/downloads/concon.pdf},
	Read = {Oui},
	Title = {{A} {F}ew {C}onstructions on {C}onstructors},
	Year = {2004},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11617990_12}}

@phdthesis{norell:thesis,
	Address = {SE-412 96 G\"{o}teborg, Sweden},
	Author = {Ulf Norell},
	Date-Added = {2008-09-05 01:52:25 +0200},
	Date-Modified = {2010-02-18 14:07:32 -0500},
	Keywords = {agda},
	Month = {September},
	Pdf = {http://www.cs.chalmers.se/~ulfn/papers/thesis.pdf},
	Read = {Oui},
	School = {Department of Computer Science and Engineering, Chalmers University of Technology},
	Title = {Towards a practical programming language based on dependent type theory},
	Url = {http://www.cs.chalmers.se/~ulfn/papers/thesis.html},
	Year = 2007,
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.chalmers.se/~ulfn/papers/thesis.html}}

@inproceedings{DBLP:conf/csl/Miquel03,
	Author = {Alexandre Miquel},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/2003},
	Date-Added = {2008-09-03 16:52:46 +0200},
	Date-Modified = {2008-09-03 19:14:25 +0200},
	Ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2803{\&}spage=441},
	Pages = {441-454},
	Pdf = {http://www.pps.jussieu.fr/~miquel/publis/csl03.pdf},
	Title = {A {S}trongly {N}ormalising {C}urry-{H}oward {C}orrespondence for {I{Z}{F}} {S}et {T}heory},
	Year = {2003},
	Bdsk-File-1 = { }}

@proceedings{DBLP:conf/csl/2003,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Date-Added = {2008-09-03 16:52:46 +0200},
	Date-Modified = {2008-09-03 16:52:46 +0200},
	Editor = {Matthias Baaz and Johann A. Makowsky},
	Isbn = {3-540-40801-0},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Computer Science Logic, 17th International Workshop, {C}{S}{L} 2003, 12th {A}nnual {C}onference of the {E}{A}{C}{S}{L}, and 8th {K}urt {G}{\"o}del {C}olloquium, {K}{G}{C} 2003, {V}ienna, {A}ustria, {A}ugust 25-30, 2003, {P}roceedings},
	Volume = {2803},
	Year = {2003}}

@article{Corbineau:2004qp,
	Abstract = {In this paper we present a contraction-free sequent calculus including inductive definitions for the first-order intuitionistic logic. We show that it is a natural extension to Dyckhoff's LJT calculus and we prove the contraction- and cut-elimination properties, thus extending Dyckhoff's result, in order to validate its use as a basis for proof-search procedures. Finally we describe the proof-search strategy used in our implementation as a tactic in the Coq proof assistant {$[$}2{$]$}.},
	Author = {Corbineau, Pierre},
	Date-Added = {2008-08-28 15:24:44 +0200},
	Date-Modified = {2008-08-28 15:24:44 +0200},
	Journal = {Types for Proofs and Programs},
	Pages = {162--177},
	Title = {First-{O}rder {R}easoning in the {C}alculus of {I}nductive {C}onstructions},
	Ty = {CHAPTER},
	Url = {http://www.springerlink.com/content/h5gecycqu69jcwq3},
	Year = {2004},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.springerlink.com/content/h5gecycqu69jcwq3}}

@inproceedings{paulin93tlca,
	Author = {Christine Paulin-Mohring},
	Booktitle = {Typed Lambda Calculi and Applications},
	Date-Added = {2008-08-28 15:00:17 +0200},
	Date-Modified = {2008-09-10 22:52:02 +0200},
	Pages = {328--345},
	Publisher = SV,
	Series = LNCS,
	Title = {{I}nductive {D}efinitions in the {S}ystem {Coq} - {R}ules and {P}roperties},
	Topics = {team},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.5387&rep=rep1&type=pdf},
	Volume = 664,
	Year = 1993,
	Bdsk-Url-1 = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.5387&rep=rep1&type=pdf}}

@article{COQUAND88,
	Author = {Thierry Coquand and G\'{e}rard Huet},
	Date-Added = {2008-08-28 14:10:57 +0200},
	Date-Modified = {2008-09-22 14:05:39 +0200},
	Journal = {Information and Computation},
	Key = {Coquand88},
	Month = {February/March},
	Number = {2--3},
	Pages = {95--120},
	Pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-0530.pdf},
	Source = {ergobib},
	Title = {The {C}alculus of {C}onstructions},
	Volume = {76},
	Year = {1988},
	Bdsk-File-1 = { }}

@misc{sozeau.Coq/classes/proval08,
	Address = {Orsay},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-08-27 19:20:35 +0200},
	Date-Modified = {2008-08-27 19:20:46 +0200},
	Howpublished = {Talk given at the {P}ro{V}al workgroup},
	Keywords = {Type classes},
	Month = {3rd March},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-LRI-030308.pdf},
	Read = {Oui},
	Title = {{F}irst-{C}lass {T}ype {C}lasses, in {C}oq},
	Type = {slides},
	Year = {2008}}

@techreport{Luo92,
	Author = {Zhaohui Luo and Robert Pollack},
	Date-Added = {2008-08-07 16:39:41 +0200},
	Date-Modified = {2008-09-10 22:28:42 +0200},
	Institution = {University of Edinburgh},
	Keywords = {misc},
	Month = may,
	Number = {ECS-LFCS-92-211},
	Title = {The {L{E}{G}{O}} {P}roof {D}evelopment {S}ystem: {A} {U}ser's {M}anual},
	Url = {http://www.cs.rhul.ac.uk/~zhaohui/LEGO92.ps.gz},
	Year = {1992},
	Bdsk-Url-1 = {http://www.cs.rhul.ac.uk/~zhaohui/LEGO92.ps.gz}}

@phdthesis{Luo90,
	Author = {Zhaohui Luo},
	Date-Added = {2008-08-07 16:39:33 +0200},
	Date-Modified = {2008-09-10 22:26:55 +0200},
	Month = jun,
	School = {Department of Computer Science, University of Edinburgh},
	Title = {An {E}xtended {C}alculus of {C}onstructions},
	Url = {http://www.cs.rhul.ac.uk/~zhaohui/THESIS90.ps.gz},
	Year = 1990,
	Bdsk-Url-1 = {http://www.cs.rhul.ac.uk/~zhaohui/THESIS90.ps.gz}}

@inproceedings{DBLP:conf/csl/Luo96,
	Author = {Zhaohui Luo},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Crossref = {DBLP:conf/csl/1996},
	Date-Added = {2008-08-07 15:44:23 +0200},
	Date-Modified = {2008-09-10 22:27:38 +0200},
	Pages = {276-296},
	Title = {Coercive {S}ubtyping in {T}ype {T}heory.},
	Url = {http://www.cs.rhul.ac.uk/~zhaohui/SUBTYPING96.ps.gz},
	Year = {1996},
	Bdsk-Url-1 = {http://www.cs.rhul.ac.uk/~zhaohui/SUBTYPING96.ps.gz}}

@inproceedings{DBLP:conf/types/LuoL03,
	Author = {Yong Luo and Zhaohui Luo},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2003},
	Date-Added = {2008-08-07 15:44:23 +0200},
	Date-Modified = {2008-08-07 15:44:23 +0200},
	Ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3085{\&}spage=276},
	Pages = {276-292},
	Title = {Combining {I}ncoherent {C}oercions for {S}igma-{T}ypes.},
	Year = {2003}}

@article{DBLP:journals/tcs/LuoS99,
	Author = {Zhaohui Luo and Sergei Soloviev},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-08-07 15:44:23 +0200},
	Date-Modified = {2008-08-07 15:44:23 +0200},
	Ee = {http://www.elsevier.nl/locate/entcs/volume29.html},
	Journal = {Electr. Notes Theor. Comput. Sci.},
	Title = {Dependent {C}oercions.},
	Volume = {29},
	Year = {1999}}

@phdthesis{Barras99,
	Author = {Bruno Barras},
	Date-Added = {2008-08-07 15:41:33 +0200},
	Date-Modified = {2008-10-04 08:54:14 +0200},
	Month = nov,
	School = {Universit{\'e} Paris~7},
	Title = {Auto-validation d'un syst{\`e}me de preuves avec familles inductives},
	Type = {Th{\`e}se de Doctorat},
	Url = {http://pauillac.inria.fr/~barras/publi/these_barras.ps.gz},
	Year = 1999,
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://pauillac.inria.fr/~barras/publi/these_barras.ps.gz}}

@techreport{Barras96a,
	Author = {Bruno Barras},
	Date-Added = {2008-08-07 15:41:33 +0200},
	Date-Modified = {2008-10-04 08:54:21 +0200},
	Institution = {INRIA},
	Month = oct,
	Number = {3026},
	Pdf = {http://hal.inria.fr/docs/00/07/36/67/PDF/RR-3026.pdf},
	Title = {Coq en {C}oq},
	Type = {Rapport de Recherche},
	Year = {1996}}

@inproceedings{Barras96b,
	Address = {Aussois, France},
	Author = {Bruno Barras},
	Booktitle = {Proceedings of the 1996 Workshop on Types for Proofs and Programs},
	Date-Added = {2008-08-07 15:41:33 +0200},
	Date-Modified = {2008-10-04 08:54:30 +0200},
	Editor = {E.~Gimenez and C.~Paulin-Mohring},
	Month = dec,
	Pages = {28--45},
	Publisher = {Springer-Verlag LNCS 1512},
	Title = {Verification of the {I}nterface of a {S}mall {P}roof {S}ystem in {C}oq},
	Year = {1996}}

@article{Rushby98:TSE,
	Author = {John Rushby and Sam Owre and Natarajan Shankar},
	Date-Added = {2008-08-07 15:39:55 +0200},
	Date-Modified = {2008-10-13 14:43:27 +0200},
	Journal = {IEEE Transactions on Software Engineering},
	Month = sep,
	Number = 9,
	Pages = {709--720},
	Title = {Subtypes for {S}pecifications: {P}redicate {S}ubtyping in {P{V}{S}}},
	Url = {http://pvs.csl.sri.com/papers/subtypes98/},
	Volume = 24,
	Year = 1998,
	Bdsk-Url-1 = {http://pvs.csl.sri.com/papers/subtypes98/}}

@inproceedings{Shankar&Owre:WADT99,
	Address = {Toulouse, France},
	Author = {Natarajan Shankar and Sam Owre},
	Booktitle = {Recent Trends in Algebraic Development Techniques, {WADT '99}},
	Date-Added = {2008-08-07 15:39:43 +0200},
	Date-Modified = {2008-09-10 22:32:56 +0200},
	Editor = {Didier Bert and Christine Choppy and Peter Mosses},
	Month = sep,
	Pages = {37--52},
	Publisher = {Springer-Verlag},
	Series = {Lecture Notes in Computer Science},
	Title = {Principles and {P}ragmatics of {S}ubtyping in {P{V}{S}}},
	Url = {http://pvs.csl.sri.com/papers/wadt99/},
	Volume = 1827,
	Year = 1999,
	Bdsk-Url-1 = {http://pvs.csl.sri.com/papers/wadt99/}}

@techreport{pvs97semantics,
	Address = {Menlo Park, CA},
	Author = {Sam Owre and Natarajan Shankar},
	Date-Added = {2008-08-07 15:35:37 +0200},
	Date-Modified = {2008-09-10 22:36:36 +0200},
	Institution = {Computer Science Laboratory, SRI International},
	Month = aug,
	Number = {SRI-CSL-97-2},
	Title = {The {F}ormal {S}emantics of {P{V}{S}}},
	Url = {http://www.csl.sri.com/papers/csl-97-2/},
	Year = 1997,
	Bdsk-Url-1 = {http://www.csl.sri.com/papers/csl-97-2/}}

@manual{pvs99reference,
	Address = {Menlo Park, CA},
	Author = {Sam Owre and Natarajan Shankar and John M. Rushby and D. W. J. Stringer-Calvert},
	Date-Added = {2008-08-07 15:35:36 +0200},
	Date-Modified = {2008-10-13 14:43:50 +0200},
	Month = sep,
	Organization = {Computer Science Laboratory, SRI International},
	Pdf = {http://pvs.csl.sri.com/doc/pvs-language-reference.pdf},
	Title = {P{V}{S} {L}anguage {R}eference},
	Year = 1999}

@misc{cayenne,
	Author = {Lennart Augustsson},
	Date-Added = {2008-08-07 15:34:46 +0200},
	Date-Modified = {2008-08-07 15:34:46 +0200},
	Key = {Cayenne Web Page},
	Note = {\url{http://www.cs.chalmers.se/~augustss/cayenne/}},
	Title = {{Cayenne} --- {Hotter} than {Haskell}},
	Year = 1999}

@misc{coq:8.2,
	Author = {The Coq development team},
	Date-Added = {2008-07-30 19:04:15 +0200},
	Date-Modified = {2008-07-30 19:05:58 +0200},
	Title = {The {C}oq proof assistant, version 8.2},
	Url = {http://coq.inria.fr},
	Year = {2008},
	Bdsk-Url-1 = {http://coq.inria.fr}}

@article{Gregoire:2005rb,
	Abstract = {We present a new implementation of a reflexive tactic which solves equalities in a ring structure inside the Coq system. The efficiency is improved to a point that we can now prove equalities that were previously beyond reach. A special care has been taken to implement efficient algorithms while keeping the complexity of the correctness proofs low. This leads to a single tool, with a single implementation, which can be addressed for a ring or for a semi-ring, abstract or not, using the Leibniz equality or a setoid equality. This example shows that such reflective methods can be effectively used in symbolic computation.},
	Author = {Gr{\'e}goire, Benjamin and Mahboubi, Assia},
	Date-Added = {2008-07-30 18:59:47 +0200},
	Date-Modified = {2008-07-30 18:59:47 +0200},
	Journal = {Theorem Proving in Higher Order Logics},
	M3 = {10.1007/11541868{\_}7},
	Pages = {98--113},
	Title = {Proving {E}qualities in a {C}ommutative {R}ing {D}one {R}ight in {C}oq},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/11541868_7},
	Year = {2005},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11541868_7}}

@article{Ballarin:2006gy,
	Abstract = {The generic proof assistant Isabelle provides a landscape of specification contexts that is considerably richer than that of most other provers. Theories are the level of specification where object-logics are axiomatised. Isabelle's proof language Isar enables local exploration in contexts generated in the course of natural deduction proofs. Finally, locales, which may be seen as detached proof contexts, offer an intermediate level of specification geared towards reuse. All three kinds of contexts are structured, to different extents. We analyse the ``topology'' of Isabelle's landscape of specification contexts, by means of development graphs, in order to establish what kinds of reuse are possible. },
	Author = {Ballarin, Clemens},
	Date-Added = {2008-07-30 18:58:28 +0200},
	Date-Modified = {2008-07-30 18:58:28 +0200},
	Journal = {Mathematical Knowledge Management},
	M3 = {10.1007/11812289{\_}4},
	Pages = {31--43},
	Title = {Interpretation of {L}ocales in {I}sabelle: {T}heories and {P}roof {C}ontexts},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/11812289_4},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11812289_4}}

@inproceedings{Pfenning91lf,
	Address = {Cambridge, England},
	Author = {Frank Pfenning},
	Booktitle = {Logical Frameworks},
	Date-Added = {2008-07-30 18:54:18 +0200},
	Date-Modified = {2008-09-03 19:35:15 +0200},
	Editor = {G\'{e}rard Huet and Gordon Plotkin},
	Fullurldvi = {http://www.cs.cmu.edu/~fp/papers/lfproc91.dvi.gz},
	Fullurlps = {http://www.cs.cmu.edu/~fp/papers/lfproc91.ps.gz},
	Keywords = {LF, Elf},
	Pages = {149--181},
	Publisher = {Cambridge University Press},
	Title = {{L}ogic {P}rogramming in the {L{F}} {L}ogical {F}ramework},
	Url = {http://www.cs.cmu.edu/~fp/papers/lfproc91.ps.gz},
	Year = {1991},
	Bdsk-Url-1 = {http://www.cs.cmu.edu/~fp/papers/lfproc91.ps.gz}}

@article{chr-fundeps,
	Address = {New York, NY, USA},
	Author = {Martin Sulzmann and Gregory J. Duck and Simon Peyton-Jones and Peter J. Stuckey},
	Date-Added = {2008-07-30 18:51:36 +0200},
	Date-Modified = {2008-07-30 18:51:58 +0200},
	Doi = {http://dx.doi.org/10.1017/S0956796806006137},
	Issn = {0956-7968},
	Journal = {J. Funct. Program.},
	Number = {1},
	Pages = {83--129},
	Publisher = {Cambridge University Press},
	Title = {Understanding functional dependencies via constraint handling rules},
	Volume = {17},
	Year = {2007},
	Bdsk-Url-1 = {http://dx.doi.org/10.1017/S0956796806006137}}

@webpage{hugs,
	Date-Added = {2008-07-30 18:42:25 +0200},
	Date-Modified = {2008-07-30 19:07:04 +0200},
	Key = {Hugs},
	Title = {Hugs 98},
	Url = {http://www.haskell.org/hugs/},
	Bdsk-Url-1 = {http://www.haskell.org/hugs/}}

@webpage{ghc,
	Date-Added = {2008-07-30 18:38:51 +0200},
	Date-Modified = {2008-07-30 19:06:51 +0200},
	Key = {GHC},
	Title = {The {G}lasgow {H}askell compiler},
	Url = {http://www.haskell.org/ghc/},
	Bdsk-Url-1 = {http://www.haskell.org/ghc/}}

@inproceedings{replib,
	Address = {Portland, Oregon, USA},
	Author = {Stephanie Weirich},
	Booktitle = {Haskell '06: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell},
	Date-Added = {2008-07-30 18:21:12 +0200},
	Date-Modified = {2008-07-30 18:24:04 +0200},
	Doi = {http://doi.acm.org/10.1145/1159842.1159844},
	Isbn = {1-59593-489-8},
	Pages = {1--12},
	Publisher = {ACM},
	Title = {Rep{L}ib: a library for derivable type classes},
	Url = {http://www.seas.upenn.edu/~sweirich/RepLib/haskell08-weirich.pdf},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1159844&type=pdf&coll=GUIDE&dl=GUIDE&CFID=38908461&CFTOKEN=56666391},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1159842.1159844},
	Bdsk-Url-3 = {http://www.seas.upenn.edu/~sweirich/RepLib/haskell08-weirich.pdf}}

@inproceedings{uniplate,
	Address = {Freiburg, Germany},
	Author = {Neil Mitchell and Colin Runciman},
	Booktitle = {Haskell '07: Proceedings of the ACM SIGPLAN workshop on Haskell workshop},
	Date-Added = {2008-07-30 18:13:10 +0200},
	Date-Modified = {2008-07-30 18:13:24 +0200},
	Doi = {http://doi.acm.org/10.1145/1291201.1291208},
	Isbn = {978-1-59593-674-5},
	Pages = {49--60},
	Publisher = {ACM},
	Title = {Uniform boilerplate and list processing},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1291208&type=pdf&coll=GUIDE&dl=GUIDE&CFID=38907636&CFTOKEN=93170946},
	Year = {2007},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1291208&type=pdf&coll=GUIDE&dl=GUIDE&CFID=38907636&CFTOKEN=93170946},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1291201.1291208}}

@inproceedings{Davies97,
	Author = {Rowan Davies},
	Booktitle = {International Conference on Algebraic Methodology and Software Technology},
	Date-Added = {2008-07-30 18:07:40 +0200},
	Date-Modified = {2008-07-30 18:07:40 +0200},
	Fullissn = {0302-9743},
	Publisher = springer,
	Series = {Lecture Notes in Computer Science},
	Title = {A refinement-type checker for {S}tandard {M{L}}},
	Volume = {1349},
	Year = {1997}}

@book{Milner&90,
	Author = {Robin Milner and Mads Tofte and Robert Harper},
	Checked = yes,
	Date-Added = {2008-07-30 18:06:27 +0200},
	Date-Modified = {2008-07-30 18:06:27 +0200},
	Publisher = mp,
	Title = {The {D}efinition of {S}tandard {M{L}}},
	Year = 1990}

@inproceedings{regis-gianas-pottier-08,
	Abstract = {We present a Hoare logic for a call-by-value
                 programming language equipped with recursive,
                 higher-order functions, algebraic data types, and a
                 polymorphic type system in the style of Hindley and
                 Milner. It is the theoretical basis for a tool that
                 extracts proof obligations out of programs annotated
                 with logical assertions. These proof obligations,
                 expressed in a typed, higher-order logic, are
                 discharged using off-the-shelf automated or interactive
                 theorem provers. Although the technical apparatus that
                 we exploit is by now standard, its application to
                 functional programming languages appears to be new, and
                 (we claim) deserves attention. As a sample application,
                 we check the partial correctness of a balanced binary
                 search tree implementation.},
	Author = {Yann R{\'e}gis-Gianas and Fran{\c c}ois Pottier},
	Booktitle = {Proceedings of the Ninth International Conference on Mathematics of Program Construction (MPC'08)},
	Date-Added = {2008-07-30 15:29:27 +0200},
	Date-Modified = {2008-07-30 15:31:05 +0200},
	Month = JUL,
	Pdf = {http://cristal.inria.fr/~fpottier/publis/regis-gianas-pottier-hoarefp.pdf},
	Publisher = {Springer-Verlag},
	Series = {Lecture Notes in Computer Science},
	Title = {A {Hoare} {L}ogic for {C}all-by-{V}alue {F}unctional {P}rograms},
	Url = {http://cristal.inria.fr/~fpottier/publis/regis-gianas-pottier-hoarefp.ps.gz},
	Volume = {5133},
	Year = {2008},
	Bdsk-Url-1 = {http://cristal.inria.fr/~fpottier/publis/regis-gianas-pottier-hoarefp.ps.gz}}

@inproceedings{mu08aop,
	Address = {Berlin Heidelberg},
	Author = {Shin-Cheng Mu and Hsiang-Shang Ko and Patrik Jansson},
	Booktitle = {Mathematics of Program Construction},
	Date-Added = {2008-07-19 15:28:03 +0200},
	Date-Modified = {2008-07-19 15:41:40 +0200},
	Editor = {Philippe Audebaud and Christine Paulin-Mohring},
	Month = {July},
	Pages = {268-283},
	Pdf = {http://www.iis.sinica.edu.tw/~scm/pub/mpc08.pdf},
	Publisher = {Springer-Verlag},
	Series = {Lecture Notes in Computer Science},
	Title = {Algebra of {P}rogramming {U}sing {D}ependent {T}ypes},
	Volume = {5133},
	Year = {2008},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.iis.sinica.edu.tw/~scm/pub/mpc08.pdf}}

@article{GunterGM93,
	Address = {Duluth, MN, USA},
	Author = {Carl A. Gunter and Elsa L. Gunter and David B. MacQueen},
	Date-Added = {2008-07-11 16:19:20 +0200},
	Date-Modified = {2008-07-11 16:20:39 +0200},
	Doi = {http://dx.doi.org/10.1006/inco.1993.1070},
	Issn = {0890-5401},
	Journal = {Inf. Comput.},
	Number = {2},
	Pages = {303--323},
	Publisher = {Academic Press, Inc.},
	Read = {Oui},
	Title = {Computing {M}{L} equality kinds using abstract interpretation},
	Volume = {107},
	Year = {1993},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1006/inco.1993.1070}}

@article{ROBINSON:1993sf,
	Abstract = {Traditionally, mathematical logic has been content with  in principle' formalizations of deductive inference, which place little emphasis on the description of practical reasoning. Requirements for formal descriptions of practical inference methods are now emerging however. For example, interactive reasoning systems are needed for verification of computer systems, and should support practically convenient reasoning techniques as strongly as possible. This paper describes a proof paradigm which formalises a hierarchical, problem-reduction style of reasoning which is widely useful in practical reasoning. It is a goal directed paradigm, which gives a central role to equivalence transformations. A hierarchy of subgoals can co-exist at a single point in the proof, and these subgoals may be of arbitrary type. The approach allows good access to contextual information when transforming subgoals, and can be applied to a variety of logics. },
	Annote = {10.1093/logcom/3.1.47},
	Author = {Robinson, Peter J. and Staples, John},
	Date-Added = {2008-05-30 16:13:06 +0200},
	Date-Modified = {2008-09-03 19:36:33 +0200},
	Journal = {Journal of Logic and Computation},
	Journal1 = {J Logic Computation},
	Number = {1},
	Pages = {47--61},
	Title = {{F}ormalizing a {H}ierarchical {S}tructure of {P}ractical {M}athematical {R}easoning},
	Ty = {JOUR},
	Url = {http://logcom.oxfordjournals.org/cgi/content/abstract/3/1/47},
	Volume = {3},
	Year = {1993},
	Bdsk-Url-1 = {http://logcom.oxfordjournals.org/cgi/content/abstract/3/1/47}}

@inproceedings{DBLP:conf/types/Coen04,
	Author = {Sacerdoti Coen, Claudio},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2004},
	Date-Added = {2008-05-29 17:08:35 +0200},
	Date-Modified = {2009-01-02 13:06:29 +0100},
	Ee = {http://dx.doi.org/10.1007/11617990_7},
	Pages = {98-114},
	Read = {Oui},
	Title = {A {S}emi-reflexive {T}actic for ({S}ub-){E}quational {R}easoning},
	Year = {2004},
	Bdsk-File-1 = { }}

@proceedings{DBLP:conf/types/2004,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-05-29 17:08:35 +0200},
	Date-Modified = {2008-05-29 17:08:35 +0200},
	Editor = {Jean-Christophe Filli{\^a}tre and Christine Paulin-Mohring and Benjamin Werner},
	Isbn = {3-540-31428-8},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for {P}roofs and {P}rograms, {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2004, {J}ouy-en-{J}osas, {F}rance, {D}ecember 15-18, 2004, {R}evised {S}elected {P}apers},
	Volume = {3839},
	Year = {2006}}

@article{paulson83higherorder,
	Author = {Lawrence C. Paulson},
	Date-Added = {2008-05-29 15:50:53 +0200},
	Date-Modified = {2008-09-03 19:35:43 +0200},
	Journal = {Science of Computer Programming},
	Number = {2},
	Pages = {119--149 (or 119--150??)},
	Read = {Oui},
	Title = {{A} {H}igher-{O}rder {I}mplementation of {R}ewriting},
	Url = {http://citeseer.ist.psu.edu/paulson83higherorder.html},
	Volume = {3},
	Year = {1983},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/paulson83higherorder.html}}

@article{DBLP:journals/iandc/LampsonB88,
	Author = {Butler W. Lampson and Rod M. Burstall},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-05-26 13:16:14 +0200},
	Date-Modified = {2008-09-03 19:27:17 +0200},
	Journal = {Inf. Comput.},
	Number = {2/3},
	Pages = {278-346},
	Pdf = {http://research.microsoft.com/lampson/39-Pebble/39-Pebble.pdf},
	Read = {Oui},
	Title = {Pebble, a {K}ernel {L}anguage for {M}odules and {A}bstract {D}ata {T}ypes},
	Volume = {76},
	Year = {1988},
	Bdsk-File-1 = { }}

@misc{jhc,
	Author = {John Meacham},
	Date-Added = {2008-05-19 15:14:19 +0200},
	Date-Modified = {2008-09-03 19:29:18 +0200},
	Title = {{J{H}{C}}: {J}ohn's {H}askell {C}ompiler},
	Url = {http://repetae.net/john/computer/jhc},
	Year = {2007},
	Bdsk-Url-1 = {http://repetae.net/john/computer/jhc}}

@inproceedings{barthe95implicit,
	Author = {Gilles Barthe},
	Booktitle = {{TYPES}},
	Date-Added = {2008-05-13 21:41:54 +0200},
	Date-Modified = {2008-05-13 21:42:10 +0200},
	Pages = {1-15},
	Read = {Oui},
	Title = {Implicit {C}oercions in {T}ype {S}ystems},
	Url = {http://citeseer.ist.psu.edu/barthe95implicit.html},
	Year = {1995},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/barthe95implicit.html}}

@inproceedings{missura94using,
	Author = {Stephan A. Missura and Andreas Weber},
	Booktitle = {{AISMC}},
	Date-Added = {2008-05-13 21:22:57 +0200},
	Date-Modified = {2008-05-13 21:23:26 +0200},
	Keywords = {coercion},
	Pages = {131-143},
	Read = {Oui},
	Title = {Using {C}ommutativity {P}roperties for {C}ontrolling {C}oercions},
	Url = {http://citeseer.ist.psu.edu/missura94using.html},
	Year = {1994},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/missura94using.html}}

@misc{wenzel95using,
	Author = {Markus Wenzel},
	Date-Added = {2008-05-13 17:07:39 +0200},
	Date-Modified = {2008-10-13 14:46:50 +0200},
	Read = {Oui},
	Text = {Markus Wenzel. Using axiomatic type classes in Isabelle, a tutorial, 1995. http://www4.informatik.tu-muenchen.de/~wenzelm/papers.html.},
	Title = {Using axiomatic type classes in {I}sabelle},
	Url = {http://citeseer.ist.psu.edu/wenzel00using.html},
	Year = {1995},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/wenzel00using.html}}

@inproceedings{DBLP:conf/popl/ChakravartyKJM05,
	Author = {Manuel M. T. Chakravarty and Gabriele Keller and Simon L. Peyton Jones and Simon Marlow},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Crossref = {DBLP:conf/popl/2005},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Ee = {http://doi.acm.org/10.1145/1040305.1040306},
	Pages = {1-13},
	Title = {Associated types with class},
	Year = {2005}}

@proceedings{DBLP:conf/popl/2005,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Jens Palsberg and Mart\'{\i}n Abadi},
	Isbn = {1-58113-830-X},
	Publisher = {ACM},
	Title = {Proceedings of the 32nd ACM SIGPLAN-S{I}{G}{A}{C}{T} {S}ymposium on {P}rinciples of {P}rogramming {L}anguages, {P}{O}{P}{L} 2005, {L}ong {B}each, {C}alifornia, {U}{S}{A}, {J}anuary 12-14, 2005},
	Year = {2005}}

@inproceedings{DBLP:conf/tphol/Wenzel97,
	Author = {Markus Wenzel},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/1997},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-09-10 20:28:27 +0200},
	Pages = {307-322},
	Pdf = {http://www4.in.tum.de/~wenzelm/papers/axclass-TPHOLs97.pdf},
	Title = {Type {C}lasses and {O}verloading in {H}igher-{O}rder {L}ogic},
	Year = {1997},
	Bdsk-File-1 = { }}

@proceedings{DBLP:conf/tphol/1997,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Elsa L. Gunter and Amy P. Felty},
	Isbn = {3-540-63379-0},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 10th {I}nternational {C}onference, {T}{P}{H}{O}{L}s'97, {M}urray {H}ill, {N}{J}, {U}{S}{A}, {A}ugust 19-22, 1997, {P}roceedings},
	Volume = {1275},
	Year = {1997}}

@inproceedings{DBLP:conf/tphol/KammullerWP99,
	Author = {Florian Kamm{\"u}ller and Markus Wenzel and Lawrence C. Paulson},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/1999},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/1690/16900149.htm},
	Pages = {149-166},
	Title = {{L}ocales - {A} {S}ectioning {C}oncept for {I}sabelle},
	Year = {1999}}

@proceedings{DBLP:conf/tphol/1999,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Yves Bertot and Gilles Dowek and Andr{\'e} Hirschowitz and C. Paulin and Laurent Th{\'e}ry},
	Isbn = {3-540-66463-7},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 12th {I}nternational {C}onference, {T}{P}{H}{O}{L}s'99, {N}ice, {F}rance, {S}eptember, 1999, {P}roceedings},
	Volume = {1690},
	Year = {1999}}

@inproceedings{DBLP:conf/types/HaftmannW06,
	Author = {Florian Haftmann and Makarius Wenzel},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {types06},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-09-10 18:26:40 +0200},
	Ee = {http://dx.doi.org/10.1007/978-3-540-74464-1_11},
	Pages = {160-174},
	Title = {{C}onstructive {T}ype {C}lasses in {I}sabelle},
	Year = {2006}}

@inproceedings{DBLP:conf/tphol/WenzelP06,
	Author = {Markus Wenzel and Larry Paulson},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {The Seventeen Provers of the World},
	Crossref = {DBLP:conf/tphol/2006provers},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Ee = {http://dx.doi.org/10.1007/11542384_8},
	Pages = {41-49},
	Title = {Isabelle/{I}sar},
	Year = {2006}}

@inproceedings{DBLP:conf/tphol/HuffmanMW05,
	Author = {Brian Huffman and John Matthews and Peter White},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2005},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-10-12 09:43:16 +0200},
	Ee = {http://dx.doi.org/10.1007/11541868_10},
	Pages = {147-162},
	Title = {{A}xiomatic {C}onstructor {C}lasses in {I}sabelle/{H{O}{L}{C}{F}}},
	Url = {http://web.cecs.pdx.edu/~jmatthew/papers/HuffmanMatthewsWhite05.pdf},
	Year = {2005},
	Bdsk-Url-1 = {http://web.cecs.pdx.edu/~jmatthew/papers/HuffmanMatthewsWhite05.pdf}}

@article{DBLP:journals/jfp/MullerNOS99,
	Author = {Olaf M{\"u}ller and Tobias Nipkow and David von Oheimb and Oscar Slotosch},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Journal = {J. {F}unct. {P}rogram.},
	Number = {2},
	Pages = {191-223},
	Title = {{H{O}{L}{C}{F}}={H{O}{L}}+{L{C}{F}}},
	Volume = {9},
	Year = {1999}}

@unpublished{higherkind,
	Author = {Adriaan Moors and Frank Piessens and Martin Odersky},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Note = {submitted to ECOOP'08},
	Title = {Generics of a {H}igher {K}ind}}

@inproceedings{DBLP:conf/tphol/Pollack00,
	Author = {Robert Pollack},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2000},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-09-03 19:38:51 +0200},
	Pages = {462-479},
	Pdf = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.58.9947&rep=rep1&type=pdf},
	Title = {{D}ependently {T}yped {R}ecords for {R}epresenting {M}athematical {S}tructure},
	Year = {2000}}

@proceedings{DBLP:conf/tphol/2000,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Mark Aagaard and John Harrison},
	Isbn = {3-540-67863-8},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 13th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2000, {P}ortland, {O}regon, {U}{S}{A}, {A}ugust 14-18, 2000, {P}roceedings},
	Volume = {1869},
	Year = {2000}}

@inproceedings{185919,
	Address = {Edinburgh, Scotland},
	Author = {Tobias Nipkow},
	Booktitle = {Papers presented at the second annual Workshop on Logical environments},
	Date-Added = {2008-05-13 16:58:48 +0200},
	Date-Modified = {2008-05-13 16:58:48 +0200},
	Isbn = {0-521-43312-6},
	Pages = {164--188},
	Publisher = {Cambridge University Press},
	Title = {Order-sorted polymorphism in {I}sabelle},
	Year = {1993}}

@incollection{jones92theory,
	Address = {New York, N.Y.},
	Author = {Mark P. Jones},
	Booktitle = {{ESOP} '92, 4th European Symposium on Programming, Rennes, France, February 1992, Proceedings},
	Date-Added = {2008-05-13 16:07:27 +0200},
	Date-Modified = {2008-05-13 16:07:27 +0200},
	Editor = {Bernd Krieg-Bruckner},
	Pages = {287-306},
	Publisher = {Springer-Verlag},
	Title = {A {T}heory of {Q}ualified {T}ypes},
	Url = {http://citeseer.ist.psu.edu/jones92theory.html},
	Volume = {582},
	Year = {1992},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/jones92theory.html}}

@inproceedings{DBLP:conf/popl/NipkowP93,
	Author = {Tobias Nipkow and Christian Prehofer},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {POPL},
	Date-Added = {2008-05-13 15:54:36 +0200},
	Date-Modified = {2008-09-03 19:20:37 +0200},
	Pages = {409-418},
	Pdf = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.42.6449&rep=rep1&type=pdf},
	Read = {Oui},
	Title = {{T}ype {C}hecking {T}ype {C}lasses},
	Year = {1993},
	Bdsk-File-1 = { }}

@inproceedings{DBLP:conf/fpca/NipkowS91,
	Author = {Tobias Nipkow and Gregor Snelting},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FPCA},
	Crossref = {DBLP:conf/fpca/1991},
	Date-Added = {2008-05-13 15:53:50 +0200},
	Date-Modified = {2008-09-03 19:34:18 +0200},
	Pages = {1-14},
	Title = {{T}ype {C}lasses and {O}verloading {R}esolution via {O}rder-{S}orted {U}nification},
	Url = {http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=128029},
	Year = {1991},
	Bdsk-Url-1 = {http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=128029}}

@proceedings{DBLP:conf/fpca/1991,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {FPCA},
	Date-Added = {2008-05-13 15:53:50 +0200},
	Date-Modified = {2008-05-13 15:53:50 +0200},
	Editor = {John Hughes},
	Isbn = {3-540-54396-1},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Functional {P}rogramming {L}anguages and {C}omputer {A}rchitecture, 5th {A}{C}{M} {C}onference, {C}ambridge, {M}{A}, {U}{S}{A}, {A}ugust 26-30, 1991, {P}roceedings},
	Volume = {523},
	Year = {1991}}

@book{Nipkow-Paulson-Wenzel:2002,
	Author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
	Date-Added = {2008-05-13 15:49:13 +0200},
	Date-Modified = {2008-05-13 15:49:13 +0200},
	Publisher = {Springer},
	Series = {LNCS},
	Title = {Isabelle/{H}{O}{L} --- {A} {P}roof {A}ssistant for {H}igher-{O}rder {L}ogic},
	Volume = 2283,
	Year = 2002}

@inproceedings{Kahl-Scheffczyk-2001,
	Abstract = {Although the functional programming language Haskell
              has a powerful type class system,
              users frequently run into situations
              where they would like to be able to define or adapt
              instances of type classes
              only \emph{after} the remainder of a component has been produced.
              However, Haskell's type class system
              essentially only allows late binding
              of type class constraints on free type variables,
              and not on uses of type class members
              at variable-free types.
               
              In the current paper we propose a language extension that
              enhances the late binding capabilities of Haskell type classes,
              and provides more flexible means for type class instantiation.
              The latter is achieved via \emph{named instances}
              that do not participate in automatic context reduction,
              but can only be used for late binding.
              By combining this capability with the automatic aspects
              of the Haskell type class system,
              we arrive at an essentially conservative extension
              that greatly improves flexibility of programming
              using type classes and opens up new structuring principles
              for Haskell library design.
              
              We exemplify our extension
              through the sketch of some applications 
              and show how our approach could be used
              to explain or subsume other language features 
              as for example implicit parameters.
              We present a typed lambda-calculus for our extension
              and provide a working prototype type checker on the basis of 
              Mark Jones' ``Typing Haskell in Haskell''.},
	Author = {Wolfram Kahl and Jan Scheffczyk},
	Crossref = {Haskell2001},
	Date-Added = {2008-05-13 15:15:59 +0200},
	Date-Modified = {2008-09-03 19:32:04 +0200},
	Read = {Oui},
	Title = {{N}amed {I}nstances for {H}askell {T}ype {C}lasses},
	Url = {http://ist.unibw-muenchen.de/Haskell/NamedInstances/},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://ist.unibw-muenchen.de/Haskell/NamedInstances/}}

@proceedings{Haskell2001,
	Booktitle = {Proc.\null{} Haskell Workshop 2001},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-07-30 18:09:20 +0200},
	Editor = {Ralf Hinze},
	Series = ENTCS,
	Title = {Proc.\null{} {H}askell {W}orkshop 2001, {F}irenze},
	Volume = {59},
	Year = {2001}}

@inproceedings{DBLP:conf/esop/Jones00,
	Author = {Mark P. Jones},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ESOP},
	Crossref = {DBLP:conf/esop/2000},
	Date-Added = {2008-05-13 14:48:50 +0200},
	Date-Modified = {2008-05-13 14:48:50 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/1782/17820230.htm},
	Pages = {230-244},
	Title = {Type {C}lasses with {F}unctional {D}ependencies},
	Year = {2000},
	Bdsk-File-1 = { }}

@article{betarte00type,
	Author = {Gustavo Betarte},
	Date-Added = {2008-05-13 14:45:08 +0200},
	Date-Modified = {2008-05-13 14:45:08 +0200},
	Journal = {Journal of Functional Programming},
	Number = {2},
	Pages = {137-166},
	Title = {Type checking dependent (record) types and subtyping},
	Url = {http://citeseer.ist.psu.edu/article/betarte00type.html},
	Volume = {10},
	Year = {2000},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/article/betarte00type.html}}

@incollection{Cardelli:TypecheckingDependentTypes,
	Annote = {1988},
	Author = {Luca Cardelli},
	Booktitle = {Foundations of Logic and Functional Programming, Trento, Italy, ({\rm December, 1986})},
	Opteditor = {M. Boscarol and L. Carlucci Aiello and G. Levi},
	Pages = {45--57},
	Publisher = springer,
	Series = lncs,
	Source = {Leavens},
	Title = {Typechecking {D}ependent {T}ypes and {S}ubtypes},
	Volume = {306},
	Year = {1988}}

@inproceedings{WadlerBlott89,
	Author = {Philip Wadler and Stephen Blott},
	Booktitle = popl89,
	Date-Modified = {2008-09-03 19:23:24 +0200},
	Pages = {60--76},
	Title = {How {T}o {M}ake {\em ad-hoc} {P}olymorphism {L}ess {\em ad hoc}},
	Url = {http://portal.acm.org/citation.cfm?id=75277.75283},
	Year = {1989},
	Bdsk-Url-1 = {http://portal.acm.org/citation.cfm?id=75277.75283}}

@inproceedings{Wadler89,
	Author = {Philip Wadler},
	Booktitle = fpca89,
	Checked = yes,
	Date-Modified = {2008-09-10 20:43:49 +0200},
	Month = sep,
	Optnote = {Imperial College, London},
	Pages = {347--359},
	Read = {Oui},
	Title = {Theorems for {F}ree!},
	Url = {http://homepages.inf.ed.ac.uk/wadler/papers/free/free.ps},
	Year = 1989,
	Bdsk-Url-1 = {http://homepages.inf.ed.ac.uk/wadler/papers/free/free.ps}}

@incollection{Wadler:MFFP,
	Author = {Philip Wadler},
	Booktitle = {Marktoberdorf Summer School on Program Design Calculi},
	Editor = {M. Broy},
	Month = Aug,
	Note = {Also in J. Jeuring and E. Meijer, editors, Advanced Functional Programming, Springer Verlag, LNCS 925, 1995.},
	Publisher = sv,
	Series = {NATO ASI Series F: Computer and systems sciences},
	Title = {Monads for functional programming},
	Volume = 118,
	Year = 1992}

@article{wadler99marriage,
	Author = {Philip Wadler},
	Date-Modified = {2008-09-11 15:50:50 +0200},
	Journal = {{ACM} {T}ransactions on Computational Logic},
	Number = 1,
	Pages = {1--32},
	Read = {Oui},
	Title = {The marriage of effects and monads},
	Volume = 4,
	Year = 2003}

@article{Hall:1996:TCH,
	Author = {Cordelia V. Hall and Kevin Hammond and Simon L. {Peyton Jones} and Philip L. Wadler},
	Bibdate = {Tue Aug 13 11:46:35 MDT 1996},
	Coden = {ATPSDT},
	Fullissn = {0164-0925},
	Fullurl = {http://www.acm.org/pubs/toc/Abstracts/0164-0925/227700.html},
	Journal = {ACM Transactions on Programming Languages and Systems},
	Month = mar,
	Number = {2},
	Pages = {109--138},
	Title = {Type classes in {Haskell}},
	Volume = {18},
	Year = {1996}}

@misc{wadler90,
	Author = {Philip Wadler},
	Howpublished = {University of Glasgow},
	Month = mar,
	Title = {Comprehending {M}onads},
	Year = 1990}

@misc{wadler85,
	Author = {Philip Wadler},
	Date-Modified = {2008-10-01 16:21:02 +0200},
	Howpublished = {Oxford University},
	Month = jan,
	Title = {Views . {A} {W}ay for elegant definitions and efficient representations to coexist},
	Url = {http://homepages.inf.ed.ac.uk/wadler/papers/view/view.ps},
	Year = 1985,
	Bdsk-Url-1 = {http://homepages.inf.ed.ac.uk/wadler/papers/view/view.ps}}

@inproceedings{DBLP:conf/tphol/GonthierMRTT07,
	Author = {Georges Gonthier and Assia Mahboubi and Laurence Rideau and Enrico Tassi and Laurent Th{\'e}ry},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2007},
	Date-Added = {2008-04-05 01:09:42 +0200},
	Date-Modified = {2008-04-05 01:10:13 +0200},
	Ee = {http://dx.doi.org/10.1007/978-3-540-74591-4_8},
	Pages = {86-101},
	Read = {Oui},
	Title = {A {M}odular {F}ormalisation of {F}inite {G}roup {T}heory},
	Year = {2007},
	Bdsk-File-1 = { }}

@article{vytinioitis:freetheorems,
	Address = {Amsterdam, The Netherlands, The Netherlands},
	Author = {Dimitrios Vytiniotis and Stephanie Weirich},
	Date-Added = {2008-04-01 18:18:07 +0200},
	Date-Modified = {2008-09-09 11:22:42 +0200},
	Doi = {http://dx.doi.org/10.1016/j.entcs.2007.02.043},
	Issn = {1571-0661},
	Journal = {Electron. Notes Theor. Comput. Sci.},
	Pages = {357--373},
	Pdf = {http://www.seas.upenn.edu/~sweirich/papers/rtheorems07.pdf},
	Publisher = {Elsevier Science Publishers B. V.},
	Read = {Oui},
	Title = {Free {T}heorems and {R}untime {T}ype {R}epresentations},
	Volume = {173},
	Year = {2007},
	Bdsk-Url-1 = {http://dx.doi.org/10.1016/j.entcs.2007.02.043}}

@inproceedings{gadts:icfp06,
	Address = {Portland, Oregon, USA},
	Author = {Simon Peyton Jones and Dimitrios Vytiniotis and Stephanie Weirich and Geoffrey Washburn},
	Booktitle = {ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2008-04-01 18:16:50 +0200},
	Date-Modified = {2008-04-01 18:17:26 +0200},
	Doi = {http://doi.acm.org/10.1145/1159803.1159811},
	Isbn = {1-59593-309-3},
	Pages = {50--61},
	Publisher = {ACM},
	Title = {Simple unification-based type inference for {G}{A}{D}{T}s},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1159811&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Year = {2006},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1159811&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1159803.1159811}}

@inproceedings{dunfield:plpv07,
	Address = {Freiburg, Germany},
	Author = {Joshua Dunfield},
	Booktitle = {PLPV '07: Proceedings of the 2007 workshop on Programming languages meets program verification},
	Date-Added = {2008-04-01 18:10:59 +0200},
	Date-Modified = {2008-04-05 01:10:19 +0200},
	Doi = {http://doi.acm.org/10.1145/1292597.1292602},
	Isbn = {978-1-59593-677-6},
	Pages = {21--32},
	Publisher = {ACM},
	Read = {Oui},
	Title = {Refined typechecking with {S}tardust},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1292602&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Year = {2007},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1292602&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1292597.1292602}}

@inproceedings{pottier-regis-gianas-06,
	Abstract = {We offer a solution to the type inference problem for
                 an extension of Hindley and Milner's type system with
                 generalized algebraic data types. Our approach is in
                 two strata. The bottom stratum is a core language that
                 marries type inference in the style of Hindley and
                 Milner with type checking for generalized algebraic
                 data types. This results in an extremely simple
                 specification, where case constructs must carry an
                 explicit type annotation and type conversions must be
                 made explicit. The top stratum consists of (two
                 variants of) an independent shape inference algorithm.
                 This algorithm accepts a source term that contains some
                 explicit type information, propagates this information
                 in a local, predictable way, and produces a new source
                 term that carries more explicit type information. It
                 can be viewed as a preprocessor that helps produce some
                 of the type annotations required by the bottom stratum.
                 It is proven sound in the sense that it never inserts
                 annotations that could contradict the type derivation
                 that the programmer has in mind.},
	Address = {Charleston, South Carolina},
	Author = {Fran{\c c}ois Pottier and Yann R{\'e}gis-Gianas},
	Booktitle = {Proceedings of the 33rd {ACM} Symposium on Principles of Programming Languages (POPL'06)},
	Date-Added = {2008-04-01 17:55:03 +0200},
	Date-Modified = {2008-04-01 17:55:25 +0200},
	Month = JAN,
	Off = {http://doi.acm.org/10.1145/1111037.1111058},
	Pages = {232--244},
	Pdf = {http://cristal.inria.fr/~fpottier/publis/pottier-regis-gianas-popl06.pdf},
	Title = {Stratified type inference for generalized algebraic data types},
	Url = {http://cristal.inria.fr/~fpottier/publis/pottier-regis-gianas-popl06.ps.gz},
	Year = {2006},
	Bdsk-Url-1 = {http://cristal.inria.fr/~fpottier/publis/pottier-regis-gianas-popl06.ps.gz}}

@phdthesis{gianas:phd,
	Author = {Yann R{\'e}gis-Gianas},
	Date-Added = {2008-04-01 17:48:24 +0200},
	Date-Modified = {2008-10-01 16:55:11 +0200},
	Keywords = {gadts, programming languages},
	Month = {November},
	Pdf = {http://cristal.inria.fr/~regisgia/these-yann.regis-gianas.pdf},
	School = {Universit{\'e} Paris~7},
	Title = {Des types aux assertions logiques : preuve automatique ou assist{\'e}e de propri{\'e}t{\'e}s sur les programmes fonctionnels},
	Type = {Doctorat},
	Year = {2007},
	Bdsk-File-1 = { }}

@inproceedings{1016883,
	Address = {Snow Bird, UT, USA},
	Author = {Ralf L\"{a}mmel and Simon Peyton Jones},
	Booktitle = {ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming},
	Date-Added = {2008-04-01 16:59:15 +0200},
	Date-Modified = {2008-04-01 16:59:15 +0200},
	Doi = {http://doi.acm.org/10.1145/1016850.1016883},
	Isbn = {1-58113-905-5},
	Pages = {244--255},
	Publisher = {ACM},
	Title = {Scrap more boilerplate: reflection, zips, and generalised casts},
	Url = {http://portal.acm.org/ft_gateway.cfm?id=1016883&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Year = {2004},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1016883&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61890656&CFTOKEN=38649807},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1016850.1016883}}

@inproceedings{717294,
	Address = {Deventer, The Netherlands, The Netherlands},
	Author = {Thorsten Altenkirch and Conor McBride},
	Booktitle = {Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming},
	Date-Added = {2008-04-01 16:58:24 +0200},
	Date-Modified = {2008-04-05 01:10:26 +0200},
	Isbn = {1-4020-7374-7},
	Pages = {1--20},
	Publisher = {Kluwer, B.V.},
	Read = {Oui},
	Title = {Generic {P}rogramming within {D}ependently {T}yped {P}rogramming},
	Year = {2003},
	Bdsk-File-1 = { }}

@article{epigram:pratprog,
	Abstract = {Find the type error in the following Haskell expression: You can't, of course: this program is obviously nonsense unless you're a typechecker. The trouble is that only certain computations make sense if the null xs test is True, whilst others make sense if it is False. However, as far as the type system is concerned, the type of the then branch is the type of the else branch is the type of the entire conditional. Statically, the test is irrelevant. Which is odd, because if the test really were irrelevant, we wouldn't do it. Of course, doesn't go wrong---well-typed programs don't go wrong---so we'd better pick a different word for the way they do go. Abstraction and application, tupling and projection: these provide the `software engineering' superstructure for programs, and our familiar type systems ensure that these operations are used compatibly. However, sooner or later, most programs inspect data and make a choice---at that point our familiar type systems fall silent. They simply can't talk about specific data. All this time, we thought our programming was strongly typed, when it was just our software engineering. In order to do better, we need a static language capable of expressing the significance of particular values in legitimizing some computations rather than others. We should not give up on programming.},
	Author = {McBride, Conor},
	Citeulike-Article-Id = {2247480},
	Date-Added = {2008-04-01 16:52:21 +0200},
	Date-Modified = {2008-12-04 14:29:31 +0100},
	Doi = {10.1007/11546382_3},
	Journal = {Advanced Functional Programming},
	Keywords = {dependent-types, type-theory},
	Pages = {130--170},
	Priority = {3},
	Read = {Oui},
	Title = {Epigram: {P}ractical {P}rogramming with {D}ependent {T}ypes},
	Url = {http://www.e-pig.org/downloads/epigram-notes.pdf},
	Year = {2005},
	Bdsk-Url-1 = {http://www.springerlink.com/content/96j7v5vn8tyebeky/},
	Bdsk-Url-2 = {http://dx.doi.org/10.1007/11546382_3},
	Bdsk-Url-3 = {http://www.e-pig.org/downloads/epigram-notes.pdf}}

@inproceedings{weirich:PIE,
	Author = {Dimitrios Vytiniotis and Stephanie Weirich},
	Booktitle = {Trends in Functional Programming},
	Date-Added = {2008-04-01 16:39:58 +0200},
	Date-Modified = {2008-04-01 16:56:20 +0200},
	Keywords = {dependent types, Coq},
	Read = {Oui},
	Title = {Dependent {T}ypes: easy as {P{I}{E}}},
	Year = {2007},
	Bdsk-File-1 = { }}

@inproceedings{xu:ESCHaskell,
	Address = {Portland, Oregon, USA},
	Author = {Dana N. Xu},
	Booktitle = {Haskell '06: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell},
	Date-Added = {2008-04-01 16:29:07 +0200},
	Date-Modified = {2008-10-09 15:33:26 +0200},
	Doi = {http://doi.acm.org/10.1145/1159842.1159849},
	Isbn = {1-59593-489-8},
	Pages = {48--59},
	Publisher = {ACM},
	Title = {Extended static checking for haskell},
	Url = {http://www.cl.cam.ac.uk/~nx200/research/escH-hw.ps},
	Year = {2006},
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=1159849&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61886649&CFTOKEN=29875007},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/1159842.1159849},
	Bdsk-Url-3 = {http://www.cl.cam.ac.uk/~nx200/research/escH-hw.ps}}

@misc{kieburtz-automated,
	Author = {Richard Kieburtz},
	Date-Added = {2008-04-01 16:26:20 +0200},
	Date-Modified = {2008-04-01 16:26:20 +0200},
	Title = {Automated soundness checking of a programming logic for {H}askell},
	Url = {http://citeseer.ist.psu.edu/575133.html},
	Year = {Unknown},
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/575133.html}}

@misc{Coq,
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 14:00:57 +0200},
	Key = {Coq},
	Title = {The {C}oq proof assistant},
	Web = {coq.inria.fr}}

@webpage{Haskell,
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-10-01 16:44:37 +0200},
	Key = {Haskell},
	Title = {The {H}askell programming language},
	Url = {http://haskell.org},
	Bdsk-Url-1 = {http://haskell.org}}

@misc{OCaml,
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 14:00:57 +0200},
	Key = {OCaml},
	Title = {The {O}{C}aml programming language},
	Web = {caml.inria.fr}}

@inproceedings{DBLP:conf/tphol/Coquand06,
	Author = {Thierry Coquand},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {The Seventeen Provers of the World},
	Crossref = {DBLP:conf/tphol/2006provers},
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 16:56:23 +0200},
	Ee = {http://dx.doi.org/10.1007/11542384_9},
	Pages = {50-54},
	Read = {Oui},
	Title = {Alfa/{A}gda.},
	Year = {2006}}

@proceedings{DBLP:conf/tphol/2006provers,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {The Seventeen Provers of the World},
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 14:00:57 +0200},
	Editor = {Freek Wiedijk},
	Isbn = {3-540-30704-4},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {The {S}eventeen {P}rovers of the {W}orld, {F}oreword by {D}ana {S}. {S}cott},
	Volume = {3600},
	Year = {2006}}

@inproceedings{DBLP:conf/pepm/FogartyPST07,
	Author = {Seth Fogarty and Emir Pasalic and Jeremy Siek and Walid Taha},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PEPM},
	Crossref = {DBLP:conf/pepm/2007},
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 16:56:24 +0200},
	Ee = {http://doi.acm.org/10.1145/1244381.1244400},
	Pages = {112-121},
	Read = {Oui},
	Title = {Concoqtion: indexed types now!},
	Year = {2007}}

@proceedings{DBLP:conf/pepm/2007,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PEPM},
	Date-Added = {2008-04-01 14:00:57 +0200},
	Date-Modified = {2008-04-01 14:00:57 +0200},
	Editor = {G. Ramalingam and Eelco Visser},
	Isbn = {978-1-59593-620-2},
	Publisher = {ACM},
	Title = {Proceedings of the 2007 {A}{C}{M} {S}{I}{G}{P}{L}{A}{N} {W}orkshop on {P}artial {E}valuation and {S}emantics-based {P}rogram {M}anipulation, 2007, {N}ice, {F}rance, {J}anuary 15-16, 2007},
	Year = {2007}}

@book{AKM:EquationsSampler89-1,
	Booktitle = {Resolution of Equations in Algebraic Structures},
	Editor = {A{\"\i}t-Kaci and Maurice Nivat},
	Publisher = AP,
	Title = {Resolution of {E}quations in {A}lgebraic {S}tructures},
	Volume = {1 (Algebraic Techniques)},
	Year = 1989}

@book{AKM:EquationsSampler89-2,
	Booktitle = {Resolution of Equations in Algebraic Structures},
	Editor = {A{\"\i}t-Kaci and Maurice Nivat},
	Publisher = AP,
	Title = {Resolution of {E}quations in {A}lgebraic {S}tructures},
	Volume = {2 (Rewriting Techniques)},
	Year = 1989}

@book{ConstraintsLanguageComputation94,
	Booktitle = {Constraints, Language and Computation},
	Editor = {C. J. Rupp, M. A. Rosner and R. L. Johnson},
	Publisher = AP,
	Title = {Constraints, {L}anguage and {C}omputation},
	Year = 1994}

@book{ModelTheoreticLogics85,
	Booktitle = {Model-Theoretic Logics},
	Editor = {J. Barwise and S. Feferman},
	Publisher = SV,
	Series = {Perspectives in Mathematical Logic},
	Title = {Model-{T}heoretic {L}ogics},
	Year = 1985}

@book{Moschovakis:LogicCS92,
	Booktitle = {Logic from Computer Science},
	Editor = {Y. N. Moschovakis},
	Publisher = SV,
	Title = {Logic from {C}omputer {S}cience},
	Year = 1992}

@book{TMR:Undecidable53,
	Author = {Alfred Tarski and Andrzej Mostowski and Raphael M. Robinson},
	Booktitle = {Undecidable Theories},
	Editor = {Alfred Tarski and Andrzej Mostowski and Raphael M. Robinson},
	Publisher = NH,
	Series = {Studies in Logic and the Foundations of Mathematics},
	Title = {Undecidable {T}heories},
	Year = 1953}

@proceedings{aaai93,
	Address = {Washington, DC},
	Number = 11,
	Title = {Proceedings of the eleventh national conference on artificial intelligence},
	Year = 1993}

@proceedings{acl86,
	Address = {New York, NY},
	Booktitle = {24th Annual Meeting of the Association for Computational Lingustics},
	Title = {24th {A}nnual {M}eeting of the {A}ssociation for {C}omputational {L}ingustics},
	Year = 1986}

@proceedings{acl87,
	Booktitle = {25th Annual Meeting of the Association for Computational Lingustics},
	Title = {25th {A}nnual {M}eeting of the {A}ssociation for {C}omputational {L}ingustics},
	Year = 1987}

@proceedings{alp92,
	Address = {Volterra, Italy},
	Booktitle = {3th International Conference on Algebraic and Logic Programming},
	Editor = {H{\'e}l{\`e}ne Kirchner and Giorgio Levi},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {3th {I}nternational {C}onference on {A}lgebraic and {L}ogic {P}rogramming},
	Volume = {632},
	Year = 1992}

@proceedings{alp94,
	Address = {Madrid, Spain},
	Booktitle = {4th International Conference on Algebraic and Logic Programming},
	Editor = {Giorgio Levi and Mario Rodr{\'\i}guez-Artalejo},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {4th {I}nternational {C}onference on {A}lgebraic and {L}ogic {P}rogramming},
	Volume = {850},
	Year = 1994}

@proceedings{alp96,
	Address = {Aachen, Germany},
	Booktitle = {5th International Conference on Algebraic and Logic Programming},
	Editor = {Michael Hanus and Mario Rodr{\'\i}guez-Artalejo},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {5th {I}nternational {C}onference on {A}lgebraic and {L}ogic {P}rogramming},
	Volume = {1139},
	Year = 1996}

@proceedings{alpplilp98,
	Address = {Pisa, Italy},
	Booktitle = {Principles of Declarative Programming},
	Editor = {MCatuscia Palamidessi and Hugh Glaser and Karl Meinke},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Joint {I}nternational {S}ymposiums {P}rogramming {L}anguages, {I}mplementations, {L}ogics and {P}rogram ({P}{L}{I}{L}{P}) and {A}lgebraic and {L}ogic {P}rogramming ({A}{L}{P})},
	Volume = {1490},
	Year = 1998}

@proceedings{plilp95,
	Address = {Utrecht, The Netherlands},
	Booktitle = {7th International Symposium on Programming Languages: Implementations, Logics and Programs},
	Editor = {S. Doaitse Swierstra and M. Hermenegildo},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {7th {I}nternational {S}ymposium on {P}rogramming {L}anguages: {I}mplementations, {L}ogics and {P}rograms},
	Volume = {982},
	Year = 1995}

@proceedings{caap91,
	Booktitle = {Colloquium on Trees in Algebra and Programming},
	Editor = {S. Abramsky and T. S. E. Maibaum},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {Colloquium on {T}rees in {A}lgebra and {P}rogramming},
	Volume = 493,
	Year = 1991}

@proceedings{caap94,
	Address = {Edinburgh, Scotland},
	Booktitle = {Colloquium on Trees in Algebra and Programming},
	Editor = {Sophie Tison},
	Publisher = SV,
	Series = LNCS,
	Title = {Colloquium on {T}rees in {A}lgebra and {P}rogramming},
	Volume = 787,
	Year = 1994}

@proceedings{caap96,
	Address = {Link\"oping (Sweden)},
	Booktitle = {Proceedings 21st International Colloquium on Trees in Algebra and Programming},
	Editor = {Kirchner, H.},
	Month = apr,
	Pages = {211--225},
	Publisher = SV,
	Series = LNCS,
	Volume = 1059,
	Year = 1996}

@proceedings{cade80,
	Address = {Les Arcs, France},
	Booktitle = {5th~International Conference on Automated Deduction},
	Editor = {W.~Bibel and R.~Kowalski},
	Publisher = SV,
	Series = LNCS,
	Title = {5th~{I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {87},
	Year = 1980}

@proceedings{cade82,
	Address = {New York, USA},
	Booktitle = {6th International Conference on Automated Deduction},
	Editor = {D. W. Loveland},
	Publisher = SV,
	Series = LNCS,
	Title = {6th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {138},
	Year = 1982}

@proceedings{cade84,
	Address = {Napa, California, USA},
	Booktitle = {7th International Conference on Automated Deduction},
	Editor = {R. E. Shostak},
	Publisher = SV,
	Series = LNCS,
	Title = {7th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {170},
	Year = 1984}

@proceedings{cade86,
	Address = {Oxford, England},
	Booktitle = {8th International Conference on Automated Deduction},
	Editor = {J{\"o}rg H. Siekmann},
	Publisher = SV,
	Series = LNCS,
	Title = {8th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {230},
	Year = 1986}

@proceedings{cade88,
	Address = {Argonne, Illinois},
	Booktitle = {9th Int. Conf. on Automated Deduction},
	Editor = {Lusk and Overbeek},
	Month = may,
	Publisher = SV,
	Series = lncs,
	Title = {9th {I}nt. {C}onf. on {A}utomated {D}eduction},
	Volume = 310,
	Year = 1988}

@proceedings{cade90,
	Address = {Kaiserslautern, Germany},
	Booktitle = {10th International Conference on Automated Deduction},
	Editor = {M. E. Stickel},
	Month = jul,
	Publisher = SV,
	Series = LNAI,
	Title = {10th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = 449,
	Year = 1990}

@proceedings{cade92,
	Address = {Saratoga Springs, NY},
	Booktitle = {11th International Conference on Automated Deduction},
	Editor = {Deepak Kapur},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {11th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {607},
	Year = 1992}

@proceedings{cade94,
	Address = {Nancy, France},
	Booktitle = {12th International Conference on Automated Deduction},
	Editor = {A. Bundy},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {12th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = {814},
	Year = 1994}

@proceedings{cade96,
	Address = {New Brunswick, NJ},
	Booktitle = {13th International Conference on Automated Deduction},
	Editor = {M. A. McRobbie and J. K. Slaney},
	Month = {july/august},
	Publisher = SV,
	Series = LNCS,
	Title = {13th {I}nternational {C}onference on {A}utomated {D}eduction},
	Year = 1996}

@proceedings{cade97,
	Address = {Townsville, North Queensland, Australia},
	Booktitle = {14th International Conference on Automated Deduction},
	Editor = {William McCune},
	Month = {july},
	Publisher = SV,
	Series = LNCS,
	Title = {14th {I}nternational {C}onference on {A}utomated {D}eduction},
	Year = 1997}

@proceedings{cade99,
	Address = {Trento, Italy},
	Booktitle = {16th International Conference on Automated Deduction},
	Editor = {Harald Ganzinger},
	Month = jul,
	Publisher = SV,
	Series = LNAI,
	Title = {16th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = 1632,
	Year = 1999}

@proceedings{cade2000,
	Address = {Pittsburgh, PA, USA},
	Booktitle = {17th International Conference on Automated Deduction},
	Editor = {McAllester, D.},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {17th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = 1831,
	Year = 2000}

@proceedings{cade03,
	Address = {Miami Beach, FL, USA},
	Booktitle = {19th International Conference on Automated Deduction (CADE-19)},
	Editor = {Franz Baader},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {19th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = 2741,
	Year = 2003}

@proceedings{cade05,
	Address = {Tallinn, Estonia},
	Booktitle = {20th International Conference on Automated Deduction (CADE-20)},
	Editor = {Robert Nieuwenhuis},
	Month = jul,
	Number = 3632,
	Publisher = SV,
	Series = LNAI,
	Title = {20th {I}nternational {C}onference on {A}utomated {D}eduction},
	Year = 2005}

@proceedings{cade07,
	Address = {Bremen, Germany},
	Booktitle = {21th International Conference on Automated Deduction (CADE-21)},
	Month = jul,
	Publisher = SV,
	Series = LNAI,
	Title = {21th {I}nternational {C}onference on {A}utomated {D}eduction},
	Volume = 4603,
	Year = 2007}

@proceedings{cav94,
	Address = {Stanford, CA, USA},
	Booktitle = {Computer Aided Verification},
	Editor = {David L. Dill},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {Computer {A}ided {V}erification, 6th {I}nternational {C}onference},
	Volume = 818,
	Year = 1994}

@proceedings{cav95,
	Address = {Liege, Belgium},
	Booktitle = {Proceedings of the 7th International Conference On Computer Aided Verification},
	Editor = {P. Wolper},
	Publisher = sv,
	Title = {Proceedings of the 7th {I}nternational {C}onference {O}n {C}omputer {A}ided {V}erification},
	Volume = 939,
	Year = 1995}

@proceedings{ccl94,
	Address = {M{\"u}nchen, Germany},
	Booktitle = {First International Conference on Constraints in Computational Logics},
	Editor = {Jean-Pierre Jouannaud},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {First {I}nternational {C}onference on {C}onstraints in {C}omputational {L}ogics},
	Topics = {teamp, cclserver,lri},
	Type_Publi = {editeur},
	Volume = 845,
	Year = 1994}

@proceedings{chambery94,
	Address = {Chamb{\'e}ry},
	Booktitle = {2nd International Conference in Logic For Computer Science: Automated Deduction. Lecture notes.},
	Editor = {Ren{\'e} David},
	Month = jul,
	Publisher = {Univ. de Savoie},
	Title = {2nd {I}nternational {C}onference in {L}ogic {F}or {C}omputer {S}cience: {A}utomated {D}eduction. {L}ecture notes.},
	Year = 1994}

@proceedings{cl00,
	Address = {London, UK},
	Booktitle = {Proceedings of the First International Conference on Computational Logic},
	Month = jul,
	Title = {Proceedings of the {F}irst {I}nternational {C}onference on {C}omputational {L}ogic},
	Year = 2000}

@proceedings{coling88,
	Address = {Budapest, Hungary},
	Booktitle = {International Conference on Computational Linguistics},
	Editor = {D{\'e}nes Vargha},
	Publisher = {John von Neumann Society for Computing Sciences},
	Title = {International {C}onference on {C}omputational {L}inguistics},
	Year = 1988}

@proceedings{comon95lncs,
	Booktitle = {Term Rewriting},
	Clef_Labo = {CJ95},
	Editor = {Hubert Comon and Jean-Pierre Jouannaud},
	Organization = {French Spring School of Theoretical Computer Science},
	Publisher = SV,
	Series = LNCS,
	Title = {Term {R}ewriting},
	Topics = {team, cclserver},
	Type_Publi = {editeur},
	Volume = {909},
	Year = 1995}

@proceedings{concur97,
	Address = {Warsaw, Poland},
	Booktitle = {Concurrency Theory},
	Editor = {Antoni W. Mazurkiewicz and J{\'o}zef Winkowski},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {Concurrency {T}heory, 8th {I}nternational {C}onference},
	Volume = 1243,
	Year = 1997}

@proceedings{concur99,
	Address = {Eindhoven, The Netherlands},
	Booktitle = {Concurrency Theory},
	Editor = {Jos C. M. Baeten and Sjouke Mauw},
	Month = aug,
	Publisher = SV,
	Series = lncs,
	Title = {Concurrency {T}heory},
	Volume = {1664},
	Year = 1999}

@proceedings{cp95,
	Address = {Cassis, France},
	Booktitle = {Principles and Practice of Constraint Programming},
	Editor = {Ugo Montanari and Francesca Rossi},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Principles and {P}ractice of {C}onstraint {P}rogramming},
	Volume = 976,
	Year = 1995}

@proceedings{cp96,
	Booktitle = {Principles and Practice of Constraint Programming},
	Editor = {Eugene Freuder},
	Publisher = SV,
	Series = LNCS,
	Volume = 1118,
	Year = 1996}

@proceedings{cp97,
	Address = {Linz, Austria},
	Booktitle = {Principles and Practice of Constraint Programming},
	Editor = {Gert Smolka},
	Month = oct,
	Publisher = SV,
	Series = LNCS,
	Title = {Principles and {P}ractice of {C}onstraint {P}rogramming},
	Volume = 1330,
	Year = 1997}

@proceedings{csl91,
	Address = {Berne, Switzerland},
	Booktitle = {Computer Science Logic},
	Editor = {E. B{\"o}rger and G. J{\"a}ger and H. Kleine B{\"u}ning and M. M. Richter},
	Month = oct,
	Publisher = SV,
	Series = LNCS,
	Title = {Computer {S}cience {L}ogic},
	Volume = 626,
	Year = 1991}

@proceedings{csl94,
	Address = {Kazimierz, Poland},
	Booktitle = {Proceedings of the 8th Workshop on Computer Science Logic},
	Editor = {Leszek Pacholski and Jerzy Tiuryn},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the 8th {W}orkshop on {C}omputer {S}cience {L}ogic},
	Volume = 933,
	Year = 1994}

@proceedings{csl97,
	Booktitle = {CSL},
	Editor = {Mogens Nielsen and Wolfgang Thomas},
	Isbn = {3-540-64570-5},
	Publisher = sv,
	Series = lncs,
	Title = {Computer {S}cience {L}ogic, 11th {I}nternational {W}orkshop, {C}{S}{L} '97, {A}nnual {C}onference of the {E}{A}{C}{S}{L}, {A}arhus, {D}enmark, {A}ugust 23-29, 1997, {S}elected {P}apers},
	Volume = 1414,
	Year = 1998}

@proceedings{csl00,
	Booktitle = {CSL},
	Editor = {Peter Clote and Helmut Schwichtenberg},
	Isbn = {3-540-67895-6},
	Publisher = sv,
	Series = lncs,
	Title = {Computer {S}cience {L}ogic, 14th {A}nnual {C}onference of the {E}{A}{C}{S}{L}, {F}ischbachau, {G}ermany, {A}ugust 21-26, 2000, {P}roceedings},
	Volume = 1862,
	Year = 2000}

@proceedings{csl01,
	Address = {Paris, France},
	Booktitle = {Proceedings of the Annual Conference of the European Association for Computer Science Logic},
	Editor = {Laurent Fribourg},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the {A}nnual {C}onference of the {E}uropean {A}ssociation for {C}omputer {S}cience {L}ogic},
	Volume = 2142,
	Year = 2001}

@proceedings{csl04,
	Address = {Karpacz, Poland},
	Booktitle = {Proceedings of the Annual Conference of the European Association for Computer Science Logic},
	Editor = {Jerzy Marcinkowski and Andrzej Tarlecki},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the {A}nnual {C}onference of the {E}uropean {A}ssociation for {C}omputer {S}cience {L}ogic},
	Year = 2004}

@proceedings{focs78,
	Address = {Ann Arbor, Michigan},
	Booktitle = {19th Annual Symposion on Foundations of Computer Science},
	Month = oct,
	Publisher = IEEECSP,
	Title = {19th {A}nnual {S}ymposion on {F}oundations of {C}omputer {S}cience},
	Year = 1978}

@proceedings{focs88,
	Booktitle = {29th Annual Symposion on Foundations of Computer Science},
	Publisher = IEEECSP,
	Title = {29th {A}nnual {S}ymposion on {F}oundations of {C}omputer {S}cience},
	Year = 1988}

@proceedings{focs99,
	Address = {New York, NY, USA},
	Booktitle = {40th Annual Symposium on Foundations of Computer Science},
	Month = oct,
	Publisher = IEEECSP,
	Title = {40th {A}nnual {S}ymposium on {F}oundations of {C}omputer {S}cience},
	Year = 1999}

@proceedings{fplca85,
	Booktitle = {IFIP International Conference on Functional Programming Languages and Computer Architecture},
	Editor = {Jean-Pierre Jouannaud},
	Publisher = SV,
	Series = LNCS,
	Title = {I{F}{I}{P} {I}nternational {C}onference on {F}unctional {P}rogramming {L}anguages and {C}omputer {A}rchitecture},
	Volume = 201,
	Year = 1985}

@proceedings{fsttcs90,
	Address = {Bangalore, India},
	Booktitle = {Foundations of Software Technology and Theoretical Computer Science},
	Editor = {K. V. Nori and C. E. Veni Madhavan},
	Publisher = SV,
	Series = LNCS,
	Title = {Foundations of {S}oftware {T}echnology and {T}heoretical {C}omputer {S}cience},
	Volume = {472},
	Year = 1990}

@proceedings{fsttcs92,
	Address = {New Delhi, India},
	Booktitle = {Foundations of Software Technology and Theoretical Computer Science},
	Editor = {R. Shyamasundar},
	Month = dec,
	Publisher = SV,
	Series = LNCS,
	Title = {Foundations of {S}oftware {T}echnology and {T}heoretical {C}omputer {S}cience},
	Volume = {652},
	Year = 1992}

@book{gi-tcs83,
	Booktitle = {Proceedings of the 6th {GI} Conference on Theoretical Computer Science},
	Editor = {A. B. Cremers and H. P. Kriegek},
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the 6th {G{I}} {C}onference on {T}heoretical {C}omputer {S}cience},
	Volume = 145,
	Year = 1982}

@proceedings{gwai85,
	Address = {Dassel/Solling},
	Booktitle = {9th German Wokshop on Artificial Intelligence},
	Editor = {Herbert Stoyan},
	Publisher = SV,
	Series = {Informatik Fachberichte vol. 118},
	Title = {9th {G}erman {W}okshop on {A}rtificial {I}ntelligence},
	Year = 1985}

@proceedings{gwai86,
	Address = {Ottenstein/Nieder{\"o}sterreich},
	Booktitle = {10th German Wokshop on Artificial Intelligence},
	Editor = {W. Bibel and R. Kowalski},
	Publisher = SV,
	Series = {Informatik Fachberichte vol. 124},
	Title = {10th {G}erman {W}okshop on {A}rtificial {I}ntelligence},
	Year = 1986}

@proceedings{icalp87,
	Address = {Karlsruhe, Germany},
	Booktitle = {14th International Colloquium on Automata, Languages and Programming},
	Editor = {Thomas Ottmann},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {14th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {267},
	Year = 1987}

@proceedings{icalp90,
	Address = {Warwick, England},
	Booktitle = {17th International Colloquium on Automata, Languages and Programming},
	Editor = {M. S. Paterson},
	Publisher = SV,
	Series = LNCS,
	Title = {17th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {443},
	Year = 1990}

@proceedings{icalp91,
	Address = {Madrid, Spain},
	Booktitle = {18th International Colloquium on Automata, Languages and Programming},
	Editor = {Javier Leach Albert and Burkhard Monien and M. Rodriguez Artalejo},
	Publisher = SV,
	Series = LNCS,
	Title = {18th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {510},
	Year = 1991}

@proceedings{icalp92,
	Address = {Wien, Austria},
	Booktitle = {19th International Colloquium on Automata, Languages and Programming},
	Editor = {W. Kuich},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {19th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {623},
	Year = 1992}

@proceedings{icalp93,
	Address = {Lund, Sweden},
	Booktitle = {20th International Colloquium on Automata, Languages and Programming},
	Editor = {Andrzej Lingas and Rolf Karlsson and Svante Carlsson},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {20th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {700},
	Year = 1993}

@proceedings{icalp94,
	Address = {Jerusalem, Israel},
	Booktitle = {21th International Colloquium on Automata, Languages and Programming},
	Editor = {Serge Abiteboul and Eli Shamir},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {21th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = 820,
	Year = 1994}

@proceedings{icalp97,
	Booktitle = {ICALP},
	Editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
	Isbn = {3-540-63165-8},
	Publisher = sv,
	Series = lncs,
	Title = {Automata, {L}anguages and {P}rogramming, 24th {I}nternational {C}olloquium, {I}{C}{A}{L}{P}'97, {B}ologna, {I}taly, 7-11 {J}uly 1997, {P}roceedings},
	Volume = 1256,
	Year = 1997}

@proceedings{icalp98,
	Address = {Aalborg, Denmark},
	Booktitle = {24th International Colloquium on Automata, Languages and Programming},
	Editor = {Kim G. Larsen},
	Month = jul,
	Organization = {EATCS},
	Publisher = SV,
	Series = LNCS,
	Title = {24th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = {1443},
	Year = 1998}

@proceedings{icalp03,
	Address = {Eindhoven, The Netherlands},
	Booktitle = {30th International Colloquium on Automata, Languages and Programming},
	Editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger},
	Isbn = {3-540-40493-7},
	Month = jul,
	Organization = {EATCS},
	Publisher = SV,
	Series = LNCS,
	Title = {30th {I}nternational {C}olloquium on {A}utomata, {L}anguages and {P}rogramming},
	Volume = 2719,
	Year = 2003}

@proceedings{iclp87,
	Booktitle = {Proceedings of the Fourth International Conference on Logic Programming},
	Editor = {Jean-Louis Lassez},
	Month = may,
	Publisher = MIT,
	Title = {Proceedings of the {F}ourth {I}nternational {C}onference on {L}ogic {P}rogramming},
	Year = 1987}

@proceedings{iclp90,
	Booktitle = {Proceedings of the 7th International Conference on Logic Programming},
	Editor = {D.H.D. Warren and P. Szeredi},
	Month = jun,
	Publisher = MIT,
	Title = {Proceedings of the 7th {I}nternational {C}onference on {L}ogic {P}rogramming},
	Year = 1990}

@proceedings{iclp91,
	Address = {Paris, France},
	Booktitle = {Proceedings of the 8th International Conference on Logic Programming},
	Editor = {Koichi Furukawa},
	Month = jun,
	Publisher = MIT,
	Title = {Proceedings of the 8th {I}nternational {C}onference on {L}ogic {P}rogramming},
	Year = 1991}

@proceedings{iclp94,
	Address = {Santa Margherita Ligure, Italy},
	Booktitle = {Proceedings of the Eleventh International Conference on Logic Programming},
	Editor = {Pascal van Hentenryck},
	Monyth = jun,
	Publisher = MIT,
	Title = {Proceedings of the {E}leventh {I}nternational {C}onference on {L}ogic {P}rogramming},
	Year = 1994}

@proceedings{ijcai91,
	Address = {Sidney},
	Booktitle = {International Joint Conference on Artificial Inteligence},
	Title = {International {J}oint {C}onference on {A}rtificial {I}nteligence},
	Year = 1991}

@proceedings{ijcai93,
	Address = {Chamb{\'e}ry, France},
	Booktitle = {13th International Joint Conference on Artificial Intelligence},
	Month = aug,
	Publisher = {Morgan Kaufmann},
	Title = {13th {I}nternational {J}oint {C}onference on {A}rtificial {I}ntelligence},
	Year = 1993}

@proceedings{islp91,
	Address = {San Diego, USA},
	Booktitle = {Proceedings of the 1991 International Symposium on Logic Programming},
	Editor = {Saraswat, Vijay and Ueda, Kazunori},
	Publisher = MIT,
	Title = {Proceedings of the 1991 {I}nternational {S}ymposium on {L}ogic {P}rogramming},
	Year = 1991}

@proceedings{islp93,
	Address = {Vancouver, Canada},
	Booktitle = {Proceedings of the 1993 International Symposium on Logic Programming},
	Editor = {Dale Miller},
	Month = oct,
	Publisher = MIT,
	Title = {Proceedings of the 1993 {I}nternational {S}ymposium on {L}ogic {P}rogramming},
	Year = 1993}

@proceedings{iwnmsa93,
	Address = {Japan},
	Month = {November},
	Title = {Proceedings of the international workshop on new models of software architecture},
	Year = 1993}

@proceedings{jicslp92,
	Address = {Washington, USA},
	Booktitle = {Proceedings of the Joint International Conference and Symposium on Logic Programming},
	Editor = {Apt, Krzysztof},
	Month = nov,
	Publisher = MIT,
	Title = {Proceedings of the {J}oint {I}nternational {C}onference and {S}ymposium on {L}ogic {P}rogramming},
	Year = 1992}

@proceedings{lacl98,
	Address = {Grenoble, France},
	Booktitle = {Logical Aspects of Computational Linguistics 1998},
	Editor = {Michael Moortgat},
	Publisher = SV,
	Series = LNAI,
	Title = {Logical {A}spects of {C}omputational {L}inguistics 1998},
	Volume = 2014,
	Year = 2001}

@proceedings{lics86,
	Address = {Cambridge, MA},
	Booktitle = {Proceedings of the First Symposium on Logic in Computer Science},
	Month = jun,
	Publisher = IEEECSP,
	Title = {Proceedings of the {F}irst {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1986}

@proceedings{lics87,
	Booktitle = {Proceedings of the Second Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {S}econd {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1987}

@proceedings{lics88,
	Booktitle = {Proceedings of the Third Annual Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {T}hird {A}nnual {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1988}

@proceedings{lics89,
	Address = {Pacific Grove, California},
	Booktitle = {Proceedings of the Fourth Annual Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {F}ourth {A}nnual {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1989}

@proceedings{lics90,
	Booktitle = {Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {F}ifth {A}nnual {I}{E}{E}{E} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1990}

@proceedings{lics91,
	Booktitle = {Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {S}ixth {A}nnual {I}{E}{E}{E} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1991}

@proceedings{lics92,
	Booktitle = {Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {S}eventh {A}nnual {I}{E}{E}{E} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1992}

@proceedings{lics93,
	Booktitle = {Proceedings of the Eigth Annual IEEE Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Proceedings of the {E}igth {A}nnual {I}{E}{E}{E} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1993}

@proceedings{lics94,
	Address = {Paris, France},
	Booktitle = {Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science},
	Month = jul,
	Organization = IEEECSP,
	Title = {Proceedings of the {N}inth {A}nnual {I}{E}{E}{E} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1994}

@proceedings{lics95,
	Address = {San Diego, CA},
	Booktitle = {Tenth Annual {IEEE} Symposium on Logic in Computer Science},
	Editor = {Dexter Kozen},
	Month = jun,
	Organization = IEEECSP,
	Title = {Tenth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1995}

@proceedings{lics97,
	Address = {Warsaw,Poland},
	Booktitle = {Twelfth Annual {IEEE} Symposium on Logic in Computer Science},
	Month = jun,
	Organization = IEEECSP,
	Title = {Twelfth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1997}

@proceedings{lics98,
	Address = {Indianapolis, IN, USA},
	Booktitle = {Thirteenth Annual {IEEE} Symposium on Logic in Computer Science},
	Editor = {Vaughan Pratt},
	Month = jun,
	Organization = IEEECSP,
	Title = {Thirteenth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1998}

@proceedings{lics99,
	Address = {Trento, Italy},
	Booktitle = {Fourteenth Annual {IEEE} Symposium on Logic in Computer Science},
	Editor = {Giuseppe Longo},
	Month = jul,
	Organization = IEEECSP,
	Title = {Fourteenth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 1999}

@proceedings{lics00,
	Address = {Santa Barbara, California},
	Booktitle = {Fiveteenth Annual {IEEE} Symposium on Logic in Computer Science},
	Editor = {Martin Abadi},
	Month = jun,
	Organization = IEEECSP,
	Title = {Fiveteenth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 2000}

@proceedings{lics01,
	Booktitle = {Sixteenth Annual {IEEE} Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {Sixteenth {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 2001}

@proceedings{lics02,
	Booktitle = {17h Annual {IEEE} Symposium on Logic in Computer Science},
	Organization = IEEECSP,
	Title = {17h {A}nnual {I{E}{E}{E}} {S}ymposium on {L}ogic in {C}omputer {S}cience},
	Year = 2002}

@proceedings{lpar92,
	Address = {St. Petersburg, Russia},
	Booktitle = {International Conference on Logic Programming and Automated Reasoning},
	Editor = {A. Voronkov},
	Month = jul,
	Publisher = SV,
	Series = LNAI,
	Title = {International {C}onference on {L}ogic {P}rogramming and {A}utomated {R}easoning},
	Volume = 624,
	Year = 1992}

@proceedings{lpar93,
	Address = {St. Petersburg, Russia},
	Booktitle = {4th International Conference on Logic Programming and Automated Reasoning},
	Editor = {Andrei Voronkov},
	Month = jul,
	Publisher = SV,
	Series = LNAI,
	Title = {4th {I}nternational {C}onference on {L}ogic {P}rogramming and {A}utomated {R}easoning},
	Volume = 698,
	Year = 1993}

@proceedings{mfcs80,
	Address = {Rydzyna, Poland},
	Booktitle = {Mathematical Foundations of Computer Science},
	Month = sep,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Year = 1980}

@proceedings{mfcs84,
	Address = {Praha, Czechoslovakia},
	Booktitle = {Mathematical Foundations of Computer Science},
	Editor = {M. P. Chytil and V. Koubek},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Volume = 175,
	Year = 1984}

@proceedings{mfcs91,
	Address = {Kazimierz Dolny, Poland},
	Booktitle = {Mathematical Foundations of Computer Science},
	Editor = {A. Tarlecki},
	Month = sep,
	Publisher = SV,
	Series = LNAI,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Volume = 520,
	Year = 1991}

@proceedings{mfcs92,
	Booktitle = {Mathematical Foundations of Computer Science},
	Publisher = SV,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Year = 1992}

@proceedings{mfcs93,
	Address = {Gda{\'n}sk, Poland},
	Booktitle = {Mathematical Foundations of Computer Science},
	Editor = {Andrzej M. Borzyszkowski and Stefan Soko{\l}owski},
	Isbn = {3-540-57182-5},
	Month = {30 August--3 September},
	Publisher = SV,
	Series = LNCS,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Volume = 711,
	Year = 1993}

@proceedings{mfcs98,
	Address = {Brno, Czech Republic},
	Booktitle = {Mathematical Foundations of Computer Science},
	Editor = {Lubos Brim and Jozef Gruska and Jiri Zlatuska},
	Isbn = {3-540-64827-5},
	Month = aug,
	Publisher = SV,
	Series = LNCS,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Volume = 1450,
	Year = 1998}

@proceedings{mfcs99,
	Address = {Szklarska Poreba, Poland},
	Booktitle = {Mathematical Foundations of Computer Science},
	Editor = {M. Kutylowski and L. Pacholski and T. Wierzbicki},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Mathematical {F}oundations of {C}omputer {S}cience},
	Volume = 1672,
	Year = 1999}

@proceedings{pods91,
	Address = {Denver, CO},
	Booktitle = {Tenth {ACM} Symposium on the Principles of Database Systems},
	Month = may,
	Title = {Tenth {A{C}{M}} {S}ymposium on the {P}rinciples of {D}atabase {S}ystems},
	Year = 1991}

@proceedings{popl75,
	Address = {Palo Alto, CA},
	Booktitle = {Proceedings of 2nd {ACM} Conference on Principles of Programming Languages},
	Publisher = ACM,
	Title = {Proceedings of 2nd {A{C}{M}} {C}onference on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1975}

@proceedings{popl80,
	Address = {Las Vegas, Nevada},
	Booktitle = {Proccedings of the Seventh Annual {ACM} Symposion on Principles of Programming Languages},
	Month = jan,
	Publisher = ACM,
	Title = {Proccedings of the {S}eventh {A}nnual {A{C}{M}} {S}ymposion on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1980}

@proceedings{popl85,
	Booktitle = {Proceedings of 12th {ACM} Conference on Principles of Programming Languages},
	Editor = {B. Reid},
	Publisher = ACM,
	Title = {Proceedings of 12th {A{C}{M}} {C}onference on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1985}

@proceedings{popl87,
	Address = {Munich, Germany},
	Booktitle = {Proceedings of the 14th {ACM} Conference on Principles of Programming Languages},
	Month = jan,
	Publisher = ACM,
	Title = {Proceedings of the 14th {A{C}{M}} {C}onference on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1987}

@proceedings{popl90,
	Address = {San Francisco, CA},
	Booktitle = {Proceedings of the 17th {ACM} Conference on Principles of Programming Languages},
	Month = jan,
	Title = {Proceedings of the 17th {A{C}{M}} {C}onference on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1990}

@proceedings{popl91,
	Address = {Orlando, FL},
	Booktitle = {Proceedings of the 18th Symposium on Principles of Programming Languages},
	Month = jan,
	Publisher = ACM,
	Title = {Proceedings of the 18th {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1991}

@proceedings{popl92,
	Address = {Albuquerque, NM},
	Booktitle = {Conference Record of the 19th Symposium on Principles of Programming Languages},
	Publisher = ACM,
	Title = {Conference {R}ecord of the 19th {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1992}

@proceedings{popl94,
	Address = {Portland, Oregon},
	Booktitle = {Conference Record of the 21st Symposium on Principles of Programming Languages},
	Key = {POPL'94},
	Publisher = ACM,
	Title = {Conference {R}ecord of the 21st {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1994}

@proceedings{popl95,
	Address = {San Francisco, California},
	Booktitle = {Conference Record of the 22nd Symposium on Principles of Programming Languages},
	Key = {POPL'95},
	Month = jan,
	Publisher = ACM,
	Title = {Conference {R}ecord of the 22nd {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1995}

@proceedings{popl97,
	Address = {Paris, France},
	Booktitle = {Conference Record of the 24th Symposium on Principles of Programming Languages},
	Month = jan,
	Publisher = ACM,
	Title = {Conference {R}ecord of the 24th {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 1997}

@proceedings{popl99,
	Address = {San Antonio, Texas, United States},
	Booktitle = {Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
	Isbn = {1-58113-095-3},
	Publisher = ACM,
	Title = {Proceedings of the 26th {A}{C}{M} {S}{I}{G}{P}{L}{A}{N}-{S}{I}{G}{A}{C}{T} symposium on {P}rinciples of programming languages},
	Year = {1999}}

@proceedings{popl00,
	Address = {Boston, Masschusetts},
	Booktitle = {Conference Record of the 27th Symposium on Principles of Programming Languages},
	Editor = {Thomas Reps},
	Month = jan,
	Publisher = ACM,
	Title = {Conference {R}ecord of the 27th {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 2000}

@proceedings{popl02,
	Address = {Portland, OR, USA},
	Booktitle = {Conference Record of the 29th Symposium on Principles of Programming Languages},
	Editor = {John Mitchell},
	Month = jan,
	Publisher = ACM,
	Title = {Conference {R}ecord of the 29th {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 2002}

@proceedings{popl06,
	Address = {Charleston, South Carolina},
	Booktitle = {Conference Record of the 33rd Symposium on Principles of Programming Languages},
	Month = jan,
	Publisher = ACM,
	Title = {Conference {R}ecord of the 33rd {S}ymposium on {P}rinciples of {P}rogramming {L}anguages},
	Year = 2006}

@proceedings{ppcp94,
	Address = {Orcas Island, Washington, USA},
	Booktitle = {Principles and Practice of Constraint Programming},
	Title = {Principles and {P}ractice of {C}onstraint {P}rogramming},
	Year = 1994}

@proceedings{rta87,
	Address = {Bordeaux, France},
	Booktitle = {Rewriting Techniques and Applications},
	Editor = {Pierre Lescanne},
	Month = may,
	Publisher = SV,
	Series = LNCS,
	Title = {Rewriting {T}echniques and {A}pplications},
	Volume = 256,
	Year = 1987}

@proceedings{rta89,
	Address = {Chapel Hill, U.S.A.},
	Booktitle = {Rewriting Techniques and Applications},
	Editor = {Nachum Dershowitz},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {Rewriting {T}echniques and {A}pplications},
	Volume = 355,
	Year = 1989}

@proceedings{rta91,
	Address = {Como, Italy},
	Booktitle = {4th International Conference on Rewriting Techniques and Applications},
	Editor = {Ronald. V. Book},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {4th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 488,
	Year = 1991}

@proceedings{rta93,
	Address = {Montreal, Canada},
	Booktitle = {5th International Conference on Rewriting Techniques and Applications},
	Editor = {Claude Kirchner},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {5th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 690,
	Year = 1993}

@proceedings{rta95,
	Address = {Kaiserslautern, Germany},
	Booktitle = {6th International Conference on Rewriting Techniques and Applications},
	Editor = {Jieh Hsiang},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {6th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 914,
	Year = 1995}

@proceedings{rta96,
	Address = {New Brunswick, NJ, USA},
	Booktitle = {7th International Conference on Rewriting Techniques and Applications},
	Editor = {Harald Ganzinger},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {7th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 1103,
	Year = 1996}

@proceedings{rta97,
	Address = {Barcelona, Spain},
	Booktitle = {8th International Conference on Rewriting Techniques and Applications},
	Editor = {Hubert Comon},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {8th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = {1232},
	Year = 1997}

@proceedings{rta98,
	Address = {Tsukuba, Japan},
	Booktitle = {9th International Conference on Rewriting Techniques and Applications},
	Editor = {Tobias Nipkow},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {9th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = {1379},
	Year = 1998}

@proceedings{rta99,
	Address = {Trento, Italy},
	Booktitle = {10th International Conference on Rewriting Techniques and Applications},
	Editor = {Paliath Narendran and Michael Rusinowitch},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {10th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = {1631},
	Year = 1999}

@proceedings{rta00,
	Address = {Norwich, UK},
	Booktitle = {11th International Conference on Rewriting Techniques and Applications},
	Editor = {Leo Bachmair},
	Month = jul,
	Publisher = sv,
	Series = lncs,
	Title = {11th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 1833,
	Year = 2000}

@proceedings{rta01,
	Address = {Utrecht, The Netherlands},
	Booktitle = {12th International Conference on Rewriting Techniques and Applications},
	Editor = {Aart Middeldorp},
	Month = may,
	Publisher = sv,
	Series = lncs,
	Title = {12th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 2051,
	Year = 2001}

@proceedings{rta02,
	Address = {Copenhagen, Denmark},
	Booktitle = {13th International Conference on Rewriting Techniques and Applications},
	Editor = {Sophie Tison},
	Month = Jul,
	Publisher = sv,
	Series = lncs,
	Title = {13th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 2378,
	Year = 2002}

@proceedings{rta03,
	Address = {Valencia, Spain},
	Booktitle = {14th International Conference on Rewriting Techniques and Applications},
	Editor = {Roberto Nieuwenhuis},
	Month = jun,
	Publisher = sv,
	Series = lncs,
	Title = {14th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 2706,
	Year = 2003}

@proceedings{rta04,
	Address = {Aachen, Germany},
	Booktitle = {15th International Conference on Rewriting Techniques and Applications},
	Editor = {Vincent van Oostrom},
	Month = jun,
	Publisher = sv,
	Series = lncs,
	Title = {15th {I}nternational {C}onference on {R}ewriting {T}echniques and {A}pplications},
	Volume = 3091,
	Year = 2004}

@proceedings{ijcar01,
	Address = {Siena, Italy},
	Booktitle = {First International Joint Conference on Automated Reasoning},
	Editor = {Rajeev Gor{\'e} and Alexander Leitsch and Tobias Nipkow},
	Month = jun,
	Publisher = sv,
	Series = lnai,
	Title = {International {J}oint {C}onference on {A}utomated {R}easoning},
	Volume = 2083,
	Year = 2001}

@proceedings{ijcar04,
	Address = {Cork, Ireland},
	Booktitle = {Second International Joint Conference on Automated Reasoning},
	Publisher = SV,
	Series = LNAI,
	Title = {International {J}oint {C}onference on {A}utomated {R}easoning},
	Volume = 3097,
	Year = 2004}

@proceedings{ijcar06,
	Address = {Seattle, USA},
	Booktitle = {Third International Joint Conference on Automated Reasoning},
	Editor = {Ulrich Furbach and Natarajan Shankar},
	Month = aug,
	Publisher = SV,
	Series = LNCS,
	Title = {International {J}oint {C}onference on {A}utomated {R}easoning},
	Volume = 4130,
	Year = 2006}

@proceedings{srt95,
	Address = {Monte Verita, Switzerland},
	Booktitle = {Proceedings of the Conference on Symbolic Rewriting Techniques},
	Editor = {Manuel Bronstein and Volker Weispfenning},
	Title = {Proceedings of the {C}onference on {S}ymbolic {R}ewriting {T}echniques},
	Year = 1995}

@proceedings{stacs92,
	Address = {Paris, France},
	Booktitle = {9th Annual Symposium on Theoretical Aspects of Computer Science},
	Editor = {P. Enjalbert and A. Finkel and K. W. Wagner},
	Publisher = sv,
	Series = lncs,
	Volume = 577,
	Year = 1992}

@proceedings{tacs91,
	Booktitle = {Theoretical Aspects of Computer Software},
	Editor = {T. Ito and A. R. Meyer},
	Month = sep,
	Publisher = SV,
	Series = LNCS,
	Title = {Theoretical {A}spects of {C}omputer {S}oftware},
	Volume = {526},
	Year = 1991}

@proceedings{tacs97,
	Booktitle = {Theoretical Aspects of Computer Software},
	Editor = {Takahashi Ito and Martin Abadi},
	Publisher = sv,
	Series = LNCS,
	Title = {Theoretical {A}spects of {C}omputer {S}oftware},
	Volume = 1281,
	Year = 1997}

@proceedings{tapsoft85,
	Booktitle = {Proceedings of the International Joint Conference on Theory and Practice of Software Development},
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the {I}nternational {J}oint {C}onference on {T}heory and {P}ractice of {S}oftware {D}evelopment},
	Volume = {185},
	Year = 1985}

@proceedings{tapsoft87-2,
	Address = {Pisa, Italy},
	Booktitle = {Proceedings of the International Joint Conference on Theory and Practice of Software Development},
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the {I}nternational {J}oint {C}onference on {T}heory and {P}ractice of {S}oftware {D}evelopment},
	Volume = {250},
	Year = 1987}

@proceedings{tapsoft89-1,
	Address = {Barcelona, Spain},
	Booktitle = {Proceedings of the International Joint Conference on Theory and Practice of Software Development},
	Editor = {J. D\'{\i}az and F. Orejas},
	Month = mar,
	Note = {1 - Advanced Seminar on Foundations of Innovative Software Development {I} and Colloquium on Trees in Algebra and Programming},
	Publisher = SV,
	Series = LNCS,
	Title = {Proceedings of the {I}nternational {J}oint {C}onference on {T}heory and {P}ractice of {S}oftware {D}evelopment},
	Volume = {351},
	Year = 1989}

@proceedings{tapsoft93,
	Address = {Orsay, France},
	Booktitle = {4th International Joint Conference on Theory and Practice of Software Development},
	Editor = {M. C. Gaudel and J.-P. Jouannaud},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {4th {I}nternational {J}oint {C}onference on {T}heory and {P}ractice of {S}oftware {D}evelopment},
	Type_Publi = {editeur},
	Volume = 668,
	Year = 1993}

@proceedings{tapsoft97,
	Address = {Lille, France},
	Booktitle = {Theory and Practice of Software Development},
	Editor = {Michel Bidoit and Max Dauchet},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {Theory and {P}ractice of {S}oftware {D}evelopment},
	Volume = {1214},
	Year = 1997}

@proceedings{tlca93,
	Title = {International {C}onference of {T}yped {L}ambda {C}alculi and {A}pplications},
	Year = {1993}}

@proceedings{wadt92,
	Address = {Caldes de Malevella, Spain},
	Month = oct,
	Publisher = {Springer 1994},
	Title = {Proceedings 10th workshop on abstract data types.},
	Year = 1992}

@proceedings{fossacs2004,
	Booktitle = {Foundations of Software Science and Computation Structures},
	Number = 2987,
	Publisher = sv,
	Series = lncs,
	Title = {Foundations of {S}oftware {S}cience and {C}omputation {S}tructures},
	Year = 2004}

@proceedings{fossacs2001,
	Address = {Genova, Italy},
	Booktitle = {Foundations of Software Science and Computation Structures},
	Editor = {Honsell, Furio},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {Foundations of {S}oftware {S}cience and {C}omputation {S}tructures},
	Volume = 2030,
	Year = 2001}

@proceedings{fossacs2000,
	Address = {Berlin, Germany},
	Booktitle = {Foundations of Software Science and Computation Structures},
	Editor = {Jerzy Tiuryn},
	Month = mar,
	Publisher = SV,
	Series = LNCS,
	Title = {Foundations of {S}oftware {S}cience and {C}omputation {S}tructures},
	Volume = 1784,
	Year = 2000}

@proceedings{fossacs99,
	Booktitle = {Foundations of Software Science and Computation Structures},
	Publisher = SV,
	Series = LNCS,
	Title = {Foundations of {S}oftware {S}cience and {C}omputation {S}tructures},
	Volume = 1578,
	Year = 1999}

@proceedings{tacas2000,
	Address = {Berlin, Germany},
	Booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
	Editor = {Susanne Graf and Michael Schwartzbach},
	Month = mar,
	Publisher = SV,
	Series = LNCS,
	Title = {Tools and {A}lgorithms for the {C}onstruction and {A}nalysis of {S}ystems},
	Volume = 1785,
	Year = 2000}

@proceedings{sas00,
	Address = {Santa Barbara, CA, USA},
	Booktitle = {Static Analysis Symposium},
	Editor = {Jens Palsberg},
	Month = jun # {/} # jul,
	Title = {Static {A}nalysis {S}ymposium},
	Year = 2000}

@proceedings{tphols99,
	Address = {Nice},
	Clef_Labo = {BDP+99},
	Date-Modified = {2008-10-13 14:38:46 +0200},
	Editor = {Yves Bertot and Gilles Dowek and Christine Paulin-Mohring and Laurent Th{\'e}ry},
	Month = sep,
	Publisher = sv,
	Series = lncs,
	Title = {International {C}onference on {T}heorem {P}roving in {H}igher {O}rder {L}ogics ({T}{P}{H}{O}{L}s'99)},
	Topics = {team},
	Type_Publi = {editeur},
	Year = 1999}

@proceedings{tphols2000,
	Booktitle = {Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000},
	Editor = {J. Harrison and M. Aagaard},
	Publisher = sv,
	Series = lncs,
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics: 13th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2000},
	Volume = 1869,
	Year = 2000}

@proceedings{tphols2005,
	Addresse = {Oxford, UK},
	Booktitle = {18th International Conference on Theorem Proving in Higher Order Logics},
	Editor = {J. Hurd and T. Melham},
	Month = aug,
	Publisher = sv,
	Series = lncs,
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics: 18th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2005},
	Volume = 3603,
	Year = 2005}

@proceedings{tphols02,
	Address = {Hampton, VA, USA},
	Booktitle = {Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002},
	Editor = {Victor A. {Carre\~{n}o} and C\'{e}sar A. {Mu\~{n}oz} and Sofi\`{e}ne Tahar},
	Month = aug,
	Publisher = sv,
	Series = lncs,
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics: 15th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2002},
	Volume = 2410,
	Year = 2002}

@proceedings{tphols03,
	Booktitle = {Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003)},
	Editor = {David Basin and Burkhart Wolff},
	Publisher = {Springer-Verlag},
	Series = {LNCS},
	Title = {Proceedings of the 16th {I}nternational {C}onference on {T}heorem {P}roving in {H}igher {O}rder {L}ogics ({T}{P}{H}{O}{L}s 2003)},
	Volume = 2758,
	Year = 2003}

@proceedings{ppdp99,
	Address = {Paris},
	Booktitle = {Principles and Practice of Declarative Programming, International Conference PPDP'99},
	Editor = {Gopalan Nadathur},
	Publisher = sv,
	Series = lncs,
	Title = {Principles and {P}ractice of {D}eclarative {P}rogramming, {I}nternational {C}onference {P}{P}{D}{P}'99},
	Volume = {1702},
	Year = 1999}

@proceedings{ppdp2002,
	Address = {Pittsburgh, USA},
	Booktitle = {Proc. of 4th ACM Sigplan Conference on Principles and Practice of Declarative Programming, PPDP'02},
	Editor = {Claude Kirchner},
	Month = oct,
	Publisher = {ACM Press, New York},
	Title = {Proc. of 4th {A}{C}{M} {S}igplan {C}onference on {P}rinciples and {P}ractice of {D}eclarative {P}rogramming, {P}{P}{D}{P}'02},
	Year = 2002}

@proceedings{mcu01,
	Address = {Chisinau, Moldova},
	Month = may,
	Publisher = sv,
	Series = lncs,
	Title = {Machines, {C}omputations and {U}niversality ({M}{C}{U}2001)},
	Volume = 2055,
	Year = 2001}

@book{comon01cclbook,
	Booktitle = {Constraints in Computational Logics},
	Editor = {Hubert Comon and Claude March{\'e} and Ralf Treinen},
	Publisher = SV,
	Series = LNCS,
	Title = {Constraints in {C}omputational {L}ogics},
	Topics = {team},
	Type_Publi = {editeur},
	Volume = 2002,
	Year = 2001}

@proceedings{lfcs97,
	Address = {Yaroslavl, Russia},
	Booktitle = {Logical Foundations of Computer Science},
	Editor = {Sergei I. Adian and Anil Nerode},
	Month = jul,
	Publisher = sv,
	Series = lncs,
	Title = {Logical {F}oundations of {C}omputer {S}cience},
	Volume = 1234,
	Year = 1997}

@proceedings{lfcs94,
	Booktitle = {Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science},
	Editor = {Anil Nerode and Yuri Matiyasevich},
	Month = jul,
	Place = {St Petersburg, Russia},
	Publisher = sv,
	Series = lncs,
	Volume = 813,
	Year = 1994}

@techreport{unif2001,
	Address = {Siena, Italy},
	Author = {Franz Baader and Volker Diekert and Cesare Tinelli and Ralf Treinen},
	Institution = {Universit{\`a} degli Studi di Siena, Dipartimento di Ingegneria dell'Informazione},
	Month = jun,
	Number = {DII 09/01},
	Title = {U{N}{I}{F} 2001 - 15th {I}nternational {W}orkshop on {U}nification},
	Topics = {team},
	Type = {Technical Report},
	Type_Publi = {diffusion},
	Year = 2001}

@book{alves-foss99,
	Booktitle = {Formal Syntax and Semantics of Java},
	Editor = {J. Alves-Foss},
	Publisher = SV,
	Series = LNCS,
	Title = {Formal {S}yntax and {S}emantics of {J}ava},
	Volume = 1523,
	Year = 1999}

@proceedings{itrs02,
	Address = {Copenhaguen, Danemark},
	Booktitle = {Second Workshop on Intersection Types and Related Systems},
	Editor = {Stefan Van Bakel},
	Month = jul,
	Publisher = ES,
	Series = entcs,
	Title = {Second {W}orkshop on {I}ntersection {T}ypes and {R}elated {S}ystems},
	Volume = 70,
	Year = 2002}

@proceedings{ifiptcs2002,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {IFIP TCS},
	Editor = {Ricardo A. Baeza-Yates and Ugo Montanari and Nicola Santoro},
	Isbn = {1-4020-7181-7},
	Publisher = {Kluwer},
	Series = {IFIP Conference Proceedings},
	Title = {Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17$^{\mbox{th}}$ World Computer {C}ongress - {T}{C}1 {S}tream / 2$^{\mbox{nd}}$ {I}{F}{I}{P} {I}nternational {C}onference on {T}heoretical {C}omputer {S}cience ({T}{C}{S} 2002), {A}ugust 25-30, 2002, {M}ontr{\'e}al, {Q}u{\'e}bec, {C}anada},
	Year = 2002}

@proceedings{tlca2001,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Editor = {Samson Abramsky},
	Isbn = {3-540-41960-8},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Typed {L}ambda {C}alculi and {A}pplications, 5th {I}nternational {C}onference, {T}{L}{C}{A} 2001, {K}rakow, {P}oland, {M}ay 2-5, 2001, {P}roceedings},
	Volume = {2044},
	Year = {2001}}

@proceedings{tlca2003,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Editor = {Martin Hofmann},
	Isbn = {3-540-40332-9},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Typed {L}ambda {C}alculi and {A}pplications, 6th {I}nternational {C}onference, {T}{L}{C}{A} 2003, {V}alencia, {S}pain, {J}une 10-12, 2003, {P}roceedings},
	Volume = {2701},
	Year = {2003}}

@proceedings{ccl98,
	Booktitle = {5th International Workshop on } # ccl,
	Place = {Jerusalem, Israel},
	Year = 1998}

@proceedings{tlca95,
	Booktitle = {International Conference of Typed Lambda Calculi and Applications},
	Year = {1995}}

@proceedings{hoa93,
	Address = {Amsterdam, The Netherlands},
	Booktitle = {First International Workshop HOA93},
	Editor = {Jan Heering and Karl Meinke and Bernhard M{\"o}ller and Tobias Nipkow},
	Month = Sep,
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {{F}irst {I}nternational {W}orkshop {H}{O}{A}93},
	Volume = {816},
	Year = {1993}}

@proceedings{types00,
	Booktitle = {TYPES 2000},
	Editor = {Paul Callaghan and Zhaohui Luo and James McKinna and Robert Pollack},
	Isbn = {3-540-43287-6},
	Publisher = SV,
	Series = LNCS,
	Title = {Types for {P}roofs and {P}rograms, {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2000, {D}urham, {U}{K}, {D}ecember 8-12, 2000, {S}elected {P}apers},
	Volume = {2277},
	Year = {2002}}

@proceedings{types02,
	Booktitle = {TYPES 2002},
	Editor = {Herman Geuvers and Freek Wiedijk},
	Publisher = SV,
	Series = LNCS,
	Title = {Types for {P}roofs and {P}rograms {S}econd {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2002, {B}erg en {D}al, {T}he {N}etherlands, {A}pril 24-28, 2002, {S}elected {P}apers},
	Volume = 2646,
	Year = 2003}

@proceedings{types03,
	Address = {Torino, Italy},
	Booktitle = {3rd International Workshop on Types for Proofs and Programs},
	Editor = {Stefano Berardi and Mario Coppo and Ferruccio Damiani},
	Isbn = {3-540-22164-6},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {3rd {I}nternational {W}orkshop on {T}ypes for {P}roofs and {P}rograms},
	Volume = 3085,
	Year = 2004}

@proceedings{types04,
	Booktitle = {TYPES 2004},
	Isbn = {3-540-31428-8},
	Publisher = SV,
	Series = LNCS,
	Title = {Types for {P}roofs and {P}rograms, {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2004, {J}ouy-en-{J}osas, {F}rance, {D}ecember 15-18,2004, {S}elected {P}apers},
	Volume = {3839},
	Year = {2005}}

@proceedings{adcncl2000,
	Booktitle = {Automated Deduction in Classical and Non-Classical Logics},
	Editor = {Ricardo Caferra and G. Salzer},
	Month = jan,
	Number = 1761,
	Publisher = SV,
	Series = LNAI,
	Title = {Automated {D}eduction in {C}lassical and {N}on-{C}lassical {L}ogics},
	Year = 2000}

@proceedings{wst03,
	Booktitle = {{Extended Abstracts of the 6th International Workshop on Termination, WST'03}},
	Editor = {Albert Rubio},
	Month = Jun,
	Title = {{Extended {A}bstracts of the 6th {I}nternational {W}orkshop on {T}ermination, {W}{S}{T}'03}},
	Year = {2003}}

@proceedings{wst06,
	Booktitle = {{Extended Abstracts of the 8th International Workshop on Termination, WST'06}},
	Editor = {Alfons Geser and Harald Sondergaard},
	Month = aug,
	Title = {{Extended {A}bstracts of the 8th {I}nternational {W}orkshop on {T}ermination, {W}{S}{T}'06}},
	Year = {2006}}

@proceedings{wst07,
	Booktitle = {{Extended Abstracts of the 9th International Workshop on Termination, WST'07}},
	Editor = {Dieter Hofbauer and Alexander Serebrenik},
	Month = jun,
	Title = {{Extended {A}bstracts of the 9th {I}nternational {W}orkshop on {T}ermination, {W}{S}{T}'07}},
	Year = {2007}}

@proceedings{amast04,
	Address = {Stirling, UK},
	Booktitle = {Algebraic Methodology and Software Technology},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {Algebraic {M}ethodology and {S}oftware {T}echnology},
	Volume = 3116,
	Year = 2004}

@proceedings{pepm04,
	Address = {Verona, Italy},
	Booktitle = {ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation},
	Month = aug,
	Publisher = ACM,
	Title = {Partial {E}valuation and {P}rogram {M}anipulation},
	Year = 2004}

@proceedings{icfem04,
	Address = {Seattle, WA, USA},
	Booktitle = {6th International Conference on Formal Engineering Methods},
	Editor = {Jim Davies and Wolfram Schulte and Mike Barnett},
	Month = nov,
	Publisher = SV,
	Series = LNCS,
	Title = {Formal {E}ngineering {M}ethods},
	Volume = 3308,
	Year = 2004}

@proceedings{icfem05,
	Booktitle = {ICFEM},
	Editor = {Kung-Kiu Lau and Richard Banach},
	Isbn = {3-540-29797-9},
	Publisher = SV,
	Series = LNCS,
	Title = {Formal {M}ethods and {S}oftware {E}ngineering, 7th {I}nternational {C}onference on {F}ormal {E}ngineering {M}ethods, {I}{C}{F}{E}{M} 2005, {M}anchester, {U}{K}, {N}ovember 1-4, 2005, {P}roceedings},
	Volume = {3785},
	Year = {2005}}

@proceedings{cav04,
	Address = {Boston, MA, USA},
	Booktitle = {16th International Conference on Computer Aided Verification},
	Editor = {Rajeev Alur and Doron A. Peled},
	Month = jul,
	Publisher = SV,
	Series = lncs,
	Title = {Computer {A}ided {V}erification},
	Volume = 3114,
	Year = {2004}}

@proceedings{cav2004,
	Booktitle = {CAV},
	Editor = {Rajeev Alur and Doron Peled},
	Publisher = SV,
	Series = LNCS,
	Title = {Computer {A}ided {V}erification, 16th {I}nternational {C}onference, {C}{A}{V} 2004, {B}oston, {M}{A}, {U}{S}{A}, {J}uly 13-17, 2004, {P}roceedings},
	Volume = {3114},
	Year = {2004}}

@proceedings{jfla05,
	Booktitle = {Seizi\`emes Journ\'ees Francophones des Langages Applicatifs},
	Month = mar,
	Organization = {INRIA},
	Publisher = {INRIA},
	Title = {Journ\'ees {F}rancophones des {L}angages {A}pplicatifs},
	Year = 2005}

@proceedings{jfla06,
	Booktitle = {Dix-septi\`emes Journ\'ees Francophones des Langages Applicatifs},
	Month = jan,
	Organization = {INRIA},
	Publisher = {INRIA},
	Title = {Journ\'ees {F}rancophones des {L}angages {A}pplicatifs},
	Year = 2006}

@proceedings{jfla07,
	Booktitle = {Dix-huiti\`emes Journ\'ees Francophones des Langages Applicatifs},
	Month = jan,
	Organization = {INRIA},
	Publisher = {INRIA},
	Title = {Journ\'ees {F}rancophones des {L}angages {A}pplicatifs},
	Year = 2007}

@proceedings{jfla08,
	Booktitle = {Dix-neuvi\`emes Journ\'ees Francophones des Langages Applicatifs},
	Month = jan,
	Organization = {INRIA},
	Publisher = {INRIA},
	Title = {Journ\'ees {F}rancophones des {L}angages {A}pplicatifs},
	Year = 2008}

@proceedings{esop03,
	Booktitle = {12th European Symposium on Programming, ESOP 2003},
	Editor = {Pierpaolo Degano},
	Publisher = SV,
	Series = LNCS,
	Title = {Programming Languages and Systems, 12th European Symposium on Programming, E{S}{O}{P} 2003, {H}eld as {P}art of the {J}oint {E}uropean {C}onferences on {T}heory and {P}ractice of {S}oftware, {E}{T}{A}{P}{S} 2003, {W}arsaw, {P}oland, {A}pril 7-11, 2003, {P}roceedings},
	Volume = {2618},
	Year = {2003}}

@proceedings{sefm05,
	Address = {Koblenz, Germany},
	Booktitle = {3rd IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)},
	Editor = {Bernhard K. Aichernig and Bernhard Beckert},
	Month = sep,
	Publisher = IEEECSP,
	Title = {Software {E}ngineering and {F}ormal {M}ethods},
	Year = 2005}

@proceedings{sefm06,
	Address = {Pune, India},
	Booktitle = {4th IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)},
	Editor = {Dang Van Hung and Paritosh Pandya},
	Month = sep,
	Publisher = IEEECSP,
	Title = {Software {E}ngineering and {F}ormal {M}ethods},
	Year = 2006}

@proceedings{rta05,
	Address = {Nara, Japan},
	Booktitle = {16th International Conference on Rewriting Techniques and Applications (RTA'05)},
	Editor = {J\"urgen Giesl},
	Month = apr,
	Publisher = SV,
	Series = LNCS,
	Title = {Term {R}ewriting and {A}pplications},
	Volume = {3467},
	Year = 2005}

@proceedings{rta06,
	Address = {Seattle, USA},
	Booktitle = {17th International Conference on Rewriting Techniques and Applications (RTA'06)},
	Editor = {Frank Pfenning},
	Month = aug,
	Publisher = SV,
	Series = LNCS,
	Title = {Term {R}ewriting and {A}pplications},
	Volume = {4098},
	Year = 2006}

@proceedings{rta07,
	Address = {Paris, France},
	Booktitle = {18th International Conference on Rewriting Techniques and Applications (RTA'07)},
	Editor = {Franz Baader},
	Month = jun,
	Publisher = SV,
	Series = LNCS,
	Title = {Term {R}ewriting and {A}pplications},
	Year = 2007}

@proceedings{fm05,
	Address = {Newcastle,UK},
	Booktitle = {International Symposium of Formal Methods Europe (FM'05)},
	Editor = {John Fitzgerald and Ian J. Hayes and Andrzej Tarlecki},
	Month = jul,
	Publisher = SV,
	Series = LNCS,
	Title = {Formal {M}ethods},
	Volume = {3582},
	Year = 2005}

@proceedings{avis04,
	Address = {Barcelona, Spain},
	Booktitle = {{P}roceedings of the 3rd {I}nternational {W}orkshop on {A}utomated {V}erification of {I}nfinite-{S}tate {S}ystems ({AVIS}'04)},
	Editor = {Bharadwaj, Ramesh},
	Month = apr,
	Year = {2004}}

@inproceedings{avis06,
	Address = {Vienna, Austria},
	Booktitle = {{P}roceedings of the 5th {I}nternational {W}orkshop on {A}utomated {V}erification of {I}nfinite-{S}tate {S}ystems ({AVIS}'06)},
	Editor = {Bharadwaj, Ramesh},
	Month = apr,
	Year = {2006}}

@proceedings{mpc2006,
	Address = {Kuressaare, Estonia},
	Booktitle = {Mathematics of Program Construction, MPC 2006},
	Editor = {Tarmo Uustalu},
	Month = jul,
	Publisher = sv,
	Series = lncs,
	Title = {Mathematics of {P}rogram {C}onstruction, 8th {I}nternational {C}onference, {M}{P}{C} 2006},
	Volume = {4014},
	Year = {2006}}

@proceedings{icfp06,
	Address = {Portland, Oregon, USA},
	Booktitle = {11th ACM SIGPLAN International Conference on Functional Programming, ICFP 2006},
	Editor = {John H. Reppy and Julia L. Lawall},
	Isbn = {1-59593-309-3},
	Publisher = {ACM},
	Title = {Proceedings of the 11th {A}{C}{M} {S}{I}{G}{P}{L}{A}{N} {I}nternational {C}onference on {F}unctional {P}rogramming, {I}{C}{F}{P} 2006},
	Year = {2006}}

@proceedings{icfp07,
	Address = {Freiburg, Germany},
	Booktitle = {12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007},
	Editor = {Ralf Hinze and Norman Ramsey},
	Publisher = {ACM},
	Title = {Proceedings of the 12th {A}{C}{M} {S}{I}{G}{P}{L}{A}{N} {I}nternational {C}onference on {F}unctional {P}rogramming, {I}{C}{F}{P} 2007},
	Year = {2007}}

@proceedings{frocos05,
	Booktitle = {FroCoS'05},
	Editor = {Bernhard Gramlich},
	Publisher = SV,
	Series = LNCS,
	Title = {Frontiers of {C}ombining {S}ystems, 5th {I}nternational {W}orkshop, {F}ro{C}o{S} 2005, {V}ienna, {A}ustria, {S}eptember 19-21, 2005, {P}roceedings},
	Volume = 3717,
	Year = {2005}}

@proceedings{vmcai08,
	Address = {San Francisco, California, USA},
	Booktitle = {9th International Conference on Verification, Model Checking, and Abstract Interpretation},
	Editor = {Francesco Logozzo and Doron Peled and Lenore Zuck},
	Month = jan,
	Publisher = SV,
	Series = LNCS,
	Title = {Verification, {M}odel {C}hecking, and {A}bstract {I}nterpretation},
	Volume = 4905,
	Year = {2008}}

@proceedings{esop08,
	Address = {Budapest, Hungary},
	Booktitle = {17th European Symposium on Programming (ESOP'08)},
	Month = apr,
	Title = {17th {E}uropean {S}ymposium on {P}rogramming ({E}{S}{O}{P}'08)},
	Year = 2008}

@webpage{ergo,
	Author = {Sylvain Conchon and Evelyne Contejean},
	Date-Modified = {2008-04-01 13:52:24 +0200},
	Note = {\url{http://ergo.lri.fr/}},
	Read = {Oui},
	Title = {The {Ergo} automatic {T}heorem {P}rover},
	Topics = {team,lri},
	Url = {http://ergo.lri.fr/},
	Bdsk-Url-1 = {http://ergo.lri.fr/}}

@inproceedings{filliatre07cav,
	Author = {Jean-Christophe Filli\^atre and Claude March\'e},
	Crossref = {cav07},
	Date-Modified = {2008-04-01 13:52:33 +0200},
	Read = {Oui},
	Title = {The {Why/{K}rakatoa/{C}aduceus} {P}latform for {D}eductive {P}rogram {V}erification},
	Topics = {team, lri},
	Url = {http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf},
	Bdsk-Url-1 = {http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf}}

@inproceedings{leavens00jml,
	Author = {Gary T. Leavens and K. Rustan M. Leino and Erik Poll and Clyde Ruby and Bart Jacobs},
	Booktitle = {{OOPSLA} 2000 Companion, Minneapolis, Minnesota},
	Pages = {105--106},
	Title = {{J{M}{L}}: notations and tools supporting detailed design in {Java}},
	Year = 2000}

@article{marche04jlap,
	Author = {Claude March{\'e} and Christine Paulin-Mohring and Xavier Urbain},
	Journal = jlap,
	Note = {\url{http://krakatoa.lri.fr}},
	Number = {1--2},
	Pages = {89--106},
	Ps = {http://www.lri.fr/~marche/marche04jlap.ps},
	Title = {The \textsc{Krakatoa} {T}ool for {C}ertification of \textsc{Java/{J}ava{C}ard} {P}rograms annotated in \textsc{J{M}{L}}},
	Topics = {team},
	Type_Publi = {irevcomlec},
	Url = {http://krakatoa.lri.fr},
	Volume = 58,
	Year = 2004,
	Bdsk-Url-1 = {http://krakatoa.lri.fr}}

@article{hoare:axiomatic,
	Abstract = {In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantage, both theoretical and practical, may follow from a pursuance of these topics.},
	Address = {New York, NY, USA},
	Author = {Hoare, C. A. R.},
	Citeulike-Article-Id = {163708},
	Date-Added = {2008-03-31 17:43:59 +0200},
	Date-Modified = {2008-04-01 13:49:18 +0200},
	Doi = {10.1145/363235.363259},
	Issn = {0001-0782},
	Journal = {Commun. ACM},
	Keywords = {computer, foundations, geometry, logical, mathematics, programming, techniques},
	Month = {October},
	Number = {10},
	Pages = {576--580},
	Priority = {2},
	Publisher = {ACM Press},
	Read = {Non},
	Title = {An axiomatic basis for computer programming},
	Url = {http://portal.acm.org/citation.cfm?id=363259},
	Volume = {12},
	Year = {1969},
	Bdsk-Url-1 = {http://portal.acm.org/citation.cfm?id=363259},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/363235.363259}}

@article{ttsemtc,
	Author = {Aleksandar Nanevski and Paul Govereau and Greg Morrisett},
	Date-Added = {2008-03-31 14:03:17 +0200},
	Date-Modified = {2008-04-01 13:52:04 +0200},
	Keywords = {HTT},
	Note = {Submitted},
	Read = {Oui},
	Title = {Type-theoretic semantics for transactional concurrency},
	Year = {2007},
	Bdsk-File-1 = { }}

@article{httpolysep,
	Author = {Aleksandar Nanevski and Greg Morrisett and Lars Birkedal},
	Date-Added = {2008-03-31 13:57:29 +0200},
	Date-Modified = {2008-04-01 13:51:57 +0200},
	Journal = {Journal of Functional Programming},
	Keywords = {HTT},
	Note = {To appear},
	Read = {Oui},
	Title = {Hoare {T}ype {T}heory, {P}olymorphism and {S}eparation},
	Year = {2007},
	Bdsk-File-1 = { }}

@inproceedings{DBLP:conf/birthday/GoguenMM06,
	Author = {Healfdene Goguen and Conor McBride and James McKinna},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {Essays Dedicated to Joseph A. Goguen},
	Crossref = {DBLP:conf/birthday/2006goguen},
	Date-Added = {2008-03-28 12:48:18 +0100},
	Date-Modified = {2008-09-03 19:12:42 +0200},
	Ee = {http://dx.doi.org/10.1007/11780274_27},
	Pages = {521-540},
	Read = {Oui},
	Title = {Eliminating {D}ependent {P}attern {M}atching},
	Url = {http://www.cs.st-andrews.ac.uk/~james/RESEARCH/pattern-elimination-final.pdf},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.st-andrews.ac.uk/~james/RESEARCH/pattern-elimination-final.pdf}}

@proceedings{DBLP:conf/birthday/2006goguen,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {Essays Dedicated to Joseph A. Goguen},
	Date-Added = {2008-03-28 12:47:48 +0100},
	Date-Modified = {2008-03-28 12:47:48 +0100},
	Editor = {Kokichi Futatsugi and Jean-Pierre Jouannaud and Jos{\'e} Meseguer},
	Isbn = {3-540-35462-X},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Algebra, {M}eaning, and {C}omputation, {E}ssays {D}edicated to {J}oseph {A}. {G}oguen on the {O}ccasion of {H}is 65th {B}irthday},
	Volume = {4060},
	Year = {2006}}

@inproceedings{DBLP:conf/tphol/Oury05,
	Author = {Nicolas Oury},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Crossref = {DBLP:conf/tphol/2005},
	Date-Added = {2008-03-28 12:46:57 +0100},
	Date-Modified = {2008-04-01 13:50:47 +0200},
	Ee = {http://dx.doi.org/10.1007/11541868_18},
	Pages = {278-293},
	Read = {Oui},
	Title = {Extensionality in the {C}alculus of {C}onstructions},
	Year = {2005}}

@inproceedings{DBLP:conf/plpv/Oury07,
	Author = {Nicolas Oury},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PLPV},
	Crossref = {DBLP:conf/plpv/2007},
	Date-Added = {2008-03-28 12:40:41 +0100},
	Date-Modified = {2008-04-01 13:52:00 +0200},
	Ee = {http://doi.acm.org/10.1145/1292597.1292606},
	Pages = {47-56},
	Read = {Oui},
	Title = {Pattern matching coverage checking with dependent types using set approximations},
	Year = {2007}}

@proceedings{DBLP:conf/plpv/2007,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {PLPV},
	Date-Added = {2008-03-28 12:40:41 +0100},
	Date-Modified = {2008-03-28 12:40:41 +0100},
	Editor = {Aaron Stump and Hongwei Xi},
	Isbn = {978-1-59593-677-6},
	Publisher = {ACM},
	Title = {Proceedings of the {A}{C}{M} {W}orkshop {P}rogramming {L}anguages meets {P}rogram {V}erification, {P}{L}{P}{V} 2007, {F}reiburg, {G}ermany, {O}ctober 5, 2007},
	Year = {2007}}

@inproceedings{DBLP:conf/types/Letouzey02,
	Author = {Pierre Letouzey},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES'02},
	Crossref = {DBLP:conf/types/2002},
	Date-Added = {2008-03-24 19:51:18 +0100},
	Date-Modified = {2008-04-01 13:49:56 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2646/26460200.htm},
	Keywords = {Extraction},
	Pages = {200-219},
	Read = {Oui},
	Title = {A {N}ew {E}xtraction for {C}oq.},
	Year = {2002}}

@phdthesis{mcbride00dependently,
	Author = {Conor McBride},
	Date-Added = {2008-03-24 19:50:18 +0100},
	Date-Modified = {2019-10-18 15:04:05 +0200},
	Keywords = {dependent types, oleg},
	Read = {Oui},
	School = {University of Edinburgh},
	Title = {Dependently {T}yped {F}unctional {P}rograms and {T}heir {P}roofs},
	Url = {http://strictlypositive.org/thesis.pdf},
	Year = {1999},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/mcbride99dependently.html}}

@inproceedings{DBLP:conf/types/McBride00,
	Author = {Conor McBride},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2000},
	Date-Added = {2008-03-24 19:50:18 +0100},
	Date-Modified = {2008-04-01 13:49:48 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2277/22770197.htm},
	Keywords = {dependent types, pattern matching},
	Pages = {197-216},
	Read = {Oui},
	Title = {Elimination with a {M}otive},
	Year = {2000}}

@inproceedings{DBLP:conf/types/BradyMM03,
	Author = {Edwin Brady and Conor McBride and James McKinna},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2003},
	Date-Added = {2008-03-24 19:50:18 +0100},
	Date-Modified = {2008-04-01 13:50:07 +0200},
	Ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3085{\&}spage=115},
	Keywords = {dependent types, staging},
	Pages = {115-129},
	Read = {Oui},
	Title = {Inductive {F}amilies {N}eed {N}ot {S}tore {T}heir {I}ndices.},
	Year = {2003}}

@inproceedings{CtpcPLDI07,
	Address = {San Diego, California, USA},
	Author = {Adam Chlipala},
	Booktitle = {PLDI'07: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:52:11 +0200},
	Month = jun,
	Read = {Oui},
	Title = {A {C}ertified {T}ype-{P}reserving {C}ompiler from {L}ambda {C}alculus to {A}ssembly {L}anguage},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/CtpcPLDI07/},
	Year = {2007},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/CtpcPLDI07/}}

@inproceedings{CertVerICFP06,
	Address = {Portland, Oregon, USA},
	Author = {Adam Chlipala},
	Booktitle = {ICFP'06: Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:51:50 +0200},
	Month = sep,
	Read = {Oui},
	Title = {Modular {D}evelopment of {C}ertified {P}rogram {V}erifiers with a {P}roof {A}ssistant},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/CertVerICFP06/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/CertVerICFP06/}}

@inproceedings{PcvVMCAI06,
	Address = {Charleston, South Carolina, USA},
	Author = {Bor-Yuh Evan Chang and Adam Chlipala and George C. Necula},
	Booktitle = {VMCAI'06: Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Month = jan,
	Title = {A {F}ramework for {C}ertified {P}rogram {A}nalysis and {I}ts {A}pplications to {M}obile-{C}ode {S}afety},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/PcvVMCAI06/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/PcvVMCAI06/}}

@inproceedings{BlastICSE04,
	Address = {Edinburgh, Scotland},
	Author = {Dirk Beyer and Adam J. Chlipala and Thomas Henzinger and Ranjit Jhala and Rupak Majumdar},
	Booktitle = {ICSE'04: Proceedings of the 26th International Conference on Software Engineering},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:50:28 +0200},
	Month = may,
	Read = {Oui},
	Title = {Generating {T}ests from {C}ounterexamples},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/BlastICSE04/},
	Year = {2004},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/BlastICSE04/}}

@inproceedings{PositionPLPV06,
	Address = {Seattle, Washington, USA},
	Author = {Adam Chlipala},
	Booktitle = {PLPV'06: Proceedings of the Programming Languages meets Program Verification Workshop},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:51:47 +0200},
	Month = aug,
	Read = {Oui},
	Title = {Position {P}aper: {T}houghts on {P}rogramming with {P}roof {A}ssistants},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/PositionPLPV06/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/PositionPLPV06/}}

@inproceedings{KettleStrategies06,
	Address = {Seattle, Washington, USA},
	Author = {Adam Chlipala and George C. Necula},
	Booktitle = {STRATEGIES'06: Proceedings of the 6th International Workshop on Strategies in Automated Deduction},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:51:35 +0200},
	Month = aug,
	Read = {Oui},
	Title = {Cooperative {I}ntegration of an {I}nteractive {P}roof {A}ssistant and an {A}utomated {P}rover},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/KettleStrategies06/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/KettleStrategies06/}}

@inproceedings{OpenverTLDI05,
	Address = {Long Beach, California, USA},
	Author = {Bor-Yuh Evan Chang and Adam Chlipala and George C. Necula and Robert R. Schneck},
	Booktitle = {TLDI'05: Proceedings of the 2nd ACM SIGPLAN Workshop on Types in Language Design and Implementation},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Month = jan,
	Title = {The {Open {V}erifier} {F}ramework for {F}oundational {V}erifiers},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/OpenverTLDI05/},
	Year = {2005},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/OpenverTLDI05/}}

@inproceedings{CoolaidTLDI05,
	Address = {Long Beach, California, USA},
	Author = {Bor-Yuh Evan Chang and Adam Chlipala and George C. Necula and Robert R. Schneck},
	Booktitle = {TLDI'05: Proceedings of the 2nd ACM SIGPLAN Workshop on Types in Language Design and Implementation},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Month = jan,
	Title = {Type-{B}ased {V}erification of {A}ssembly {L}anguage for {C}ompiler {D}ebugging},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/CoolaidTLDI05/},
	Year = {2005},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/CoolaidTLDI05/}}

@inproceedings{StrictTLDI05,
	Address = {Long Beach, California, USA},
	Author = {Adam Chlipala and Leaf Petersen and Robert Harper},
	Booktitle = {TLDI'05: Proceedings of the 2nd ACM SIGPLAN Workshop on Types in Language Design and Implementation},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:50:51 +0200},
	Month = jan,
	Read = {Oui},
	Title = {Strict {B}idirectional {T}ype {C}hecking},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/StrictTLDI05/},
	Year = {2005},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/StrictTLDI05/}}

@inproceedings{PosterPCC06,
	Address = {Seattle, Washington, USA},
	Author = {Adam Chlipala},
	Booktitle = {PCC'06: Proceedings of the International Workshop on Proof-Carrying Code},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Month = aug,
	Title = {Developing {C}ertified {P}rogram {V}erifiers with a {P}roof {A}ssistant},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/PosterPCC06/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/PosterPCC06/}}

@inproceedings{BlastSAS04,
	Address = {Verona, Italy},
	Author = {Dirk Beyer and Adam J. Chlipala and Thomas Henzinger and Ranjit Jhala and Rupak Majumdar},
	Booktitle = {SAS'04: Proceedings of the 11th Static Analysis Symposium},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Month = aug,
	Title = {The {Blast} {Q}uery {L}anguage for {S}oftware {V}erification},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/BlastSAS04/},
	Year = {2004},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/BlastSAS04/}}

@techreport{LaconicTR,
	Author = {Adam Chlipala},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:51:32 +0200},
	Number = {UCB/EECS-2006-120},
	Read = {Oui},
	Title = {Scrap {Y}our {W}eb {A}pplication {B}oilerplate, or {M}etaprogramming with {R}ow {T}ypes},
	Type = {{Technical Report}},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/LaconicTR/},
	Year = {2006},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/LaconicTR/}}

@techreport{PcvTR,
	Author = {Bor-Yuh Evan Chang and Adam Chlipala and George C. Necula},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-03-24 19:49:19 +0100},
	Institution = {UC Berkeley EECS Department},
	Number = {UCB/ERL M05/32},
	Title = {A {F}ramework for {C}ertified {P}rogram {A}nalysis and {I}ts {A}pplications to {M}obile-{C}ode {S}afety},
	Type = {{Technical Report}},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/PcvTR/},
	Year = {2005},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/PcvTR/}}

@techreport{ChlipalaMS,
	Author = {Adam Chlipala},
	Date-Added = {2008-03-24 19:49:19 +0100},
	Date-Modified = {2008-04-01 13:50:16 +0200},
	Institution = {UC Berkeley EECS Department},
	Number = {UCB/ERL M04/41},
	Read = {Oui},
	Title = {An {U}ntrusted {V}erifier for {T}yped {A}ssembly {L}anguage},
	Type = {{Technical Report}},
	Url = {http://www.cs.berkeley.edu/~adamc/papers/ChlipalaMS/},
	Year = {2004},
	Bdsk-Url-1 = {http://www.cs.berkeley.edu/~adamc/papers/ChlipalaMS/}}

@article{Benton:2006ce,
	Abstract = {We introduce a Floyd-Hoare-style framework for specification and verification of machine code programs, based on relational parametricity (rather than unary predicates) and using both step-indexing and a novel form of separation structure. This yields compositional, descriptive and extensional reasoning principles for many features of low-level sequential computation: independence, ownership transfer, unstructured control flow, first-class code pointers and address arithmetic. We demonstrate how to specify and verify the implementation of a simple memory manager and, independently, its clients in this style. The work has been fully machine-checked within the Coq proof assistant. },
	Author = {Benton, Nick},
	Date-Added = {2008-03-24 19:44:44 +0100},
	Date-Modified = {2008-04-01 13:51:03 +0200},
	Journal = {Computer Science Logic},
	Keywords = {separation logic},
	M3 = {10.1007/11874683{\_}12},
	Pages = {182--196},
	Read = {Oui},
	Title = {Abstracting {A}llocation},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/11874683_12},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/11874683_12}}

@article{Nanevski:2007ik,
	Abstract = {Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsulated, stateful computations. The type system incorporates pre- and post-conditions, in a fashion similar to Hoare and Separation Logic, so that programmers can modularly specify the requirements and effects of computations within types.  This paper extends HTT with quantification over abstract predicates (i.e., higher-order logic), thus embedding into HTT the Extended Calculus of Constructions. When combined with the Hoare-like specifications, abstract predicates provide a powerful way to define and encapsulate the invariants of private state that may be shared by several functions, but is not accessible to their clients. We demonstrate this power by sketching a number of abstract data types that demand ownership of mutable memory, including an idealized custom memory manager.   },
	Author = {Nanevski, Aleksandar and Ahmed, Amal and Morrisett, Greg and Birkedal, Lars},
	Date-Added = {2008-03-24 19:36:57 +0100},
	Date-Modified = {2008-04-01 13:51:54 +0200},
	Journal = {Programming Languages and Systems},
	Keywords = {HTT},
	M3 = {10.1007/978-3-540-71316-6{\_}14},
	Pages = {189--204},
	Read = {Oui},
	Title = {Abstract {P}redicates and {M}utable {A}{D}{T}s in {H}oare {T}ype {T}heory},
	Ty = {CHAPTER},
	Url = {http://dx.doi.org/10.1007/978-3-540-71316-6_14},
	Year = {2007},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-71316-6_14}}

@inproceedings{mandelbaum:icfp03,
	Address = {Uppsala, Sweden},
	Author = {Yitzhak Mandelbaum and David Walker and Robert Harper},
	Booktitle = {ICFP '03: Proceedings of the eighth ACM SIGPLAN International Conference on Functional Programming},
	Date-Added = {2008-03-24 19:14:56 +0100},
	Date-Modified = {2008-10-09 19:17:37 +0200},
	Doi = {http://doi.acm.org/10.1145/944705.944725},
	Isbn = {1-58113-756-7},
	Keywords = {refinement},
	Pages = {213--225},
	Publisher = {ACM},
	Read = {Oui},
	Title = {{A}n {E}ffective {T}heory of {T}ype {R}efinements},
	Url = {http://www.cs.princeton.edu/sip/pub/effective-type-refinements03.pdf},
	Year = {2003},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://portal.acm.org/ft_gateway.cfm?id=944725&type=pdf&coll=GUIDE&dl=GUIDE&CFID=21423515&CFTOKEN=99839047},
	Bdsk-Url-2 = {http://doi.acm.org/10.1145/944705.944725},
	Bdsk-Url-3 = {http://www.cs.princeton.edu/sip/pub/effective-type-refinements03.pdf}}

@mastersthesis{sozeau.Coq/Russell/report,
	Address = {LRI, Orsay},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2009-01-08 14:51:36 +0100},
	Keywords = {coercion, subsets, Calculus of Constructions},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/master-sozeau.pdf},
	Read = {Oui},
	School = {Universit\'e Paris VII},
	Title = {Coercion par pr\'edicats en {C}oq},
	Year = {2005}}

@misc{sozeau.Coq/Russell/web,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:51:29 +0200},
	Read = {Oui},
	Title = {{R}ussell},
	Web = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/russell.en.html},
	Year = {2006}}

@unpublished{sozeau.Coq/Russell/meta,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2010-01-05 20:54:14 +0100},
	Note = {Notes},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/metaproof.pdf},
	Read = {Oui},
	Title = {Russell {M}etatheoretic {S}tudy in {C}oq},
	Year = {2006}}

@misc{sozeau.Coq/Russell/meta-web,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-09-03 17:55:28 +0200},
	Read = {Oui},
	Title = {{R}ussell {M}etatheoretic {S}tudy in {Coq}, experimental development},
	Web = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/russell/meta.en.html},
	Year = {2006}}

@misc{sozeau.Coq/Russell/types06,
	Address = {University of Nottingham, UK},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:51:33 +0200},
	Howpublished = {Talk given at TYPES'06},
	Month = {19-21 april},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Subset_Coercions_in_Coq-types06-210406.pdf},
	Read = {Oui},
	Title = {Subset {C}oercions in {Coq}},
	Type = {slides},
	Year = {2006}}

@inproceedings{sozeau.Coq/Russell/article,
	Abstract = {We propose a new language for writing programs with dependent
  types on top of the {C}oq proof assistant. This language permits
  to establish a phase distinction between writing and proving
  algorithms in the {C}oq environment.  Concretely, this means allowing
  to write algorithms as easily as in a practical functional programming
  language whilst giving them as rich a specification as desired and
  proving that the code meets the specification using the whole {C}oq
  proof apparatus. This is achieved by extending conversion to an
  equivalence which relates types and subsets based on them, a technique
  originating from the ``Predicate subtyping'' feature of PVS
  and following mathematical convention. The typing judgements can be
  translated to the Calculus of Inductive Constructions by means of an interpretation
  which inserts coercions at the appropriate places. These coercions can
  contain existential variables representing the propositional parts of
  the final term, corresponding to proof obligations (or PVS
  type-checking conditions). A prototype implementation of this process
  is integrated with the {C}oq environment.},
	Author = {Matthieu Sozeau},
	Booktitle = {TYPES'06},
	Copyright = {Springer},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-12-29 19:17:42 +0100},
	Doi = {http://dx.doi.org/10.1007/978-3-540-74464-1_16},
	Editor = {Thorsten Altenkirch and Conor McBride},
	Pages = {237-252},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Subset_Coercions_in_Coq.pdf},
	Publisher = {Springer},
	Read = {Oui},
	Series = {Lecture Notes in Computer Science},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Subset_Coercions_in_Coq-types06-210406.pdf},
	Title = {{Subset Coercions in Coq}},
	Volume = {4502},
	Year = {2007},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-74464-1_16}}

@misc{sozeau.Coq/FingerTrees/web,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:51:56 +0200},
	Read = {Oui},
	Title = {{D}ependent {F}inger {T}rees in {C}oq},
	Web = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/russell/fingertrees.en.html},
	Year = {2007}}

@inproceedings{sozeau.Coq/FingerTrees/article,
	Abstract = {Finger Trees (Hinze & Paterson, JFP 2006) are a general purpose persistent
data structure with good performance. Their genericity permits developing
a wealth of structures like ordered sequences or interval trees
on top of a single implementation. However, the type systems
used by current functional languages do not guarantee the coherent
parameterization and specialization of Finger Trees, let alone the
correctness of their implementation.
We present a certified implementation of Finger Trees solving
these problems using the {P}rogram extension of {C}oq. 
We not only implement the structure but also prove its
invariants along the way, which permit building certified
structures on top of Finger Trees in an elegant way.},
	Address = {Freiburg, Germany},
	Author = {Matthieu Sozeau},
	Booktitle = {ICFP'07},
	Copyright = {ACM, 2007. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ICFP'07, http://doi.acm.org/10.1145/1291151.1291156},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2014-02-10 14:13:02 +0000},
	Doi = {http://doi.acm.org/10.1145/1291151.1291156},
	Isbn = {978-1-59593-815-2},
	Pages = {13--24},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq.pdf},
	Publisher = {ACM Press},
	Read = {Oui},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq-icfp07-011007.pdf},
	Title = {{P}rogram-ing {F}inger {T}rees in {C}oq},
	Year = {2007},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/1291151.1291156}}

@unpublished{sozeau.Coq/lambda/notes,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:51:53 +0200},
	Note = {Literate {C}oq script},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/drafts/lambda-notes.pdf},
	Read = {Oui},
	Title = {A dependently-typed formalization of simply-typed lambda-calculus: substitution, denotation, normalization},
	Year = {2007}}

@misc{sozeau.Coq/Programing/proval07,
	Address = {Orsay},
	Author = me,
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:05 +0200},
	Howpublished = {Talk given at the {P}ro{V}al seminar},
	Month = {9th march},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_in_Coq-proval-090307.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing in {C}oq},
	Type = {slides},
	Year = {2007}}

@misc{sozeau.Coq/Programing/gallium07,
	Address = {Rocquencourt},
	Author = me,
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:05 +0200},
	Howpublished = {Talk given at the {G}allium seminar},
	Month = {16th march},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_in_Coq-gallium-160307.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing in {C}oq},
	Type = {slides},
	Year = {2007}}

@misc{sozeau.Coq/FingerTrees/types07,
	Address = {Cividale Del Friuli, Italy},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:06 +0200},
	Howpublished = {Talk given at TYPES'07},
	Month = {2-5 May},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq-types07-040507.pdf},
	Read = {Oui},
	Title = {A journey with {R}ussell: {P}rogramming {D}ependent {F}inger {T}rees in {C}oq},
	Type = {slides},
	Year = {2007}}

@misc{sozeau.Coq/FingerTrees/icfp07,
	Address = {Freiburg, Germany},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:12 +0200},
	Howpublished = {Talk given at ICFP'07},
	Month = {1--3 October},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq-icfp07-011007.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing {F}inger {T}rees in {C}oq},
	Type = {slides},
	Year = {2007}}

@misc{sozeau.Coq/classes/web,
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:16 +0200},
	Read = {Oui},
	Title = {{T}ype classes in {C}oq},
	Web = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/coq/classes.en.html},
	Year = {2008}}

@inproceedings{sozeau.Coq/classes/fctc,
	Abstract = {
Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for 
specifying with abstract structures by quantification on contexts. However, 
both systems are limited by second-class implementations of these constructs,
and these limitations are only overcomed by ad-hoc extensions to 
the respective systems. We propose an embedding of type classes into a 
dependent type theory that is first-class and supports some of the most 
popular extensions right away. The implementation is correspondingly 
cheap, general and very well integrated inside the system, as we have 
experimented in Coq. We show how it can be used to help structured 
programming and proving by way of examples.},
	Author = {Matthieu Sozeau and Nicolas Oury},
	Booktitle = {TPHOLs},
	Copyright = {Springer},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2014-02-10 14:11:53 +0000},
	Doi = {10.1007/978-3-540-71067-7_23},
	Editor = {Otmane Ait Mohamed, C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tahar},
	Keywords = {Type classes},
	Month = {August},
	Pages = {278-293},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes.pdf},
	Publisher = {Springer},
	Read = {Oui},
	Series = {LNCS},
	Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-TPHOLs-200808.pdf},
	Title = {{F}irst-{C}lass {T}ype {C}lasses},
	Volume = {5170},
	Year = {2008},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-71067-7_23}}

@misc{sozeau.Coq/Programing/psu08,
	Address = {Portland, OR},
	Author = me,
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:18 +0200},
	Howpublished = {Talk given at {P}ortland {S}tate {U}niversity},
	Month = {16th january},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_in_Coq-psu-160108.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing in {C}oq},
	Type = {slides},
	Year = {2008}}

@misc{sozeau.Coq/Programing/harvard08,
	Address = {Cambridge, MA},
	Author = me,
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:18 +0200},
	Howpublished = {Talk given at {H}arvard},
	Month = {23th january},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_in_Coq-harvard-230108.pdf},
	Read = {Oui},
	Title = {{P}rogram-ing in {C}oq},
	Type = {slides},
	Year = {2008}}

@misc{sozeau.Coq/FingerTrees/dtp08,
	Address = {Nottingham, UK},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-04-01 13:52:19 +0200},
	Howpublished = {Talk given at DTP'08},
	Month = {18--20 February},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Dependent_Finger_Trees-dtp08-180208.pdf},
	Read = {Oui},
	Title = {{D}ependent {F}inger {T}rees},
	Type = {slides},
	Year = {2008}}

@misc{sozeau.Coq/classes/tphols08,
	Address = {Montr{\'e}al, Canada},
	Author = {Matthieu Sozeau},
	Date-Added = {2008-03-24 19:08:52 +0100},
	Date-Modified = {2008-11-04 11:58:15 +0100},
	Howpublished = {Talk given at {TPHOLs}'08},
	Keywords = {Type classes},
	Month = {20th August},
	Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/First-Class_Type_Classes-TPHOLs-200808.pdf},
	Read = {Oui},
	Title = {{F}irst-{C}lass {T}ype {C}lasses},
	Type = {slides},
	Year = {2008}}

@article{DBLP:journals/eik/Basin94,
	Author = {David A. Basin},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-02-27 12:32:04 +0100},
	Date-Modified = {2008-09-10 20:38:53 +0200},
	Journal = {Elektronische Informationsverarbeitung und Kybernetik},
	Keywords = {rewriting, setoid},
	Number = {5/6},
	Pages = {249-259},
	Read = {Oui},
	Title = {Generalized {R}ewriting in {T}ype {T}heory},
	Url = {http://www.inf.ethz.ch/personal/basin/pubs/tt-rewrite.ps.gz},
	Volume = {30},
	Year = {1994},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.inf.ethz.ch/personal/basin/pubs/tt-rewrite.ps.gz}}

@misc{Gonthier4col,
	Author = {Georges Gonthier and Benjamin Werner},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-10-01 16:45:17 +0200},
	Keywords = {verification, Coq},
	Month = {April},
	Read = {Oui},
	Title = {A computer-checked proof of the four-coulour theorem},
	Url = {http://research.microsoft.com/~gonthier/4colproof.pdf},
	Year = {2005},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://research.microsoft.com/~gonthier/4colproof.pdf}}

@inproceedings{longo95logic,
	Author = {Longo and Milsted and Soloviev},
	Booktitle = {{LICS}: {IEEE} Symposium on Logic in Computer Science},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:15 +0200},
	Keywords = {Subtyping},
	Read = {Oui},
	Title = {A {L}ogic of {S}ubtyping},
	Url = {http://citeseer.ist.psu.edu/longo96logic.html},
	Year = {1995},
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/longo96logic.html}}

@inproceedings{Xi:ATStypes03,
	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.
}},
	Author = {Hongwei Xi},
	Booktitle = {post-workshop Proceedings of TYPES 2003},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-10-07 14:22:21 +0200},
	Keywords = {ATS, dependent types},
	Pages = {394--408},
	Pdf = {http://www.cs.bu.edu/~hwxi/academic/papers/types03.pdf},
	Publisher = {Springer-Verlag LNCS 3085},
	Read = {Oui},
	Title = {{Applied {T}ype {S}ystem (extended abstract)}},
	Year = {2004}}

@misc{Xi:ATS,
	Author = {Hongwei Xi},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:50:43 +0200},
	Keywords = {ATS},
	Read = {Oui},
	Title = {Applied {T}ype {S}ystems},
	Url = {http://www.cs.bu.edu/~hwxi/ATS/ATS.html},
	Year = {2005},
	Bdsk-Url-1 = {http://www.cs.bu.edu/~hwxi/ATS/ATS.html}}

@inproceedings{Chen:POPL-2003,
	Abstract = {We present a coercive subtyping system for the calculus of
                  constructions. The proposed system $\lambda C_{\leq}^{co}$ is obtained
                  essentially by adding coercions and $\eta$-conversion to
                  $\lambda C_\leq$\cite{Chen97a}, which is a subtyping
                  extension to the calculus of constructions without
                  coercions. Following \cite{LMS95,LMS98}, the coercive
                  subtyping $c : A \leq B$ is understood as a special case
                  of typing in arrow type $c : A \to B$ such that the term
                  $c$ behaves like an identity function. We prove that,
                  with respect to this semantic interpretation, the
                  proposed coercive subtyping system is sound and complete,
                  and that this completeness leads to transitivity
                  elimination.  In addition, we establish the equivalence
                  between $\lambda C_{\leq}^{co}$ and $\lambda C_{\beta \eta}$, this fact implies that
                  $\lambda C_{\leq}^{co}$ has confluence, subject reduction and strong
                  normalization. We propose a formalization of coercion
                  inference problem and present a sound and complete
                  coercion inference algorithm.},
	Author = {Gang Chen},
	Booktitle = popl03,
	Churchreport = {yes},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2009-09-22 15:05:34 -0400},
	Keywords = {Subtyping, coercion, Calculus of Constructions},
	Pages = {150-159},
	Pdf = {http://www.church-project.org/reports/electronic/Chen:POPL-2003.pdf},
	Read = {Oui},
	Title = {Coercive {S}ubtyping for the {C}alculus of {C}onstructions (extended abstract)},
	Year = {2003},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.church-project.org/reports/electronic/Chen:POPL-2003.pdf.gz}}

@inproceedings{cal00coherence,
	Address = {Ponte de Lima, Portugal},
	Author = {Paul Callaghan},
	Booktitle = {APPSEM Workshop on Subtyping and Dependent Types in Programming},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:51 +0200},
	Keywords = {coercion, subtyping, dependent types},
	Month = {July},
	Read = {Oui},
	Title = {Coherence checking and its implementation in plastic},
	Url = {http://www-sop.inria.fr/oasis/DTP00/Proceedings/callaghan.ps},
	Year = {2000},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www-sop.inria.fr/oasis/DTP00/Proceedings/callaghan.ps}}

@inproceedings{XiPfenning1999DTP,
	Acknowledgement = ack-nhfb,
	Author = {Hongwei Xi and Frank Pfenning},
	Bibdate = {Mon May 3 12:58:58 MDT 1999},
	Booktitle = popl99,
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-09-10 22:38:47 +0200},
	Fullpublisher = {ACM Press},
	Fullseries = {ACM SIG{-}PLAN Notices},
	Keywords = {dependent types, dml},
	Month = jan,
	Pages = {214--227},
	Read = {Oui},
	Title = {Dependent types in practical programming},
	Url = {http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p214-xi/},
	Year = {1999},
	Bdsk-Url-1 = {http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p214-xi/}}

@proceedings{conf/mfcs/1997,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MFCS},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:34 +0200},
	Editor = {Igor Pr\'{\i}vara and Peter Ruzicka},
	Isbn = {3-540-63437-1},
	Publisher = {Springer},
	Read = {Non},
	Series = {Lecture Notes in Computer Science},
	Title = {Mathematical {F}oundations of {C}omputer {S}cience 1997, 22nd {I}nternational {S}ymposium, {M}{F}{C}{S}'97, {B}ratislava, {S}lovakia, {A}ugust 25-29, 1997, {P}roceedings},
	Volume = {1295},
	Year = {1997}}

@book{whitehead.russell:principia,
	Address = {Cambridge},
	Author = {Whitehead, Alfred North and Russell, Bertrand},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:20 +0200},
	Publisher = {Cambridge University Press},
	Read = {Non},
	Title = {Principia {M}athematica},
	Year = 1910}

@book{progmartinlof,
	Author = {Nordstr\"{o}m, Bengt and Petersson, Kent and Smith, Jan M.},
	Citeulike-Article-Id = {760320},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:14 +0200},
	Howpublished = {out of print; avalaible electronically},
	Keywords = {functional_programming type_theory},
	Priority = {3},
	Publisher = {Oxford University Press},
	Read = {Oui},
	Title = {Programming in {M}artin-{L}\"of's {T}ype {T}heory},
	Url = {http://www.cs.chalmers.se/Cs/Research/Logic/book/},
	Year = {1990},
	Bdsk-Url-1 = {http://www.cs.chalmers.se/Cs/Research/Logic/book/}}

@phdthesis{ChenPhD,
	Address = {Laboratoire d'Informatique de l'\'Ecole Normale Sup\'erieure, Paris},
	Author = {Gang Chen},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-09-10 22:24:03 +0200},
	Keywords = {subtyping, coercion, Calculus of Constructions},
	Month = {D\'ecembre},
	Read = {Oui},
	School = {Universit\'e Paris {\uppercase\expandafter{\romannumeral 7}}},
	Title = {Sous-typage, {C}onversion de {T}ypes et \'{E}limination de la {T}ransitivit\'e},
	Url = {http://cat.inist.fr/?aModele=afficheN&cpsidt=197333},
	Year = {1998},
	Bdsk-Url-1 = {http://cat.inist.fr/?aModele=afficheN&cpsidt=197333}}

@misc{stumpsubset,
	Author = {Aaron Stump},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:50:08 +0200},
	Keywords = {subsets, partiality},
	Note = {Draft paper},
	Read = {Oui},
	Title = {Subset {T}ypes and {P}artial {F}unctions},
	Url = {http://citeseer.ist.psu.edu/699807.html},
	Year = {2003},
	Bdsk-Url-1 = {http://citeseer.ist.psu.edu/699807.html}}

@inproceedings{conf/mfcs/Chen97,
	Author = {Gang Chen},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MFCS},
	Crossref = {DBLP:conf/mfcs/1997},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:34 +0200},
	Keywords = {Subtyping, Calculus of Constructions},
	Pages = {189--198},
	Read = {Oui},
	Title = {Subtyping {C}alculus of {C}onstruction ({E}xtended {A}bstract).},
	Year = {1997}}

@inproceedings{conf/mpc/Parent95,
	Author = {Catherine Parent},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MPC},
	Crossref = {DBLP:conf/mpc/1995},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-09-10 22:41:21 +0200},
	Keywords = {Calculus of Constructions},
	Pages = {351-379},
	Read = {Oui},
	Title = {Synthesizing {P}roofs from {P}rograms in the {C}alculus of {I}nductive {C}onstructions.},
	Url = {http://www-verimag.imag.fr/~parent/MPC/mpc.ps},
	Year = {1995},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www-verimag.imag.fr/~parent/MPC/mpc.ps}}

@inproceedings{DBLP:conf/types/MiquelW02,
	Author = {Alexandre Miquel and Benjamin Werner},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Crossref = {DBLP:conf/types/2002},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-09-03 19:15:33 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2646/26460240.htm},
	Keywords = {proof-irrelevance, Calculus of Constructions, model},
	Pages = {240-258},
	Pdf = {http://www.pps.jussieu.fr/~miquel/publis/types02.pdf},
	Read = {Oui},
	Title = {The {N}ot {S}o {S}imple {P}roof-{I}rrelevant {M}odel of {C{C}}.},
	Year = {2002},
	Bdsk-Url-1 = {http://www.pps.jussieu.fr/~miquel/publis/types02.pdf}}

@article{DBLP:journals/jfp/McBrideM04,
	Author = {Conor McBride and James McKinna},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:50:21 +0200},
	Ee = {http://dx.doi.org/10.1017/S0956796803004829},
	Journal = {J. Funct. Program.},
	Keywords = {pattern matching, dependent types},
	Number = {1},
	Pages = {69-111},
	Read = {Oui},
	Title = {The view from the left.},
	Volume = {14},
	Year = {2004},
	Bdsk-File-1 = { }}

@inproceedings{saibi97inheritance,
	Address = {La Sorbonne, Paris, France},
	Author = {Amokrane Sa\"ibi},
	Booktitle = {24th Annual Symposium on Principles of Programming Languages},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-09-03 19:36:56 +0200},
	Keywords = {Subtyping, Calculus of Constructions, coercion},
	Month = {January 15-17},
	Organization = {ACM},
	Pages = {292--301},
	Read = {Oui},
	Title = {{T}yping {A}lgorithm in {T}ype {T}heory with {I}nheritance},
	Url = {http://pauillac.inria.fr/~saibi/ClassCoq4.ps},
	Year = {1997},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://pauillac.inria.fr/~saibi/ClassCoq4.ps}}

@article{adams:PTSEQ,
	Author = {Robin Adams},
	Date-Modified = {2008-09-22 13:56:27 +0200},
	Journal = {Journal of Functional Programming},
	Keywords = {PTS},
	Pages = {219-246},
	Read = {Oui},
	Title = {{P}ure {T}ype {S}ystems with {J}udgemental {E}quality},
	Url = {http://www.cs.rhul.ac.uk/~robin/ptseq8.ps.gz},
	Volume = {16:2},
	Year = {2006},
	Bdsk-File-1 = { },
	Bdsk-Url-1 = {http://www.cs.rhul.ac.uk/~robin/ptseq8.ps.gz}}

@article{werner:ProofIrrelevance,
	Author = {Benjamin Werner},
	Date-Modified = {2008-10-01 16:18:00 +0200},
	Journal = {3rd International Joint Conference on Automated Reasoning},
	Keywords = {proof-irrelevance, Calculus of Constructions},
	Pdf = {http://www.lix.polytechnique.fr/Labo/Benjamin.Werner/publis/ijcar06.pdf},
	Read = {Oui},
	Title = {On the strength of proof-irrelevant type theories},
	Year = {2006},
	Bdsk-File-1 = { }}

@inproceedings{DBLP:conf/tlca/Miquel01,
	Author = {Alexandre Miquel},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Date-Modified = {2008-09-03 19:16:36 +0200},
	Ee = {http://link.springer.de/link/service/series/0558/bibs/2044/20440344.htm},
	Keywords = {staging, Calculus of Constructions},
	Pages = {344-359},
	Pdf = {http://www.pps.jussieu.fr/~miquel/publis/tlca01.pdf},
	Publisher = {Springer},
	Read = {Oui},
	Series = {Lecture Notes in Computer Science},
	Title = {The {I}mplicit {C}alculus of {C}onstructions.},
	Volume = {2044},
	Year = {2001}}

@phdthesis{miquel:PhD,
	Author = {Alexandre Miquel},
	Date-Modified = {2008-09-03 19:17:09 +0200},
	Keywords = {staging, Calculus of Constructions},
	Pdf = {http://www.pps.jussieu.fr/~miquel/publis/these.pdf},
	Read = {Oui},
	School = {Universit\'e Paris 7},
	Title = {Le {C}alcul des {C}onstructions implicite: syntaxe et s\'emantique},
	Year = {2001}}

@article{hinze:FingerTrees,
	Author = {Ralf Hinze and Ross Paterson},
	Date-Modified = {2008-04-01 13:51:11 +0200},
	Journal = {J. Funct. Program.},
	Keywords = {Finger Trees},
	Number = {2},
	Pages = {197--217},
	Read = {Oui},
	Title = {{F}inger {T}rees: {A} {S}imple {G}eneral-purpose {D}ata {S}tructure},
	Url = {http://www.soi.city.ac.uk/~ross/papers/FingerTree.html},
	Volume = {16},
	Year = {2006},
	Bdsk-Url-1 = {http://www.soi.city.ac.uk/~ross/papers/FingerTree.html}}

@article{DBLP:journals/entcs/BiernackaDS06,
	Author = {Malgorzata Biernacka and Olivier Danvy and Kristian St{\o}vring},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Modified = {2008-04-01 13:51:24 +0200},
	Ee = {http://dx.doi.org/10.1016/j.entcs.2005.11.056},
	Journal = {Electr. Notes Theor. Comput. Sci.},
	Keywords = {Extraction, Normalization},
	Pages = {169-189},
	Read = {Oui},
	Title = {Program {E}xtraction {F}rom {P}roofs of {W}eak {H}ead {N}ormalization.},
	Volume = {155},
	Year = {2006},
	Bdsk-File-1 = { }}

@article{DBLP:journals/jfp/BirdC06,
	Author = {Richard S. Bird and Sharon A. Curtis},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Date-Modified = {2008-04-01 13:51:13 +0200},
	Ee = {http://dx.doi.org/10.1017/S0956796805005678},
	Journal = {J. Funct. Program.},
	Number = {1},
	Pages = {13-20},
	Read = {Oui},
	Title = {Functional {P}earls: {F}inding celebrities: {A} lesson in functional programming.},
	Volume = {16},
	Year = {2006}}

@proceedings{cav07,
	Address = {Berlin, Germany},
	Booktitle = {19th International Conference on Computer Aided Verification},
	Editor = {Werner Damm and Holger Hermanns},
	Month = jul,
	Publisher = SV,
	Series = lncs,
	Title = {Computer {A}ided {V}erification},
	Year = {2007}}

@proceedings{DBLP:conf/mpc/1995,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {MPC},
	Date-Added = {2008-02-27 02:07:18 +0100},
	Date-Modified = {2008-04-01 13:49:28 +0200},
	Editor = {Bernhard M{\"o}ller},
	Isbn = {3-540-60117-1},
	Publisher = {Springer},
	Read = {Non},
	Series = {Lecture Notes in Computer Science},
	Title = {Mathematics of {P}rogram {C}onstruction, {M}{P}{C}'95, {K}loster {I}rsee, {G}ermany, {J}uly 17-21, 1995, {P}roceedings},
	Volume = {947},
	Year = {1995}}

@proceedings{DBLP:conf/esop/2000,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ESOP},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Gert Smolka},
	Isbn = {3-540-67262-1},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Programming Languages and Systems, 9th European Symposium on Programming, ES{O}{P} 2000, {H}eld as {P}art of the {E}uropean {J}oint {C}onferences on the {T}heory and {P}ractice of {S}oftware, {E}{T}{A}{P}{S} 2000, {B}erlin, {G}ermany, {M}arch 25 - {A}pril 2, 2000, {P}roceedings},
	Volume = {1782},
	Year = {2000}}

@proceedings{DBLP:conf/tphol/2005,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2008-05-13 17:02:39 +0200},
	Date-Modified = {2008-05-13 17:02:39 +0200},
	Editor = {Joe Hurd and Thomas F. Melham},
	Isbn = {3-540-28372-2},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 18th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2005, {O}xford, {U}{K}, {A}ugust 22-25, 2005, {P}roceedings},
	Volume = {3603},
	Year = {2005}}

@proceedings{DBLP:conf/types/2003,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-08-07 15:44:23 +0200},
	Date-Modified = {2008-08-07 15:44:23 +0200},
	Editor = {Stefano Berardi and Mario Coppo and Ferruccio Damiani},
	Isbn = {3-540-22164-6},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for {P}roofs and {P}rograms, {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2003, {T}orino, {I}taly, {A}pril 30 - {M}ay 4, 2003, {R}evised {S}elected {P}apers},
	Volume = {3085},
	Year = {2004}}

@proceedings{tphols2008a,
	Booktitle = {TPHOLs},
	Date-Added = {2008-08-25 19:42:35 +0200},
	Date-Modified = {2008-08-25 19:42:35 +0200},
	Editor = {Otmane Ait Mohamed, C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tahar},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 21th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2008, {M}ontreal, {C}anada, {A}ugust 18-21, 2008, {P}roceedings},
	Volume = {5170},
	Year = {2008}}

@proceedings{DBLP:conf/types/2002,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-09-09 23:12:48 +0200},
	Date-Modified = {2008-09-09 23:12:48 +0200},
	Editor = {Herman Geuvers and Freek Wiedijk},
	Isbn = {3-540-14031-X},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers},
	Volume = {2646},
	Year = {2003}}

@proceedings{DBLP:conf/types/2000,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-09-28 13:47:36 +0200},
	Date-Modified = {2008-09-28 13:47:36 +0200},
	Editor = {Paul Callaghan and Zhaohui Luo and James McKinna and Robert Pollack},
	Isbn = {3-540-43287-6},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers},
	Volume = {2277},
	Year = {2002}}

@proceedings{DBLP:conf/types/1993,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-10-09 13:12:56 +0200},
	Date-Modified = {2008-10-09 13:12:56 +0200},
	Editor = {Henk Barendregt and Tobias Nipkow},
	Isbn = {3-540-58085-9},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Workshop TYPES'93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers},
	Volume = {806},
	Year = {1994}}

@proceedings{DBLP:conf/lics/LICS9,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {LICS},
	Date-Added = {2008-10-09 16:10:11 +0200},
	Date-Modified = {2008-10-09 16:11:02 +0200},
	Publisher = {IEEE Computer Society},
	Title = {Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France},
	Year = {1994}}

@proceedings{DBLP:conf/tphol/2007,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2008-04-05 01:09:42 +0200},
	Date-Modified = {2008-04-05 01:09:42 +0200},
	Editor = {Klaus Schneider and Jens Brandt},
	Isbn = {978-3-540-74590-7},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem {P}roving in {H}igher {O}rder {L}ogics, 20th {I}nternational {C}onference, {T}{P}{H}{O}{L}s 2007, {K}aiserslautern, {G}ermany, {S}eptember 10-13, 2007, {P}roceedings},
	Volume = {4732},
	Year = {2007}}

@proceedings{icfp02,
	Booktitle = {International Conference on Functional Programming 2002},
	Date-Added = {2008-10-12 16:18:44 +0200},
	Date-Modified = {2008-10-12 16:18:44 +0200},
	Publisher = {ACM Press},
	Title = {International Conference on Functional Programming 2002},
	Year = 2002}

@proceedings{DBLP:conf/types/1995,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-10-13 12:40:31 +0200},
	Date-Modified = {2008-10-13 12:40:31 +0200},
	Editor = {Stefano Berardi and Mario Coppo},
	Isbn = {3-540-61780-9},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Workshop TYPES'95, Torino, Italy, June 5-8, 1995, Selected Papers},
	Volume = {1158},
	Year = {1996}}

@proceedings{DBLP:conf/types/1996,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TYPES},
	Date-Added = {2008-12-25 22:04:51 +0100},
	Date-Modified = {2008-12-25 22:04:51 +0100},
	Editor = {Eduardo Gim{\'e}nez and Christine Paulin-Mohring},
	Isbn = {3-540-65137-3},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Types for Proofs and Programs, International Workshop TYPES'96, Aussois, France, December 15-19, 1996, Selected Papers},
	Volume = {1512},
	Year = {1998}}

@proceedings{DBLP:conf/csl/1996,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Date-Added = {2008-12-25 22:06:08 +0100},
	Date-Modified = {2008-12-25 22:06:08 +0100},
	Editor = {Dirk van Dalen and Marc Bezem},
	Isbn = {3-540-63172-0},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers},
	Volume = {1258},
	Year = {1997}}

@proceedings{types06,
	Booktitle = {TYPES 2006},
	Date-Modified = {2008-12-29 19:12:17 +0100},
	Editor = {Thorsten Altenkirch and Conor McBride},
	Isbn = {978-3-540-74463-4},
	Publisher = SV,
	Series = LNCS,
	Title = {Types for {P}roofs and {P}rograms, {I}nternational {W}orkshop, {T}{Y}{P}{E}{S} 2006, {N}ottingham, {U}{K}, {A}pril 18-21, 2006, {R}evised {S}elected {P}apers},
	Volume = {4502},
	Year = {2007}}

@proceedings{DBLP:conf/tphol/2009,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TPHOLs},
	Date-Added = {2009-12-23 15:52:59 +0100},
	Date-Modified = {2009-12-23 15:52:59 +0100},
	Editor = {Stefan Berghofer and Tobias Nipkow and Christian Urban and Makarius Wenzel},
	Ee = {http://dx.doi.org/10.1007/978-3-642-03359-9},
	Isbn = {978-3-642-03358-2},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Title = {Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings},
	Volume = {5674},
	Year = {2009}}

@proceedings{DBLP:conf/tlca/2011,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {TLCA},
	Date-Added = {2013-03-19 12:40:14 +0000},
	Date-Modified = {2014-01-30 06:25:29 +0000},
	Editor = {C.-H. Luke Ong},
	Ee = {http://dx.doi.org/10.1007/978-3-642-21691-6},
	Isbn = {978-3-642-21690-9},
	Publisher = {Springer},
	Series = {LNCS},
	Title = {Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings},
	Volume = {6690},
	Year = {2011}}

@proceedings{DBLP:conf/csl/2012,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CSL},
	Date-Added = {2013-01-31 14:47:53 +0000},
	Date-Modified = {2013-01-31 14:47:53 +0000},
	Editor = {Patrick C{\'e}gielski and Arnaud Durand},
	Isbn = {978-3-939897-42-2},
	Publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
	Series = {LIPIcs},
	Title = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France},
	Volume = {16},
	Year = {2012}}

@proceedings{DBLP:conf/icfp/2011,
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {ICFP},
	Date-Added = {2012-12-10 18:17:12 +0000},
	Date-Modified = {2012-12-10 18:17:12 +0000},
	Editor = {Manuel M. T. Chakravarty and Zhenjiang Hu and Olivier Danvy},
	Isbn = {978-1-4503-0865-6},
	Publisher = {ACM},
	Title = {Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011},
	Year = {2011}}

@article{MR2964639,
	Author = {Guiraud, Yves and Malbos, Philippe},
	Fjournal = {Advances in Mathematics},
	Issn = {0001-8708},
	Journal = {Adv. Math.},
	Mrclass = {18C10 (18D05 18G10 18G20 68Q42)},
	Mrnumber = {2964639},
	Mrreviewer = {Enrico Vitale},
	Number = {3-4},
	Pages = {2294--2351},
	Title = {Higher-dimensional normalisation strategies for acyclicity},
	Url = {https://doi.org/10.1016/j.aim.2012.05.010},
	Volume = {231},
	Year = {2012},
	Bdsk-Url-1 = {https://doi.org/10.1016/j.aim.2012.05.010}}

@article{MR1988395,
	Author = {M\'etayer, Fran\c{c}ois},
	Fjournal = {Theory and Applications of Categories},
	Issn = {1201-561X},
	Journal = {Theory Appl. Categ.},
	Mrclass = {18D05 (05C20)},
	Mrnumber = {1988395},
	Mrreviewer = {Ross H. Street},
	Pages = {No. 7, 148--184},
	Title = {Resolutions by polygraphs},
	Volume = {11},
	Year = {2003}}

@proceedings{DBLP:conf/itp/2014,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.uni-trier.de/rec/bib/conf/itp/2014},
	Date-Added = {2015-02-19 00:36:23 +0000},
	Date-Modified = {2015-02-19 00:36:23 +0000},
	Doi = {10.1007/978-3-319-08970-6},
	Editor = {Gerwin Klein and Ruben Gamboa},
	Isbn = {978-3-319-08969-0},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Fri, 29 Jan 4442332 15:24:00 +},
	Title = {Interactive Theorem Proving - 5th International Conference, {ITP} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
	Url = {http://dx.doi.org/10.1007/978-3-319-08970-6},
	Volume = {8558},
	Year = {2014},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-319-08970-6}}

@proceedings{DBLP:conf/cpp/2011,
	Bibsource = {dblp computer science bibliography, http://dblp.org},
	Biburl = {http://dblp.org/rec/bib/conf/cpp/2011},
	Date-Added = {2018-01-20 16:31:54 +0000},
	Date-Modified = {2018-01-20 16:31:54 +0000},
	Doi = {10.1007/978-3-642-25379-9},
	Editor = {Jean{-}Pierre Jouannaud and Zhong Shao},
	Isbn = {978-3-642-25378-2},
	Publisher = {Springer},
	Series = {Lecture Notes in Computer Science},
	Timestamp = {Thu, 25 May 2017 00:42:11 +0200},
	Title = {Certified Programs and Proofs - First International Conference, {CPP} 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings},
	Url = {https://doi.org/10.1007/978-3-642-25379-9},
	Volume = {7086},
	Year = {2011},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-25379-9}}

@proceedings{DBLP:conf/csl/2016,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/csl/2016},
	Date-Added = {2018-03-04 15:49:04 +0000},
	Date-Modified = {2018-03-04 15:49:04 +0000},
	Editor = {Jean{-}Marc Talbot and Laurent Regnier},
	Isbn = {978-3-95977-022-4},
	Publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
	Series = {LIPIcs},
	Timestamp = {Wed, 27 Sep 2017 13:54:28 +0200},
	Title = {25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016, August 29 - September 1, 2016, Marseille, France},
	Url = {http://www.dagstuhl.de/dagpub/978-3-95977-022-4},
	Volume = {62},
	Year = {2016},
	Bdsk-Url-1 = {http://www.dagstuhl.de/dagpub/978-3-95977-022-4}}

@proceedings{DBLP:conf/cpp/2018,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/cpp/2018},
	Date-Added = {2018-03-15 12:41:04 +0000},
	Date-Modified = {2018-03-15 12:41:04 +0000},
	Editor = {June Andronick and Amy P. Felty},
	Isbn = {978-1-4503-5586-5},
	Publisher = {{ACM}},
	Timestamp = {Sat, 30 Dec 2017 17:33:25 +0100},
	Title = {Proceedings of the 7th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2018, Los Angeles, CA, USA, January 8-9, 2018},
	Url = {http://dl.acm.org/citation.cfm?id=3176245},
	Year = {2018},
	Bdsk-Url-1 = {http://dl.acm.org/citation.cfm?id=3176245}}

@proceedings{DBLP:conf/rta/2018,
	Bibsource = {dblp computer science bibliography, https://dblp.org},
	Biburl = {https://dblp.org/rec/bib/conf/rta/2018},
	Date-Added = {2018-10-16 17:04:30 +0000},
	Date-Modified = {2018-10-16 17:04:30 +0000},
	Editor = {H{\'{e}}l{\`{e}}ne Kirchner},
	Isbn = {978-3-95977-077-4},
	Publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
	Series = {LIPIcs},
	Timestamp = {Wed, 04 Jul 2018 11:37:53 +0200},
	Title = {3rd International Conference on Formal Structures for Computation and Deduction, {FSCD} 2018, July 9-12, 2018, Oxford, {UK}},
	Url = {http://www.dagstuhl.de/dagpub/978-3-95977-077-4},
	Volume = {108},
	Year = {2018},
	Bdsk-Url-1 = {http://www.dagstuhl.de/dagpub/978-3-95977-077-4}}

@comment{BibDesk Static Groups{
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<array>
	<dict>
		<key>group name</key>
		<string>Eval</string>
		<key>keys</key>
		<string>altenkirch-mcbride-wierstra:ott-now,altenkirch:ctt,licata:cubicaltt</string>
	</dict>
</array>
</plist>
}}

@comment{BibDesk Smart Groups{
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<array>
	<dict>
		<key>conditions</key>
		<array>
			<dict>
				<key>comparison</key>
				<integer>3</integer>
				<key>key</key>
				<string></string>
				<key>value</key>
				<string></string>
				<key>version</key>
				<string>1</string>
			</dict>
		</array>
		<key>conjunction</key>
		<integer>0</integer>
		<key>group name</key>
		<string>Eval</string>
	</dict>
	<dict>
		<key>conditions</key>
		<array>
			<dict>
				<key>comparison</key>
				<integer>2</integer>
				<key>key</key>
				<string>Keywords</string>
				<key>value</key>
				<string>HTT</string>
				<key>version</key>
				<string>1</string>
			</dict>
			<dict>
				<key>comparison</key>
				<integer>2</integer>
				<key>key</key>
				<string>Keywords</string>
				<key>value</key>
				<string>Ynot</string>
				<key>version</key>
				<string>1</string>
			</dict>
		</array>
		<key>conjunction</key>
		<integer>1</integer>
		<key>group name</key>
		<string>HTT &amp; Ynot</string>
	</dict>
	<dict>
		<key>conditions</key>
		<array>
			<dict>
				<key>comparison</key>
				<integer>2</integer>
				<key>key</key>
				<string>Author</string>
				<key>value</key>
				<string>Matthieu Sozeau</string>
				<key>version</key>
				<string>1</string>
			</dict>
			<dict>
				<key>comparison</key>
				<integer>2</integer>
				<key>key</key>
				<string></string>
				<key>value</key>
				<string></string>
				<key>version</key>
				<string>1</string>
			</dict>
		</array>
		<key>conjunction</key>
		<integer>0</integer>
		<key>group name</key>
		<string>Matthieu Sozeau</string>
	</dict>
	<dict>
		<key>conditions</key>
		<array>
			<dict>
				<key>comparison</key>
				<integer>4</integer>
				<key>key</key>
				<string>BibTeX Type</string>
				<key>value</key>
				<string>proceedings</string>
				<key>version</key>
				<string>1</string>
			</dict>
		</array>
		<key>conjunction</key>
		<integer>0</integer>
		<key>group name</key>
		<string>Proceedings</string>
	</dict>
</array>
</plist>
}}

@comment{BibDesk URL Groups{
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<array>
	<dict>
		<key>URL</key>
		<string>http://www.cs.nott.ac.uk/~txa/publ/alti.bib</string>
		<key>group name</key>
		<string>Altenkirch</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>http://www.cis.upenn.edu/~bcpierce/papers/bcp.bib</string>
		<key>group name</key>
		<string>B. Pierce</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>file://localhost/Users/mat/research/demons-biblio/demons.bib</string>
		<key>group name</key>
		<string>Démons</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>file://localhost/Users/mat/research/demons-biblio/demons2.bib</string>
		<key>group name</key>
		<string>Démons2</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>file://localhost/Users/mat/research/demons-biblio/demons3.bib</string>
		<key>group name</key>
		<string>Démons3</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>http://pauillac.inria.fr/~fpottier/biblio/english.bib</string>
		<key>group name</key>
		<string>F. Pottier</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>http://www.cs.nott.ac.uk/~nxg/papers/bibtex</string>
		<key>group name</key>
		<string>N. Ghani</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>file://localhost/Users/mat/research/publication/bib/pvs.bib</string>
		<key>group name</key>
		<string>PVS</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>http://www.itu.dk/~birkedal/realizability/realizability.bib</string>
		<key>group name</key>
		<string>Realizability</string>
	</dict>
	<dict>
		<key>URL</key>
		<string>file://localhost/Users/mat/research/publication/bib/reynolds.bib</string>
		<key>group name</key>
		<string>Reynolds</string>
	</dict>
</array>
</plist>
}}
