On 10/05/07, Mathieu Suen <mathk.sue at gmail.com> wrote:
> The only case that somone write this is that aClass is abstract.
> ottherwise is like
>
> [true] whileTrue
>
its ok until you execute it. Stack gets checked when you running
something, not when you simply keep it on the shelf.


> What do you mean by deal?
>
I mean that detecting repetitive patterns is hard to implement, if not
impossible. And given example why.

Smalltalk is not functional language, so there is no ways how to
detect a recursion without running a message.

>         Mth
>
>
>
> On May 10, 2007, at 7:45 PM, sig wrote:
>
> > But then, what to deal with such cases:
> >
> > aClass>>add: a with: b
> > ^ self add: a with: b+1
>
>
>