rank 2-polymorphism and type checking
Wed, 24 Oct 2001 08:48:33 -0700
PS to my earlier message. I am not at all certain that=20
the Odersky/Laufer thing would in fact solve Janis's problem.
You want not only a rank-3 type, but also higher-order unification,
since you want to instantiate 't' to
\c. forall d . (c->d) -> d -> d=20
That may just be too hard. But I'm out of my depth here.=20
Maybe a types expert can help.
| -----Original Message-----
| From: Simon Peyton-Jones [mailto:firstname.lastname@example.org]=20
| Sent: 24 October 2001 09:08
| To: Janis Voigtlaender; email@example.com
| Subject: RE: rank 2-polymorphism and type checking
| Here's the story
| * GHC understands only rank-2 types; your type is rank 3
| * The reason for this is that type inference for higher-rank=20
| types is tricky.
| GHC just squeezes through the door with rank-2 types by=20
| using a neat
| hack, but the hack just doesn't cope with higher ranks at all.
| * GHC 4.08 didn't *check* that the type is rank-2, whereas=20
| ghc 5.02 does.
| So all versions of your program will be rejected by GHC now, before
| it ever gets to type checking.
| * It's true that your test' *does* typecheck in GHC 4.08, but=20
| it's a coincidence!
| Certain very special programs will work even with higher=20
| rank types, but
| its jolly hard to explain which, so GHC 5 chucks them all out.
| * Nevertheless your program makes perfect sense. I believe=20
| that the Right
| Thing to do is to adopt Odersky/Laufer's idea of "Putting=20
| Type Annotations
| To Work" (POPL 96). They show how to typecheck=20
| arbitrarily high rank
| type provided there are enough type annotations, and Mark=20
| Shields has
| recently explained it all to me. But implementing this=20
| would be real work.
| So I'm interested to know: if GHC allowed arbitrarily-ranked=20
| types, who would use them?
| | -----Original Message-----
| | From: Janis Voigtlaender [mailto:firstname.lastname@example.org]
| | Sent: 24 October 2001 08:00
| | To: email@example.com
| | Subject: Re: rank 2-polymorphism and type checking
| | Iavor S. Diatchki writes:
| | > > > test :: (forall t . (forall a . t a) -> t b) -> b -> b
| | > i am not an expert on this, but isnt this rank 3?
| | Might be. Does this mean I cannot write it in Haskell? But, with
| | data T a =3D C
| | I can write:
| | test' :: (forall t . (forall a . t a) -> t b) -> b -> b =20
| test' g x =3D=20
| | case g C of C -> x
| | Here, the type checker finds out on its own that t is
| | instantiated to T. Still,=20
| | why are the annotations in the following code not enough to=20
| | let it also accept=20
| | the definition of "test" (see my earlier message),=20
| | respectively how can I tell=20
| | it that t should be instantiated to t c =3D forall d . (c->d)=20
| | -> d -> d ?
| | test :: (forall t . (forall a . t a) -> t b) -> b -> b
| | test g x =3D (g :: (forall a . (forall d . (a->d) ->=20
| | d -> d)) ->
| | (forall e . (b->e) -> e -> e))
| | ((\f y -> y) :: (forall a . (forall d . (a->d) ->=20
| | d -> d)))
| | (id :: (b -> b))=20
| | (x :: b)
| | --
| | Janis Voigtlaender
| | http://wwwtcs.inf.tu-dresden.de/~voigt/
| | mailto:firstname.lastname@example.org
| | _______________________________________________
| | Haskell mailing list
| | Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
| Haskell mailing list
| Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell