Wiki Agenda Contact Version française

Publications 1993

Back

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

Books and book chapters

[1] J. A. Goguen, T. Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Applications of Algebraic Specifications Using OBJ, chapter Introducing OBJ*. Cambridge University Press, 1993. D. Coleman, R. Gallimore and J. Goguen, eds. [ bib ]

Journals

[7] Hubert Comon. Complete axiomatizations of some quotient term algebras. Theoretical Computer Science, 118(2):167--191, September 1993. [ bib | .dvi.Z ]
[6] Alexandre Boudet. Competing for the AC-unification race. Journal of Automated Reasoning, 11:185--212, 1993. [ bib ]
[5] Alexandre Boudet. Combining unification algorithms. Journal of Symbolic Computation, 16:597--626, 1993. [ bib ]
[4] Évelyne Contejean. Solving *-problems modulo distributivity by a reduction to AC1-unification. Journal of Symbolic Computation, 16(5):493--52, 1993. [ bib | DOI | Abstract ]
[3] Laurence Puel and Ascander Suarez. Compiling pattern matching by term decomposition. Journal of Symbolic Computation, 15:1--26, 1993. [ bib ]
[2] Christine Paulin Mohring and Benjamin Werner. Synthesis of ml programs in the system coq. Journal of Symbolic Computation, 15:607--640, 1993. [ bib ]
[1] Christine Paulin-Mohring and Benjamin Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15:607--640, 1993. [ bib ]

Conferences

[17] Évelyne Contejean. Solving linear diophantine constraints incrementally. In David S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, Logic Programming, pages 532--549, Budapest, Hungary, June 1993. MIT Press. [ bib | Abstract ]
[16] 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 ]
[15] Nicolas Beldiceanu, Évelyne Contejean, and Helmut Simonis. Integrating an algorithm for solving linear constraints in finite domains in the language CHIP. In Proc. 4th Workshop on Constraint Logic Programming, March 1993. [ bib | Abstract ]
[14] 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 ]
[13] Roberto Di Cosmo and Delia Kesner. A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object. In Andrzej Lingas, Rolf Karlsson, and Svante Carlsson, editors, 20th International Colloquium on Automata, Languages and Programming, volume 700 of Lecture Notes in Computer Science, pages 645--656, Lund, Sweden, July 1993. Springer. [ bib | .ps.gz ]
[12] Franco Barbanera and Maribel Fernández. Modularity of termination and confluence in combinations of rewrite systems with λω. In Andrzej Lingas, Rolf Karlsson, and Svante Carlsson, editors, 20th International Colloquium on Automata, Languages and Programming, volume 700 of Lecture Notes in Computer Science, pages 657--668, Lund, Sweden, July 1993. Springer. [ bib ]
[11] Franco Barbanera and Maribel Fernández. Combining first and higher order rewrite systems with type assignment systems. In M. Bezem and J. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, Utrecht, Holland, volume 664 of Lecture Notes in Computer Science. Springer, 1993. [ bib ]
[10] Alexandre Boudet and Hubert Comon. About the theory of tree embedding. In M. C. Gaudel and J.-P. Jouannaud, editors, 4th International Joint Conference on Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science, pages 376--390, Orsay, France, April 1993. Springer. [ bib | .dvi.Z ]
[9] Hubert Comon. Constraints in term algebras (short survey). In T. Rus M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Workshop in Computing, Univ. of Twente, 1993. Springer. Invited talk. [ bib | .dvi.Z ]
[8] Évelyne Contejean. A partial solution for D-unification based on a reduction to AC1-unification. In Andrzej Lingas, Rolf Karlsson, and Svante Carlsson, editors, 20th International Colloquium on Automata, Languages and Programming, volume 700 of Lecture Notes in Computer Science, pages 621--632, Lund, Sweden, July 1993. Springer. [ bib | DOI | Abstract ]
[7] 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 ]
[6] N. Dershowitz, Jean-Pierre Jouannaud, and J.W. Klop. More problems in rewriting. In Claude Kirchner, editor, 5th International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 468--487, Montreal, Canada, June 1993. Springer. [ bib ]
[5] Maribel Fernández. AC-Complement Problems: Satisfiability and Negation Elimination. In Claude Kirchner, editor, 5th International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 358--373, Montreal, Canada, June 1993. Springer. [ bib ]
[4] Delia Kesner. An extensional λ-calculus with pairs. In Proc. 7th Workshop on Unification, Boston, USA, 1993. [ bib ]
[3] Christine Paulin-Mohring. Inductive definitions in the system COQ. In Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 328--345. Springer, 1993. [ bib ]
[2] Stephen van Bakel and Maribel Fernández. Strong normalization of typeable rewrite systems. In Proceedings of HOA'93 (Higher Order Algebra), Lecture Notes In Computer Science, vol. 816, Amsterdam, Holland, 1993. Springer. [ bib ]
[1] Christine Paulin-Mohring. Inductive Definitions in the System Coq - Rules anProperties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi anApplications, number 664 in Lecture Notes in Computer Science, 1993. [ bib ]

PhD theses

[5] Maribel Fernández. Modèles de calculs multiparadigmes fondés sur la réécriture. Thèse de doctorat, Université Paris-Sud, Orsay, France, December 1993. [ bib ]
[4] Marianne Haberstrau. ECOLOG: un Environnement pour la programmation en LOGique COntrainte. Thèse de doctorat, Université Paris-Sud, Orsay, France, December 1993. [ bib ]
[3] Delia Kesner. La définition de fonctions par cas à l'aide de motifs dans des langages applicatifs. Thèse de doctorat, Université Paris-Sud, Orsay, France, December 1993. [ bib ]
[2] Walid Sadfi. Contribution à l'étude de la séquentialité forte des définitions de fonctions par règles. Thèse de doctorat, Université Paris-Sud, Orsay, France, December 1993. [ bib ]
[1] Claude Marché. Réécriture modulo une théorie présentée par un système convergent et décidabilité des problèmes du mot dans certaines classes de théories équationnelles. Thèse de doctorat, Université Paris-Sud, Orsay, France, October 1993. [ bib | PDF | Abstract ]

Misc.

[5] Hubert Comon. Completion of rewrite systems with membership constraints. part i: deduction rules. This is a first part of a paper whose abstract appeared in Proc. ICALP 92, Vienna. It will appear in the Journal of Symbolic Computation, August 1993. [ bib | .dvi.Z ]
[4] Hubert Comon. Completion of rewrite systems with membership constraints. part ii: Constraint solving. This is the second part of a paper whose abstract appeared in Proc. ICALP 92, Vienna. It will appear in the Journal of Symbolic Computation, August 1993. [ bib | .dvi.Z ]
[3] Hubert Comon and Maribel Fernández. Negation elimination, part I: Equational formulae in empty or permutative theories. submitted, 1993. [ bib ]
[2] Maribel Fernández. Negation elimination, part II: AC complement problems. submitted, 1993. [ bib ]
[1] Claude Marché. Normalized rewriting -- application to ground completion and standard bases. Notes de cours de l'école de printemps, 1993. [ bib | PDF | Abstract ]

Reports

[10] Maribel Fernández and Jean-Pierre Jouannaud. Modularity properties of term rewriting systems revisited. Technical Report 875, Laboratoire de Recherche en Informatique, November 1993. [ bib ]
[9] Hubert Comon and Ralf Treinen. The first-order theory of lexicographic path orderings is undecidable. Research Report RR-93-42, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, September 1993. [ bib ]
[8] 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 ]
[7] Alexandre Boudet and Hubert Comon. About the theory of tree embedding. Technical Report 870, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[6] Hubert Comon and Ralf Treinen. The first-order theory of lexicographic path orderings is undecidable. Technical Report 867, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[5] Hubert Comon and Florent Jacquemard. Ground reducibility and automata with disequality constraints. Technical Report 868, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[4] Hubert Comon. Constraints in term algebras (short survey). Technical Report 869, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[3] Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Technical Report 1991, INRIA Rocquencourt, 1993. [ bib ]
[2] Maribel Fernández. AC-Complement Problems: Satisfiability and Negation Elimination. Research Report 839, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, 1993. [ bib ]
[1] J.-P. Jouannaud. Rewrite proofs and computations. Technical Report 880, Laboratoire de Recherche en Informatique, 1993. [ bib ]
Back

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

This page was generated by bibtex2html.