Need hints about proving some intuitionistic logic statements...

Derivatives of data structures in Agda...

Mutually Inductive Descriptions with different type indices?...

Idris pass proof to a function that arguments are LTE...

How to convince Idris in vector length...

Compile time enforced finite lists...

What is the type of a pi type?...

In scala shapeless, is it possible to use literal type as a generic type parameter?...

types as parameters in coq...

In scala shapeless library, is there a native way to convert a product type (HList/Generic/NamedGene...

How to rewrite given two dependent types are equal in Coq...

Lifting existentials to type level...

Rewriting with John Major's equality...

Agda: can I prove that types with different constructors are disjoint?...

Coq: type mismatch on dependent lists which could be solved by a proof...

Does injectivity of Type product make sense?...

Record, Proof irrelevance, and John Major's equality...

Why isn't dependent type inffered by the compiler?...

How to tell a dependent match two nats are equal...

How to make it so that dependent types in two different traits are recognized as the same type...

Can one prove an equivalent to Forall_inv for heterogeneous lists in Coq?...

Is there a language with constrainable types?...

How to understand the type declaration and definition for List and Vect in Idris lang?...

Use template from dependent type...

How to guarantee that passed object key is callable using Typescript?...

How to use a refutation to direct the type checker in Haskell?...

Coq : How to correctly remember dependent values without messing up the induction hypothesis?...

Is there any trick to avoid the `typename` keyword inside a template class?...

How to properly wrap over a datatype indexed by an inductive datatype?...

Pull type-level value out of dependent type/using type-level bindings at value-level...