I'm currently working on developing a
semantic error test corpus, which is basically a large set of tiny TLA+ files that trigger all the semantic errors in SANY. This is an amusing sort of reverse-engineering process where I look at the code where an error is being raised and try to guess a TLA+ parse input that will trigger that error. There are a few I'm puzzled by: in particular,
this one seems to imply it's possible for operators to have a
lower bound on their accepted levels?
Does anybody know of an operator with a level lower bound, or is this dead code from a previous incarnation of the level-checker? Thanks!