Contact Version française

The ProVal team was stopped at the end of August 2012, and reborn into a new team Toccata
These pages do not evolve anymore, please follow the link above for up-to-date informations about our team.

Publications 2002

Back

Books / Journals / Conferences / PhD theses / Misc. / Reports

Books and book chapters

Journals

[1] Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive Data Type Systems. Theoretical Computer Science, 272(1-2):41-68, 2002. [ bib ]

Conferences

[6] Sylvain Conchon. Modular information flow analysis for process calculi. In Iliano Cervesato, editor, Proceedings of the Foundations of Computer Security Workshop (FCS 2002), Copenhagen, Denmark, July 2002. [ bib | .ps.gz ]
[5] Julien Forest. A weak calculus with explicit operators for pattern matching and substitution. In Sophie Tison, editor, 13th International Conference on Rewriting Techniques and Applications, volume 2378 of Lecture Notes in Computer Science, pages 174-191, Copenhagen, Denmark, July 2002. Springer. [ bib | PDF | .pdf ]
[4] Judicaël Courant. Strong normalization with singleton types. In Stefan Van Bakel, editor, Second Workshop on Intersection Types and Related Systems, volume 70 of Electronic Notes in Computer Science, Copenhaguen, Danemark, July 2002. Elsevier Science Publishers. [ bib | .ps.gz ]
[3] Judicaël Courant. Explicit universes for the calculus of constructions. In Victor Carreño, César A. Muñoz, and Sofiène Tahar, editors, Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002, volume 2410 of Lecture Notes in Computer Science, pages 115-130, Hampton, VA, USA, August 2002. Springer. [ bib | .ps.gz ]
[2] Jean-Christophe Filliâtre. La supériorité de l'ordre supérieur. In Journées Francophones des Langages Applicatifs, pages 15-26, Anglet, France, January 2002. [ bib | PDF | .pdf ]
[1] Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, and Ralf Treinen. The first-order theory of subtyping constraints. In John Mitchell, editor, Conference Record of the 29th Symposium on Principles of Programming Languages, pages 203-216, Portland, OR, USA, January 2002. ACM Press. [ bib | PDF | .ps.gz ]

PhD theses

[3] Cuihtlauac Alvarado. Réflexion pour la réécriture dans le calcul des constructions inductives. PhD thesis, Université Paris-Sud, December 2002. [ bib ]
[2] Patrick Loiseleur. Spécifications et preuves de programmes distribués, une approche basée sur les réseaux d'objets CORBA. PhD thesis, Université Paris-Sud, September 2002. [ bib ]
[1] Benjamin Monate. Propriétés uniformes de familles de systèmes de réécriture de mots paramétrées par des entiers. Thèse de doctorat, Université Paris-Sud, Orsay, France, January 2002. [ bib | .ps.gz ]

Misc.

Reports

[10] Jérôme Creci. Certification d'algorithmes d'arithmétique réelle exacte dans le système Coq. Rapport de DEA, Université Paris-Sud, Orsay, France, September 2002. [ bib ]
[9] Nicolas Oury. équivalence vis-à-vis de l'observation et extraction de programmes. Rapport de DEA, Université Paris-Sud, Orsay, France, September 2002. [ bib | .ps.gz ]
[8] Julien Signoles. Calcul statique des applications de foncteurs en présence d'effets de bord. Rapport de DEA, Université Paris-Sud, September 2002. In French. [ bib ]
[7] The Coq Development Team. The Coq Proof Assistant Reference Manual - Version V7.3, May 2002. http://coq.inria.fr. [ bib | http ]
[6] Julien Forest. A weak calculus with explicit operators for pattern matching and substitution. Research Report 1313, LRI, May 2002. [ bib | PDF | .pdf ]
[5] The Coq development team. The coq proof assistant reference manual v7.2. Technical Report 255, INRIA, France, March 2002. [ bib | .html ]
[4] Keiichirou Kusakari, Claude Marché, and Xavier Urbain. Termination of associative-commutative rewriting using dependency pairs criteria. Research Report 1304, LRI, 2002. http://www.lri.fr/~urbain/textes/rr1304.ps.gz. [ bib | .ps.gz ]
[3] Antoine Kremer. Spécification et vérification de systèmes temporisés réactifs en logique linéaire. Rapport de DEA, Université Paris-Sud, 2002. [ bib ]
[2] Xavier Urbain. Modular & incremental proofs of AC-termination. Research Report 1317, LRI, 2002. [ bib | .ps.gz ]
[1] Xavier Urbain. Modular & incremental automated termination proofs. Research Report 1326, LRI, 2002. [ bib | .ps.gz ]

Back

Books / Journals / Conferences / PhD theses / Misc. / Reports


This page was generated by bibtex2html.