Fridtjof Siebert
Fridtjof Siebert
This problem exists in Java as well: building a string as follows ``` var s := "" for(i=0, i build(n u64) => if n > 0 then b.yield 1; build...
Just came across [this post mentioning immutable dequeue](https://x.com/ChShersh/status/1875608047550390278). This might provide a solution if `a ++ b` would, for finite sequences, make sure to first convert the longer sequence into...
This is not fixed yet. #4651 provides some infrastructure that maybe provides a solution, but I would like the example to run fast or the user to be guided such...
If there is only an implicit precondition, we could produce an error for a redefinition declaring a `pre else cc` or a `pre cc` precondition. In the case of postconditions,...
I do not think this must be an effect, it would be sufficient to have a `String` that internally uses `expanding_array` such that it has an efficient concatenation using `s3...
I think this is a general problem: What should the output of `say $b` be, `6` or `Lazy@0x1233456`? I would go for `6`, i.e., operations should be applied on the...
I agree for the second case, where `ERROR` must clearly be `Any`, but not for the first, since `F` might still be any type that inherits from `Lazy`. Currently, the...
This is not only wrapped in a lambda, but also wrapped into `c.head.infix : (...)`, so this is IMHO not a tail call. This code is maybe problematic since it...