Path: utzoo!attcan!utgpu!watmath!att!dptg!rutgers!cs.utexas.edu!uunet!mcvax!ukc!castle!lfcs!jha From: jha@lfcs.ed.ac.uk (Jamie Andrews) Newsgroups: comp.lang.prolog Subject: Re: Unification as equation solving. Message-ID: <29@castle.ed.ac.uk> Date: 8 Aug 89 10:11:23 GMT References: <3613@csd4.milw.wisc.edu> Sender: root@castle.ed.ac.uk Reply-To: jha@lfcs.ed.ac.uk (Jamie Andrews) Organization: Laboratory for the Foundations of Computer Science, Edinburgh U Lines: 14 Questions on Mark's unification algorithm: - How efficient is it on the size of the input? You mention only that the occurs check is done in constant time. If it is linear, how does it differ from Martelli & Montanari's algorithm? - How space-efficient is it? This is where linear unification algorithms usually fall down, and the reason that they are not implemented very often. --Jamie. jha@lfcs.ed.ac.uk "It's normal to be lazy" -- G. Huet