The GitHub link is not valid anymore but it looks like you constructed a function of the form forks == [ p \in Range(Philosophers) |-> SUBSET {Left(p), Right(p)} ] and then checked the predicate hasForks \in forks. What I think you meant to write was something like /\ hasForks \in [Range(Philosophers) -> Range(Forks)] /\ \A p \in Range(Philosophers : hasForks[p] \subseteq {Left(p), Right(p)} In particular, the right-hand side of the first conjunct is a set of functions, not a single function. See also the typing invariant in the module that I posted. Stephan
You received this message because you are subscribed to the Google Groups "tlaplus" group. To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx. To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/8397D121-2322-46AF-B282-E6BCA90A4698%40gmail.com. |