-
#### Version
8.8.0
#### Description of the problem
```coq
Inductive silly : nat -> Type := .
Definition foo {n} (v : silly n) : False := match v with end.
Goal forall (s1 : silly 0) (s2 : …
-
TL;DR: Currently, there are lots of anomalies with algebraic universes, but allowing depth-1 conclusion-algebraic types (but not algebraic universes in terms of a universe) might be a reasonable restr…
-
I like the inductive restriction symbols @(equal) and *(smaller) for their simplicity. I wonder if we could make use of these symbols to prove the size of objects. For example,
```
Kind nat type.
T…
-
```
/Users/dan/src/ProofChecking/UniMath/UniMath-exact-categories/UniMath/Algebra/Lattice.v
4: Definition of
/Users/dan/src/ProofChecking/UniMath/UniMath-exact-categories/UniMath/CategoryTheory/lim…
-
Dear Fabiano,
would it be possible to integrate a "Count Mode" similar as in the Circuitar Dimmer library? This is the mode that uses complete half-waves to dim. That would be very helpful.
Reg…
-
For the following code:
```agda
{-# OPTIONS --cubical #-}
open import Agda.Primitive
open import Cubical.Foundations.Prelude
interleaved mutual
data A : Type
data B : A → Type
cons…
-
Note: the issue was created automatically with bugzilla2github tool
Original bug ID: BZ#5357
From: @paul-kline
Reported version: unspecified
CC: coq-bugs-redist@lists.gforge.inria.fr
-
I don't think there's a way to delete terms as a user, so here are a few duplicates that need to be resolved (assuming this is the right place to bring them up):
- [Interference control](http://www.c…
tsalo updated
6 years ago
-
Recognizing this may be beyond the intended scope of the maxsynth ILP approach to program synthesis:
Muggleton does, in ["Inductive Logic Programming: Theory and Methods" ](https://www.sciencedire…
-
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…