-
In order to have better hygiene in my proofs, I tried to make a few of my functions opaque to SMT, in order to force F* to use their lemmas with SMT patterns.
When doing so, some proofs did break, an…
TWal updated
12 months ago
-
Hello,
As discussed, on the following code using polymorphic recursive data type stainless never finishes (nor prints errors or anything).
https://github.com/jacobprudhomme/finger-tree/tree/stainl…
-
Note: the issue was created automatically with bugzilla2github tool
Original bug ID: BZ#5334
From: @JasonGross
Reported version: 8.6
CC: coq-bugs-redist@lists.gforge.inria.fr
-
## Abstract
- propose a novel decoding algorithm - `INDIGO`, which generates text in an arbitrary order via insertion operation
- achieve competitive or even better performance in machine translatio…
-
~~~coq
Module Fix.
Unset Universe Checking.
Inductive sAcc (x:nat) : SProp := sAccIn : (forall y, y < x -> sAcc y) -> sAcc x.
Set Universe Checking.
Lemma sAcc0 : sAcc 0.
Proof…
-
#### Description of the problem
While debugging https://github.com/coq/coq/issues/16388, I encountered for the first time the `[^ ident ]` pattern. I was pointed at [the documentation](https:/…
-
~~~coq
Cumulative Polymorphic Class t@{+s} (S : Type@{s}) (A B : Prop) :=
T {
prf : S -> A -> B;
}.
Monomorphic Inductive X@{s | Set < s} : Type@{s} := x.
#[refine,local]
Instanc…
-
# Dependent Type Theory
## Function Abstraction and Evaluation
There is a statement "...has nothing to do with the constant ``b`` declared earlier." but there is no such declaration of ``b``. Th…
-
#### Description of the problem
When applying the case tactic to a recursively defined proposition that needs to be reduced in order to exhibit a constructor of some inductive type, the fixpoin…
chdoc updated
3 years ago
-
(I am not yet sure this will end up being a Feature Request or a Bug Report and/or Documentation. But hopefully discussion of this will make its way into a Stainless primer on converting code...)
B…