Team π.r²

Overall Objectives
Scientific Foundations
Application Domains
New Results
Other Grants and Activities


Major publications by the team in recent years

B. Barras, B. Bernardo.
The Implicit Calculus of Constructions as a Programming Language with Dependent Types, in: FoSSaCS, 2008, p. 365-379
M. Basaldella, A. Saurin, K. Terui.
On the Meaning of Focalization, in: (informal) Proceedings of Prelude Workshop, September 2009
P.-L. Curien, H. Herbelin.
The duality of computation, in: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), Montreal, Canada, September 18-21, 2000, SIGPLAN Notices 35(9), ACM, 2000, p. 233–243
H. 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, January 7-12, 2008, G. C. Necula, P. Wadler (editors), ACM, January 2008, p. 383-394
H. Herbelin.
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure, in: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, L. Pacholski, J. Tiuryn (editors), Lecture Notes in Computer Science, Springer, 1995, vol. 933, p. 61–75.
Y. 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
A. Saurin.
Separation with Streams in the $ \upper_lambda$$ \mu$ -calculus, in: Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, IEEE Computer Society, 2005, p. 356-365
A. Saurin.
On the Relations between the Syntactic Theories of $ \lambda$$ \mu$ -calculi, in: Computer Science Logic 2008, LNCS, Springer, 2008.
A. Saurin.
Towards Ludics Programming: Interactive Proof Search, in: ICLP 2008, LNCS, Springer, 2008, p. 253-268.
A. Saurin.
Une étude logique du Contrôle, appliquée à la programmation fonctionnelle et logique, École Polytechnique, September 2008, Ph. D. Thesis.
A. Saurin.
Typing Streams in the $ \upper_lambda$$ \mu$ -calculus, in: ACM Transactions on Computational Logic, 2009, to appear.

Publications of the year

Articles in International Peer-Reviewed Journal

P.-L. Curien, G. Munch-Maccagnoni.
The duality of computation under focus, in: Higher Order and Symbolic Computation, 2010, in preparation for a special issue in honour of Peter Landin.

International Peer-Reviewed Conference/Proceedings

H. Herbelin, G. Lee.
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus, in: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-25, 2009, Proceedings, H. Ono, M. Kanazama, R. de Queiroz (editors), Lecture Notes in Artificial Intelligence, Springer, 2009, vol. 5514, p. 209–217.
H. Herbelin, S. Zimmermann.
An Operational Account of Call-By-Value Minimal and Classical $ \lambda$ -calculus in “Natural Deduction” Form, in: Ninth International Conference, TLCA '07, Brasilia, Brazil. July 2009, Proceedings, P.-L. Curien (editor), Lecture Notes in Computer Science, Springer, 2009, vol. 5608, p. 142–156.
G. 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.
E. Soubiran.
A unified framework and a transparent name-space for the Coq module system., in: Proceedings of the First International Workshop on Modules and Libraries for Proof Assistants (MLPA'09), Montreal, Canada, ELSEVIER ENTCS, Montreal, Canada, August 2009, p. 28–42.

National Peer-Reviewed Conference/Proceedings

S. Glondu.
Extraction certifiée dans Coq-en-Coq, in: JFLA 2009, Vingtièmes Journées Francophones des Langages Applicatifs, Saint Quentin sur Isère, France, January 31 - February 3, 2009. Proceedings, 2009.

Internal Reports

D. Ilik, G. Lee, H. Herbelin.
Kripke Models for Classical Logic, Inria, 2009, Technical report.

Other Publications

H. Herbelin, G. Lee.
Formalising Logical Meta-theory - Semantical Normalisation using Kripke Models for Predicate Logic, 2009, submitted in November 2009 to APAL.
H. Herbelin, A. Saurin.
$ \lambda$$ \mu$ -calculus and $ \upper_lambda$$ \mu$ -calculus, a capital difference, 2009, submitted to APAL.
K. T. Michele Basaldella.
From focalization of logic to the logic of focalization, 2010, submitted in november 2009 to an international conference.
A. Saurin.
A Hierarchy for delimited control in call-by-name, 2010, to appear in the proceedings of FOSSACS 2010.
A. Saurin.
Standardization and Böhm Trees for $ \upper_lambda$$ \mu$ -calculus, 2010, submitted in november 2009 to an international conference.

References in notes

R. Adams.
Pure type systems with judgemental equality, in: J. Funct. Program., 2006, vol. 16, no 2, p. 219-246
H. P. Barendregt.
The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1984.
Y. Bertot, P. Castéran.
Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions, Springer, 2004.
A. Bohannon, J. N. Foster, B. C. Pierce, A. Pilkiewicz, A. Schmitt.
Boomerang: Resourceful Lenses for String Data, in: ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL), San Francisco, California, January 2008
A. Church.
A set of Postulates for the foundation of Logic, in: Annals of Mathematics, 1932, vol. 2, p. 33, 346-366.
T. Coq Development Team.
The Coq Reference Manual, version 8.2, September 2008, Distributed electronically.
T. Coquand.
Une théorie des Constructions, University Paris 7, January 1985, Dissertation.
T. Coquand, G. Huet.
Constructions : A Higher Order Proof System for Mechanizing Mathematics, in: EUROCAL'85, Linz, Lecture Notes in Computer Science, Springer Verlag, Linz, 1985, vol. 203.
T. 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.
K. Crary.
A Simple Proof Technique for Certain Parametricity Results, in: ICFP, 1999, p. 82-89
H. B. Curry, R. Feys, W. Craig.
Combinatory Logic, North-Holland, 1958, vol. 1, §9E.
Z. Dargaye.
Vérification formelle d'un compilateur pour langages fonctionnels, Université Paris Diderot-Paris 7, July 2009, Doctorat.
N. de Bruijn.
AUTOMATH, a language for mathematics, Technological University Eindhoven, November 1968, no 66-WSK-05, Technical report.
T. Ehrhard, L. Regnier.
The differential Lambda-calculus, in: Theor. Comput. Sci., 2003, vol. 309, no 1, p. 1–41
M. Felleisen, D. P. Friedman, E. Kohlbecker, B. F. Duba.
Reasoning with continuations, in: First Symposium on Logic and Computer Science, 1986, p. 131-141.
A. Filinski.
Representing Monads, in: Conf. Record 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'94, Portland, OR, USA, 17-21 Jan. 1994, ACM Press, 1994, p. 446-457.
J.-C. Filliâtre, C. Marché.
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification, in: 19th International Conference on Computer Aided Verification, Berlin, Germany, W. Damm, H. Hermanns (editors), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, July 2007
G. Gentzen.
Untersuchungen über das logische Schließen, in: Mathematische Zeitschrift, 1935, vol. 39, p. 176–210,405–431.
J.-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.
J.-Y. Girard.
A new constructive logic: Classical logic, in: Math. Struct. Comp. Sci., 1991, no 1.
T. 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.
W. 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.
J.-L. Krivine.
Realizability in classical logic, 2004, To appear in Panoramas et synthèses, Société Mathématique de France.
J.-L. Krivine.
A call-by-name lambda-calculus machine, in: Higher Order and Symbolic Computation, 2005.
J.-L. Krivine.
Un interpréteur du lambda-calcul, 1986, Unpublished.
P. Landin.
The mechanical evaluation of expressions, in: The Computer Journal, January 1964, vol. 6, no 4, p. 308–320.
P. 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.
S. Lengrand.
Normalisation & Equivalence in Proof Theory & Type Theory, Université Paris 7 & University of St Andrews, 2006, Ph. D. Thesis.
P. B. Levy.
Call-by-Push-Value: A Subsuming Paradigm, in: TLCA, 1999, p. 228-242
P. Martin-Löf.
A theory of types, University of Stockholm, 1971, no 71-3, Technical report.
P.-A. Melliès, J. Vouillon.
Recursive Polymorphic Types and Parametricity in an Operational Framework, in: 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), IEEE Computer Society, 2005, p. 82-91, PPS//04/09//no30 (pp).
A. Miquel.
Le Calcul des Constructions implicite: syntaxe et sémantique, Université Paris 7, December 2001, Ph. D. Thesis.
H. Nilsson, A. Courtney, J. Peterson.
Functional Reactive Programming, Continued, in: Proceedings of the 2002 ACM SIGPLAN Haskell Workshop (Haskell'02), Pittsburgh, Pennsylvania, USA, ACM Press, Pittsburgh, Pennsylvania, USA, October 2002, p. 51–64.
C. Papadimitriou.
Computational Complexity, Addison Wesley, 1994.
M. Parigot.
Free Deduction: An Analysis of "Computations" in Classical Logic., in: Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990 - Second Russian Conference on Logic Programming, St. Petersburg, Russia, September 11-16, 1991, Proceedings, A. Voronkov (editor), Lecture Notes in Computer Science, Springer, 1991, vol. 592, p. 361-380.
M. 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.
A. M. Pitts.
Typed Operational Reasoning, in: Advanced Topics in Types and Programming Languages, B. C. Pierce (editor), The MIT Press, 2005, chap. 7, p. 245–289.
J. C. Reynolds.
Definitional interpreters for higher-order programming languages, in: ACM '72: Proceedings of the ACM annual conference, New York, NY, USA, ACM Press, New York, NY, USA, 1972, p. 717–740.
J. 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.
K. Terui.
Computational Ludics, in: Theoretical Computer Science, 2009, to appear.