lambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-211 days agoIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orgimagemessage-square176fedilinkarrow-up1363arrow-down159file-text
arrow-up1304arrow-down1imageIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orglambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-211 days agomessage-square176fedilinkfile-text
minus-squarePhoenix3875@lemmy.worldlinkfedilinkarrow-up3·10 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 Monoidmappendoperator (i.e. generalized binary concatenation).