Re: in praise of tabling

rafe@xxxxxxxxxxx a écrit :

In a nutshell, a tabled predicate is associated with a hash table of
some kind.  Whenever a new result for the predicate is computed, the
result is recorded in the hash table.

Yes but I guess the subtle parts of the tabling strategy is to effectively table calls, not returns, so as to act on recursion loops.

.

Relevant Pages

  • Re: a short article about equality in Lisp (for beginners)
    ... | equality predicate + hash function. ... | according to whether the equality function is eq, eql, equal or equalp. ... tests and hashing methods. ... hashing function for an arbitrary equality predicate. ...
    (comp.lang.lisp)
  • Re: in praise of tabling
    ... Well, tabling is, to a first order approximation, Prolog-speak for ... Whenever a new result for the predicate is computed, ... result is recorded in the hash table. ... upon whether the cost of recomputation outweighs the cost of checking ...
    (comp.lang.prolog)
  • Re: File Hashing
    ... two different files with the same hash value. ... That implies that if two ... To put it in pure logic terms, if A is the predicate "X and Y have ... I hope you can see how these are logically equivalent questions. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: User-defined EQUALP
    ... with a determinable initial hash size. ... The standard provides no appropriate hash table predicate for ... case sensitive vectors of strings: ...
    (comp.lang.lisp)