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 1996

Back

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

Books and book chapters

Journals

[3] Roberto Di Cosmo and Delia Kesner. Combining algebraic rewriting, extensional lambda calculi, and fixpoints. Theoretical Computer Science, 169(2):201-220, 1996. [ bib ]
[2] Delia Kesner, Laurence Puel, and Val Tannen. A Typed Pattern Calculus. Information and Computation, 124(1):32-61, January 1996. [ bib ]
[1] Claude Marché. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation, 21(3):253-288, 1996. [ bib | PDF | Abstract ]

Conferences

[12] Mina Abdiche. A type inference algorithm for the polyadic pi-calculus with a sub-sort relation. In Journées du pôle programmation fonctionnelle, Orléans, November 1996. PRC/GDR Programmation du CNRS. [ bib ]
[11] Ralf Treinen. The first-order theory of one-step rewriting by a linear term rewriting system is undecidable (extended abstract). In Klaus Schulz and Stephan Kepser, editors, Extended Abstracts of the Tenth International Workshop on Unification, Herrsching, Germany, June 1996. Published as CIS-Bericht-96-91, Universität München. [ bib ]
[10] Delia Kesner. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 184-199, New Brunswick, NJ, USA, July 1996. Springer. [ bib ]
[9] Alexandre Boudet and Hubert Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Proc. Coll. on Trees in Algebra and Programming (CAAP'96), Lecture Notes in Computer Science, pages 30-43, 1996. [ bib ]
[8] Alexandre Boudet, Evelyne Contejean, and Claude Marché. AC-complete unification and its application to theorem proving. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 18-32, New Brunswick, NJ, USA, July 1996. Springer. [ bib | DOI | PDF | Abstract ]
[7] Evelyne Contejean and Claude Marché. CiME: Completion Modulo E. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 416-419, New Brunswick, NJ, USA, July 1996. Springer. System Description available at http://cime.lri.fr/. [ bib | DOI | PDF | http | Abstract ]
[6] Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. λ-calculi with explicit substitutions and composition which preserve β-strong normalization (extended abstract). In Michael Hanus and Mario Rodríguez-Artalejo, editors, 5th International Conference on Algebraic and Logic Programming, volume 1139 of Lecture Notes in Computer Science, pages 284-298, Aachen, Germany, September 1996. Springer. [ bib ]
[5] Jean-Pierre Jouannaud and Albert Rubio. A recursive path ordering for higher-order terms in η-long β-normal form. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 108-122, New Brunswick, NJ, USA, July 1996. Springer. [ bib | .ps.gz | Abstract ]
[4] Florent Jacquemard. Decidable approximations of terms rewriting systems. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 362-376, New Brunswick, NJ, USA, July 1996. Springer. [ bib ]
[3] Ralf Treinen. The first-order theory of one-step rewriting is undecidable. In Harald Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 276-286, New Brunswick, NJ, USA, July 1996. Springer. [ bib ]
[2] Judicaël Courant. Un calcul de modules pour coq. In Actes de la journée du Pôle Preuves et Spécifications Algébriques du GDR de programmation, Orléans, France, 1996. [ bib ]
[1] Christine Paulin-Mohring. Circuits as streams in Coq : Verification of a sequential multiplier. In S. Berardi and M. Coppo, editors, Types for Proofs and Programs, TYPES'95, volume 1158 of Lecture Notes in Computer Science. Springer, 1996. [ bib ]

PhD theses

[2] Florent Jacquemard. Automates d'arbres et Réécriture de termes. PhD thesis, Université Paris-Sud, November 1996. [ bib ]
[1] Christine Paulin-Mohring. Définitions inductives en théorie des types d'ordre supérieur. thèse d'habilitation, Ecole Normale Supérieure de Lyon, Décembre 1996. [ bib ]

Misc.

[2] Adel Bouhoula and Jean-Pierre Jouannaud. Automata-driven automated induction, June 1996. [ bib | .ps.gz | Abstract ]
[1] Jean-Pierre Jouannaud and Mitsuhiro Okada. Strong normalization of inductive data type systems, February 1996. [ bib | .ps.gz | Abstract ]

Reports

[4] Ralf Treinen. The first-order theory of linear one-step rewriting is undecidable. Rapport de Recherche 1080, Laboratoire de Recherche en Informatique, Université de Paris-Sud, F91405 Orsay cedex, France, November 1996. [ bib | .ps.gz | Abstract ]
[3] Jean-Pierre Jouannaud and Mitsuhiro Okada. Inductive data type systems. Technical report, Laboratoire de Recherche en Informatique, 1996. submitted. [ bib ]
[2] Landy Rabehasaina. Systèmes de réécriture pour l'arithmétique. Rapport de stage de magistère, Université Paris-sud, 1996. [ bib | PDF | Abstract ]
[1] Xavier Urbain. Interprétations polynomiales et applications aux λ-calculs avec substitutions explicites. Rapport de stage de maîtrise, Université Paris-sud, 1996. [ bib | PDF | Abstract ]

Back

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


This page was generated by bibtex2html.