- Haskell-Cafe - Haskell.org

Generic permutations
by Cetin Sert 26 Jan '08

26 Jan '08

How can I make a generic permutations function? -- boolean permutations bpms :: Int → [[Bool]] bpms 0 = [[]] bpms n = map (False:) bss ++ map (True:) bss where bss = bpms (n - 1) -- generic permutations pms a :: Int → [[a]] Best Regards, Cetin Sert

3 6

Re: [Haskell-cafe] Re: Generic permutations with high performance
by Cetin Sert 26 Jan '08

26 Jan '08

Hello again Ryan, I have found out where to import those stuff from and tested your more elegant suggestion and my original performance. -- print ((length ∘ pmsO [0,1]) 24) 9~ seconds -- print ((length ∘ pmsE [0,1]) 24) 23~ seconds -- print ((length ∘ pmsU [0,1]) 24) 23~ seconds -- O: original, E: elegant, U: unreadable I prefer performance over elegance (and for me using monads almost feels like adding an unnecessary dependency to the definition of pms. Though I know I may be dead wrong on that. I just don't quite understand monads yet.) I would love to have you and/or others suggest more performant versions of pms (and maybe also come up with a better name for it). mnt :: [a] → [[a]] → [[a]] mnt [] _ = [] mnt _ [] = [] mnt (x:xs) yss = map (x:) yss ++ mnt xs yss pms :: [a] → Int → [[a]] pms [] _ = [[]] pms _ 0 = [[]] pms xxs n = mnt xxs (pms xxs (n - 1)) I generalized 'pms' from the 'bools' function on page 108 of Programming in Haskell (Hutton, 2007) -- Cetin Sert On 26/01/2008, Ryan Ingram <ryani.spam(a)gmail.com> wrote: > > When you say permuations, I think of reorderings of a list, for example: > > permutations [1,2,3] = > [ [1,2,3], > [1,3,2], > [2,1,3], > [2,3,1], > [3,1,2], > [3,2,1] ] > > Here's an implementation: > > -- split [1,2,3] => [ > -- ( 1, [2,3] ), > -- ( 2, [1,3] ), > -- ( 3, [1,2] ) ] > split :: [a] -> [(a, [a])] > split [] = error "split: empty list" > split [a] = [(a, [])] > split (a:as) = (a, as) : map prefix (split as) > where prefix (x, xs) = (x, a : xs) > > permutations :: [a] -> [[a]] > permutations [] = return [] > permutations xs = do > (first, rest) <- split xs > rest' <- permutations rest > return (first : rest') > > The problem you solved can be solved much more elegantly: > > pms : [a] -> Int -> [[a]] > pms xs n = foldM combine [] (replicate n xs) where > combine rest as = liftM (:rest) as > > or, for the unreadable version: > pms xs n = foldM (map . flip (:)) [] $ replicate n xs > > (note that, in the list monad, liftM = map). > > -- ryan >

1 0

Problem with HGL
by jia wang 26 Jan '08

26 Jan '08

Hi, I'm trying to use HGL-3.2.0.0 with ghc-6.8.2 on my windows system. When I run command: runhaskell Setup.hs build it shows an error D:\HGL-3.2.0.0\HGL-3.2.0.0>runhaskell Setup.hs build Preprocessing library HGL-3.2.0.0... Building HGL-3.2.0.0... Graphics/HGL/Key.hs:57:7: Could not find module `Graphics.Win32': it is a member of package Win32-2.1.1.0, which is hidden so, how to solve this problem, thanks

2 1

running into an unresolved linker error on RHEL 5
by Galchin Vasili 26 Jan '08

26 Jan '08

Hello, I am building the unix-2.2.0.0. The linker is failing with -lgmp. I set "export LD_LIBRARY_ATH=/bin:/usr/lib". I did a "ls -l /usr/lib/*gmp*" and I can see: libgmp.so.3 libgmp.so.3.3.3 libgmpxx.so.3 libgmpxx.so.3.0.5, i.e. either gmp shared objects and whatever the gmp "xx" shared objects are. So why is my link of unix-2.2.0.0 failing in DynamicLinker? Kind regards, Vasili

1 0

ANN: bytestringparser-0.2, a Parsec-like parser for lazy ByteStrings
by Bryan O'Sullivan 25 Jan '08

25 Jan '08

Some time ago, Jeremy Shaw wrote a Parsec clone for lazy ByteStrings. I've been using it for a while, and have made substantial changes to it along the way. It's very fast, using the same manual unpacking trick as the binary package to keep performance nippy. It also integrates with the latest flava in parsing combinators, Control.Applicative, providing instances of the Applicative and Alternative typeclasses. The API is rather smaller than that of Parsec, but it's more than adequate for parsing e.g. text-based network protocols. Download: http://hackage.haskell.org/packages/archive/bytestringparser/0.2/bytestring… Haddocks: http://darcs.serpentine.com/bytestringparser/dist/doc/html/bytestringparser… Darcs repository: darcs get http://darcs.serpentine.com/bytestringparser <b

1 0

HList error with hFoldr
by Denis Bueno 25 Jan '08

25 Jan '08

Hello all, I'm doing some machine learning in Haskell and have run into a problem. I have a generic distance function (declare in the MetricSpace) typeclass that returns the distance between two things as a number. I frequently will be working with heterogeneous collections of data, and if possible I'd like to write the distance function (overloaded) once for all. At the moment, I'm using HList to represent the collections of data uniformly. I wrote the following as a sanity check but I can't even get it to compile. The effect I'd like is that I can call `dist` on any two HLists which have the correct, corresponding element types in the correct positions, and `dist` will be recursively invoked to calculate the typical euclidean distance (squared sum of individual element distances, and at the and taking the square root). My attempt at doing this follows. For the moment my HLists only contain Ints. I'm using GHC 6.8.2 and HList 0.1. import HList class (Num i) => MetricSpace e i where dist :: e -> e -> i instance Num i => MetricSpace Int i where x `dist` y = fromIntegral $ abs (y - x) data ApplyDistSum = ApplyDistSum instance (MetricSpace e r) => Apply ApplyDistSum ((e, e), r) r where apply _ (p, v) = v + uncurry dist p -- Why should the following generate an error? testApplyDistSum = hFoldr ApplyDistSum 0 ((4,4) .*. hNil) {- The error: /Users/denbuen/edu/cornell/meng/classes/cs678/code/practice/Knn.hs:53:19: No instance for (Apply ApplyDistSum ((t, t1), r1) r) arising from a use of `hFoldr' at /Users/denbuen/edu/cornell/meng/classes/cs678/code/practice/Knn.hs:53:19-56 Possible fix: add an instance declaration for (Apply ApplyDistSum ((t, t1), r1) r) In the expression: hFoldr ApplyDistSum 0 ((4, 4) .*. hNil) In the definition of `testApplyDistSum': testApplyDistSum = hFoldr ApplyDistSum 0 ((4, 4) .*. hNil) -} Thanks in advance. -- Denis

1 0

Evolutionary Computing
by PR Stanley 25 Jan '08

25 Jan '08

Hi What does the list think of EC? Genetic algorithm is apparently the latest thing. Is EC mathematically reasonable? Paul

6 6

Fwd: ByteString Parsec clone
by Johan Tibell 25 Jan '08

25 Jan '08

I tried to get Dan's thoughts on cloning parts of the Parsec interface and some of the documentation but none of the emails addresses I've tried seem to work. What's allowed when it comes to duplicating something like an API? What about the documentation? I intend it to be released under BSD3 which I believe is used for Parsec as well. Anyone know how I can reach Dan? -- Johan ---------- Forwarded message ---------- From: Johan Tibell <johan.tibell(a)gmail.com> Date: Jan 22, 2008 2:56 PM Subject: ByteString Parsec clone To: daan(a)cs.uu.nl I've written, but yet not published, a ByteString version of parts of the Parsec API as a part of a web application server project. I've currently used almost the exact wording from your documentation (as the semantics of the functions is intended to be the same as in Parsec.) Are you OK with that? P.S. I intend to give my library a different name as it has different module structure and doesn't support a lot of Parsec's features. It will be BSD licensed. Best regards, Johan Tibell

2 2

Binary IO of a list of ints
by Jamie Love 25 Jan '08

25 Jan '08

Hi there I have a list of ints, with values between 0 and 255 and I need to print them out in little endian form to a file. I've been using Data.Binary for single values, e.g. runPut $ do put 'B' put (0 :: Int32) I'm wondering how I can go about writing a list of Ints out. My thought was to do something like: foldr (\x B.hPut output (runPut $ do put (x :: Word8))) data (where output is my file handle), but apart from giving me type errors, it seems a rather arduous way to do it. Could anyone suggest a better way to do this? -- Jamie Love Senior Consultant Aviarc Australia Mobile: +61 400 548 048 ------------------------------------------------------------ This message has been scanned for viruses and dangerous content by MailScanner and is believed to be clean.

4 5

ANNOUNCE: Harpy 0.4 - Runtime code generation for x86 machine code
by Martin Grabmueller 24 Jan '08

24 Jan '08

We are pleased to announce the release of Harpy 0.4, a library for runtime code generation for x86 machine code. Harpy is available from Hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/harpy-0.4 Also see Harpy's homepage, which features two tutorials and access to the darcs repo (and to the Haddock documentation, until it is available from Hackage, too): http://uebb.cs.tu-berlin.de/harpy/ Harpy is supposed to be built with GHC 6.8 and GHC 6.6 (with Cabal 1.2 or greater). Please report any build problems you encounter. This release features the following additions and fixes: - New convenience top-level module "Harpy", which re-exports Harpy.CodeGenMonad, Harpy.Call and Harpy.X86Assembler - It is now possible to override Harpy's automatic code buffer management. The new field 'customCodeBuffer' in the type 'CodeGenConfig' can be set to 'Just (buf, size)', where 'buf' is a pointer to a memory region of 'size' bytes. Harpy will then use the supplied code buffer and will not perform any automatic code buffer allocation on overflow. Overflow checking is still performed and will result in an exception in the CodeGen monad. - When using the high-level assembler in X86Assembler, the code buffer is automatically protected from overflow. - Floating point operations added to X86Assembler (only for double operands yet). - Preliminary support for SSE instructions. Currently, only the packed and scalar floating-point arithmetic operations are supported (both in the low-level module Harpy.X86CodeGen and as methods in Harpy.X86Assembler) - Code buffer default size has been increased from 128 to 4096 bytes. - The CodeGenMonad fails when a label is defined twice. - It is now possible to associate names with labels, using the new operation newNamedLabel. The given names will show up in the disassembly, which makes debugging of generated code much easier. - The doc directory contains a second, slightly larger tutorial now. - The examples/evaluator directory contains a small example interpreter for arithmetic expressions, which translates expressions entered at the keayboard to machine code on the fly. This is the demo program we presented at the Haskell Workshop 2007. Happy Haskell Hacking with Harpy, Martin and Dirk

2 1