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: Once no more pairs can be substituted, it uses a large table of the frequencies of each symbol (`qfreqs`) to efficiently encode a sequence of those symbols as a large number, "efficiently".
gollark: Pairs of symbols (initially just the bytes given to the thing) in the input are repeatedly substituted for symbols from the dictionary (the `real_bped` blob).
gollark: Well, I guess bees good.
gollark: I don't count bzip because no.
gollark: And maybe whatever #12 does.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.