Major publications by the team in recent years
  • 1R. M. Amadio, Y. Regis-Gianas.

    Certifying and reasoning about cost annotations of functional programs, in: Higher-Order and Symbolic Computation, January 2013.

  • 2Z. Ariola, H. Herbelin, A. Sabry.

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

  • 3D. Baelde, A. Doumane, A. Saurin.

    Infinitary proof theory : the multiplicative additive case , in: Proceedings of CSL 2016, September 2016.

  • 4C. Chenavier.

    The lattice of reduction operators: applications to noncommutative Gröbner bases and homological algebra, Université paris Diderot, December 2016.

  • 5P.-L. Curien.

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

  • 6P.-L. Curien, R. Garner, M. Hofmann.

    Revisiting the categorical interpretation of dependent type theory, in: Theoretical computer Science, 2014, vol. 546, pp. 99-119.

  • 7P.-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, pp. 233–243. [ DOI : 10.1145/351240.351262 ]

  • 8P.-L. Curien, H. Herbelin.

    Abstract machines for dialogue games, in: Interactive models of computation and program behavior, Panoramas et Synthèses, Société Mathématique de France, 2009, pp. 231-275.

  • 9P. Dehornoy, Y. Guiraud.

    Quadratic normalization in monoids, in: Internat. J. Algebra Comput., 2016, vol. 26, no 5, pp. 935–972.

  • 10S. Gaussent, Y. Guiraud, P. Malbos.

    Coherent presentations of Artin monoids, in: Compositio Mathematica, 2015, vol. 151, no 5, pp. 957-998. [ DOI : 10.1112/S0010437X14007842 ]

  • 11G. Gilbert, J. Cockx, M. Sozeau, N. Tabareau.

    Definitional Proof-Irrelevance without K, in: 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019, Lisbon, Portugal, POPL, January 2019.

  • 12T. Girka, D. Mentré, Y. Regis-Gianas.

    Oracle-based Dierential Operational Semantics (long version), Université Paris Diderot / Sorbonne Paris Cité, October 2016.

  • 13Y. Guiraud.

    Rewriting methods in homotopical and higher-dimensional algebra, Univ. Paris 7, 2019, Habilitation à diriger des recherches.
  • 14Y. Guiraud, P. Malbos.

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

  • 15Y. Guiraud, P. Malbos, S. Mimram.

    A Homotopical Completion Procedure with Applications to Coherence of Monoids, in: RTA - 24th International Conference on Rewriting Techniques and Applications - 2013, Eindhoven, Netherlands, F. Van Raamsdonk (editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, June 2013, vol. 21, pp. 223-238. [ DOI : 10.4230/LIPIcs.RTA.2013.223 ]

  • 16H. Herbelin.

    On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic, in: Proceedings of TLCA 2005, P. Urzyczyn (editor), Lecture Notes in Computer Science, Springer, 2005, vol. 3461, pp. 209–220.
  • 17H. Herbelin.

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

  • 18H. 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, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, 25-28 June 2012, Dubrovnik, Croatia, IEEE Computer Society, June 2012, pp. 365-374.

  • 19G. Jaber, N. Tabareau, M. Sozeau.

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

  • 20P. Letouzey.

    Hofstadter's problem for curious readers, Université Paris Diderot ; Inria Paris-Rocquencourt, September 2015, 29 p.

  • 21G. 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, pp. 409–423.
  • 22T. U. F. Program.

    Homotopy type theory—univalent foundations of mathematics, The Univalent Foundations Program, Princeton, NJ; Institute for Advanced Study (IAS), Princeton, NJ, 2013, xiv+589 p.

  • 23Y. Regis-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, pp. 305–335.

  • 24A. 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, pp. 356-365.
  • 25B. Ziliani, M. Sozeau.

    A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading, in: Journal of Functional Programming, 2017, vol. 27. [ DOI : 10.1017/S0956796817000028 ]

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 28M. Anel, G. Biedermann, E. Finster, A. Joyal.

    Goodwillie's calculus of functors and higher topos theory, in: Journal of topology, December 2018, vol. 11, no 4, pp. 1100-1132. [ DOI : 10.1112/topo.12082 ]

  • 29F. Fages, T. Martinez, D. A. Rosenblueth, S. Soliman.

    Influence Networks compared with Reaction Networks: Semantics, Expressivity and Attractors, in: IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2018, vol. PP, no 99, pp. 1-14. [ DOI : 10.1109/TCBB.2018.2805686 ]

  • 30G. Gilbert, J. Cockx, M. Sozeau, N. Tabareau.

    Definitional Proof-Irrelevance without K, in: Proceedings of the ACM on Programming Languages, January 2019, pp. 1-28. [ DOI : 10.1145/329031610.1145/3290316 ]

  • 31Y. Guiraud, E. Hoffbeck, P. Malbos.

    Convergent presentations and polygraphic resolutions of associative algebras, in: Mathematische Zeitschrift, 2018, 68 pages.

  • 32Y. Guiraud, P. Malbos.

    Polygraphs of finite derivation type, in: Mathematical Structures in Computer Science, 2018, vol. 28, no 2, pp. 155-201, https://arxiv.org/abs/1402.2587. [ DOI : 10.1017/S0960129516000220 ]

  • 33Y. Jiang, J. Liu, G. Dowek, K. Ji.

    Towards Combining Model Checking and Proof Checking, in: The Computer Journal, 2019.

  • 34J.-O. Kaiser, B. Ziliani, R. Krebbers, Y. Régis-Gianas, D. Dreyer.

    Mtac2: typed tactics for backward reasoning in Coq, in: Proceedings of the ACM on Programming Languages, July 2018, vol. 2, no ICFP, pp. 1 - 31. [ DOI : 10.1145/3236773 ]

  • 35L. Patey, K. Yokoyama.

    The proof-theoretic strength of Ramsey's theorem for pairs and two colors, in: Advances in Mathematics, May 2018, vol. 330, pp. 1034 - 1070. [ DOI : 10.1016/j.aim.2018.03.035 ]

  • 36N. Tabareau, É. Tanter, M. Sozeau.

    Equivalences for Free: Univalent Parametricity for Effective Transport, in: Proceedings of the ACM on Programming Languages, September 2018, pp. 1-29. [ DOI : 10.1145/3234615 ]


International Conferences with Proceedings

  • 37A. Anand, S. Boulier, C. Cohen, M. Sozeau, N. Tabareau.

    Towards Certified Meta-Programming with Typed Template-Coq, in: ITP 2018 - 9th Conference on Interactive Theorem Proving, Oxford, United Kingdom, LNCS, Springer, July 2018, vol. 10895, pp. 20-39. [ DOI : 10.1007/978-3-319-94821-8_2 ]

  • 38T. Letan, Y. Régis-Gianas, P. Chifflier, G. Hiet.

    Modular Verification of Programs with Effects and Effect Handlers in Coq, in: FM 2018 - 22nd International Symposium on Formal Methods, Oxford, United Kingdom, LNCS, Springer, July 2018, vol. 10951, pp. 338-354. [ DOI : 10.1007/978-3-319-95582-7_20 ]

  • 39É. Miquey, H. Herbelin.

    Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control, in: FOSSACS 18 - 21st International Conference on Foundations of Software Science and Computation Structures, Thessalonique, Greece, C. Baier, U. D. Lago (editors), LNCS, Springer, April 2018, vol. 10803, pp. 276-292, https://arxiv.org/abs/1803.00914. [ DOI : 10.1007/978-3-319-89366-2_15 ]

  • 40E. Rivas.

    Relating Idioms, Arrows and Monads from Monoidal Adjunctions, in: Seventh Workshop on Mathematically Structured Functional Programming- EPTCS, Oxford, United Kingdom, July 2018, vol. 275, pp. 18-33.

  • 41Y. Régis-Gianas, N. Jeannerod, R. Treinen.

    Morbig: A Static Parser for POSIX Shell, in: SLE 2018 - ACM SIGPLAN International Conference on Software Language Engineering, Boston, United States, November 2018. [ DOI : 10.1145/3276604.3276615 ]

  • 42A. Timany, M. Sozeau.

    Cumulative Inductive Types in Coq, in: FSCD 2018 - 3rd International Conference on Formal Structures for Computation and Deduction, Oxford, United Kingdom, July 2018. [ DOI : 10.4230/LIPIcs.FSCD.2018.29 ]

  • 43T. Winterhalter, M. Sozeau, N. Tabareau.

    Eliminating Reflection from Type Theory: To the Legacy of Martin Hofmann, in: CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Lisbonne, Portugal, ACM, January 2019, pp. 91-103. [ DOI : 10.1145/3293880.3294095 ]


National Conferences with Proceedings

  • 44P. Laforgue, Y. Régis-Gianas.

    OCaml étendu avec du filtrage par comotifs, in: JFLA 2018 - Journées Francophones des Langages Applicatifs, Banyuls sur mer, France, January 2018.


Conferences without Proceedings

  • 45A. Anand, S. Boulier, N. Tabareau, M. Sozeau.

    Typed Template Coq – Certified Meta-Programming in Coq, in: CoqPL 2018 - The Fourth International Workshop on Coq for Programming Languages, Los Angeles, CA, United States, January 2018, pp. 1-2.

  • 46R. Nollet, A. Saurin, C. Tasson.

    Local validity for circular proofs in linear logic with fixed points: extended version, in: Computer Science Logic, Birmingham, United Kingdom, September 2018.

  • 47T. Zimmermann.

    Challenges in the collaborative development of a complex mathematical software and its ecosystem, in: OpenSym 2018 - 14th International Symposium on Open Collaboration, Paris, France, August 2018, vol. 2018. [ DOI : 10.1145/3233391.3233966 ]


Scientific Books (or Scientific Book chapters)

  • 48A. Bouajjani, C. Enea, K. Ji, S. Qadeer.

    On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony, in: International Conference on Computer Aided Verification, CAV 2018: Computer Aided Verification, Springer International Publishing, July 2018, pp. 372-391.


Other Publications

References in notes
  • 61T. Altenkirch.

    Extensional Equality in Intensional Type Theory, in: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, IEEE Computer Society, 1999, pp. 412–420.

  • 62T. Altenkirch, P. Capriotti, N. Kraus.

    Extending Homotopy Type Theory with Strict Equality, in: CSL, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, vol. 62, pp. 21:1–21:17.
  • 63D. J. Anick.

    On the Homology of Associative Algebras, in: Trans. Amer. Math. Soc., 1986, vol. 296, no 2, pp. 641–659.
  • 64D. Ara, F. Métayer.

    The Brown-Golasiński Model Structure on strict -groupoids revisited, in: Homology, Homotopy and Applications, 2011, vol. 13, no 1, pp. 121–142.
  • 65J. Baez, A. Crans.

    Higher-dimensional algebra. VI. Lie 2-algebras, in: Theory Appl. Categ., 2004, vol. 12, pp. 492–538.
  • 66H. P. Barendregt.

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

    Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer, 2004.
  • 68G. Bonfante, Y. Guiraud.

    Polygraphic Programs and Polynomial-Time Functions, in: Logical Methods in Computer Science, 2009, vol. 5, no 2, pp. 1–37.
  • 69S. Boulier, P.-M. Pédrot, N. Tabareau.

    The next 700 syntactical models of type theory, in: Certified Programs and Proofs (CPP 2017), Paris, France, January 2017, pp. 182 - 194. [ DOI : 10.1145/3018610.3018620 ]

  • 70B. Buchberger.

    Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal (An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal), Mathematical Institute, University of Innsbruck, Austria, 1965.
  • 71A. Burroni.

    Higher-dimensional word problems with applications to equational logic, in: Theoretical Computer Science, jul 1993, vol. 115, no 1, pp. 43–62.
  • 72A. Chlipala.

    Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant, MIT Press, 2013.

  • 73A. Church.

    A set of Postulates for the foundation of Logic, in: Annals of Mathematics, 1932, vol. 2, pp. 33, 346-366.
  • 74J. Cockx.

    Dependent Pattern Matching and Proof-Relevant Unification, Katholieke Universiteit Leuven, Belgium, 2017.

  • 75T. Coquand.

    Une théorie des Constructions, University Paris 7, January 1985.
  • 76T. 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.
  • 77T. 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.
  • 78H. B. Curry, R. Feys, W. Craig.

    Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
  • 79P. Dehornoy, Y. Lafont.

    Homology of Gaussian groups, in: Ann. Inst. Fourier (Grenoble), 2003, vol. 53, no 2, pp. 489–540.

  • 80P. Deligne.

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

    Reasoning with continuations, in: First Symposium on Logic and Computer Science, 1986, pp. 131-141.
  • 82A. 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, pp. 446-457.
  • 83G. Gentzen.

    Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, pp. 176–210,405–431.
  • 84J.-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, pp. 63-92.
  • 85T. 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, pp. 47–57.
  • 86Y. Guiraud.

    Présentations d'opérades et systèmes de réécriture, Univ. Montpellier 2, 2004.
  • 87Y. Guiraud.

    Termination Orders for 3-Dimensional Rewriting, in: Journal of Pure and Applied Algebra, 2006, vol. 207, no 2, pp. 341–371.
  • 88Y. Guiraud.

    The Three Dimensions of Proofs, in: Annals of Pure and Applied Logic, 2006, vol. 141, no 1–2, pp. 266–295.
  • 89Y. Guiraud.

    Two Polygraphic Presentations of Petri Nets, in: Theoretical Computer Science, 2006, vol. 360, no 1–3, pp. 124–146.
  • 90Y. Guiraud, E. Hoffbeck, P. Malbos.

    Confluence of linear rewriting and homology of algebras, in: 3rd International Workshop on Confluence, Vienna, Austria, July 2014.

  • 91Y. Guiraud, P. Malbos.

    Higher-dimensional categories with finite derivation type, in: Theory Appl. Categ., 2009, vol. 22, no 18, pp. 420-478.
  • 92Y. Guiraud, P. Malbos.

    Identities among relations for higher-dimensional rewriting systems, in: Séminaires et Congrès, Société Mathématique de France, 2011, vol. 26, pp. 145-161.
  • 93Y. Guiraud, P. Malbos.

    Coherence in monoidal track categories, in: Math. Structures Comput. Sci., 2012, vol. 22, no 6, pp. 931–969.
  • 94M. Hofmann, T. Streicher.

    The groupoid interpretation of type theory, in: Twenty-five years of constructive type theory (Venice, 1995), Oxford Logic Guides, Oxford Univ. Press, New York, 1998, vol. 36, pp. 83–111.
  • 95W. 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.
  • 96J. Kock, A. Joyal, M. Batanin, J.-F. Mascari.

    Polynomial functors and opetopes, in: Advances in Mathematics, 2010, vol. 224, no 6, pp. 2690 - 2737. [ DOI : 10.1016/j.aim.2010.02.012 ]

  • 97J.-L. Krivine.

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

    Un interpréteur du lambda-calcul, 1986, Unpublished.
  • 99Y. Lafont.

    Towards an Algebraic Theory of Boolean Circuits, in: Journal of Pure and Applied Algebra, 2003, vol. 184, pp. 257-310.
  • 100Y. Lafont, F. Métayer, K. Worytkiewicz.

    A Folk Model Structure on Omega-Cat, in: Advances in Mathematics, 2010, vol. 224, no 3, pp. 1183–1231.
  • 101P. Landin.

    The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, no 4, pp. 308–320.
  • 102P. 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.
  • 103J. Lurie.

    Higher topos theory, Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, 2009, vol. 170, xviii+925 p.
  • 104P. Malbos.

    Critères de finitude homologique pour la non convergence des systèmes de réécriture de termes, Univ. Montpellier 2, 2004.
  • 105P. Martin-Löf.

    A theory of types, University of Stockholm, 1971, no 71-3.
  • 106M. 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, pp. 361-380.

  • 107S. B. Priddy.

    Koszul resolutions, in: Trans. Amer. Math. Soc., 1970, vol. 152, pp. 39–60.
  • 108J. 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, pp. 717–740.
  • 109J. C. Reynolds.

    Towards a theory of type structure, in: Symposium on Programming, B. Robinet (editor), Lecture Notes in Computer Science, Springer, 1974, vol. 19, pp. 408-423.
  • 110C. Squier, F. Otto, Y. Kobayashi.

    A finiteness condition for rewriting systems, in: Theoret. Comput. Sci., 1994, vol. 131, no 2, pp. 271–294.
  • 111C. C. Squier.

    Word problems and a homological finiteness condition for monoids, in: J. Pure Appl. Algebra, 1987, vol. 49, no 1-2, pp. 201–217.
  • 112R. Street.

    Limits Indexed by Category-Valued 2-Functors, in: Journal of Pure and Applied Algebra, 1976, vol. 8, pp. 149–181.
  • 113T. C. D. Team.

    The Coq Proof Assistant, version 8.7.1, December 2017.

  • 114N. de Bruijn.

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