Crypt Master wrote:

I recently had to implement an algorthm in C, and found the time to give it a go in Haskell to aid in learning haskell.

I found myself "needing" runtime meta information on data types (well tuples which are data (a,b) = (a,b)). Does haskell allow this ?

<snip absolutely normal example>

So what is the general haskell approach to this type of introspection/meta data problem... ?

Introspection in Haskell is provided by the Data.Generics module. Try `deriving Data' and go wild (everybody else has). Jon Cast