Bibliography

Major publications by the team in recent years

• 1R. M. Amadio, Y. Régis-Gianas.
  Certifying and reasoning about cost annotations of functional programs, in: Higher-Order and Symbolic Computation, January 2013.
  https://hal.inria.fr/inria-00629473
• 2Z. 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
• 3P.-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.
  https://hal.archives-ouvertes.fr/hal-00697065
• 4P.-L. Curien, R. Garner, M. Hofmann.
  Revisiting the categorical interpretation of dependent type theory, in: Theoretical computer Science, 2014, vol. 546, pp. 99-119.
  http://dx.doi.org/10.1007/s10990-007-9006-0
• 5P.-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 ]
  http://hal.archives-ouvertes.fr/inria-00156377/en/
• 6P.-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.
  https://hal.archives-ouvertes.fr/hal-00155295
• 7Y. Guiraud, P. Malbos.
  Higher-dimensional normalisation strategies for acyclicity, in: Advances in Mathematics, 2012, vol. 231, n^o 3-4, pp. 2294-2351. [ DOI : 10.1016/j.aim.2012.05.010 ]
  https://hal.archives-ouvertes.fr/hal-00531242
• 8Y. 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 ]
  https://hal.inria.fr/hal-00818253
• 9H. 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/
• 10H. 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.
  https://hal.inria.fr/hal-00697240
• 11G. Jaber, N. Tabareau, M. Sozeau.
  Extending Type Theory with Forcing, in: LICS 2012 : Logic In Computer Science, Dubrovnik, Croatia, June 2012.
  https://hal.archives-ouvertes.fr/hal-00685150
• 12G. 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.
• 13Y. 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, pp. 305–335.
  http://gallium.inria.fr/~fpottier/publis/regis-gianas-pottier-hoarefp.ps.gz
• 14A. Saurin.
  Separation with Streams in the $\Lambda \mu$-calculus, in: Symposium on Logic in Computer Science (LICS 2005), Chicago, IL, USA, Proceedings, IEEE Computer Society, 26-29 June 2005, pp. 356-365.
• 15M. 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, pp. 278-293.

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 16L. D. C. Gonzalez Huesca.
  Incrementality and effect simulation in the simply typed lambda calculus, Universite Paris Diderot-Paris VII, November 2015.
  https://hal.inria.fr/tel-01248531
• 17P.-M. Pédrot.
  A Materialist Dialectica, Paris Diderot, September 2015.
  https://hal.archives-ouvertes.fr/tel-01247085

Articles in International Peer-Reviewed Journals

• 18F. Dabrowski, F. Loulergue, T. Pinsard.
  A formal semantics of nested atomic sections with thread escape, in: Computer Languages, Systems and Structures, 2015, 24 p.
  https://hal.inria.fr/hal-01143199
• 19S. Gaussent, Y. Guiraud, P. Malbos.
  Coherent presentations of Artin monoids, in: Compositio Mathematica, 2015, vol. 151, n^o 5, pp. 957-998. [ DOI : 10.1112/S0010437X14007842 ]
  https://hal.archives-ouvertes.fr/hal-00682233
• 20H. Herbelin.
  A dependently-typed construction of semi-simplicial types, in: Mathematical Structures in Computer Science, June 2015, vol. 25, n^o Special issue 05, 16 p. [ DOI : 10.1017/S0960129514000528 ]
  https://hal.inria.fr/hal-00935446
• 21F. Loulergue, W. Bousdira, J. Tesson.
  Calculating Parallel Programs in Coq using List Homomorphisms, in: International Journal of Parallel Programming, 2016, 20 p.
  https://hal.inria.fr/hal-01159182
• 22É. Miquey, M. Guillermo.
  Classical realizability and arithmetical formulæ, in: Mathematical Structures in Computer Science, 2016. [ DOI : 10.1017/S0960129515000559 ]
  https://hal.inria.fr/hal-01247989

International Conferences with Proceedings

• 23B. Allan, N. Kosmatov, M. Lemerre, F. Loulergue.
  A case study on formal verification of the Anaxagoros hypervisor paging system with Frama-C, in: International Workshop on Formal Methods for Industrial Critical Systems (FMICS), Oslo, Norway, Springer, June 2015.
  https://hal.inria.fr/hal-01140271
• 24D. Baelde, A. Doumane, A. Saurin.
  Least and Greatest Fixed Points in Ludics , in: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Berlin, Germany, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Leibniz International Proceedings in Informatics (LIPIcs), September 2015, vol. 41, pp. 549–566. [ DOI : 10.4230/LIPIcs.CSL.2015.549 ]
  https://hal.archives-ouvertes.fr/hal-01256773
• 25M. Bagnol, A. Doumane, A. Saurin.
  On the dependencies of logical rules, in: FOSSACS, 18th International Conference on Foundations of Software Science and Computation Structures, London, United Kingdom, April 2015.
  https://hal.archives-ouvertes.fr/hal-01110340
• 26P.-L. Curien, M. Fiore, G. Munch-Maccagnoni.
  A theory of effects and resources: adjunction models and polarised calculi, in: Principles of Programmming Languages, Saint-Petersbourg, Florida, United States, Proceedings POPL 2016, January 2016. [ DOI : 10.1145/2837614.2837652 ]
  https://hal.archives-ouvertes.fr/hal-01256092
• 27F. Dabrowski, F. Loulergue, T. Pinsard.
  Nested atomic sections with thread escape: Compilation to threads and locks, in: ACM Symposium on Applied Computing (SAC), Salamanca, Spain, ACM, April 2015.
  https://hal.inria.fr/hal-01105093
• 28A. Guesmi, P. Clemente, F. Loulergue, P. Berthomé.
  Cloud Resources Placement Based on Functional and Non-Functional Requirements, in: SECRYPT, Colmar, France, SCITEPRESS, July 2015.
  https://hal.inria.fr/hal-01158134
• 29C. Mangin, M. Sozeau.
  Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study, in: Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice, Berlin, Germany, EPTCS, August 2015, vol. 185. [ DOI : 10.4204/EPTCS.185.5 ]
  https://hal.inria.fr/hal-01248807
• 30P.-M. Pédrot, A. Saurin.
  Classical by-need, in: European Symposium on Programming, Eindhoven, Netherlands, European Symposium on Programming, April 2016.
  https://hal.archives-ouvertes.fr/hal-01257348
• 31B. Ziliani, M. Sozeau.
  A unification algorithm for Coq featuring universe polymorphism and overloading, in: 20th ACM SIGPLAN International Conference on Functional Programming, Vancouver, Canada, September 2015. [ DOI : 10.1145/2784731.2784751 ]
  https://hal.inria.fr/hal-01248804

Conferences without Proceedings

• 32G. Claret, Y. Régis-Gianas.
  Mechanical Verification of Interactive Programs Specified by Use Cases, in: 3rd IEEE/ACM FME Workshop on Formal Methods in Software Engineering, FLoren, France, May 2015. [ DOI : 10.1109/FormaliSE.2015.17 ]
  https://hal.inria.fr/hal-01255107
• 33T. Girka, D. Mentré, Y. Régis-Gianas.
  A Mechanically Checked Generation of Correlating Programs Directed by Structured Syntactic Differences, in: Automated Technology for Verification and Analysis, Shanghai, China, Lecture Notes in Computer Science, October 2015, vol. 9364. [ DOI : 10.1007/978-3-319-24953-7_6 ]
  https://hal.inria.fr/hal-01238704
• 34H. Herbelin, É. Miquey.
  Toward dependent choice: a classical sequent calculus with dependent types, in: TYPES 2015, Tallinn, Estonia, May 2015.
  https://hal.inria.fr/hal-01247998
• 35F. Loulergue.
  Construction de programmes parallèles en Coq avec des homomorphismes de listes, in: 14èmes journées Approches Formelles dans l'Assistance au Développement Logiciel (AFADL), Bordeaux, France, 2015.
  https://hal.inria.fr/hal-01158137
• 36F. Loulergue.
  Modèles fonctionnels de MapReduce en Coq, in: Journées Nationales du GdR GPL, Bordeaux, France, 2015.
  https://hal.inria.fr/hal-01158138
• 37É. Miquey.
  Realizability games for arithmetical formulæ , in: Worskshop GaLoP2015, Londres, United Kingdom, April 2015.
  https://hal.inria.fr/hal-01248093

Scientific Books (or Scientific Book chapters)

• 38F. Loulergue, W. Bousdira, J. Tesson.
  Calcul de programmes parallèles avec Coq, in: Informatique Mathématique, collection Alpha, CNRS Éditions, March 2015.
  https://hal.inria.fr/hal-01107296

Internal Reports

• 39P. Letouzey.
  Hofstadter's problem for curious readers, Université Paris Diderot ; Inria Paris-Rocquencourt, September 2015, 29 p.
  https://hal.inria.fr/hal-01195587

Other Publications

• 40D. Baelde, A. Doumane, A. Saurin.
  Least and Greatest Fixed Points in Ludics, July 2015, This document corresponds to the long version of a paper accepted for publication at CSL 2015.
  https://hal.inria.fr/hal-01178396
• 41R. Chen, J.-J. Levy.
  Readable semi-automatic formal proofs of Depth-First Search in graphs using Why3, November 2015, working paper or preprint.
  https://hal.inria.fr/hal-01253136
• 42C. Chenavier.
  Confluence algebras and acyclicity of the Koszul complex, April 2015, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01141738
• 43P.-L. Curien, J. Obradovic.
  On the various definitions of cyclic operads, January 2016, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01254649
• 44P. Dehornoy, Y. Guiraud.
  Quadratic normalisation in monoids, April 2015, 27 pages.
  https://hal.archives-ouvertes.fr/hal-01141226
• 45M. Lucas.
  A coherence theorem for pseudonatural transformations, September 2015, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01191867
• 46C. Mangin.
  Eliminating Dependent Pattern-Matching in Coq, Université Paris 7 Denis Diderot, August 2015.
  https://hal.inria.fr/hal-01250855
• 47J. Obradovic.
  The Bénabou-Roubaud monadic descent theorem via string diagrams, January 2016, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01254637
• 48T. Zimmermann, H. Herbelin.
  Automatic and Transparent Transfer of Theorems along Isomorphisms in the Coq Proof Assistant, May 2015, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01152588

References in notes

• 49H. P. Barendregt.
  The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1984.
• 50R. Berger.
  Confluence and Koszulity, in: J. Algebra, 1998, vol. 201, n^o 1, pp. 243–283.
• 51A. Church.
  A set of Postulates for the foundation of Logic, in: Annals of Mathematics, 1932, vol. 2, pp. 33, 346-366.
• 52T. Coquand.
  Une théorie des Constructions, University Paris 7, January 1985.
• 53T. 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.
• 54T. 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.
• 55H. B. Curry, R. Feys, W. Craig.
  Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
• 56U. Dal Lago, C. Faggian, B. Valiron, A. Yoshimizu.
  Parallelism and Synchronization in an Infinitary Context, in: Proc. LICS 2015, 2015.
• 57P. Dehornoy, F. Digne, E. Godelle, D. Krammer, J. Michel.
  Foundations of Garside theory, EMS Tracts Math., European Mathematical Society, 2015, vol. 22, xiv + 689 pages p.
• 58P. Deligne.
  Action du groupe des tresses sur une catégorie, in: Invent. Math., 1997, vol. 128, n^o 1, pp. 159–175.
• 59M. Felleisen, D. P. Friedman, E. Kohlbecker, B. F. Duba.
  Reasoning with continuations, in: First Symposium on Logic and Computer Science, 1986, pp. 131-141.
• 60A. 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.
• 61G. Gentzen.
  Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, pp. 176–210,405–431.
• 62J.-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, n^o 63, pp. 63-92.
• 63T. 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.
• 64Y. Guiraud, E. Hoffbeck, P. Malbos.
  Linear polygraphs and Koszulity of algebras, June 2014, 42 pages.
  https://hal.archives-ouvertes.fr/hal-01006220
• 65Y. Guiraud, P. Malbos.
  Coherence in monoidal track categories, in: Math. Structures Comput. Sci., 2012, vol. 22, n^o 6, pp. 931–969.
• 66W. 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.
• 67J.-L. Krivine.
  A call-by-name lambda-calculus machine, in: Higher Order and Symbolic Computation, 2005.
• 68J.-L. Krivine.
  Un interpréteur du lambda-calcul, 1986, Unpublished.
• 69P. Landin.
  The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, n^o 4, pp. 308–320.
• 70P. Landin.
  A generalisation of jumps and labels, UNIVAC Systems Programming Research, August 1965, n^o ECS-LFCS-88-66, Reprinted in Higher Order and Symbolic Computation, 11(2), 1998.
• 71P. Martin-Löf.
  A theory of types, University of Stockholm, 1971, n^o 71-3.
• 72M. 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.
  http://www.informatik.uni-trier.de/~ley/pers/hd/p/Parigot:Michel.html
• 73J. 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.
• 74J. 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.
• 75The Coq Development Team.
  The Coq Reference Manual, version 8.2, September 2008.
  http://coq.inria.fr/doc
• 76J. Tits.
  A local approach to buildings, in: The geometric vein, New York, Springer, 1981, pp. 519–547.
• 77N. de Bruijn.
  AUTOMATH, a language for mathematics, Technological University Eindhoven, November 1968, n^o 66-WSK-05.