Proofs about functions that depend on the ordering of their alternatives...

Type Juggling with Existentials at Runtime...

Is there any connection between `a :~: b` and `(a :== b) :~: True`?...

Problems in defining an applicative instance...

Struggling with rewrite tactic in Idris...

Idris: arithmetics for bounded Double...

Why is Monad of sort Set1?...

Idris non-trivial type computation for tensor indexing...

Type safe lookup on heterogeneous lists in Haskell...

Efficiently abstracting over datatype arity...

Type level environment in Haskell...

Infinite (finally-periodic) HList in Haskell...

Replacing singleton data types with a data family...

Generic programming via effects...

More problems with dependently typed programming in Haskell...

How to enumerate the elements of a list by `Fin`s in linear time?...

Understanding `k : Nat ** 5 * k = n` Signature...

Agda: How to infer proof of _≤_ (or, how to implement a binary search tree)...

How to determine all sub-dimensions of a HVect?...

Agda: parse a string with numbers...

Scala dependent products without pointless casts...

Do typing judgements have a kind?...

Why can't coq infer the that 0+n=n in this dependently typed program?...

Does Idris have an equivalent to Agda's `_` expressions?...

Returning templated dependent types...

Declaration of dependent type as function parameter in template class...

Choosing a typeclass on construction of a data type...

How can I express the type of 'takeWhile for vectors'?...

How Agda determines a type is impossible...

Why can't I define `Eq` using only indices in Agda?...