For language design, fp tends to make things a lot easier to represent. Any parser-type application is going to be a recursive structure with a lot of continuat

For language design, fp tends to make things a lot easier to represent. Any parser-type application is going to be a recursive structure with a lot of continuations which is the natural way of coding in a functional lang. If you ever look into language design or compilers, you'll see that things are generally written as sum types in bnf, cnf, etc [0]. Basically all fp langs implement sum types, so you can practically translate theory 1-1 into code. I guess you could think of a level editor as a type of language, it's just so minimal that I don't. [0] http://www.cs.man.ac.uk/~pjj/farrell/comp2.html http://www.cs.man.ac.uk/~pjj/farrell/comp2.html