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
2A. Asperti, J.-J. Lévy.

On the length of Standard Reductions in the Lambda Calculus.
3P.-L. Curien.

Substitution up to isomorphism, in: Fundamenta Informaticae, 1993, vol. 19, pp. 51-85.
4P.-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/
5Y. 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
6Y. 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
7H. 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, pp. 383-394.
8H. 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/
9H. Herbelin.

A dependently-typed construction of semi-simplicial types, March 2013.

https://hal.inria.fr/hal-00935446
10J.-J. Lévy.

Simple proofs of simple programs in Why3.
11G. 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.
12Y. 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
13A. 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.
14A. 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, pp. 154-168. [ DOI : 10.1007/978-3-540-87531-4_13 ]

http://hal.archives-ouvertes.fr/hal-00527930/en/
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

16P. Boutillier.

New tool to compute with inductive in Coq, Université Paris-Diderot - Paris VII, February 2014.

https://tel.archives-ouvertes.fr/tel-01054723

Articles in International Peer-Reviewed Journals

17P.-L. Curien, R. Garner, M. Hofmann.

Revisiting the categorical interpretation of dependent type theory, in: Theoretical Computer Science, 2014, vol. 546, pp. 99-119. [ DOI : 10.1016/j.tcs.2014.03.003 ]

https://hal.archives-ouvertes.fr/hal-01114033
18S. Gaussent, Y. Guiraud, P. Malbos.

Coherent presentations of Artin monoids, in: Compositio Mathematica, December 2014, pp. 1-42. [ DOI : 10.1112/S0010437X14007842 ]

https://hal.archives-ouvertes.fr/hal-00682233

International Conferences with Proceedings

19M. 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
20S. Castellan, J. Hayman, M. Lasson, G. Winskel.

Strategies as Concurrent Processes, in: MFPS 2014, Ithaca, United States, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX), June 2014, vol. 308, pp. 87–107. [ DOI : 10.1016/j.entcs.2014.10.006 ]

https://hal.archives-ouvertes.fr/hal-01105258
21F. 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
22P. Downen, Z. Ariola.

The duality of construction, in: ESOP 2014 : European Symposium on Programming, Grenoble, France, April 2014, 15 p.

https://hal.archives-ouvertes.fr/hal-00938317
23H. Herbelin, A. Spiwack.

The Rooster and the Syntactic Bracket , in: 19th International Conference on Types for Proofs and Programs (TYPES 2013), Toulouse, France, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, July 2014, vol. 26, pp. 169–187. [ DOI : 10.4230/LIPIcs.TYPES.2013.169 ]

https://hal.inria.fr/hal-01097919
24M. Lasson.

Canonicity of Weak ω-groupoid Laws Using Parametricity Theory, in: MFPS 2014, Ithaca, United States, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX), June 2014, vol. 308, pp. 229 - 244. [ DOI : 10.1016/j.entcs.2014.10.013 ]

https://hal.archives-ouvertes.fr/hal-01105252
25G. Munch-Maccagnoni.

Models of a Non-Associative Composition, in: FOSSACS 2014 - 17th International Conference on Foundations of Software Science and Computation Structures, Grenoble, France, A. Muscholl (editor), Springer, April 2014, vol. 8412, pp. 396-410. [ DOI : 10.1007/978-3-642-54830-7_26 ]

https://hal.inria.fr/hal-00996729
26P.-M. Pédrot.

A Functional Functional Interpretation, in: CSL-LICS 2014 - Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Vienna, Austria, July 2014. [ DOI : 10.1145/2603088.2603094 ]

https://hal.archives-ouvertes.fr/hal-01111802
27M. Sozeau, N. Tabareau.

Universe Polymorphism in Coq, in: Interactive Theorem Proving, Vienna, Austria, July 2014.

https://hal.inria.fr/hal-00974721
28B. Ziliani, M. Sozeau.

Towards a better-behaved unification algorithm for Coq , in: UNIF 2014 Workshop, Vienna, Austria, July 2014, pp. 74-87.

https://hal.archives-ouvertes.fr/hal-01111193

National Conferences with Proceedings

29M. Bagnol, A. Doumane, A. Saurin.

Analyse de dépendances et correction des réseaux de preuve, in: JFLA 2014 - Vingt-cinquièmes Journées Francophones des Langages Applicatifs, Fréjus, France, January 2014.

https://hal.archives-ouvertes.fr/hal-01110338
30A. Saurin, P.-M. Pédrot.

Nécessité faite loi: de la réduction linéaire de tête à l'évaluation paresseuse, in: JFLA 2014 - Vingt-cinquièmes Journées Francophones des Langages Applicatifs, Fréjus, France, January 2014.

https://hal.archives-ouvertes.fr/hal-01110337

Conferences without Proceedings

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

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

https://hal.archives-ouvertes.fr/hal-01105087

Scientific Books (or Scientific Book chapters)

32F. 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

33P. Boutillier, S. Glondu, B. Grégoire, H. Herbelin, P. Letouzey, P.-M. Pédrot, Y. Régis-Gianas, M. Sozeau, A. Spiwack, E. Tassi.

Coq 8.4 Reference Manual, Inria, July 2014, The Coq Development Team.

https://hal.inria.fr/hal-01114602

Scientific Popularization

34P.-L. Curien.

Formalisation mathématique, certification logicielle, même combat, in: Gazette des Mathématiciens, October 2014, vol. 142, pp. 83-86.

https://hal.archives-ouvertes.fr/hal-01114035

Other Publications

35Y. Guiraud, E. Hoffbeck, P. Malbos.

Linear polygraphs and Koszulity of algebras, June 2014, 42 pages.

https://hal.archives-ouvertes.fr/hal-01006220
36Y. Guiraud, P. Malbos.

Polygraphs of finite derivation type, January 2014, 46 pages.

https://hal.archives-ouvertes.fr/hal-00932845

References in notes

37H. P. Barendregt.

The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1984.
38R. Berger.

Confluence and Koszulity, in: J. Algebra, 1998, vol. 201, n^o 1, pp. 243–283.
39B. 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, n^o 3-4, pp. 475–511, Translated from the 1965 German original by Michael P. Abramson.
40A. Church.

A set of Postulates for the foundation of Logic, in: Annals of Mathematics, 1932, vol. 2, pp. 33, 346-366.
41T. Coquand.

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

Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
45F. Dabrowski, F. Loulergue, T. Pinsard.

Nested Atomic Sections with Thread Escape: A Formal Definition, in: Symposium on Applied Computing (SAC), ACM, 2014, pp. 1585-1592.

http://dx.doi.org/10.1145/2554850.2554996
46P. Dehornoy, L. Paris.

Gaussian groups and Garside groups, two generalisations of Artin groups, in: Proc. London Math. Soc. (3), 1999, vol. 79, n^o 3, pp. 569–604.
47P. Deligne.

Action du groupe des tresses sur une catégorie, in: Invent. Math., 1997, vol. 128, n^o 1, pp. 159–175.
48K. Emoto, F. Loulergue, J. Tesson.

A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction, in: Interactive Theorem Proving (ITP), LNCS, Springer, 2014, n^o 8558, pp. 258-274.

http://dx.doi.org/10.1007/978-3-319-08970-6_17
49M. Felleisen, D. P. Friedman, E. Kohlbecker, B. F. Duba.

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

Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, pp. 176–210,405–431.
52J.-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.
53T. 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.
54W. 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.
55J.-L. Krivine.

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

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

The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, n^o 4, pp. 308–320.
58P. 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.
59F. Loulergue, S. Robillard, J. Tesson, J. Légaux, Z. Hu.

Formal Derivation and Extraction of a Parallel Program for the All Nearest Smaller Values Problem, in: Symposium on Applied Computing (SAC), ACM, 2014, pp. 1577-1584.

http://dx.doi.org/10.1145/2554850.2554912
60P. Martin-Löf.

A theory of types, University of Stockholm, 1971, n^o 71-3.
61M. 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
62J. 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.
63J. 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.
64The Coq Development Team.

The Coq Reference Manual, version 8.2, September 2008.

http://coq.inria.fr/doc
65J. Tits.

A local approach to buildings, in: The geometric vein, New York, Springer, 1981, pp. 519–547.
66N. de Bruijn.

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

Previous |

Home