-
It is possible to translate some intuitionistic proofs into algorithms
I don't know neither a formalization, nor a proof sketch, but some projects like Coq have it implemented
My first idea of how…
-
Hi ! Using repsnapper 2.4 on fedora 25 x64, there is no report of the nozzle temperature (while bed temperature reports fine) on a chinese prusa i3 clone. It's not that important since printing still …
didli updated
7 years ago
-
**TL;DR** **Make the syntax of positive coinductive types into a syntax sugar for negative coinductive types with a single constructor.**
Let's say we want to implement some `CoList`s (i.e. coinduc…
-
[paper](https://arxiv.org/pdf/2203.10202.pdf), [code](https://github.com/suprosanna/r…
-
It would be nice if the developer is able to give logical hints about loops.
Potential ideas:
- Loop invariants
- Loop bounds
- Loop pre/post conditions
-
win18rr_transductive Report an error：
10:41:03 Random seed: 1024
10:41:03 Config file: config/transductive/wn18rr.yaml
10:41:03 Delta: 0
10:41:03 {'dataset': {'class': 'WN18RR', 'root': '~…
-
#### Description of the problem
```coq
Goal True /\ True.
Info 2 split. (* simple refine ?X2 *)
Info 2 constructor. (* simple refine ?X5 *)
```
This is bogus, as it should be refining …
-
#### Version
8.7.1
#### Description of the problem
I could not find any printing option other than `Set Printing All` which allows me to see the implicitly generated argument name in `fun '((…
-
The following fails to verify in 3.5.0.40314:
```
const p:()->bool
const c := p()
method test() {
assert c == p(); // fails
}
```
-
#### Description of the problem
```coq
Inductive t : Set := C : t -> t -> t.
Reserved Notation "a $ b" (at level 200, right associativity).
Infix "$" := C.
Variables (a b : t).
Check (a …