Polyad
In mathematics, polyad is a concept of category theory introduced by Jean Bénabou in generalising monads.[1] A polyad in a bicategory D is a bicategory morphism Φ from a locally punctual bicategory C to D, Φ : C → D. (A bicategory C is called locally punctual if all hom-categories C(X,Y) consist of one object and one morphism only.) Monads are polyads Φ : C → D where C has only one object.
Notes
- Benabou, Jean (1967), Introduction to Bicategories
Bibliography
- Street, Ross (1983), Enriched Categories and Cohomology
gollark: I mean the public keys and random bits of configuration.
gollark: No.
gollark: Tailscale handles most of that via a central configuration server, and has NAT traversal, making my stuff much easier.
gollark: Basically, osmarksnetnet™ 1 involved me manually copypasting Wireguard configuration keys everywhere, and everything only connected to one server at a time, and I had to have nftables, and it was very irritating.
gollark: The mesh is layer 2, so routing doesn't care.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.