<html><body>
<p><tt>Gustaf Neumann <neumann@wu-wien.ac.at> wrote on 05/09/2006 03:54:49 AM:<br>
<br>
> Scott Gargash schrieb:<br>
> ><br>
> > I.e., you can't forward the "mixin delete" to an object of another <br>
> > class. If the mixin to be deleted is present in the call stack, it <br>
> > appears that the mixin can't be deleted. Not that I expected it to <br>
> > work, but it seems worth noting.<br>
> ><br>
> if you have a case that goes beyond "do not remove actvive mixins from <br>
> the before part of active mixin classes"), please send an example.<br>
</tt><br>
<tt>No, the same conditions apply. It's just that the BEFORE part includes anything invoked indirectly by the BEFORE part. Sometimes you don't have knowledge of what some other object will do when invoked, and it can be a subtle bug. </tt><br>
<br>
<tt>> We have to deal with the following cases when we have e.g. a precedence<br>
> order M1 M2 M3 M4, and the following happens in the BEFORE part of M2:<br>
> <br>
> a chain is set to: M1 M3 M4 (your case, you want to continue with M3)<br>
> b chain is set to: M1 M4 defensible M4<br>
> c chain is set to: M2 M1 M3 M4 under current semantics, continue with M1<br>
> d chain is set to: M4 M2 M3 M1 continue with M3, M4 will never by <br>
> invoked<br>
</tt><br>
<tt>Yup, that's exactly the behavior I (naively) had expected. </tt><br>
<br>
<tt>But to be clear, what is the current behavior of 'next' for each of these cases? To unwind the call stack? When can the updated mixin list be considered to have taken effect? </tt><br>
<tt><br>
> The general problem is pretty similar to the "immediate" and "logical" <br>
> update view in logic languages, </tt><br>
<br>
<tt>Good analogy, that makes sense.</tt><br>
<br>
<tt>> but it goes back to Lindholm and Richard<br>
> O'Keefe (ROK) from 87, */Efficient implementation of a defensible semantics<br>
> for dynamic Prolog code/* (unfortunately, could not find this fine paper on<br>
> the net). </tt><br>
<br>
<tt>There's also a brief discussion of this in O'Keefe's book "The Craft of Prolog".</tt><br>
<tt><br>
> The most promissing approach not mentioned yet is to develop a<br>
> c-level implementation of mixin/instmixin/filter/instfilter delete,<br>
> which simply flags the entry in the chain as deleted.....<br>
</tt><br>
<tt>Interestingly, that's how I assumed it was implemented, which is probably why I was surprised.</tt><br>
<br>
<tt> Scott</tt></body></html>