store comonad



Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism = propositions as types +programs as proofs +relation type theory/category theory

logiccategory theorytype theory
trueterminal object/(-2)-truncated objecth-level 0-type/unit type
falseinitial objectempty type
proposition(-1)-truncated objecth-proposition, mere proposition
proofgeneralized elementprogram
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
cut elimination for implicationcounit for hom-tensor adjunctionbeta reduction
introduction rule for implicationunit for hom-tensor adjunctioneta conversion
logical conjunctionproductproduct type
disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)
implicationinternal homfunction type
negationinternal hom into initial objectfunction type into empty type
universal quantificationdependent productdependent product type
existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)
equivalencepath space objectidentity type
equivalence classquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
completely presented setdiscrete object/0-truncated objecth-level 2-type/preset/h-set
setinternal 0-groupoidBishop set/setoid
universeobject classifiertype of types
modalityclosure operator, (idemponent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels


Modalities, Closure and Reflection



The store comonad (also costate comonad) is a comonad (in computer science) used to implement computational storage and retrieval of data in functional programming.

As a comonadic triple (D,ε,δ)(D,\varepsilon,\delta) it is given by an endofunctor,

DX:XW×[W,X], DX : X \rightarrow W \times [W,X],

with natural transformations the counit,

ε:DXId X \varepsilon : DX \rightarrow Id_X
ε(v,f)f(v), \varepsilon(v,f) \mapsto f(v),

usually called extract and comultiplication,

δ:DXDDX \delta: DX \rightarrow DDX
δ(s,v)(s,λs.(s,v)), \delta (s, v) \mapsto (s, \lambda s' . (s', v)),

simply called duplicate.


Realization in dependent type theory

In a locally Cartesian closed category/dependent type theory H\mathbf{H}, then to every type WW is associated its base change adjoint triple

H /W WW * WH. \mathbf{H}_{/W} \stackrel{\overset{\sum_W}{\longrightarrow}}{\stackrel{\overset{W^\ast}{\longleftarrow}}{\underset{\prod_W}{\longrightarrow}}} \mathbf{H} \,.

In terms of this the store comonad is the composite

Store= WW * WW * Store = \sum_W W^\ast \prod_W W^\ast

of context extension, followed by dependent product , followed by context extension, followed by dependent sum.

Here WW *=[W,]\prod_W W^\ast = [W,-] is called the function monad or reader monad and WW *=W×()\sum_W W^\ast = W \times (-) is the writer comonad.


Last revised on August 24, 2018 at 11:13:47. See the history of this page for a list of all contributions to it.