Re: [Haskell-cafe] computation over containers, greatly simplified notation.

2012-12-01 Thread Takayuki Muranushi
Thank you Jason, I have implemented those. https://github.com/nushio3/practice/blob/master/free-objects/zipn-03.hs I implemented what I have wanted. It is forZN in the following code. https://github.com/nushio3/practice/blob/master/free-objects/zipf-05.hs forZN, much like printf, can be used in

Re: [Haskell-cafe] computation over containers, greatly simplified notation.

2012-12-01 Thread Takayuki Muranushi
Dear all, https://github.com/nushio3/practice/blob/master/free-objects/zipf-12.hs I was finally able to remove the verbose type annotations. The point was (1) to let the argument-list carry the type-constructor information, so that only values of the type (v a) can enter the heterogeneous list;

Re: [Haskell-cafe] computation over containers, greatly simplified notation.

2012-11-30 Thread Takayuki Muranushi
Dear everyone, After a number of attempts [1] I'm starting to think that my initial approach was ill-directed. After all, Functor, Applicative, Zip are three different classes. Functors are type constructors where you can map unary functions over them. Applicatives are those with map-over of

Re: [Haskell-cafe] computation over containers, greatly simplified notation.

2012-11-30 Thread Jason Dagit
You might find this paper an interesting read: http://www.brics.dk/RS/01/10/ On Fri, Nov 30, 2012 at 4:43 PM, Takayuki Muranushi muranu...@gmail.comwrote: Dear everyone, After a number of attempts [1] I'm starting to think that my initial approach was ill-directed. After all, Functor,