Wiki Agenda Contact Version française

Publications : Laurence Puel

Back
[18] Laurence Puel. La sécurité sociale, chapter Rapport de la 6ème chambre de la Cour des Comptes: Le système d'information de la caisse nationale d'Assurance Vieillesse. édition des journaux officiels, September 2003. [ bib ]
[17] Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. Lambda-calculi with Explicit Substitutions Preserving Strong Normalization. Applicable Algebra in Engineering Communication and Computing, 9(4):333--371, 1999. [ bib ]
[16] Maria C.F. Ferreira, Delia Kesner, and Laurence Puel. Reducing AC-Termination to Termination. In Lubos Brim, Jozef Gruska, and Jiri Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 239--247, Brno, Czech Republic, August 1998. Springer. [ bib | .ps.gz ]
[15] Delia Kesner, Laurence Puel, and Val Tannen. A Typed Pattern Calculus. Information and Computation, 124(1):32--61, January 1996. [ bib ]
[14] 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 ]
[13] Laurence Puel and Ascander Suarez. Optimal solutions to pattern matching problems. In Proc. TAPSOFT 93, Lecture Notes in Computer Science, vol. 668, pages 501--518, Orsay, April 1993. Springer. [ bib ]
[12] Val Breazu-Tannen, Delia Kesner, and Laurence Puel. A typed pattern calculus. In Proceedings of the Eigth Annual IEEE Symposium on Logic in Computer Science, pages 262--274. IEEE Comp. Soc. Press, 1993. [ bib ]
[11] Val Breazu-Tannen, Delia Kesner, and Laurence Puel. A typed pattern calculus. Technical Report 878, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, France, 1993. [ bib | .ps.gz ]
[10] Catherine Delor and Laurence Puel. Extension of the associative path ordering to a chain of associative-commutative symbols. In Claude Kirchner, editor, 5th International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 389--404, Montreal, Canada, June 1993. Springer. [ bib ]
[9] Laurence Puel and Ascander Suarez. Compiling pattern matching by term decomposition. Journal of Symbolic Computation, 15:1--26, 1993. [ bib ]
[8] Catherine Delor and Laurence Puel. A generalized associative commutative recursive path ordering. Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris. Unpublished, 1990. [ bib ]
[7] Laurence Puel and Ascander Suarez. Compiling pattern matching by term decomposition. Internal Report, laboratoire d'Informatique de l'Ecole Normale Supérieure. Paris, January 1990. [ bib ]
[6] Laurence Puel and Ascander Suarez. Compiling pattern matching by term decomposition. In Proc. Int. Conf. on LISP and Functional Programming, 1990. [ bib ]
[5] Laurence Puel. Règles de calcul dans les systèmes de réécriture réguliers d'après huet et levy (a paraître), October 1989. Transparents du Séminaire Octobre 89. [ bib ]
[4] Laurence Puel. Embedding with patterns and associated recursive path ordering. In Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pages 371--387. Springer, 1989. [ bib ]
[3] Laurence Puel. Bons préordres sur les arbres associés à des ensembles inévitables et preuves de terminaison des systèmes de réécriture. Thèse de Doctorat d'Etat, Université Paris VII, December 1987. [ bib ]
[2] Laurence Puel. Proofs in the final algebra. In Bruno Courcelle, editor, Proceedings of the Ninth Colloquium on Trees in Algebra and Programming, pages 227--242, Bordeaux, France, March 1984. [ bib ]
[1] Laurence Puel. Preuves dans l'algèbre terminale. algorithmes de complétion. Thèse de Doctorat. Université Paris VII, December 1983. [ bib ]
Back
This page was generated by bibtex2html.