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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 278-293.

Publications of the year

Doctoral Dissertations and Habilitation Theses

11G. Munch-Maccagnoni.

Syntaxe et modèles d'une composition non-associative des programmes et des preuves, Université Paris-Diderot - Paris VII, December 2013.

http://hal.inria.fr/tel-00918642

Articles in International Peer-Reviewed Journals

12R. M. Amadio, Y. Regis-Gianas.

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

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

International Conferences with Proceedings

13B. Barras, L. D. C. Gonzalez Huesca, H. Herbelin, Y. Régis-Gianas, E. Tassi, M. Wenzel, B. Wolff.

Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems, in: MKM/Calculemus/DML, Bath, United Kingdom, 2013, pp. 359-363.

http://hal.inria.fr/hal-00908980
14G. Claret, L. D. C. Gonzalez Huesca, Y. Régis-Gianas, B. Ziliani.

Lightweight proof by reflection using a posteriori simulation of effectful computation, in: Interactive Theorem Proving, Rennes, France, July 2013.

http://hal.inria.fr/hal-00870110
15P. Downen, Z. Ariola.

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

http://hal.inria.fr/hal-00938317
16Y. 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 ]

http://hal.inria.fr/hal-00818253
17P.-M. Pédrot.

Un régime au concentré d'automate, in: JFLA - Journées francophones des langages applicatifs, Aussois, France, D. Pous, C. Tasson (editors), Damien Pous and Christine Tasson, February 2013.

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

Scientific Books (or Scientific Book chapters)

18P. Aczel, B. Ahrens, T. Altenkirch, S. Awodey, B. Barras, A. Bauer, Y. Bertot, M. Bezem, T. Coquand, E. Finster, D. Grayson, H. Herbelin, A. Joyal, D. Licata, P. Lumsdaine, A. Mahboubi, P. Martin-Löf, S. Melikhov, A. Pelayo, A. Polonsky, M. Shulman, M. Sozeau, B. Spitters, B. Van Den Berg, V. Voevodsky, M. Warren, C. Angiuli, A. Bordg, G. Brunerie, C. Kapulkin, E. Rijke, K. Sojakova, J. Avigad, C. Cohen, R. Constable, P.-L. Curien, P. Dybjer, M. Escardó, K.-B. Hou, N. Gambino, R. Garner, G. Gonthier, T. Hales, R. Harper, M. Hofmann, P. Hofstra, J. Koch, N. Kraus, N. Li, Z. Luo, M. Nahas, E. Palmgren, E. Riehl, D. Scott, P. Scott, S. Soloviev.

Homotopy Type Theory: Univalent Foundations of Mathematics, Aucun, 2013, 448 p.

http://hal.inria.fr/hal-00935057
19Y. Guiraud, P. Malbos.

Identities among relations for higher-dimensional rewriting systems, in: Operads 2009, Séminaires et Congrès, Société Mathématique de France, 2013, vol. 26, pp. 145-161.

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

Other Publications

20P. Boutillier.

Simple simpl, 2013.

http://hal.inria.fr/hal-00816918
21Y. Guiraud, P. Malbos.

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

http://hal.inria.fr/hal-00932845
22H. Herbelin.

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

http://hal.inria.fr/hal-00935446
23M. Sozeau, N. Tabareau.

Univalence for free, 2013.

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

References in notes

24U. A. Acar.

Self-adjusting Computation, Carnegie Mellon University, Pittsburgh, PA, USA, 2005, AAI3166271.
25D. J. Anick.

On the Homology of Associative Algebras, in: Trans. Amer. Math. Soc., 1986, vol. 296, n^o 2, pp. 641–659.
26H. P. Barendregt.

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

Confluence and Koszulity, in: J. Algebra, 1998, vol. 201, n^o 1, pp. 243–283.
28B. 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.
29A. Church.

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

Une théorie des Constructions, University Paris 7, January 1985.
31T. 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.
32T. 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.
33P.-L. Curien, G. Munch-Maccagnoni.

The duality of computation under focus, in: Theoretical Computer Science, 2010, pp. 165–181.
34H. B. Curry, R. Feys, W. Craig.

Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
35P. 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.
36M. Felleisen, D. P. Friedman, E. Kohlbecker, B. F. Duba.

Reasoning with continuations, in: First Symposium on Logic and Computer Science, 1986, pp. 131-141.
37A. 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.
38C. Führmann.

Direct Models for the Computational Lambda Calculus, in: Electr. Notes Theor. Comput. Sci., 1999, vol. 20, pp. 245-292.
39S. Gaussent, Y. Guiraud, P. Malbos.

Coherent presentations of Artin monoids, 2013, 45 p.
40G. Gentzen.

Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, pp. 176–210,405–431.
41J.-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.
42T. 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.
43Y. Guiraud, P. Malbos.

Higher-dimensional categories with finite derivation type, in: Theory Appl. Categ., 2009, vol. 22, n^o 18, pp. 420-478.
44H. Herbelin, A. Spiwack.

The Rooster and the Syntactic Bracket, 2013.
45W. 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.
46J.-L. Krivine.

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

Un interpréteur du lambda-calcul, 1986, Unpublished.
48F. Lamarche.

On the Algebra of Structural Contexts, in: Math. Struct. in Comp. Sci., 2014, to appear.
49P. Landin.

The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, n^o 4, pp. 308–320.
50P. 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.
51P. Martin-Löf.

A theory of types, University of Stockholm, 1971, n^o 71-3.
52J.-F. Monin.

Proof Trick: Small Inversions, in: Second Coq Workshop, Edinburgh Royaume-Uni, Y. Bertot (editor), July 2010.

http://hal.inria.fr/inria-00489412/en/
53G. Munch-Maccagnoni.

Models of a Non-Associative Composition, in: 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCs), 2014.
54M. 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
55J. 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.
56J. 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.
57C. Squier, F. Otto, Y. Kobayashi.

A finiteness condition for rewriting systems, in: Theoret. Comput. Sci., 1994, vol. 131, n^o 2, pp. 271–294.
58The Coq Development Team.

The Coq Reference Manual, version 8.2, September 2008.

http://coq.inria.fr/doc
59P. Wadler.

Call-by-value is dual to call-by-name, in: Proceedings of ICFP, ACM, 2003, pp. 189–201.
60N. Zeilberger.

The Logical Basis of Evaluation Order and Pattern-Matching, Carnegie Mellon University, 2009.
61N. de Bruijn.

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

Previous |

Home