Conversation
… Removed some of the STrN theorems, as I think most of them are no longer necessary. Bisimulation theorems now complete using grind.
This PR defines Relation- and Trans-related defs about LTS earlier on, so that they can be reused for other definitions in PRs like PR #220.
|
I've updated the file to use #231 Also, the naming of theorems is a bit confusing wrt the STr relation. |
In CSLib we typically use
See this page for a full description of patterns.
We try to follow the Mathlib naming conventions but I will readily admit these don't come naturally to me for these oddly cased names. I think the relevant rule is:
|
Hm... maybe it is better if I leave out @[grind] altogether for the time being? What is better for this PR, just leaving it out, or making an educated guess and hoping you will catch it if its wrong? |
… a different modifier.
|
You can test what grind is doing by using the |
|
What's the status of this? I see some conflicts and I'm afraid of messing it up. :) |
|
I got into trouble making the changes, because it turned out I overlooked one of the bisimulation theorems when I thought the "metric" version was not being used anymore. And after that, I ran out of time and got swamped in teaching preparations. So it is indeed a bit of a mess now. If you have ideas on how to clean it up and have time, please feel free to do so! Next week Thursday, I hope to get four students who want to work with Lean4. |
|
Fixed it! I hope... (Awaiting automatic checks to finish.) I have now removed everything related to "induction over N tau-steps" and replaced this with a straightforward induction over tauSTr. |
|
It seems that I'm dependent on maintainers to run automatic workflows to check my code. |
This is a security measure that GitHub implements. Once your first PR is merged, this requirement is removed. I would do so now, but I'm not sure if/how this can be done ahead of time.
CONTRIBUTING.md is where I have documented how to run the checks CI does locally. The failure you are seeing is from |
Thanks, that helps. |
|
Yes, I should document this... you add a |
|
Thanks. For now, I managed to get all checks to pass by iterating on the test output. @fmontesi I have now removed all of the no-longer-needed theorems regarding STrN. I hope the changes are now a bit more readable for you. |
Separating the series of tau steps from the saturation relation to benefit the definition of branching bisimulation later.
Not sure if this counts as a feat: or refactor:, since it is a relatively small change and should not touch anything outside the scope of the file at the moment.