-
Writing pure predicates is pretty difficult and a pretty convincing argument was made recently that typestate predicates don't need to be pure. Removing the pred concept would simplify things a lot.
brson updated
10 years ago
-
findSafePos is hard-coded to search 5500m to prevent Chernarus spawning missions in Debug.
It should instead be unique per-map.
Islands it would be from the center point to the farthest shoreline.
…
-
When typechecking this instance declaration (Note that this is the only use of the name v1 in the program):
```
instance Show v1 => Show (PType {v=v1} e a) where
show = showPrec 0
```
I get the fo…
-
There's a couple of small things which have changed in the new pretty printing code. They're minor (so I'll stick them in the same issue report), but we should probably fix them before the next releas…
-
The Z3 solver supports non-constant multiplication (in an incomplete form - it may return "unknown"), but JKind will still reject any non-linear expressions when Z3 is selected as the solver.
Could …
-
The proof of the second half of theorem 2.11.1 seems to need f to be a half adjoint equivalence, not just equipped with a quasi-inverse. At least, I don't see how to do without it right now, and it's…
-
If I have:
```
Float sqrt(Float float) {
"argument must be non-negative"
assert (float>=0.0);
}
```
Ceylondoc should document that assertion.
-
bc.. I have been thinking about the assumption model a bit and it seems
that Interval could be used to implement predicate evaluations.
For simplicity, I'll assume that any assumption on some
symbol …
pearu updated
10 years ago
-
Chapter 4 doesn't use the idea of W-types as initial algebras of polynomial functors!
Unless someone else is willing to do it, I propose to add a bit on this point of view in section 4.4 -- it will mo…
-
Borrowing from one of the [examples](http://hackage.haskell.org/packages/archive/sbv/2.9/doc/html/src/Data-SBV-Examples-Uninterpreted-Deduce.html#SB), axioms require the user to enter "raw" SMT-lib st…
TomMD updated
11 years ago