Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unication. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257321. The MIT press, Cambridge (MA, USA), 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....N or N2, have boxed types. Therefore M[ N A N2 ] 0 is a well typed term, and M M and M M2, since N A N2 is both an instance Figure 4: Least common instances of N and an instance of N2. Moreover, by construction this is the least one, so M is the supremum of M and M2. This is unification [31]. The key here is that we basically only need unification modulo an empty theory, instead of the theory of the relation . We write M as M II M2. Symmetrically, every pair of points M, M2 of C(Mo) has an infimum M. That is, M M, M2 M and for every M such that M M and M2 M , M M. ....

Jean-Pierre Jouannaud and Claude Kirchner, Solving equations in abstract algebras: a rule-based survey of unification, Tech. report, LRI, CNRS UA 410:A1 Khowarizmi, March 1990.

....Therefore, in this section, we do not rely on the syntactic conventions in any way. Subtype satisfaction is a generalization of the well known problem of unification, and the techniques we use here are based on those used to solve unification. For more details, consult a survey on unification [19, 20, 30, 10, 21 6, 31, 1]. One difference between unification and our satisfaction problems is that we work with types that go beyond simple types, but our substitutions involve only simple types. This is not the typical case with unification, and it makes our problem easier to solve. If S 1 ; S 2 are substitutions and V ....

Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez 52 and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, chapter 8, pages 257--321. MIT Press, 1991.

....Therefore, in this section, we do not rely on the syntactic conventions in any way. Subtype satisfaction is a generalization of the well known problem of unification, and the techniques we use here are based on those used to solve 21 unification. For more details, consult a survey on unification [19, 20, 30, 10, 6, 31, 1]. One difference between unification and our satisfaction problems is that we work with types that go beyond simple types, but our substitutions involve only simple types. This is not the typical case with unification, and it makes our problem easier to solve. If S 1 ; S 2 are substitutions and V ....

Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez 55 and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, chapter 8, pages 257--321. MIT Press, 1991.

No context found.

Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: a rule-based survey of unication. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257321. The MIT press, Cambridge (MA, USA), 1991.

No context found.

Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of uni cation. In JeanLouis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. The MIT Press, 1991.

No context found.

Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of uni cation. In JeanLouis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. The MIT Press, Cambridge, MA, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC