parametric polymorphism does: a function works for any type T without knowing what T is

the Y combinator does: enables recursion in languages without named functions

The Y combinator allows anonymous functions to call themselves recursively

Lambda calculus

Lambda calculus represents data using only functions

Dependent type

Dependent types depend on values, not just types

Characteristic function (probability theory)

Characteristic function φ(t) = E[e^(itX)] is the Fourier transform of the PDF

Monad (functional programming)

Monads are a type constructor with two operations: return and bind

Curry–Howard correspondence

Proofs are programs, types are propositions