-
We have been talking about adding a lenses library similar to the one available in Haskell.
Here is a very basic `lens` in Lean: https://github.com/leanprover/lean/blob/master/tmp/micro_lenses.lean
…
-
**Warns** (Correct):
``` javascript
const noop = (n) => n;
const num:number = noop('NOT A NUMBER');
// "String. This type is incompatible with number"
```
**Passes** (Incorrect):
``` javascript
con…
-
_From [Martin.R...@googlemail.com](https://code.google.com/u/113922991942493634983/) on June 15, 2011 12:47:46_
Resolution modulo [1] has two inference rules, resolution and extended narrowing and re…
-
_From [Martin.R...@googlemail.com](https://code.google.com/u/113922991942493634983/) on June 15, 2011 13:58:26_
Implement Sequent calculus modulo as described in [1] and [2] including many sorted fol…
-
Hello F\* team! I'm interested in learning F\* and I had some questions about the language. Not being sure where to post these (perhaps that could be considered one of my questions), I figured I would…
-
I'm not sure where to add them, but it might be useful to add [Coq](http://coq.inria.fr/) which is a proof assistant written in OCaml, and can be used to verify programs that can later be extracted in…
-
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
-
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