How to propogate an assumption when pattern matching in Lean...

Is coproduct the same as sum types?...

Dependent types can prove your code is correct up to a specification. But how do you prove the speci...

What is the bottom type?...

Inductive type constructed by a list of that type in Lean...

Why do We Need Sum Types?...

What's the absurd function in Data.Void useful for?...

RankNTypes and Church numerals...

Limit a number to a range (Haskell)...

How can quotient types help safely expose module internals?...

Pattern matching in Observational Type Theory...

Describing a typeclass for general graphs in Haskell...

Singleton types in Haskell...

Is it possible to define a recursive type in Common Lisp?...

What is the canonical name for the identity type?...

Law of excluded middle in Agda...

Types are erased before run time...

Java: Why must user satisfy extends constraint?...

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

Self-representation and universes in OTT...

Curry Howard correspondence and equality...

f#: encoding even and odd in (inductive) types?...

Provable coherence in OTT...

Why does `filter` work with higher-order occurrence typing?...

Unification Weirdness in Typeclass Instance...

How to systematically compute the number of inhabitants of a given type?...

Why is forall a. a not considered a subtype of Int while I can use an expression of type forall a. a...

How do I show that a Haskell type is inhabited by one and only one function?...

Are there useful applications for the Divisible Type Class?...

What does GADT offer that cannot be done with OOP and generics?...