Here is the quintessential guessing game as implemented in ATS. The SATS file (the public external specification) and the DATS file (the implementation): and finally, the Makefile: Running it:| Talking with a Lisp
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
The more I learn of ATS, the more I’m fascinated by it. Notwithstanding the talk which pokes sufficient (light-hearted) fun at ATS, I actually find it very logical, including the naming and organisation of files, libraries, and concepts.After the initial get-go, it’s been a veritable pleasure learning ATS. I’m halfway through the first book, and … Continue reading A simple file copying example in ATS| Talking with a Lisp
This is an implementation, in ATS, of one of my favourite exercises in closures – a line-number printing closure. For reference, the Rust version is given first, and then the same in ATS, whih has a unique flavour of its own. Here is the Rust version: Running it: And here is the same in ATS: … Continue reading A line number closure implementation in ATS| Talking with a Lisp
A simple, functional merge sort implementation for a custom list type in ATS: Testing it out:| Talking with a Lisp
The more I learn ATS, the more I love it. Never mind the naysayers and the detractors who claim it is an illogically complex language. So far, I’ve found it to be a verylogical and relatively…| Talking with a Lisp