Re: [Haskell] Fixpoint combinator without recursion
5 Apr
2007
5 Apr
'07
4:41 a.m.
Mike,
For those of us who aren't type theorists: What's a "negative datatype"?
A type that has a recursive call in negative position. Negative positions are the argument positions in function types. (But if a function type appears in a negative position, then its own argument position is denoted positive and its result position negative.) Cheers, Stefan
6803
Age (days ago)
6803
Last active (days ago)
0 comments
1 participants
participants (1)
-
Stefan Holdermans