<div dir="ltr"><div><div><div>I'm mighty pleased to note that the following is valid Haskell code!<br><br></div>Do others find this useful/appealing?<br></div>Any possibilities on making the commented out parts work?<br>
</div><br>[Pragmatics about typing this at the same speed and facility as we do with Ascii is a separate and (IMHO) solvable problem though its not the case at the moment]<br><div><div><div><div><br><br>--------------------<br>
import qualified Data.Set as Set<br>-- Experimenting with Unicode in Haskell source<br><br>-- Numbers<br>x ≠ y = x /= y<br>x ≤ y = x <= y<br>x ≥ y = x >= y<br>x ÷ y = divMod x y<br>x ⇑ y = x ^ y<br> <br>
x × y = x * y -- readability hmmm !!!<br>π = pi <br> <br>-- ⌊ x = floor x<br>-- ⌈ x = ceiling x<br><br>-- Lists <br>xs ⤚ ys = xs ++ ys<br><br>-- Bools<br>x ∧ y = x && y <br>x ∨ y = y || y<br>
-- ¬x = not x<br><br><br>-- Sets<br><br>x ∈ s = x `Set.member` s -- or keep ∈ for list elem?<br>s ∪ t = s `Set.union` t<br>s ∩ t = s `Set.intersection` t<br>s ⊆ t = s `Set.isSubsetOf` t<br>s ⊂ t = s `Set.isProperSubsetOf` t<br>
s ⊈ t = not (s `Set.isSubsetOf` t)<br>-- ∅ = Set.null<br><br>
</div></div></div></div></div>