Namespace List

Here is a list of all documented namespaces with brief descriptions:

[detail level 123]

Ndedekind
Ncategory
Ndetail_arrows	The endomorphisms of T that have a storage class, as three coproducts, each an arrow by case analysis and a coproduct by construction (the Jlt paper, Listing 2)
Ndetail_comprehension
Ndetail_involution	An involution is an endomorphism once read on its object: the implication holds of the lifted arrow, endo<T>(f), and not of a bare callable such as std::logical_not<bool>, which is a family of arrows, one per type, and no IsArrow until endo names its domain
Ndetail_kleisli
Ndetail_lattice_nodes
Noperations	Composition as an operation, the function object whose call is f >> g, so that a fold or a shape can take it as it takes std::plus; the operator stays what the partitions overload, and this only names it (the standard made the same move for + and never for >>). It lives in a namespace of its own, so that lookup by argument reaches no law function of the tree's (:species' associative) and a shape stating the laws of its own finds only those
Nsets
Ndetail_complement_involution
Ndetail_recursion_witness
Norder
Ndetail_interval
Ndetail_pointfree_decidability
Ndetail_axis	A meet of cylinders: the factor on axis I is the intersection of both children's factors on that axis, so two bounds on the same axis (π_1<=5 && π_1<=3) meet to the tighter one rather than dropping either
Ndetail_cover_witness
Ndetail_runs	χ(x): the value of the last step at or before x
Ndetail_runs_witness
Ngeometry
Ndetail_ops
Nlinear_algebra
Ndetail_diag
Ndetail
Ndetail_transfer
Nmorphologies
Nsingleton_image_breadcrumb
Nfirst_iso_mod_2
Nnumbers
Ndetail_lambek_witness
Nsequences
Ndetail	The interval ↔ iota_view bridge: order's Interval<T,L>, a value, read as the half-open std::ranges::iota_view [start, bound), and back, as a total inverse
N_path_525
Ndetail_pst_witness
Ndetail_boundedset_witness	Witness: BoundedSet is a set. IsSet is reached by inheriting dedekind::sets::SetExpr and supplying the χ — the same opt-in surface Comprehension uses; nominal, never a precondition
Nhalfspace_iota_witness
Nbridge_meet_witness
Ndetail_relprod	The composed predicate for \(R;S\) over the finite ℕ-prefix \([0,M)\) middle. Carries M (so the bound survives repeated squaring) and the two operand IsRelPredicate operands. The \(\exists\)-over-the-middle is the short-circuiting std::ranges::any_of over a lazy iota generator: it advances only to the first witness \(b\), so a hit returns immediately ( \(\top \vee x = \top\)) — O(1) memory (no bool accumulator threaded), O(M) steps worst-case, no array
Noptimization
Ndetail