On Tue, Oct 23, 2012 at 5:53 AM, Myles C. Maxfield myles.maxfi...@gmail.com
wrote:
I am the author/maintainer of the 'punycode' hackage package. After 4
months, I just found that punycode conversion already exists in the
Data.Encoding.BootString package inside the 'encoding' package. I'd like
The last revision of the encoding package (0.6.7.1) was uploaded 6
days ago, so it's certainly not old. The package is also not
unwieldly: the functions (runPut . encode punycode) and (runGet
(decode punycode)) are equivalent to my 'encode' and 'decode'
functions. In addition, it supports many
Hi Cafe,
I was playing with the classic example of a Foldable structure: Trees.
So the code you can find both on Haskell Wiki and LYAH is the following:
data Tree a = Empty | Node (Tree a) a (Tree a) deriving (Show, Eq)
instance Foldable Tree where
foldMap f Empty = mempty
foldMap f
And HList paper left me with two questions. The first one is how much
such an encoding costs both in terms of speed and space. And the
second one is can I conveniently define a Storable instance for
hlists. As I said before, I need all this machinery to parse a great
number of serialized
Le 23 oct. 2012 09:54, Alfredo Di Napoli alfredo.dinap...@gmail.com a
écrit :
What this code does is straighforward. I was struck from the following
sentences in LYAH:
Notice that we didn't have to provide the function that takes a value
and returns a monoid value.
We receive that function as
Andreas Abel wrote:
I tell them that monads are for sequencing effects; and the
sequencing is visible clearly in
() :: IO a - IO b - IO b
(=) :: IO a - (a - IO b) - IO b
but not in
fmap :: (a - b) - IO a - IO b
join :: IO (IO a) - IO a
Indeed! I'd like to point out an old
-- Forwarded message --
From: Alfredo Di Napoli alfredo.dinap...@gmail.com
Date: 23 October 2012 10:35
Subject: Re: [Haskell-cafe] A clarification about what happens under the
hood with foldMap
To: Chaddaï Fouché chaddai.fou...@gmail.com
I'm sure I'm missing a point, but the
I was playing with the classic example of a Foldable structure: Trees.
So the code you can find both on Haskell Wiki and LYAH is the following:
data Tree a = Empty | Node (Tree a) a (Tree a) deriving (Show, Eq)
instance Foldable Tree where
foldMap f Empty = mempty
foldMap f (Node
On Tue, Oct 23, 2012 at 10:36 AM, Alfredo Di Napoli
alfredo.dinap...@gmail.com wrote:
I'm sure I'm missing a point, but the minimum definition for a Foldable
instance is given in terms of foldMap, so I get the cake for free, foldr
included, right?
In the example I have defined my treeSum as:
On Thu, Oct 18, 2012 at 11:49:08PM +0530, niket wrote:
I am a novice in Haskell but I would love to see the gurus out here
teaching Haskell on MOOCs like Coursera or Udacity.
Dr Martin Odersky is doing it for Scala here:
https://www.coursera.org/course/progfun
I would love to see Haskell
Hi.
I am using hsql-(mysql-)1.8.2
When compiled with ghc-7.6, the resulting executable
does not seem to be able to read strings from the DB correctly
(umlauts do vanish)
while it worked with hsql-(mysql-)1.8.1 and ghc-7.4.
the mysql server says (show variables)
| character_set_client
Thanks guys,
I'll work my way through Oleg's paradox as well as what you just said
Chaddai.
I'm very busy right now, but I'll probably come back to you tomorrow
morning, when I'll have an hour to think freely :)
Cheers,
A.
___
Haskell-Cafe mailing list
Hi,
I can't say anything about HSQL, but I use HDBC and I'm happy with it.
[1] says it's the most popular database for Haskell.
Best, Daniel
[1] http://en.wikibooks.org/wiki/Haskell/Database
Am 10/23/12 4:21 PM, schrieb Johannes Waldmann:
Hi.
I am using hsql-(mysql-)1.8.2
When compiled
Hello -cafe,
There's a very cool Haskell job opening at Functor AB, involving some cool
type theory, for use in nuclear fusion research.
You can read about it here:
http://alpmestan.com/posts/2012-10-23-haskell-job-opening-at-functor.html
--
Alp Mestanogullari
On Tue, Oct 23, 2012 at 1:53 AM, Myles C. Maxfield
myles.maxfi...@gmail.com wrote:
Is there a better way to make this algorithm discoverable?
How about deprecation pragmas?
http://www.haskell.org/ghc/docs/7.2.2/html/users_guide/pragmas.html
--
gwern
http://www.gwern.net
Hey everyone,
I changed my code I now I get the following error message
Main: thread blocked indefinitely in an MVar operation
Before the change, I was using the State monad with runState.
Then, I changed the code to use the StateT monad transformer wrapped
around IO monad and runStateT.
On Tue, Oct 23, 2012 at 5:03 PM, José A. Lopes jose.lo...@ist.utl.pt wrote:
Hey everyone,
I changed my code I now I get the following error message
Main: thread blocked indefinitely in an MVar operation
Before the change, I was using the State monad with runState.
Then, I changed the
From: Alfredo Di Napoli alfredo.dinap...@gmail.com
Subject: [Haskell-cafe] A clarification about what happens under the
hoodwith foldMap
I'm sure I'm missing a point, but the minimum definition for a Foldable
instance is given in terms of foldMap, so I get the cake for free,
On Tue, Oct 16, 2012 at 9:37 PM, AUGER Cédric sedri...@gmail.com wrote:
As I said, from the mathematical point of view, join (often noted μ in
category theory) is the (natural) transformation which with return (η
that I may have erroneously written ε in some previous mail) defines a
monad
19 matches
Mail list logo
