@Goten : I’ve only implemented typelists like lists are implemented in Haskell, thus providing the functions we use the most in Haskell. I didn’t want my code to be a copy of Andrei Alexandrescu’s one in Modern C++ Design. That’s all.

@3DArchi : You can find many such projects. For example, there is a SCM written in Haskell, a Window Manager for Linux, 3D games, Linux kernel modules, etc etc.
You really should consider browsing the Haskell wiki on the “real world functional programming” pages. And by the way, using FP over C++ templates is basically what boost.mpl, boost.fusion and all do. Since there are no side effects at compile-time, and that we use functional structures, all we do with C++ templates is functional programming

Despite I was already using typelists it’s always a pleasure to read you :p.
Your examples of algorithms on typelists are clearly oriented haskell-like array function. It’s really interesting for the algorithm part. You also could have write about typeAt or replace algorithms which can be really useful when you use Typelist.
At last, you could have explain for what typelist are useful (like emulating variadic templates).
But again it’s really great, looking forward for new articles, thanks.

This post was mentioned on Twitter by alpmestan: Functional compile-time templates based type lists in C++: http://wp.me/pEB41-17…