Why oh why all the functional programmers I know use sExps. ;) You didn't guess the right expansion. I meant shortened expressions. Say a function called foral

Why oh why all the functional programmers I know use sExps. ;) You didn't guess the right expansion. I meant shortened expressions. Say a function called forallPerm. There are million better names most of which start by saying what it does. Even foldAllPermutations would be better (if you know what a fold is). If you're writing in M-expressions do it consistently. If it is logic proof, it is not functional. There I'd expect some lemma names. In plain English. The datatype called LTEL takes the cake.