-
_From [nils.anders.danielsson](https://code.google.com/u/nils.anders.danielsson/) on August 05, 2010 01:16:59_
ccasin observed that one can prove that Bool and Fin 2 are distinct
(see the #agda IRC c…
-
-
On the front page, the definition for bijection is given:
> A Bijection is an invertible function that converts back and forth between two different types, with the contract that a round-trip through…
-
Sections 2.6 through 2.11 use the phrases "beta-reduction" and "eta-equivalence" in a general way to refer to properties of identity types of certain types, intended to be compared with similar proper…
-
The following code type checks
```
> Blt : Nat -> Type
> Blt b = (n : Nat ** so (n < b))
> idx : Vect alpha n -> Blt n -> alpha
> idx (a :: as) (O ** _) = a
> idx (a :: as) (S k ** q) = idx as (k **…