lambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-220 days agoIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orgimagemessage-square181fedilinkarrow-up1360arrow-down162file-text
arrow-up1298arrow-down1imageIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orglambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-220 days agomessage-square181fedilinkfile-text
minus-squarePhoenix3875@lemmy.worldlinkfedilinkarrow-up3·19 days agoYes for OCaml. Haskell’s inequality is defined as /= (for ≠). <> is usually the Monoid mappend operator (i.e. generalized binary concatenation).
Yes for OCaml. Haskell’s inequality is defined as
/=
(for ≠).<>
is usually the Monoidmappend
operator (i.e. generalized binary concatenation).