Difference between revisions of "Monad"
Jump to navigation
Jump to search
Line 11: | Line 11: | ||
{{#ask: | {{#ask: | ||
[[Category:Category Theory]] | [[Category:Monad]] | [[Category:Category Theory]] | [[Category:Monad]] | ||
|format= | |format=category | ||
|mainlabel=Local Links | |mainlabel=Local Links | ||
}} | }} |
Revision as of 02:41, 5 January 2022
Monad is a way to preserve symmetries in the space of functions while allowing for maximal compositionality.
Don't fear the Monad
Brian Beckman had an hour-long video that explains Monad in a rather detailed and insightful tutorial[1]. Therefore, a special page was dedicated to annotate the tutorial with segmented video clips. Just click on this link:Don't fear the Monad, to get access to the annotation. The following is the shortened version of the page:
Synopsis of Beckman's Tutorial on Monad
- Monad is the way to build complexity from simplicity
- Monad is ruled by one customizable rule that rules them all
- Monad is hard to learn because of a broken symmetry
The idea of Monad can be traced back to the mathematical structure: Monoid, which is just an algebra with one element only. This mathematical structure provides a basis to reduce complexity. As Beckman says:
Monoid helps to guarantee you to build a software with one and only one type ...(start at 1126)
|ZhuHCtR3xq8|||| |start=1126&end=1230}}
References
- ↑ Beckman, Brian (Nov 21, 2012). Brian Beckman: Don't fear the Monad. local page: jasonofthel33t.
Related Pages
A
- Local Links A Global Network of Personal Knowledge Container
- Local Links Abstract Interpretation
- Local Links Abstract Specification of PKC
- Local Links Abstract nonsense
- Local Links Accountability
- Local Links Adjoint Functors
- Local Links Adjunctions
- Local Links Age Appropriate Design Code
- Local Links Anti-joke
- Local Links Anti-math
- Local Links Anti-operator
- Local Links Applied Category Theory
- Local Links Approximate truth
- Local Links Associative array
B
- Local Links Bartosz Milewski
- Local Links Bob Coecke
- Local Links Book/A Compositional Framework for Passive Linear Networks
B cont.
- Local Links Book/Axiomatic design
- Local Links Book/Axiomatic design and fabrication of composite structures
- Local Links Book/CATEGORIES TYPES AND STRUCTURES
- Local Links Book/Categories for the Working Mathematician
- Local Links Book/Category Theory for Programmers
- Local Links Book/Category Theory for the Sciences
- Local Links Book/Complexity-theory and applications
- Local Links Book/Conceptual Mathematics
- Local Links Book/Conceptual Mathematics/OnSymmetries
- Local Links Book/From Frege to Gödel
- Local Links Book/New Structures for Physics
- Local Links Book/Picturing Quantum Processes
- Local Links Book/Probably Approximately Correct
- Local Links Book/Seven Sketches in Compositionality
- Local Links Book/Speakable and Unspeakable in Quantum Mechanics
- Local Links Book/What is Applied Category Theory
- Local Links Boundary Conditions
B cont.
- Local Links Brendan Fong
C
- Local Links Categorical quantum mechanics
- Local Links Category Theory
- Local Links Category Theory by John Peloquin
- Local Links Category Theory for Programmers
- Local Links Category of Systems
- Local Links Causal cone
- Local Links Cause
- Local Links Colimit
- Local Links Comedy
- Local Links Commutative Diagram
- Local Links Commutative Diagram and Commutator
- Local Links Compatibility
- Local Links Composability
- Local Links Composition
- Local Links Containerization Logic Model
- ... further results