You may have seen the Some Were Meant for C polemic; I do not agree with it completely but I encourage you to read it if you have not. Here, I give some comments on ATS and Rust in light of it.
I came across some interesting benchmark results recently, and I figured I'd give a short writeup.
If you have followed the Haskell community much, you may have heard the phrase "programmable semicolon" in relation to monads. Of course, it is not obvious what is meant by such a thing, so I figured I'd write a short explanation for those already familiar with monads.
Here I present two ways to write Euler's totient function in ATS. First we write our primality check:
I started work on my ATS math library recently; though I'm not sure it will be a wholehearted success, there were parts that deserve attention.prev | next