Comment #1 on issue 87 by p.giarrusso: Unification failure in currying
example
http://code.google.com/p/teyjus/issues/detail?id=87
Is this change a consequence of the restriction to pattern unification?
After reading
http://www.cs.nmsu.edu/ALP/2010/03/teyjus-a-lprolog-implementation/ and
skimming Xiaochu Qi's PhD thesis (at the end of Sec. 9.3), I guess
that "[Teyjus 2] is oriented around a special form of higher-order
unification known as pattern unification" probably means "it only supports
pattern unification".
Teyjus 1 seems to manage this example successfully, once I build it on a
32bit machine (it's almost certainly possible to make it build a 32bit
executable on 64bit machines).
If that's the case, I might not be interested in using Teyjus 2 after all,
as long as you don't implement higher-order unification. Moreover, I'm
disappointed by the fact that this restriction is not clearly explained.