Wiki Agenda Contact Version française

Publications 1992


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

Books and book chapters


[5] Hubert Comon. Constraints in term algebras. application to rewrite systems. Atti Degli Incontri Di Logica Matematica, 8:5--17, 1992. [ bib ]
[4] Maribel Fernández. Narrowing based procedures for equational disunification. Applicable Algebra in Engineering Communication and Computing, 3:1--26, 1992. [ bib ]
[3] Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, and Aristide Megrelis. OBJ: Programming with equalities, subsorts, overloading and parametrization. Journal of Logic Programming, 12:257--279, 1992. [ bib ]
[2] Jean-Pierre Jouannaud and Claude Marché. Termination and completion modulo associativity, commutativity and identity. Theoretical Computer Science, 104:29--51, 1992. [ bib | PDF | Abstract ]
[1] Claude Marché. The word problem of ACD-ground theories is undecidable. International Journal of Foundations of Computer Science, 3(1):81--92, 1992. [ bib | PDF | Abstract ]


[9] Delia Kesner. Sequential signatures and sequential sorts. In Proc. 6th Workshop on Unification, Schloß Dagstuhl, Germany, July 1992. [ bib ]
[8] Alexandre Boudet. Unification in order-sorted algebras with overloading. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, Saratoga Springs, NY, June 1992. Springer. [ bib ]
[7] Marianne Haberstrau. ECOLOG: un Environnement pour la programmation en LOGique COntrainte. In Actes des Journées Francophones sur la Programmation Logique, May 1992. [ bib ]
[6] Alexandre Boudet and Évelyne Contejean. On n-syntactic equational theories. In Hélène Kirchner and Giorgio Levi, editors, 3th International Conference on Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 446--457, Volterra, Italy, September 1992. Springer. [ bib | DOI | Abstract ]
[5] Hubert Comon. Completion of rewrite systems with membership constraints. In W. Kuich, editor, Proc. 19th Int. Coll. on Automata, Languages and Programming, LNCS 623, Vienna, 1992. Springer. [ bib ]
[4] Hubert Comon, Marianne Haberstrau, and Jean-Pierre Jouannaud. Decidable properties of shallow equational theories. In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science. IEEE Comp. Soc. Press, 1992. [ bib ]
[3] Hubert Comon and Maribel Fernández. Negation elimination in equational formulae. In Mathematical Foundations of Computer Science. Springer, 1992. [ bib ]
[2] J.-P. Jouannaud. Rewriting techniques for software engineering. In Proc. Workshop on Algebraic Specifications of Abstract Data Types, Barcellonna, 1992. To appear in LNCS. [ bib ]
[1] Delia Kesner. Free sequentiality in orthogonal order-sorted rewriting systems with constructors. In Deepak Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 603--617, Saratoga Springs, NY, June 1992. Springer. [ bib | .ps.gz ]

PhD theses

[1] Évelyne Contejean. Éléments pour la Décidabilité de l'Unification modulo la Distributivité. Thèse de doctorat, Université Paris-Sud, Orsay, France, April 1992. [ bib ]


[1] Catherine Delor. Extension of the associative path ordering to a chain of associative commutative symbols, 1992. Unpublished draft. [ bib ]


[3] Hubert Comon. On unification of terms with integer exponents. Research Report 770, L.R.I, Univ. Paris-Sud, Orsay, August 1992. To appear in Mathematical Systems Theory. [ bib ]
[2] Christine Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. Technical Report 92-49, LIP-ENS Lyon, 1992. [ bib ]
[1] Hubert Comon. Resolution de contraintes dans des algebres de termes: rapport d'habilitation. Technical Report 751, LRI, Univ. Paris-Sud, 1992. [ bib | .dvi.Z ]


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

This page was generated by bibtex2html.