PureMetaFunctionalProof

Proof that C++ templates are effectively a pure functional programming language.

In order to prove this, the library reimagines many of Haskell's common types and functions to show that they can be implemented in C++'s template system.

---

TypeList

Like Haskell's basic [a] type, but operating on types rather than values.

Included Features:

• TypeList< Ts ... >
• EmptyTypeList
• Cons< T, TypeList< Ts ... > >
• Null< TypeList< Ts ... > >
• Length< TypeList< Ts ... > >
• Head< TypeList< Ts ... > >
• Tail< TypeList< Ts ... > >
• Last< TypeList< Ts ... > >
• Init< TypeList< Ts ... > >
• Concat< TypeList< Ts ... >, TypeList< Us ... > >
• Reverse< TypeList< Ts ... > >
• Map< template< typename > Z, U, TypeList< Ts ... > >
• Foldl< template< typename, typename > Z, U, TypeList< Ts ... > >
• Scanl< template< typename, typename > Z, U, TypeList< Ts ... > >
• Foldl1< template< typename, typename > Z, TypeList< Ts ... > >
• Scanl1< template< typename, typename > Z, TypeList< Ts ... > >
• Replicate< unsigned long long N, TypeList< Ts ... > >
• Elem< typename T, TypeList< Ts ... >
• NotElem< typename T, TypeList< Ts ... >

Planned Features:

• Foldr< template< typename, typename > Z, U, TypeList< Ts ... > >
• Scanr< template< typename, typename > Z, U, TypeList< Ts ... > >
• Uncons
• Intersperse
• Foldr1
• Scanr1
• Take
• Drop
• SplitAt
• TakeWhile
• DropWhile
• Inits
• Tails