I had presented a functional merge sort implementation in a previous blog. Here is an example of a functional implementation of insertion sort in ATS: Running it:| Talking with a Lisp