@ertesx @pigworker f x is of type C. I just translated this code with no attempt to understand it…
-
-
Replying to @edwinbrady
@edwinbrady@pigworker Then it will probably not do what a Haskeller would expect with RankNTypes: f :: (∀ a. F a -> G a) → …1 reply 0 retweets 0 likes -
Replying to @ertesx
@ertesx@edwinbrady Insufficient bandwidth. No clue what's going on.2 replies 0 retweets 0 likes -
Replying to @pigworker
@pigworker@edwinbrady f in the above case specifically wants a function that expects a type argument. The implicit must be preserved.1 reply 0 retweets 0 likes -
Replying to @ertesx
@ertesx There are two different f's above. Please restart, ensuring freshness of names.@edwinbrady1 reply 0 retweets 0 likes -
Replying to @pigworker
@pigworker@edwinbrady I've just installed Idris. Let me try to convert my thoughts into a module I can paste.2 replies 0 retweets 0 likes -
Replying to @ertesx
@ertesx@edwinbrady That'll help, thanks. My expectation is that {x : A} -> ... should work a lot like forall in Haskell, inference-wise.1 reply 0 retweets 0 likes -
Replying to @pigworker
@pigworker@edwinbrady I had to do it in Agda, because Idris wouldn't accept Edwin's version. http://lpaste.net/1296962 replies 0 retweets 0 likes -
Replying to @ertesx
@ertesx@pigworker My version is pasted from a working version in Idris1 reply 0 retweets 0 likes -
Replying to @edwinbrady
@edwinbrady I did not doubt that it works. I was wondering whether it would work in the context of a function with higher-rank implicits.1 reply 0 retweets 0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.