Steve Downey schrieb:
The STL, however, brings a very applicative programming model into an otherwise imperative language. And, it turns out that the template language is a turing complete pure functional language, making possible some very interesting type based metaprogramming.
AFAIK there's some limitation built into the template language (nesting depth or something) that makes the template language Turing-incomplete.
Regards, Jo _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
