-
If I go to the end of the line at https://github.com/mit-plv/fiat/blob/13fecc64d7ec3ae4f969f807c73b26d123020abc/src/Parsers/Refinement/IndexedAndAtMostOneNonTerminalReflective.v#L668 and execute `proo…
-
* Translate formula along signature morphism (hets)
* Flatten a theory (hets)
* Compute colimit of a network (hets)
* Compute normal form of a structured OMS/graph (hets)
* Syntax highlighting, au…
-
To set the scene, here is a C program:
```c
#include
void *f(void *arr, size_t n) {
if (n > 0) {
((unsigned char *)arr)[0] = 42;
}
return arr;
}
void *g(void *arr, size_t n) …
-
VST is formally proved sound w.r.t. the operational semantics of CompCert Clight.
VST is _supposed to be sound_ for gcc and clang, but is not formally proved sound.
In this issue I propose that we c…
-
See the following minimal example
```fstar
open FStar.Tactics
assume val predicate: int -> Type0
// If we add the SMTPat, then `test` succeed
assume val predicate_is_true_lemma: x:int -> Lemm…
-
Envision a decentralized, collaborative ecosystem where the collective intelligence of developers, validators, and miners is harnessed to reimagine and enhance APIs. Here's how the elements of this in…
-
Allow for Encoders to be attached to the controller (pin dependant) and provide low latency feedback to LinuxCNC host without impacting motion control.
Test and validate LinuxCNC controlled closed …
-
# Open Grant Proposal: Develop the 'zk-Useful Work' system utilizing zero-knowledge proofs to ensure tasks are verifiable and rewards are equitable and transparent.
**Project Name:**`zk-Useful Work…
-
I was going to comment on https://github.com/coq/coq/pull/10334 but I felt that it would be less hickjacking to open an issue.
This is mostly a question for @ppedrot and @mattam82 I guess: it seems…
-
Given the definitions
```haskell
data Foo = A
data Bar = B | C
{-@ reflect f @-}
f :: Foo -> Bar
f A = B
{-@ reflect g @-}
g :: Foo -> Bar
g A = f A
{-@ reflect h @-}
h :: Foo -> Bar
…