Raoul Duke wrote:
>> map :: forall a b %r0 %r1 !e0 $c0
>> . (a -(!e0 $c0)> b) -> List %r0 a -(!e1 $c1)> List %r1 b
>> :- !e1 = !{ !Read %r0; !e0 }
>> , $c1 = f : $c0
>>
>
> boy oh boy it will take a while for people in general to get to the
> point of really groking such notations and being able to work smoothly
> with it i think.
>
Indeed. However, looking at DDC, it seems that this information is
rather hidden - you don't need to see this information unless you ask to
see it. :-) Notice above that the type signature given by the programmer
is the same as in Haskell. This is also an experimental language, so
they may change the syntax as they go forward.
Thanks,
PKE.
--
Pål-Kristian Engstad ([EMAIL PROTECTED]),
Lead Graphics & Engine Programmer,
Naughty Dog, Inc., 1601 Cloverfield Blvd, 6000 North,
Santa Monica, CA 90404, USA. Ph.: (310) 633-9112.
"It is better to have 100 functions operate on one data structure
than 10 functions [each operate] on 10 data structures." -- NN
_______________________________________________
bitc-dev mailing list
[email protected]
http://www.coyotos.org/mailman/listinfo/bitc-dev
