Rachit Nigam

> That is, to allow some version of `seq { a ; b }` where `a` is dynamic and `b` is static where we can guarantee that b runs in...

> so if we can guarantee they'll be different, then is it possible to do an early transition? This was thinking too but this is a fact about dynamic ->...

The opportunistic stuff is an optimization so I won't say much about it. You're right about the trade-offs: no semantic guarantees and therefore not particularly useful timing-precise reasoning. I was...

How do you feel about making the "slow transition" behavior opt-in in the same we've been discussing adding a new attribute to make `static` control programs compactable? That is, in...

I think defining which computations potentially interact with the outside world will become increasingly difficult, especially in presence of `ref` cells. If that is the case, then we should make...

@nathanielnrn I think Caleb is asking if there are specific, concrete examples you can think of. For example, one possible example is a burst transfer where, once the `valid` signal...

Another bump on this issue because I'd like to make progress on this. @calebmkim thoughts on taking the next open slot in the Calyx meeting to discuss this issue and...

Zero-cycle groups or static groups are not allowed. If a program provides a zero-cycle group, it leads to undefined behavior (miscompilation, specifically)

I remain iffy about attributes as a mechanism to add correctness guarantees to the program. Specifically, if the compiler does not guarantee that it'll preserve or even respect attributes, I...

CC @sampsyo on this last comment because I think we disagree on this point and maybe I'm missing something obvious