Abstract

this paper is to show how to solve the constraints that are involved in the deduction mechanism of the first part. This may be interesting in its own since this provides with a unification algorithm for an order-sorted logic with context variables and can be read independently of the first part. This can also be compared with unification of term schemes of various kind (Chen & Hsiang, 1991; Salzer, 1992; Comon, 1995; R. Galbav'y and M. Hermann, 1992). Indeed,

Citations

448	Simple Word Problems in Universal Algebra - Knuth, Bendix - 1970
339	Con uent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
158	Solving Equations in Abstract Algebras: A RuleBased Survey of Unification - Jouannaud, Kirchner - 1991
124	The undecidability of the second-order unification problem - Goldfarb - 1981
66	Deduction with symbolic constraints. Revue Francaise d’Intelligence - Kirchner, Kirchner, et al. - 1990
49	D.A.: Termination Orderings for Associative-Commutative Rewriting Systems - Bachmair, Plaisted - 1985
48	Solving symbolic ordering constraints - Comon - 1990
48	Order-sorted equational computation - Smolka, Nutt, et al. - 1989
37	Computational Aspects of an Order-Sorted Logic with Term Declarations - Schmidt-Schau - 1989
35	Satisfiability of systems of ordinal notations with the subterm ordering is decidable - Jouannaud, Okada - 1991
32	Executable higher-order algebraic specification languages - Jouannaud, Okada
30	Equational formulae with membership constraints - Comon, Delor - 1994
29	Operational semantics of OBJ3 - Kirchner, Kirchner, et al. - 1988
23	On unification of terms with integer exponents - Comon - 1995
22	R'esolution d"equations dans les langages d'ordre 1; 2; : : : ; !. Th`ese de doctorat d"etat, Universit'e Paris VII - Huet - 1976
22	Unification of infinite sets of terms schematized by primal grammars - Hermann, Galbav´y - 1997
20	The unification of infinite sets of terms and its applications - Salzer - 1992
17	Logic programming with recurrence domains - Chen, Hsiang - 1991
15	Equational formulas on order-sorted algebras - Comon - 1990
10	Confluent term rewriting systems with membership conditions - Toyama
7	A uni algorithm for second order monadic terms - Farmer - 1988
4	Constraints in term algebras (short survey - Comon - 1994
4	Tree monoids and recognizable sets of finite trees - Nivat - 1989
4	Dynamically Typed Computations for Order-Sorted Equational Presentations. Pages 450--461 of - Hintermeier, Kirchner - 1994
2	A logic of semi-functions, inclusion and equality. The setting. Research Report 89-R-058. Centre de Recherche en Informatique - Aristide - 1989
2	Rewrite Systems. Pages 243-- 309 of: van Leeuwen - Dershowitz - 1990
2	Schematization of infinite sets of rewrite rules generated by divergent completion process - Kirchner - 1989
1	Automata with Equality Tests. Tech. rept. IT 207. Laboratoire d'Informatique Fondamentale de - Bogaert - 1991
1	Open Problems in Term Rewriting. Pages 445--456 of - Dershowitz, Jouannaud - 1991
1	Tree Automata. Budapest: Akademia Kiad'o - G'ecseg - 1984
1	Comon A. Proofs of the technical lemmas of section 2 Lemma 2.2 For every f 2 F , there is a function f \Gamma1 which associates to each s 2 SE a finite set of tuples of sort expressions, in such a way that f(t 1 ; : : : ; t n ) 2 [[s]] A , 9(s 1 ; : : : ; - Hubert - 1994
1	Logic Programming with recurrence domains. In: (Albert et al - Chen - 1991
1	Unification of Term Schemes. Theory and Applications. Research Report SR-88-18 - Gramlich - 1988