Cartesian closed category¶

A category with a terminal object, binary products and exponential objects representing morphisms out of products.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3599
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics
Aliases: CCC

Core Idea¶

For each A and B an exponential B to the A and evaluation morphism make hom(X times A,B) naturally isomorphic to hom(X,B to the A); size and coherence conventions must be fixed. Currying factors every two-input morphism uniquely through an exponential object, turning product and internal hom into an adjunction that interprets simply typed lambda calculus. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Machines That Make Machines

Imagine a world of machines, where some machines take two things in and give one thing out. In a cartesian closed category, any two-input machine can be turned into a one-input machine that, when you feed it the first thing, hands you back a new machine waiting for the second thing. And you can always turn it back again, without losing anything.

The Currying World

In a branch of math called category theory, a category is a world made of objects and arrows between them. A Cartesian closed category is a world with three special features. You can pair up any two objects into a combined object, there is a special 'single point' object, and for any two objects A and B there is an object inside the world that stands for all the arrows from A to B. Because of this, an arrow that takes a pair of inputs is exactly the same as an arrow that takes the first input and gives back an arrow waiting for the second. This trick is called currying.

Products, Exponentials, and Currying

A cartesian closed category is a category that has a terminal object, binary products A × B, and, for every pair of objects A and B, an exponential object B^A together with an evaluation morphism from B^A × A to B. These must make morphisms X × A → B correspond one-to-one, naturally in X, with morphisms X → B^A. That correspondence is currying: any two-input morphism factors in exactly one way through the exponential. The exponential B^A behaves like an internal 'object of morphisms from A to B'. The category of sets is the standard example, where B^A is the set of all functions from A to B. Cartesian closed categories are the categorical models of the simply typed lambda calculus.

A Cartesian closed category is a category with a terminal object, all binary products, and, for every pair of objects A and B, an exponential object B^A together with an evaluation morphism ev: B^A × A → B, such that for every object X there is a bijection hom(X × A, B) ≅ hom(X, B^A), natural in X. Concretely, every morphism f: X × A → B factors uniquely as ev ∘ (g × id_A) for a unique g: X → B^A, the curried form of f. Equivalently, for each A the functor − × A has a right adjoint (−)^A, the internal hom. This adjunction supplies exactly what is needed to interpret the simply typed lambda calculus, with products for pairing, exponentials for function types, evaluation for application, and currying for lambda abstraction. Sets and functions form the prototypical example. Rigorous statements must fix the category and hom-sets, chosen products and exponentials, the evaluation morphisms, the currying bijection and its inverse, functoriality, and size and coherence conventions (exponentials are unique only up to isomorphism).

Scope of Application¶

Cartesian closed category belongs to category theory and is useful where the analyst can specify the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism are explicit. The scope is broad within that domain but bounded by the need for the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Cartesian closed category can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Cartesian closed category. Cartesian closed category compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory because they reuse the typed category theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Currying factors every two-input morphism uniquely through an exponential object, turning product and internal hom into an adjunction that interprets simply typed lambda calculus., and type the carrier, state every parameter and convention in the definition, test that the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Cartesian closed category Domain-specific

Parents (1) — outgoing typed relations

Cartesian closed category is a kind of Composition Prime

It remains its own entry because its identity is fixed by the category and hom-sets, terminal object, chosen binary products, exponential objects, evaluation morphisms, natural currying bijection and inverse, functoriality and coherence or uniqueness-up-to-isomorphism.

Hierarchy path (1) — routes to 1 parentless root

Cartesian closed category → is a kind of Composition → presupposes Gestalt Principles → is a decomposition of Holism

Neighborhood in Abstraction Space¶

Cartesian closed category sits in a crowded region of the domain-specific corpus (2^nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Category Theory Foundations (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25