I've been doing some more work with atspkg and polyglot builds. It is now in
slightly better shape, and it gives us the ability to call ATS code in Haskell
almost painlessly.
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.
Three examples of recursion schemes drawn from mathematics, showing the use of linked lists as control structures.
Like my last post on ATS , this is far from a full-fledged tutorial, but I think it will nonetheless be instructive to students of ATS.
prev | next