Rachit Nigam

@UnsignedByte was this fixed with the recent changes to the FP implementation?

Yeah, that change would also make it work in the case when the bundle has size of exactly `1`. The problem is that we need the information about the length...

Ah, thanks for pointing this out! We can take a look and fix it

This is certainly a problem I was thinking about as well! A tricky thing about mutability is that it would make the verification of parameteric designs hard. Right now, `let`-bound...

Interesting catch! This is something that the Calyx interface should handle. For example, each `calyx::Component` has a [`Namegenerator`](https://docs.rs/calyx-utils/latest/calyx_utils/struct.NameGenerator.html) to ensure that new cells added to the component do not have...

Thanks for finding this! In fact, the `calyx` configuration is probably no longer needed because we invoke the calyx compiler ourselves but reasonable to update it anyways!

Thanks for opening the issue! I think before we start committing to any particular heuristics, it would be important to measure their effects. `fud` has automation to make it easy...

We've decided on the following convention: - CamelCase for `comp` definitions, parameters, and instances. - snake_case for invocations, ports, bundles - ALLCAPS for events (for now). The next step is...

Hm, I'm not sure I follow. Could you write up some pseudocode for that?

How to encode coverage constraints for Filament's linearity check? For example: ``` bundle a{#K+1}; a{0} = 20 for #i in 0..#K-1 { a{#i+1} = 30 } a{#K} = 10 ```...