🚀 go-pugleaf

I am looking for an efficient Prolog program to do hashing.

We are working on dynamic programming and memoization in
Prolog (and interested in hearing from others working in
this area).  So rather than doing a simple deterministic check 
for membership in a list, such as
	find(X,[X|_]) :- !.
	find(X,[_|T]) :- find(X,T).
it should do efficient hashing to cache and look up values.
A binary search implementation would also be interesting.

Thank you very much if you can help,
Karl