Re:The C standard formalized in Coq
by pron on Tuesday December 01, 2015 @05:58AM
(#10654559)
Sorry, that should be:
As a matter of fact, TLA+ also allows unbounded quantifications, so you could write:
However, this form is rarely used because TLC, (TLA+'s model checker, which only supports a subset of TLA+), doesn't support unbounded quantifiers, and they are not necessary when modeling real programs. I'm not sure about TLAPS (the proof assistant), but I believe it handles it fine.
[ Parent
| on HN ]
There are no comments on this comment yet.