- Haskell-Cafe - Haskell.org

working with Random.randoms
by Stephen Howard 18 Jun '08

18 Jun '08

Hi List, I am a newcomer doing my obligatory struggling with Haskell's type system, and I've got a nut I've not been able to crack. Given: import Random random_test :: Int -> String random_test n = do g <- getStdGen take n (randoms g)::String I'm expecting that I ought to be able to pass this action an integer and get back a random string that long (given, not all characters may be printable). But GHCI tells me: RandomTest.hs:7:4: Couldn't match `[]' against `IO' Expected type: [] Inferred type: IO In a 'do' expression: g <- getStdGen In the definition of `random_test': random_test n = do g <- getStdGen take n (randoms g) :: String And yet, when I run these lines in GHCI by hand, things seem to work (though the string is the same set of random characters each time, another bit that I need to solve): Prelude> :module Random Prelude Random> g <- getStdGen Prelude Random> take 5 (randoms g)::String "\1025049\315531\882767\1032009\334825" I'm guessing that randoms is returning an IO type but I'm not sure how to go about extracting the String to return to the calling action. Changing the type signature to Int -> IO String only gives me a different error. Where am I going wrong? thanks, Stephen

5 6

Re: [Haskell-cafe] Lambda and closures in PHP -- could someone please comment?
by PR Stanley 18 Jun '08

18 Jun '08

Blimey! Talk about rearranging the deckchairs :-) With respect, do you not think it'd be wiser for the community to deal with a total lack of proper type checking, the lack of any notion of the general concept of a function, or a whole range of other fundamental issues in PHP first before worrying about closures and lambda functions? I'm no language purist but PHP really does take the biscuit. My personal views and not in any way representing the list . Paul At 17:45 17/06/2008, you wrote: >Hi, > >The PHP community is discussing the adding of closures and lambdas to >the language, see the proposal at http://wiki.php.net/rfc/closures > >If someone with knowledge of both languages could take a quick look it >would be great. > >Thanks a lot > >Karoly Negyesi > >Ps. I am not a member of the PHP internals team, I am just a PHP >developer but I am very very interested in getting these in my >favourite language. >_______________________________________________ >Haskell-Cafe mailing list >Haskell-Cafe(a)haskell.org >http://www.haskell.org/mailman/listinfo/haskell-cafe

15 27

Something like scan1
by Achim Schneider 18 Jun '08

18 Jun '08

Is there a generalisation of scan1, such that eg. foo (+) [0,1] (1,2) = [0,1,1,2,3,5,8,13,...] ? I came up with it while thinking about the equivalence of laziness and strictness resp. pull and push. To be more specific, I was thinking about ArrowLoop and how that beast generalises over time-varying values. It's some kind of helixoid fixed point (which might not help at all if your visualisation is incompatible with mine). -- (c) this sig last receiving data processing entity. Inspect headers for past copyright information. All rights reserved. Unauthorised copying, hiring, renting, public performance and/or broadcasting of this signature prohibited.

2 3

Haskell data types and Storable class
by Galchin, Vasili 18 Jun '08

18 Jun '08

Hello, I am reading the FFI spec. Something is unclear to me. Let's assume we have data A = {b:B, .......} and data B ={ .............} both of which belong to class Storable. In the A instance of Storable I want to do a poke and peek of "b" into and out-of, respectively, B. How do I write the poke and peek function of "b" in the "instance Storable A"? thank you, Vasili

2 1

Re: [Haskell-cafe] Lambda and closures in PHP -- could someone please comment?
by PR Stanley 18 Jun '08

18 Jun '08

> > Now, if you, Jules, Alex or some other wannabe Hitler have a problem with > > my freedom of expression then your best solution is to saddle up > and get the > > hell out yourselves. This is the wrong place for setting up your tinpot > > dictatorship, Doctor! > >Just more evidence... > >http://en.wikipedia.org/wiki/Godwin's_law > >Paul: I think you're missing a big painfully obvious point here, Mr >smarty pants. No, actually, I think I'll leave it at that. I just >can't be bothered. However, I'll say this - anyone sticking his >bloody big hooter into my business in the future will get a similar reaction! Paul >Luke

1 0

Compiling large code with old machine
by Samuel Silva 18 Jun '08

18 Jun '08

Hello I'm using GHC to compile around 700K of Haskell Code generated by HaXml. How I compile this code. My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2. How much time it spend to compile this file? I spent more than 1 hour and it doesn't finished. What flags make compiling fast? I try with -H500m but dont't expect. It is possible GHC running endless cycle at compilation stage? Thanks. -- Don't hug that, Hugs ME! Samuel Silva

6 6

ANNOUNCE: cabal-install 0.5
by Duncan Coutts 18 Jun '08

18 Jun '08

cabal-install 0.5 ================= cabal-install version 0.5 is out: http://haskell.org/cabal/download.html or get it from hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/cabal-install If you are already using a cabal-install pre-release then you can just: $ cabal update $ cabal install cabal-install New features in cabal-install ============================= Command line improvements ------------------------- The most immediately noticeable thing is that the command line interface now has all the commands that runhaskell Setup.hs has. Of course it still has the features to download and install packages from hackage. It also gained an upload command. So it now provides a command line interface to the whole Cabal/Hackage system. There’s no need to use runhaskell Setup.hs ever again. There is also bash command line completion support included which I find is a great time saver. Installing and upgrading ------------------------ The next big thing is that it includes a new package dependency resolution system that finds correct and sensible solutions more of the time and has better default behaviour. The new behaviour should be similar to other package managers that people are used to. For example, suppose you’ve got xmonad-0.5 installed and version 0.7 is the latest on hackage, then $ cabal install xmonad will install xmonad-0.7. The older version, xmonad-0.5, will remain installed. The behaviour of install is to upgrade as little as possible to satisfy your request, but sometimes you want to upgrade all the dependencies too. Supposing now that we have xmonad-0.7 installed, but we’re still using X11-1.4.1 and the latest version on hackage is X11-1.4.2, then $ cabal upgrade xmonad will install X11-1.4.2 and *re-install* xmonad-0.7, this time built against the newer X11-1.4.2. So in general, the install command will install the latest version of things but will try and use any existing installed versions of dependencies while the upgrade command will also try to use the latest versions of all dependencies. As a special case, cabal upgrade on its own will try to upgrade all the packages that you have installed. For both command there is a --dry-run flag so you can see what would be installed without actually doing it. Hugs ---- Yes, it even works with hugs. That is, cabal-install built by ghc can manage the installation of packages for hugs. In principle cabal-install should be able to be run by hugs but currently the zlib binding is using a function that hugs does not support. Note that for hugs, Cabal does not know what packages are already installed because there is no equivalent of the package database that ghc has. So that means cabal-install cannot do very sensible installation planning. It should work ok so long as all the dependencies are already installed. Windows ------- Yes, it even works on Windows. The one caveat is that cabal-install cannot currently upgrade itself because Windows makes it hard for a process to overwrite its own executable file. It needs more complex trickery with the Win32 API. In the meantime the workaround is to rename the cabal.exe file first eg to cabal-foo.exe, then run cabal-foo install cabal-install. Build reporting --------------- One feature that made it into this release is build reporting. cabal-install keeps logs of all packages that you install (at least packages from hackage, not local ones). It records a bit of information about each package, in particular whether the outcome was successful or not. You can see these build reports in ~/.cabal/packages/$server/build-reports.log. For example, there is one from my machine for xmonad: package: xmonad-0.7 os: linux arch: x86_64 compiler: ghc-6.8.2 client: cabal-install-0.5.1 flags: -testing small_base dependencies: X11-1.4.2 base-3.0.1.0 containers-0.1.0.1 directory-1.0.0.0 mtl-1.1.0.0 process-1.0.0.0 unix-2.3.0.0 install-outcome: InstallOk docs-outcome: NotTried tests-outcome: NotTried The plan in the longer term is to let people upload these build reports to hackage so we can get a wider range of testing data about the packages on hackage. Duncan

1 0

Re: [Haskell-cafe] Compiling large code with old machine
by Samuel Silva 18 Jun '08

18 Jun '08

Hello On Tue, Jun 17, 2008 at 10:24 PM, Niels Aan de Brugh <nielsadb(a)gmail.com> wrote: > On Tue, 2008-06-17 at 13:19 +0100, Samuel Silva wrote: >> >> I'm using GHC to compile around 700K of Haskell Code generated by HaXml. >> How I compile this code. >> My machine is Windows-XP(512MB RAM, 1.5GHz) running GHC-6.8.2. >> >> How much time it spend to compile this file? >> I spent more than 1 hour and it doesn't finished. > > Just out of curiosity, is all that 700K just one big file or did you > split it up into multiple files? It's just two big files with 700K each generated by DtdToHaskell from two big DTD files around 70K each. > Are you using any "expensive" features? I'm not a GHC exert, but I'd > expect things like type manipulations (e.g. phantom types) to be > expensive (please correct me if this assumption is wrong). This large module only contains datatype declarations and instance classes for HTypeable, XmlContent, XmlAttributes and XmlAttrType. > Bottom line: if compiling is so slow consider changing the code > generator so the result is easier to process by GHC instead of fiddling > with command line switches. Since you've chosen to generate the code it > will probably change often and you'll run into this problem more than > once. > > Regards, > Niels > > Each Haskell file have almost 15000 lines. It is huge. It's compiling very fast(some minutes) using -H300m without cabal and -H200m with cabal. GHC it is amazing. This was a valuable help. -- Don't hug that, Hugs ME! Samuel Silva

1 0

ANN: Mueval 0.3
by Gwern Branwen 18 Jun '08

18 Jun '08

Hiya everyone. So I've uploaded Mueval 0.3 (release early, release often) <http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mueval-0.3>. What's new? Well, I changed the printing output to be cleaner, and I made printing the inferred type optional (through a --print-type flag). In addition, I've made sure it can run (for me, at least) under -N4, and the watchdog threads should be sturdier. (Plus extra tests.) However, I've been hearing that a number of people (3 at last count) have been having a lot of trouble with the ResourceLimits stuff. So, I have a few requests of people who install mueval: * First, does it work out of the box, with no tweaking of the resource limits? * Second, if it doesn't work out of the box, which resource limits did you need to disable or increase? * Thirdly, if you changed the resource limits, could you run ./build.sh and tell me whether all the tests pass? Finally, I've been pondering removing the rlimits entirely since they are both very unportable, empirically derived, and apparently don't even work consistently on Linux. Any thoughts? -- gwern PABX MEMEX 868 1* TSCI @ shelter Yukon el ASLET

1 0

Polymorphic QuickCheck arguments
by Hugo Pacheco 17 Jun '08

17 Jun '08

Hi all, There is something about polymorphic tests in QuickCheck that I do not understand. If you write the simplest dummy test function tst :: a -> Bool tst _ = True and evaluate it we get > verboseCheck tst 0: () 1: () ... How come did the polymorphic value a get instanciated to ()? Is this done via the Testable type class? Could someone please explain this to me? I'm not saying it does not make sense, but I would like to understand how it works. Being possible to change this behavior, this is, assign another "default type" whenever polymorphic types occur, would be awesome. Cheers, hugo -- www.di.uminho.pt/~hpacheco

3 4