@BartoszMilewski@mathstodon.xyz
Post #3023663
2026-05-13 11:38 UTC
Replies (2)
-
@BartoszMilewski@mathstodon.xyz 2026-05-13 11:49
@sjoerd_visscher@types.pl @6d03@mathstodon.xyz A morphism is built from two pairs of objects (a, b) and (a', b') and a pair of arrows (u: a -> a', v: b -> b'). They have to satisfy a commuting square that uses lmap and rmap.
-
@sjoerd_visscher@types.pl 2026-05-13 14:57
@BartoszMilewski@mathstodon.xyz @6d03@mathstodon.xyz Yes a bit. Reading up on graphs of a profunctor, it is a bit like an arrow category. (It is exactly that if the profunctor is a hom functor). Arrow categories are annoying because it has arrows as objects, and commuting squares as morphisms. But in most Haskell encodings objects are types but arrows are values, and Haskell isn’t dependently typed. Cographs on the other hand are easy [1], which is why I only tried defining cotabulators. [1]: https://github.com/sjoerdvisscher/proarrow/blob/main/src/Proarrow/Category/Instance/Collage.hs#L24