- Haskell-Cafe - Haskell.org

[ANN] tls-extra 0.6.1 - security update, please upgrade.
by Vincent Hanquez 22 Jan '13

22 Jan '13

Hi cafe, this is a security advisory for tls-extra < 0.6.1 which are all vulnerable to bad certificate validation. Some part of the certificate validation procedure were missing (relying on the work-in-progress x509 v3 extensions), and because of this anyone with a correct end-entity certificate can issue certificate for any arbitrary domain, i.e. acting as a CA. This problem has been fixed in tls-extra 0.6.1, and I advise everyone to upgrade as soon as possible. Despite a very serious flaw in the certificate validation, I'm happy that the code is seeing some audits, and would want to thanks Ertugrul Söylemez for the findings [1]. [1] https://github.com/vincenthz/hs-tls/issues/29 -- Vincent

3 5

regular expression sub-expression matching
by Nicolas Bock 22 Jan '13

22 Jan '13

Hello list, I was wondering whether there is a way to do what the following python code does in haskell: import re result = re.compile("M$([0-9]+),([0-9]+)$ *= *([0-9.eE-]+);").search("M(1,2) = 0.1e-3;") if result: print(result.group(1), result.group(2), result.group(3)) Basically I would like to pattern match parts of a string and return the matches. I have looked at Text.Regex.Posix but (of course I might just not have understood the functions in there properly) it seems as if it does not provide anything like python's re module. Thanks already, nick

3 3

XCode Dependency for HP on Mac
by Tom Murphy 21 Jan '13

21 Jan '13

This may sound ignorant because, well, it is ignorant: I know very little about the underlying mechanics here. Installing the Haskell Platform currently requires XCode developer tools. To get XCode on my 10.6 machine, I... [*** begin ranty details (skippable) ... was told I could get a free version by registering as an Apple Developer. So I lie on the forms (phone number and address, for example, are _required_ fields!), and lie on the _required_ 2-3 page survey. I put in a code that they sent to my email (couldn't lie on that!), and log in. The page tells me, in the exact box that told me if I registered I could get XCode for free, that I... *** end ranty details] ...have to either pay to upgrade to their newer OS (10.7: Lion), or pay $99/year for a Mac OS Developer Membership. Is there a way to install HP without XCode? Could there be in the future? I'm tired of dealing with Apple's constant upgrade requirements, registration requirements, etc., and it seems like a small function that XCode actually performs in the Haskell development "toolchain." Again, I'm ignorant of the details and I'm sorry if this is ranty, but I'd love to hear your reactions. Thanks! Tom

16 26

ANN: Hquery 0.1
by Tycho Andersen 21 Jan '13

21 Jan '13

Hi cafe, I've written a library called hquery, which can be used to manipulate xmlhtml trees (and has a similar selector syntax to jquery, hence the name). This enables easy manipulation and content generation from html templates. If you're familiar with Lift's CssSels, this is basically an implementation of those in haskell. This is my first foray into haskell, so any critiques of the code or API are welcome :-) Hquery: http://hackage.haskell.org/package/hquery-0.1.0.1 Examples: http://hackage.haskell.org/packages/archive/hquery/0.1.0.1/doc/html/Text-Hq… \t

1 0

forkProcess, forkIO, and multithreaded runtime
by Michael Snoyman 21 Jan '13

21 Jan '13

Hi all, I think I have a misunderstanding of how forkProcess should be working. Ultimately this relates to some bugs in the development version of keter, but I've found some behavior in a simple test program which I wouldn't have expected either, which may or may not be related. With the program at the end of this email, I would expect that, once per second, I would get a message printed from each forkIO'd green thread, the forked process, and the master process. And if I spawn 8 or less child threads that's precisely what happens. However, as soon as I up that number to 9, the child process is never run. The process is, however, created, as can be confirmed by looking at the process table. This only occurs when using the multithreaded runtime. In other words, compiling with "ghc --make test.hs" seems to always produce the expected output, whereas "ghc --make -threaded test.hs" causes the behavior described above. Having looked through the code for the process package a bit, my initial guess is that this is being caused by a signal being sent to the child process, but I'm not familiar enough with the inner workings to confirm or disprove this guess. If anyone has any ideas on this, I'd appreciate it. Michael import System.Posix.Process (forkProcess, getProcessID) import Control.Concurrent (forkIO, threadDelay) import System.IO (hFlush, stdout) import System.Posix.Signals (signalProcess, sigKILL) import Control.Exception (finally) main :: IO () main = do mapM_ spawnChild [1..9] child <- forkProcess $ do putStrLn "starting child" hFlush stdout loop "child" 0 print ("child pid", child) hFlush stdout -- I've commented out the "finally" so that the zombie process stays alive, -- to prove that it was actually created. loop "parent" 0 -- `finally` signalProcess sigKILL child spawnChild :: Int -> IO () spawnChild i = do _ <- forkIO $ loop ("spawnChild " ++ show i) 0 return () loop :: String -> Int -> IO () loop msg i = do pid <- getProcessID print (pid, msg, i) hFlush stdout threadDelay 1000000 loop msg (i + 1)

12 19

Up-front Unit Testing in Haskell
by Kazu Yamamoto 21 Jan '13

21 Jan '13

#Resending due to the lack of URL. Hello cafe, Just FYI: I wrote an tutorial, "Up-front Unit Testing in Haskell". It is about how to use doctest, hspec and Cabal. https://github.com/kazu-yamamoto/unit-test-example/blob/master/markdown/en/… Enjoy! --Kazu

3 2

Up-front Unit Testing in Haskell
by Kazu Yamamoto 21 Jan '13

21 Jan '13

Hello cafe, Just FYI: I wrote an tutorial, "Up-front Unit Testing in Haskell". It is about how to use doctest, hspec and Cabal. Enjoy! --Kazu

2 2

Re: [Haskell-cafe] [Haskell] Silent error
by Henning Thielemann 21 Jan '13

21 Jan '13

On Mon, 21 Jan 2013, miphis(a)meta.ua wrote: > The program looks like this: > > --*********************** > factorial :: Int->Int > factorial n = product [1..n] > > main = do > print $ factorial 50 > --*********************** > > And that yields "0" (no errors). Is it a bug or feature? :) This question is certainly better posted to haskell-cafe. The answer is: Int has limited bitsize (32 ord 64 bit depending on your machine), thus it computes factorial modulo 2^32 or 2^64. You can get the correct result by replacing Int by Integer.

1 0

"Function decoration pattern" on wiki
by Derek Elkins 20 Jan '13

20 Jan '13

I created the following page on the wiki to capture one pattern that occurs often in Edward Kmett's lens library. http://www.haskell.org/haskellwiki/Function_decoration_pattern Feel free to rename it or add comments, examples, clarifications, additional notes or extensions to the technique.

1 0

Duplicates in arbitrary instances for collections
by Tom Murphy 20 Jan '13

20 Jan '13

Every QuickCheck tutorial makes the point that, given a property on some type, the Arbitrary instance for that type is written in such a way that nearly all of the interesting edge-cases of that type are tried. So e.g. for numeric types, positive, negative, and zero numbers are tried. For collections, I think the case of duplicate elements is insufficiently covered. Say we have a list difference function: badDiff :: Eq a => [a] -> [a] -> [a] badDiff l r = filter (\e -> e `notElem` r) l And a test for it: prop_wrong :: [Int] -> [Int] -> Bool prop_wrong a b = (a `badDiff` b) == (a \\ b) `quickCheck prop_wrong` passes about 80% of the time! Obviously it shouldn't: > badDiff [1,2,3,3,3] [2,3] [1] > (\\) [1,2,3,3,3] [2,3] [1,3,3] But even with maxSuccess at 1000, this property passes at least 2/3 of the times it's run (on my machine, where (maxBound :: Int) is large). The reason is that `arbitrary` for [a] is just `sized $ \n -> choose (0,n) >>= \k -> sequence [arbitrary | _ <- [1..k]]` It would be trivial to duplicate values in the collection a certain percentage of the time (possibly sometimes adjacent). Is there a good reason not to? It shouldn't require an Eq constraint. Tom

1 0