I am new to SML of NJ and I need to check if a given string is a pangram or not. A pangram is a sentence that contains at least one of every letter of the alphabet.
So it would have to contain at least one of each of the following "abcdefghijklmnopqrstuvwxyz". How would you do such a thing in sml?