Three examples of recursion schemes drawn from mathematics, showing the use of linked lists as control structures.
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.
I figured I'd post this as ATS is quite difficult. Nothing contained in this file is advisable, but by the time you can figure out what's wrong, you won't need it!
This tutorial will give you an opinionated introduction to using Haskell on the frontend for web. To benefit, you must:
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