News for hackers. Stuff that matters.
Re:Counterexamples in Type Systems by lapinot on Monday May 24, 2021 @09:38AM (#27264208)
Looking at java, rust or assembly i find this argument hard to swallow ;) It's really worth it to learn some sequent calculus basics to be able to read typing rules. Its mostly the same thing as a grammar, or a weird inductive type ("enum").
Re:Counterexamples in Type Systems by duped on Monday May 24, 2021 @09:57AM (#27264406)
It shouldn't be hard to swallow. Monospaced ascii text that is (usually) unambiguous with extensive documentation is night and day from formal notation.

At least BNF grammars are legible

Re:Counterexamples in Type Systems by klibertp on Monday May 24, 2021 @12:00PM (#27265941)
Look at APL, K, and J. The notation based on keywords is not a problem; the problematic notations are the ones which abuse strange characters or ideograms, because they require you to re-learn the process of reading.