Hi,
with the boilerplate style one can build terms while exploring permutations.
This can accommodated as a generic program.
An illustrative code snippet follows.
Let's define a function that builds a datum "a" while reading constructor
strings via a monad. Hence the function is of the following t
> So my question is, is there any method in GHC which allows you to
> extract the order of the constructors in a type or to parse a
> type-representation in such a way that the order of the records doesn't
> matter (I am looking for ease/simplicity of use)?
If you happen to use Parsec for parsing
I am currently trying to implement a method of allowing arbitrary record
syntax data-types to be converted to and from an XML representation of
them using the Read and Show class;
i.e. simply derive either Show and then parse the given String to
extract the name/value pairs which can then be conv
