Peter Donovan

> @petervdonovan do you think this would be easily fixable? Probably.

I do not need to (re-)start a long argument, but I would like to leave a comment here just to ensure that my skepticism of mixed-target federations is well-documented. The...

I'm not sure how easy it will be to have another branch mirror `master`. Why not just do this all at once? Start a new branch called `main` that is...

> Does "last writer wins" mean that both tags have to match? Or that only g_2 has to match? I would want to require that only $g_2$ matches, but maybe...

I'll try to summarize what I understood from what Edward has said and from my conversation with @lhstrh. It seems like we have three options on the table for how...

> Issue https://github.com/lf-lang/lingua-franca/issues/203 does not seem relevant. Oops -- fixed. > Can you clarify? Suppose a reaction executes at tag $g = (t, m)$ and schedules an event $(5 \text{ms},...

Okay, that sounds reasonable. If we do elementwise addition then that would mean going ["all in" on super dense time](https://github.com/lf-lang/lingua-franca/issues/236#issuecomment-727757313), in which case I would argue that queueing in the...

Yes, Christian and I seem to be on the same page about items 3 and 4, and items 2 and 5 both seem like examples where you sort of diverge...

Regarding the question of how to expose the different policies (defer/drop/replace): I still think they might best be implemented in standard library reactors, because I think this approach provides *...

Another approach would be to use macros, like ``` #define T int // Code-generate the type of the self struct, the reaction functions, etc. #undef T ``` Doing it this...