Name: Anonymous 2018-02-21 19:44
An example of Symta's expressiveness could be the implementation of quick sort algorithm, which takes just a single line of Symta code:
qsort@r$[] H,@T = @T.keep{?<H}^r,H,@T.skip{?<H}^rSymta's qsort is arguably more readable than Haskell's version:
qsort [] = []
qsort (x:xs) = qsort [y | y <- xs, y < x] ++ [x] ++ qsort [y | y <- xs, y >= x]