Thun

[mthom]

This PR is a continuation of the work of #622.

[mthom]

This predicate causes several example queries to fail:

free_reg(Reg, reggy(FreePool0, References0, V0), reggy(FreePool, References, V)) --> [],
    { select(Reg, References0, References),
      (  member(Reg, References)  % If reg is still in use
      -> FreePool=     FreePool0, V0=V % we can't free it yet
      ;  FreePool=[Reg|FreePool0], % otherwise we put it back in the pool.
         del_assoc(Reg, V0, _, V)
      )
    }.

I'm not sure how this might work in SWI, but it's called with References0 bound to [], causing select to fail.
Maybe @calroc could comment?

[hurufu]

I also find this interpreter very elegant – it handles "combinators" using rational trees. Actually I find it tempting to using concepts similar to "Thun" for procedural parts of Prolog programs.

[calroc]

Good Lord, I missed this whole thread! That paper sounds awesome, I'm going to read it today I think.

…

On 6/24/2024 at 10:18 PM, "Alex Grabowski" ***@***.***> wrote: I also find this [interpreter](https://www.semanticscholar.org/paper/An-Application- of-Rational-Trees-in-a-Logic-for-a- Carro/aedc1eb62decf9c23d9a266fbb0c705381c15921?utm_source=direct_li nk) very elegant – it handles "combinators" using rational trees. -- Reply to this email directly or view it on GitHub: #853 (comment)- 2187998675 You are receiving this because you were mentioned. Message ID: ***@***.***>

-- "The history of mankind for the last four centuries is rather like that of an imprisoned sleeper, stirring clumsily and uneasily while the prison that restrains and shelters him catches fire, not waking but incorporating the crackling and warmth of the fire with ancient and incongruous dreams, than like that of a man consciously awake to danger and opportunity." --H. G. Wells, "A Short History of the World"