Thanks, I think I understand it now.
Do you know why they switched over in GHC 6.6?
-Kangyuan Niu
On Fri, Jul 6, 2012 at 3:11 AM, o...@okmij.org wrote:
Kangyuan Niu wrote:
Aren't both Haskell and SML translatable into System F, from which
type-lambda is directly taken?
The fact
taken? What does the translation for the above code even look
like? Why isn't it possible to write something like:
fun 'a revap (Ap (xs : 'a list) f) = f ys
where
ys :: 'a list
ys = reverse xs
in SML?
-Kangyuan Niu
___
Haskell
