-
Idris version: 1.3.1
# Steps to Reproduce
For example, I have the following code:
```idris
data Tree = Branches (List Tree) | Node Int
sumTree : Tree -> Int
sumTree (Branches xs) = sum (…
-
So, from what I can see, there doesn't seem to be an option to build the firmware for a wanhao duplicator 4 with an atmega2560. I planned on changing the chip on my printer to a 2560 in the next week …
-
Consider a logic program
```
eq(X,X).
```
and a queries using the eq predicate in CoALPj
```
res :- eq(X,X), eq(a,b).
res :- eq(a,b), eq(X,X).
```
These must fail but it succeeds in most recent v…
-
This may be a known fact, but Agda allows definitions that occur in their own type:
```agda
A : Set
a : A
data D : A → Set where
d : D a
A = D a
a = d
```
The term `d` h…
-
Consider the following model: `x` is the "state" proper, and `ok` is a bool that keeps track of some property of the state (in this case that `0
-
Note: the issue was created automatically with bugzilla2github tool
Original bug ID: BZ#5645
From: @ppedrot
Reported version: trunk
CC: coq-bugs-redist@lists.gforge.inria.fr
-
I've been meaning to file this for a year, but better late than never I guess...
While we haven't encountered a need so far, we need a way to represent mutually-recursive types[1]. I'm assuming we …
-
Currently if you want to train and evaluate a model you run the following script:
```bash
#!/bin/bash
set -e # Exit immediately if a command exits with a non-zero status.
source $(conda info --…
-
Inversion (in Prawitz' sense) of inductive definitions is a special case of pattern-matching, corresponding to there being a *unique* combination of premises for an inference rule which guarantee the …
-
If the recurrence relation is $$ T(n) = T(\lceil n / 2 \rceil) + T(\lfloor n / 2 \rfloor) + \Theta(n) $$
And our inductive hypothesis for the upper bound is $$ T(n) \le c(n-2)\lg(n-2) -2c $$
Th…