uot; (show . fst) $ getLeftmost tree
You can also experiment with "zipping through" computations. It's as
simple as defining a new fclabel lens for a reversible computation,
e.g.:
> reversible :: (Show b, Read b) => b :-> String
> reversible = lens show (const . read)
Thanks,
Brandon Simmons
http://coder.bsimmons.name
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
This is the first *real* release `shapely-data`, a haskell library
up here on hackage:
http://hackage.haskell.org/package/shapely-data
for working with algebraic datatypes in a simple generic form made up of
haskell's primitive product, sum and unit types: `(,)`, `Either`, and `()`.
You can
