-
As a demonstration, when I have these holes,
```
%coverage
LF ty : type =
| base : ty
| arr : ty -> ty -> ty
;
%name ty T.
LF tm : ty -> type =
| abs : (tm A -> tm B) -> tm (arr A B…
-
The common for the whole EQ3 control is weak BLE signal. Usually weak means lower than -90. Such devices tend to disappear, or loss connection. Such connection needs to be retried multiple times, maki…
-
In Section 3, it is not explained anywhere what the purpose of all the data for the construction is. For instance, what are `Q` and `R` and `j_Q` about? These symbols are not connected to anything tha…
-
The following code is type-correct, but the GHC backend cannot handle it:
```agda
{-# OPTIONS --cubical #-}
module Test where
open import Agda.Builtin.Cubical.Path
open import Agda.Builtin.IO…
-
I've just completed the Bin-Isomorphism exercise at the end of the Quantifiers chapter.
As part of the exercise, it is suggested that the reader proves the following lemma:
```
proj₁≡→Can≡ : {c…
-
Note: the issue was created automatically with bugzilla2github tool
Original bug ID: BZ#5474
From: @JasonGross
Reported version: 8.6
CC: coq-bugs-redist@lists.gforge.inria.fr
-
I'm trying to get a feeling for what works and what doesn't with ghc-proofs and inspection-testing, and I found this case where inspection-testing recognizes two equal functions but ghc-proofs doesn't…
-
This is an awesome design and, as part of the team in NZ keen on getting a few made at JLCPCB, I started reviewing the design. At this stage, just the layout and BOM. I noticed X1 is a 40 MHz oscillat…
-
The following problem occurs when I run the code and after debugging the problem is not solved. How can I fix it?
…
-
#### Description of the problem
A simple proof script that involves `n` constructor applications can lead to a proof term whose type-checking time is quadratic in `n`. This is illustrated by th…