-
Consider a sequence of dependent pairs where both pair components depend on a `t : Nat` value:
```
> Foo : (t : Nat) -> Type
> Bar : (t : Nat) -> (ft : Foo t) -> Type
> data FooBarSeq : (t : Nat) ->…
-
```
Since type constructors are considered injective by the forcing analysis we are
able to define the type for the "russel" paradox:
open import Data.Product
Type = Set₁
data Box : Type -> Set wh…
-
One day I came on the https://www.haskell.org/ and found this little code (last line is mine):
```
primes = filterPrime [2..]
where filterPrime (p:xs) =
p : filterPrime [x | x
-
This sounds natural:
```
g.relabel(Permutations(g.order()).random_element())
```
but it stops with `TypeError: i (= 0) must be between 1 and 4`. That is because actually a "permutation" used as an…
-
I'm not sure what's the problem. F* doesn't give any warning.
```
$ fstar.exe M.fst
Verified module: M (1095 milliseconds)
All verification conditions discharged successfully
```
```F#
mod…
-
When --without-K is enabled, Agda currently tries to detect datatypes that do satisfy K (such as `Nat`) in order to reintroduce the deletion rule on a more limited basis. For example, this ensures tha…
-
I'm not sure if this bug is related to issue #376.
```agda
module Bug where
------------------------------------------------------------------------
-- Prelude
data _≡_ {A : Set} (x : A) : A …
-
org.apache.lucene.analysis.fa.PersianAnalyzer
words are normalized when indexed but in search , words are not normalized then it cannot find them if i normalized them by myself then it find them
-
On the one hand, this seems to break the "convert only does lossless conversion" contract:
``` jl
julia> convert(Float64, 2^53+1) == 2^53+1
false
```
I've made a few false starts on changing this so…
-
The system logic is divided into two: **Sensors Handling** and **Applications Handling**. Each part has been developed seperatly in the past week and a half and has reaching impressive results; howeve…