Boolean Function Analysis, the study of functions on the Boolean cube {0,1}^n, forms an essential part of the "theoretician's toolkit". Recently, functions on other domains (such as the Grassmann scheme) have been studied along similar lines, motivated by applications to TCS and combinatorics. I will discuss this nascent field, Discrete Harmonic Analysis, and some of the domains it has been studied on.