> My point is that there are some things that can't easily be expressed
> in current Haskell (like generic printing) that are useful and
> might be aided by meta-programming technology. The interesting question
> is can it be done in a way that preserves whatever we want from the type
> system: sa
The page
http://www.haskell.org/ghc/docs/latest/set/generic-classes.html
starts with the text
(Note: support for generic classes is currently broken in GHC 5.02).
and I know from testing earlier versions that the generic-classes support
was pretty buggy. Is there any hope of a revival? Doe
> You don't need meta-programming technology (reflection) to do things like
> generic prinitng. A generic programming extension of Haskell (like
> Generic Haskell, or derivable classes) can do the job for you.
Isn't generic programming usually based on a kind of compile-time
reflection (if the ar
>> You don't need meta-programming technology (reflection) to do things
>> like
>> generic prinitng. A generic programming extension of Haskell (like
>> Generic Haskell, or derivable classes) can do the job for you.
>
> Isn't generic programming usually based on a kind of compile-time
> reflectio
| and I know from testing earlier versions that the
| generic-classes support was pretty buggy. Is there any hope
| of a revival? Does it already work in CVS? I suspect it will
| rot away if nobody works on it.
|
| Any comments from the implementors - does the idea "fit well"
| with ghc? Is i
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wednesday 20 February 2002 08:46, Bernard James POPE wrote:
>
> There are numerous ways to provide security for your data types.
(In)Visibility isn't security. I have more than often witnessed Java users
who thought "private" keyword was for secu
Hi,
I'm trying out some combinatorial parsers, and I ran into a slightly
inelegant construction. To parse a sequence of things, we have a function
like
pThen3 :: (a->b->c->d) -> Parser a -> Parser b -> Parser c -> Parser d
pThen3 combine p1 p2 p3 toks =
[(combine v1 v2 v3, toks3) | (v1
Mark Wotton writes:
| Hi,
|
| I'm trying out some combinatorial parsers, and I ran into a slightly
| inelegant construction. To parse a sequence of things, we have a function
| like
|
| pThen3 :: (a->b->c->d) -> Parser a -> Parser b -> Parser c -> Parser d
| pThen3 combine p1 p2 p3 tok
On Wed, Feb 20, 2002 at 01:15:36PM -0800, Simon Peyton-Jones wrote:
> Another possiblity would be to make the ConCls class look like this
> class ConCls c where
> name :: String
> arity :: Int
> ...etc...
>
> Now we'd have to give an explicit type argument at the ca
