Curated reference materials for understanding category theory, self-reference, fixed points, and their applications in type theory and programming languages.
📁 Browse
📖 Foundational Texts
Categories for the Working Mathematician
The foundational text on category theory by Saunders Mac Lane. Essential reading for understanding categories, functors, and natural transformations.
Category Theory for Programmers
Accessible introduction to category theory with examples in Haskell. Covers functors, monads, and algebraic data types.
Practical Foundations for Programming Languages
Comprehensive treatment of programming language theory including type systems and categorical semantics.
🔄 Fixed Points & Recursion
Initial Algebra Semantics
Understanding inductive data types through initial algebras of endofunctors. The categorical foundation for recursive types.
Terminal Coalgebras
Dual to initial algebras. Models coinductive types, infinite data structures, and observational semantics.
The Y Combinator
Fixed-point combinator enabling recursion without explicit self-reference. Bridge between lambda calculus and category theory.
🚀 Advanced Topics
Lawvere's Fixed Point Theorem
Categorical generalization of diagonalization arguments. Connects self-reference to incompleteness and undecidability.
Domain Theory
Scott domains and continuous functions. Provides denotational semantics for recursive type equations.
Topos Theory & Self-Reference
Internal languages of topoi and their relationship to constructive logic and type theory.
🔗 External Resources
nLab: Fixed Points
Comprehensive wiki entry on fixed points in category theory with links to related concepts.
nLab: Initial Algebras
Detailed treatment of initial algebras and their role in modeling inductive types.
arXiv: Category Theory
Recent preprints in category theory. Stay current with research developments.