Re: Composing sequences (interesting to solve)

[porton@ex-code.com (Victor Porton)]

In article <u1y3cyyd6.fsf@fwilson.i-did-not-set--mail-host-address--so-shoot-me>,
	Fraser Wilson <newsfraser@blancolioni.org> writes:
> porton@ex-code.com (Victor Porton) writes:
> 
>> In article <b06t4c$m4h27$3@id-77047.news.dfncis.de>,> You haven't given me a solution. (I suspect that it is even impossible 
>> in Ada9X.)
> 
> Presented with
> 
>    S & T
> 
> where S is a sequence, and T is something else, how can you know
> whether the desired result is a new sequence of S and T, or the
> sequence S with T tacked onto the end (i.e. an intermediate result
> from "P & Q & T")?  Unless you add an extra rule which says that all
> sequences get merged (i.e. always choose the second option in this
> case), I don't think this is possible.

I mean to merge all sequences at compile time, but probably not at run 
time. Well, now I'm almost sure that it is impossible in Ada (however 
possible in C++). I'm switching to an another syntax.