I'm currently working on a Haskell web framework that allows one to easily define all of the possible values dynamic content can take, generate all permutations of content (assuming the values are finite), and load them all into an in-memory cache to be fired off, pre-baked. Inspired by the idea of a pure function -- that is, a function that is given the same arguments should always return the same result (and have no side effects).

More general than a CMS, but the idea is similar.