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.
I wanted to share a little example I came across while working on one of my Idris libraries. It's matrix multiplication, but from an angle you may not be used to. In particular, though it is written in Idris (a strict language), it composes as well arrays in Haskell or another lazy language thanks to dependent types.
prev | next