6 Matching Annotations
 Feb 2021

en.wikipedia.org en.wikipedia.org

Though rarer in computer science, one can use category theory directly, which defines a monad as a functor with two additional natural transformations. So to begin, a structure requires a higherorder function (or "functional") named map to qualify as a functor:
rare in computer science using category theory directly in computer science What other areas of math can be used / are rare to use directly in computer science?


dryrb.org dryrb.org

It's hard to say why people think so because you certainly don't need to know category theory for using them, just like you don't need it for, say, using functions.

 Jul 2020

en.wikipedia.org en.wikipedia.org

Willard Van Orman Quine insisted on classical, firstorder logic as the true logic, saying higherorder logic was "set theory in disguise".

 Jan 2020

en.wikipedia.org en.wikipedia.org

en.wikipedia.org en.wikipedia.org
 Jun 2018

ocw.mit.edu ocw.mit.edu

Remark1.73.IfPandQare total orders andf:P!Qand1:Q!Pare drawn witharrows bending as in Exercise 1.72, we believe thatfis left adjoint to1iff the arrows donot cross. But we have not proved this, mainly because it is difficult to state precisely,and the total order case is not particularly general
