- ( c , c ′ ) {\displaystyle S(c',c')\to S(c,c')} . The
definition of the
coend of a
functor S : C o p × C → X {\displaystyle S:\mathbf {C} ^{\mathrm {op}...
-
tensor x ⊗ y {\displaystyle x\otimes y} Left kan
extensions are
computed via
coends,
which leads to the
version below. Let ( C , ⊗ c ) {\displaystyle (\mathbf...
- (\operatorname {Lan} _{F}X)b=\int ^{a}\mathbf {B} (Fa,b)\cdot Xa} when the
above coend exists for
every object b of B. Dually,
right Kan
extensions can be computed...
-
string theory and many
other areas. 1969 Max Kelly-Nobuo
Yoneda Ends and
coends 1969
Pierre Deligne-David
Mumford Deligne–Mumford
stacks as a generalization...
- the same
thing as a cofibration.
codensity monad Codensity monad.
coend The
coend of a
functor F : C op × C → X {\displaystyle F:C^{\text{op}}\times...
-
introduced to deal with concurrency.
Execution of the
statement cobegin S1 // S2
coend executes S1 and S2 in parallel. It
terminates when both S1 and S2 have terminated...
- \phi (d,c)} . Equivalently,
profunctor composition can be
written using a
coend ( ψ ϕ ) ( e , c ) = ∫ d : D ψ ( e , d ) × ϕ ( d , c ) {\displaystyle (\psi...
