[Haskell-cafe] Re: Rigid types fun

2010-11-05 Thread Bulat Ziganshin
Hello Mitar, Friday, November 5, 2010, 12:45:21 PM, you wrote: from - newChan for - newChan let nerve = Nerve (Axon from) (AxonAny for) create = do from - newChan for - newChan return$ Nerve (Axon from) (AxonAny for) main = do nerve - create ... -- Best

[Haskell-cafe] Re: Rigid types fun

2010-11-05 Thread Mitar
Hi! On Fri, Nov 5, 2010 at 10:49 AM, Bulat Ziganshin bulat.zigans...@gmail.com wrote: Friday, November 5, 2010, 12:45:21 PM, you wrote: from - newChan for - newChan let nerve = Nerve (Axon from) (AxonAny for) create = do from - newChan            for - newChan            return$ Nerve

[Haskell-cafe] Re: Rigid types fun

2010-11-05 Thread Alexey Khudyakov
On 05.11.2010 14:08, Mitar wrote: So I know I can move some hard-coded combination into a function. But I would like to cover all combinations and tell with arguments which combination I want. I'm not sure what do you exactly want. But what about applicative functors? They offer nice notation

[Haskell-cafe] Re: Rigid types fun

2010-11-05 Thread Mitar
Hi! On Fri, Nov 5, 2010 at 12:50 PM, Alexey Khudyakov alexey.sklad...@gmail.com wrote: I'm not sure what do you exactly want. But what about applicative functors? They offer nice notation Nerve $ (Axon $ newChan) * (AxonAny $ newChan) Ooo. That is nice. Mitar