I wanted to give a small demonstration of ATS, partly to document a little bit of how to use atspkg, partly to show how to (safely) beat C's performance in ATS, and partly an example of how to parse command-line arguments in ATS.
I came across some interesting benchmark results recently, and I figured I'd give a short writeup.
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.
In this tutorial, we reimplement several of wc's features in ATS. The core logic (as we shall see)
is relatively simple, and we end up with something that's competitive with
C with relatively little effort.