🚀 go-pugleaf

Hi there,
I've got a small problem. For an efficient prototype of a kind of
theorem prover I need correct unification, i.e. unification WITH occur-check.
In Quintus-Prolog there are a lot of libraries including one with a
correct unification. Unfortunately it is written in Prolog and therefore
as slow as the rest of my program.

So my question is: can anybody out there tell me about a correct unification
procedure written in C which can be linked with a Quintus-Prolog program?
How can I get it?
Or do you know whether it is possible at all and how to do it?

Thanks a lot for any response,
	Max.
-- 

_______________________________________________________________________________
 Max Moser		 	    	 Forschungsgruppe KI - Intellektik
 Institut f"ur Informatik		 Lehrstuhl f"ur Rechnerarchitektur
 Technische Universit"at M"unchen
 Postfach 20 24 20		    		Tel.: +49-89/521096
 Arcisstr. 21					Fax.: +49-89/526502
 D-8000 M"unchen 2	     	     Email: moser@informatik.tu-muenchen.de
_______________________________________________________________________________