lambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-25 months agoIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orgexternal-linkmessage-square183fedilinkarrow-up1376arrow-down163file-text
arrow-up1313arrow-down1external-linkIt's easier to remember the IPs of good DNSes, too.lemmy.sdf.orglambalicious@lemmy.sdf.org to Programmer Humor@programming.devEnglish · edit-25 months agomessage-square183fedilinkfile-text
minus-squarePhoenix3875@lemmy.worldlinkfedilinkarrow-up3·5 months 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).