[Haskell-cafe] A practical Haskell puzzle

[Eric Mertens]

There were a number of emails discussing what a type-safe list solution
would like look. This was the approach that first came to mind when I read
your email (but I've had my head in Agda lately)

http://hpaste.org/44469/software_stack_puzzle

I've written up a minimal working example of this approach for those that
are curious.


As for the Haskell98 approach, I'd love to see a solution that didn't
require deserialization/serialization at each layer boundary. This sounds
like a case for the techniques used in list fusion, but GHC RULES are hardly
Haskell98 :-) I'd also like to avoid cramming all of the possible layer
input and output types into one giant ADT in such a solution.

-- 
Eric Mertens
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110303/4c2e6d48/attachment.htm>