-
The following minimal example leads to an unexpected failure:
```fstar
module Bug1
open FStar.All
val is_special_lex_t : lex_t -> GTot Type0
let rec is_special_lex_t x =
match x with
…
-
```
struct {
tag: u32,
data: F tag
}
```
Processing this struct often requires code like this:
```
match s.tag {
val1 => { f1 s.data },
val2 => { f2 s.data },
_ => { ...…
-
Hi all
I run vampire_z3_Release_static_master_4764.
Everything is ok until I try a file containing $sum:
```
tff(anti_sum_2_2_5,conjecture,
( $sum(2,2) = 5 )).
```
There the program run…
-
Here is why:
1. My Production code must be signed
2. My Production code uses [assembly: InternalsVisibleTo(MyUnitTest strong name)] to give unit test access to its internals.
3. The name MyUnitTest sp…
-
Let me start by saying: very impressive work! You guys have realized many of the ideas that I was pondering about in a nicely built, open source package. Awesome. Ok, to the issue.
Currently, Termi…
-
### Description
When conducting a G29 P1 my z-probe never reaches the bed in the corner region of (X=max bed size, Y=0) this occurs for 12 adjacent points in this region (box region of 3 points…
-
We have a function that detects whether a natural number is a prime number:
```
is_prime(nat) -> bool
```
The implementation of the prime number detector is not relevant. What we want to describe is…
-
I was also trying to prove confluence using Takahashi’s approach, and with the sigma-algebra developed in the section on substitution I am able to prove the following `par-complete-dev` by a simple in…
-
In the following code, `foo : R -> A` is defined by pattern matching and `bar : R` is defined by copatterns. Then `foo bar` is a stuck term.
```agda
open import Agda.Builtin.Equality
postulate
…
-
Without becoming to wedded to a specific way of doing things, we might also want to do some analysis on the 'kind' of things: `Type`, `Format`, `Predicate`, `kind -> kind`. This would allow us to expr…