-
Our current definition rules are a bit, shall we say … overly general. I would like to replace them with proper rules with the following interface:
```
DefinitionLeftRule(subProof: LKProof, aux: Sequ…
-
The only documentation on tactics available is outdated http://eb.host.cs.st-andrews.ac.uk/Idris/theorems.html.
-
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…
-
It would be nice to be able to define new symbols at the REPL, like this:
```
:let timesTwo x = x * 2
:let double x = x + x
:prove \x = timesTwo x == double x
```
Yes, this could be done with lots o…
-
_From [fra...@gmail.com](https://code.google.com/u/108596877348066494139/) on January 10, 2011 13:04:03_
We want to parse Prover9 proofs into gapt. This should be based on the textual proofs that Pro…
-
If `applyTactic` is used to derive implicit arguments, we need to sprinkle `Solve`s in between the tactic script we produce. If `applyTactic` is used in interactive theorem proving those `Solve`s resu…
pa-ba updated
10 years ago
-
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…
-
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 …