Objects, morphisms, composition, identity morphisms, categories, and the category of sets provide the base language for the series.
Topic
mathematics
The Curry-Howard-Lambek correspondence relates propositions, proofs, programs, and categorical structure.
Limits and colimits express universal constructions through cones, cocones, terminal objects, products, sums, and equalizers.
Monads arise from monoids in the category of endofunctors and model structured computation in programming languages.
Universal constructions describe initial and terminal objects, products, sums, monoids, exponential objects, and type algebra.
The series introduces category theory as a connected collection of definitions, examples, and applications in sets, programming languages, and physics.
Groups, rings, fields, and vector spaces provide algebraic background used by the categorical examples.
Topos theory studies categories that behave like generalized universes of sets.
Yoneda's lemma explains how an object of a locally small category is determined by the morphisms into or out of it.
Natural transformations compare functors component by component and organize functors into their own categories.
Functors map objects and morphisms between categories while preserving composition and identity.
Kleisli categories describe composition for computations with effects such as partiality, exceptions, and nondeterminism.
Part three of a three-post series on Shor's algorithm and its cryptographic applications, focused on elliptic curves and ECDH.
Part two of a three-post series on Shor's algorithm and its cryptographic applications, focused on the quantum Fourier transform and discrete logarithms.
Part one of a three-post series on Shor's algorithm and its cryptographic applications, focused on period finding and RSA.