-
The following checks if the witness is changed to *:
```
datatype Type = Type(
le:(T,T)->bool
) {
predicate refl() { forall t:T :: le(t,t) }
}
type Ro = t:Type | t.refl() witness Type(…
-
I would have a question about formulas that include quantifiers over strings. For the following formula:
```(set-option :produce-models true)
(set-option :produce-unsat-cores true)
(set-info :statu…
-
Currently, ghost state declarations (e.g., for tracking map keys) are generated regardless of whether there is a quantifier that quantifies over the corresponding map. It would be great to only genera…
-
## The Problem
The semantics of frugal quantifiers in LTM are currently unspecified (or at least I couldn't find that they are anywhere in roast). S05 speculates that they should be LTM termina…
jnthn updated
3 years ago
-
**Describe the bug**
`UnsupportedOperationException` is thrown when executing the following Alloy specification:
`sig A { id: Int }`
`pred P1 [p : set A]`
`{`
` one a: p | a.id = 1`
`}`
`pre…
-
Consider:
```
var f = id(id);
sig g : forall a. (a) -> a
fun g(x) { f(x) }
```
Initially f is given the type `(%t) -> %t` (as it cannot be generalised). When then visiting the body of `g`,…
-
A constraint pattern that we are using very often is to check that every value in a list matches a predicate, or that at least one value matches a predicate. Effectively [some](https://developer.mozil…
-
I want to create a custom textobject for `c` and `cpp` which will select all the statements inside function body excluding function parenthesis. I have added the below query search to `textobjects…
-
Allow the user to set a list of quantifiers to recognize.
-
CI should be computed for average rank, and rank/performance differences as well. This should be easy to add as an incremental functionality.