Inferred curried function signatures in F#...

Define lists with least fixed point, sum, and product types...

Free theorems in C++: are templates inherently ignorant and neutral with their objects of unknown ty...

Finding the most general unifier in Haskell using Data.Comp.Unification (beginner question)...

How to prove that "Type <> Set" (i.e. Type is not equal to Set) in Coq?...

Zip function in System F...

Formulating a dependent type system in Agda...

Can type constructors be considered as types in functional programming languages?...

Are definitional and propositional extenionality on top of intensional type theory equivalent?...

How to prove that the defining equations of the recursor for N hold propositionally using the induct...

How does the compiler know to return the right type?...

Why J axiom takes 2 x when giving signature of x, y?...

Is there a type theory in which the equivalence of identically shaped inductive datatypes is represe...

Creating three dimensional Array with arbitrary type and map in Scala...

A category of type-changing substitutions...

What is a clean algorithm to recover a CC term from an untyped one and its CC type?...

Representing Functions as Types...

What is positivity checking?...

What's the difference between parametric polymorphism and higher-kinded types?...

Proving commutativity of type level addition of natural numbers...

Subtype relation of Option type...

Type theory: type kinds...

Difference between type parameters and indices?...

Proving the principle of explosion in Agda...

Coq HoTT - How to correctly put a definition inside a theorem?...

How to deconstruct an SNat (singletons)...

Implementing non-positional keyword arguments in Haskell...

How to prove a relation at compile-time in Lean?...

How to pattern match on a Prop when proving in Coq without elimination on Type...

In Lean, is it possible to use decidable_linear_order with a user defined equality relation?...