EN FR
EN FR


Bibliography

Major publications by the team in recent years
  • 1Z. Ariola, H. Herbelin, A. Sabry.

    A Type-Theoretic Foundation of Delimited Continuations, in: Higher Order and Symbolic Computation, 2007.

    http://dx.doi.org/10.1007/s10990-007-9006-0
  • 2P.-L. Curien.

    Substitution up to isomorphism, in: Fundamenta Informaticae, 1993, vol. 19, p. 51-85.
  • 3P.-L. Curien, H. Herbelin.

    The duality of computation, in: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), Montreal, Canada, SIGPLAN Notices 35(9), ACM, September 18-21 2000, p. 233–243. [ DOI : 10.1145/351240.351262 ]

    http://hal.archives-ouvertes.fr/inria-00156377/en/
  • 4H. Herbelin, S. Ghilezan.

    An Approach to Call-by-Name Delimited Continuations, in: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, G. C. Necula, P. Wadler (editors), ACM, January 7-12 2008, p. 383-394.
  • 5H. Herbelin.

    An intuitionistic logic that proves Markov's principle, in: Logic In Computer Science, Edinburgh, Royaume-Uni, IEEE Computer Society, 2010.

    http://hal.inria.fr/inria-00481815/en/
  • 6G. Munch-Maccagnoni.

    Focalisation and Classical Realisability, in: Computer Science Logic '09, E. Grädel, R. Kahle (editors), Lecture Notes in Computer Science, Springer-Verlag, 2009, vol. 5771, p. 409–423.
  • 7Y. Régis-Gianas, F. Pottier.

    A Hoare Logic for Call-by-Value Functional Programs, in: Proceedings of the Ninth International Conference on Mathematics of Program Construction (MPC'08), Lecture Notes in Computer Science, Springer, July 2008, vol. 5133, p. 305–335.

    http://gallium.inria.fr/~fpottier/publis/regis-gianas-pottier-hoarefp.ps.gz
  • 8A. Saurin.

    Separation with Streams in the Λμ-calculus, in: Symposium on Logic in Computer Science (LICS 2005), Chicago, IL, USA, Proceedings, IEEE Computer Society, 26-29 June 2005, p. 356-365.
  • 9A. Saurin.

    On the Relations between the Syntactic Theories of λμ-Calculi, in: 17th Annual Conference of the EACSL 17th EACSL Annual Conference on Computer Science Logic - CSL 2008, Bertinoro Italie, Lecture notes in computer science, Springer, 2008, vol. 5213, p. 154-168. [ DOI : 10.1007/978-3-540-87531-4_13 ]

    http://hal.archives-ouvertes.fr/hal-00527930/en/
  • 10M. Sozeau, N. Oury.

    First-Class Type Classes, in: Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, O. A. Mohamed, C. Muñoz, S. Tahar (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5170, p. 278-293.
Publications of the year

Articles in International Peer-Reviewed Journals

  • 11A. Bove, A. Krauss, M. Sozeau.

    Partiality and Recursion in Interactive Theorem Provers - An Overview, in: Mathematical Structures in Computer Science, January 2012, To appear.

    http://hal.inria.fr/hal-00691459
  • 12Y. Guiraud, P. Malbos.

    Coherence in monoidal track categories, in: Mathematical Structures in Computer Science, 2012, vol. 22, no 6, p. 931-969.

    http://hal.inria.fr/hal-00470795
  • 13Y. Guiraud, P. Malbos.

    Higher-dimensional normalisation strategies for acyclicity, in: Advances in Mathematics, 2012, vol. 231, no 3-4, p. 2294-2351. [ DOI : 10.1016/j.aim.2012.05.010 ]

    http://hal.inria.fr/hal-00531242
  • 14D. Ilik.

    Continuation-passing Style Models Complete for Intuitionistic Logic, in: Annals of Pure and Applied Logic, May 2012. [ DOI : 10.1016/j.apal.2012.05.003 ]

    http://hal.inria.fr/hal-00647390
  • 15D. Ilik.

    Delimited control operators prove Double-negation Shift, in: Annals of Pure and Applied Logic, November 2012, vol. 163, no 11, p. 1549-1559. [ DOI : 10.1016/j.apal.2011.12.008 ]

    http://hal.inria.fr/hal-00647389
  • 16A. Saurin.

    Böhm theorem and Böhm trees for the Lambda-mu-calculus, in: Theoretical Computer Science, June 2012, vol. 435, p. 106-138. [ DOI : 10.1016/j.tcs.2012.02.027 ]

    http://hal.inria.fr/hal-00695534
  • 17V. Siles, H. Herbelin.

    Pure Type System conversion is always typable, in: Journal of Functional Programming, May 2012, vol. 22, no 2, p. 153 - 180. [ DOI : 10.1017/S0956796812000044 ]

    http://hal.inria.fr/inria-00497177

Invited Conferences

International Conferences with Proceedings

  • 19R. Amadio, Y. Régis-Gianas.

    Certifying and reasoning on cost annotations of functional programs, in: Foundational and Practical Aspects of Resource Analysis, Madrid, Spain, R. Peña (editor), Lecture Notes in Computer Science, Springer, June 2012, vol. 7177, p. 72-88.

    http://hal.inria.fr/inria-00629473
  • 20Z. Ariola, P. Downen, H. Herbelin, K. Nakata, A. Saurin.

    Classical call-by-need sequent calculi : The unity of semantic artifacts, in: FLOPS 2012 - 11th International Symposium on Functional and Logic Programming, Kobe, Japan, T. Schrijvers, P. Thiemann (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7294, p. 32-46. [ DOI : 10.1007/978-3-642-29822-6 ]

    http://hal.inria.fr/hal-00697241
  • 21N. Ayache, R. Amadio, Y. Régis-Gianas.

    Certifying and reasoning on cost annotations in C programs, in: FMICS 2012 - 17th International Workshop on Formal Methods for Industrial Critical Systems, Paris, France, August 2012.

    http://hal.inria.fr/hal-00702665
  • 22H. Herbelin.

    A Constructive Proof of Dependent Choice, Compatible with Classical Logic, in: LICS 2012 - 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, IEEE Computer Society, 2012, p. 365-374, 1ère version rédigée en janvier 2011. Nombreuses corrections, et raffinements, appliqués après coup..

    http://hal.inria.fr/hal-00697240
  • 23G. Jaber, N. Tabareau, M. Sozeau.

    Extending Type Theory with Forcing, in: LICS 2012 : Logic In Computer Science, Dubrovnik, Croatia, June 2012.

    http://hal.inria.fr/hal-00685150

National Conferences with Proceeding

  • 24P. Boutillier.

    A relaxation of Coq's guard condition, in: JFLA - Journées Francophones des langages applicatifs - 2012, Carnac, France, February 2012, p. 1 - 14.

    http://hal.inria.fr/hal-00651780

Conferences without Proceedings

  • 25M. Puech, Y. Régis-Gianas.

    Safe Incremental Type Checking, in: TLDI 2012 - Seventh ACM SIGPLAN Workshop on Types in Language Design and Implementation, Philadelphia, United States, January 2012, 2 pages.

    http://hal.inria.fr/hal-00650341

Scientific Books (or Scientific Book chapters)

  • 26P.-L. Curien.

    Operads, clones, and distributive laws, in: Operads and Universal Algebra : Proceedings of China-France Summer Conference, L. G. Chengming Bai, J.-L. Loday (editors), Nankai Series in Pure, Applied Mathematics and Theoretical Physics, Vol. 9, World Scientific, Tianjin, China, 2012, p. 25-50.

    http://hal.inria.fr/hal-00697065

Internal Reports

Other Publications

  • 30P. Castéran, M. Sozeau.

    A gentle introduction to type classes and relations in Coq, May 2012, This document presents the main features of type classes and user-defined relations in the Coq proof assistant. Available at http://www.labri.fr/perso/casteran/CoqArt/TypeClassesTut/typeclassestut.pdf.

    http://hal.inria.fr/hal-00702455
  • 31S. Gaussent, Y. Guiraud, P. Malbos.

    Coherent presentations and actions on categories, 2012, 66 pages.

    http://hal.inria.fr/hal-00682233
  • 32M. Sozeau, N. Tabareau, G. Jaber.

    Forcing in Coq, 2012.

    http://github.com/mattam82/Forcing
References in notes
  • 33D. J. Anick.

    On the Homology of Associative Algebras, in: Trans. Amer. Math. Soc., 1986, vol. 296, no 2, p. 641–659.
  • 34H. P. Barendregt.

    The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1984.
  • 35Y. Bertot, P. Castéran.

    Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer, 2004.
  • 36B. Buchberger.

    An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, in: J. Symbolic Comput., 2006, vol. 41, no 3-4, p. 475–511, Translated from the 1965 German original by Michael P. Abramson.
  • 37A. Chlipala.

    An Introduction to Programming and Proving with Dependent Types in Coq, in: Journal of Formalized Reasoning, 2010, vol. 3, no 2, p. 1–93.
  • 38A. Church.

    A set of Postulates for the foundation of Logic, in: Annals of Mathematics, 1932, vol. 2, p. 33, 346-366.
  • 39 Coq Development Team, The.

    The Coq Reference Manual, version 8.2, September 2008.

    http://coq.inria.fr/doc
  • 40T. Coquand.

    Une théorie des Constructions, University Paris 7, January 1985.
  • 41T. Coquand, G. Huet.

    Constructions : A Higher Order Proof System for Mechanizing Mathematics, in: EUROCAL'85, Linz, Lecture Notes in Computer Science, Springer Verlag, 1985, vol. 203.
  • 42T. Coquand, C. Paulin-Mohring.

    Inductively defined types, in: Proceedings of Colog'88, P. Martin-Löf, G. Mints (editors), Lecture Notes in Computer Science, Springer Verlag, 1990, vol. 417.
  • 43H. B. Curry, R. Feys, W. Craig.

    Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
  • 44P. Deligne.

    Action du groupe des tresses sur une catégorie, in: Invent. Math., 1997, vol. 128, no 1, p. 159–175.
  • 45M. Felleisen, D. P. Friedman, E. Kohlbecker, B. F. Duba.

    Reasoning with continuations, in: First Symposium on Logic and Computer Science, 1986, p. 131-141.
  • 46A. Filinski.

    Representing Monads, in: Conf. Record 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'94, Portland, OR, USA, ACM Press, 17-21 Jan 1994, p. 446-457.
  • 47C. Führmann.

    Direct Models for the Computational Lambda Calculus, in: Electr. Notes Theor. Comput. Sci., 1999, vol. 20, p. 245-292.
  • 48F. Garillot.

    Generic Proof Tools and Finite Group Theory, École Polytechnique, December 2011.
  • 49G. Gentzen.

    Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, p. 176–210,405–431.
  • 50J.-Y. Girard.

    Une extension de l'interpretation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types, in: Second Scandinavian Logic Symposium, J. Fenstad (editor), Studies in Logic and the Foundations of Mathematics, North Holland, 1971, no 63, p. 63-92.
  • 51T. G. Griffin.

    The Formulae-as-Types Notion of Control, in: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL '90, San Francisco, CA, USA, 17-19 Jan 1990, ACM Press, 1990, p. 47–57.
  • 52Y. Guiraud, P. Malbos.

    Higher-dimensional categories with finite derivation type, in: Theory Appl. Categ., 2009, vol. 22, no 18, p. 420-478.
  • 53R. Harper, R. Pollack.

    Type Checking with Universes, in: Theor. Comput. Sci., 1991, vol. 89, no 1, p. 107-136.
  • 54H. Herbelin.

    An intuitionistic logic that proves Markov's principle, in: Logic In Computer Science, United Kingdom Edinburgh, IEEE Computer Society, 2010.

    http://hal.inria.fr/inria-00481815/en
  • 55M. Hofmann.

    On the Interpretation of Type Theory in Locally Cartesian Closed Categories, in: Computer Science Logic (CSL'94), Springer Lecture Notes in Computer Science 933, 1994, p. 427-441.
  • 56W. A. Howard.

    The formulae-as-types notion of constructions, in: to H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 1980, Unpublished manuscript of 1969.
  • 57J.-L. Krivine.

    A call-by-name lambda-calculus machine, in: Higher Order and Symbolic Computation, 2005.
  • 58J.-L. Krivine.

    Structures de réalisabilité, RAM et ultrafiltre sur N, in: CoRR, 2008, vol. abs/0809.2394.
  • 59J.-L. Krivine.

    Un interpréteur du lambda-calcul, 1986, Unpublished.
  • 60P. Landin.

    The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, no 4, p. 308–320.
  • 61P. Landin.

    A generalisation of jumps and labels, UNIVAC Systems Programming Research, August 1965, no ECS-LFCS-88-66, Reprinted in Higher Order and Symbolic Computation, 11(2), 1998.
  • 62P. Martin-Löf.

    A theory of types, University of Stockholm, 1971, no 71-3.
  • 63F. Métayer.

    Resolutions by polygraphs, in: Theory Appl. Categ., 2003, vol. 11, p. 148–184.
  • 64M. Parigot.

    Free Deduction: An Analysis of "Computations" in Classical Logic., in: Logic Programming, Second Russian Conference on Logic Programming, St. Petersburg, Russia, A. Voronkov (editor), Lecture Notes in Computer Science, Springer, September 11-16 1991, vol. 592, p. 361-380.

    http://dblp.uni-trier.de
  • 65M. Parigot.

    Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction, in: Logic Programming and Automated Reasoning: International Conference LPAR '92 Proceedings, St. Petersburg, Russia, Springer-Verlag, 1992, p. 190-201.
  • 66B. C. Pierce.

    Proof Assistants as Teaching Assistants: A View from the Trenches, in: ITP, M. Kaufmann, L. C. Paulson (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 6172, 8 p.
  • 67J. C. Reynolds.

    Definitional interpreters for higher-order programming languages, in: ACM '72: Proceedings of the ACM annual conference, New York, NY, USA, ACM Press, 1972, p. 717–740.
  • 68J. C. Reynolds.

    Towards a theory of type structure, in: Symposium on Programming, B. Robinet (editor), Lecture Notes in Computer Science, Springer, 1974, vol. 19, p. 408-423.
  • 69B. Spitters, E. van der Weegen.

    Type classes for mathematics in type theory, in: Mathematical Structures in Computer Science, 2011, vol. 21, no 4, p. 795-825.
  • 70C. Squier, F. Otto, Y. Kobayashi.

    A finiteness condition for rewriting systems, in: Theoret. Comput. Sci., 1994, vol. 131, no 2, p. 271–294.
  • 71J. Tits.

    A local approach to buildings, in: The geometric vein, New York, Springer, New York, 1981, p. 519–547.
  • 72B. Werner.

    On the Strength of Proof-Irrelevant Type Theories, in: Journal of Automated Reasoning, 2006, p. 604–618.
  • 73N. de Bruijn.

    AUTOMATH, a language for mathematics, Technological University Eindhoven, November 1968, no 66-WSK-05.