Beginnings of K interpreter written in OCaml
github.com
github.com
Good hunting!
K/J/Q/APL2 and friends[0] have isolated iterative constructs that cover IME 98% of what's needed (each, fold, scan, fixed point, ...) in a way that's just as simple to analyze as recursion[1]. These languages do like DSLish for the first 10 or 20 examples you see - but by the 200th example, it is clear the domain it is specific to is "mostly everything"
[0] I'm not considering APL1 as part of the modern family - it had Fortran-style computed gotos for control flow.
[1] Although there's about 10 times as many of them, so it's not quite as elegant.