A Sample of Standard ML, the TreeSort Algorithm, and Monoids

Jeremy Kun · 2013

In this post we will assume the reader has a passing familiarity with some of the basic concepts of functional programming (the map, fold, and filter functions). We introduce these topics in our Racket primer, but the average reader will understand the majority of this primer without expertise in functional programming. Follow-ups to this post can be found in the Computational Category Theory section of the Main Content page.

Read the paper · More papers on PaperTik