May 2008 - Haskell-Cafe

re: a build problem
by Galchin, Vasili 28 May '08

28 May '08

Hi Duncan, In response to your below, I am running "runhaskell Setup.hs configure -v3 --prefix=$HOME". Is v3 the current highest Cabal highest verbosity level? FYI basically I am running ghc that I just built a couple of days ago from the ghc source distribution. Vasili (I. Galchin) ;^) On Tue, 2008-05-27 at 15:33 -0700, Thomas Hartman wrote: > I think dist gets populated when you do build. Actually we also stash the configuration in ./dist/setup-config so that gets created at configure time. Galchin's problem is that something goes wrong during the configure and so nothing gets created in dist. From the log it looks like ghc or ld are failing during one of the early tests we do when configuring ghc. To make debugging this kind of thing a bit less mysterious in future Cabal now logs in greater detail what happens when it calls external programs (when invoked at the highest verbosity level). Duncan

1 1

Re: [Haskell-cafe] a build problem ....
by Thomas Hartman 28 May '08

28 May '08

I think dist gets populated when you do build. > > 2008/5/27 Galchin, Vasili <vigalchin(a)gmail.com>: >> when I do a "clean" followed by "configure" then dist is empty >> >> vasili >> >> On Tue, May 27, 2008 at 4:37 PM, Thomas Hartman <tphyahoo(a)gmail.com> wrote: >>> >>> maybe try >>> >>> runghc Setup.hs clean >>> >>> or fresh darcs checkout and try build again from scratch. it's helped >>> me in the past. >>> >>> thomas. >>> >>> >>> Am 26. Mai 2008 21:32 schrieb Galchin, Vasili <vigalchin(a)gmail.com>: >>> > Hello, >>> > >>> > One of my test cases will not build. I am running: >>> > >>> > vigalchin@ubuntu:~$ ghc -v >>> > Glasgow Haskell Compiler, Version 6.8.2, for Haskell 98, stage 2 booted >>> > by >>> > GHC version 6.8.2 >>> > Using package config file: /usr/local/lib/ghc-6.8.2/package.conf >>> > wired-in package base mapped to base-3.0.1.0 >>> > wired-in package rts mapped to rts-1.0 >>> > wired-in package haskell98 mapped to haskell98-1.0.1.0 >>> > wired-in package template-haskell mapped to template-haskell-2.2.0.0 >>> > wired-in package ndp not found. >>> > Hsc static flags: -static >>> > *** Deleting temp files: >>> > Deleting: >>> > *** Deleting temp dirs: >>> > Deleting: >>> > ghc-6.8.2: no input files >>> > Usage: For basic information, try the `--help' option. >>> > vigalchin@ubuntu:~$ >>> > >>> > Here is the build: >>> > >>> > vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell >>> > Setup.lhs configure --prefix=$HOME >>> > Configuring mlock-1.0... >>> > vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell >>> > Setup.lhs build >>> > Preprocessing executables for mlock-1.0... >>> > Building mlock-1.0... >>> > vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell >>> > Setup.lhs install >>> > Installing: /home/vigalchin/bin >>> > Setup.lhs: dist/build/mlock/mlock: copyFile: does not exist (No such >>> > file or >>> > directory) >>> > >>> > The install step fails. I guess "copyFile" is used to copy the >>> > executable to >>> > the install directory?? >>> > >>> > Regards, vasili >>> > >>> > >>> > >>> > >>> > _______________________________________________ >>> > Haskell-Cafe mailing list >>> > Haskell-Cafe(a)haskell.org >>> > http://www.haskell.org/mailman/listinfo/haskell-cafe >>> > >>> > >> >> >

2 1

ANN: HSmugMug 0.1 - a haskell wrapper to the photo site smugmug's api
by Daniel Patterson 27 May '08

27 May '08

Released May 27th, 2008. I've been working for a little while on a haskell wrapper to the photo hosting site Smugmug's api. As of now, the library is pretty simple - it is 'read-only' - ie, you can't use it to upload to or create galleries, but I still think it is potentially useful to haskell/smugmug users. I created it primarily so I could integrate my photos at smugmug into my website, which you can see in the 'photos' section of my website - a very primitive but proof of concept-esque demonstration. I have deliberately not included much glue between the actual api and the use of it, because I think that is something that can more cleanly evolve out of use - if people find themselves repeating certain patterns when using the api, those would logically become part of the api wrapper. So, let me know what you think! Full release notes, brief tutorial, install instructions, etc, at http://dbpatterson.com/articles/10 . Feedback welcome! (this is the first thing longer than a 5 liner that I've written in haskell, so be gentle) Daniel

1 0

a build problem ....
by Galchin, Vasili 27 May '08

27 May '08

Hello, One of my test cases will not build. I am running: vigalchin@ubuntu:~$ ghc -v Glasgow Haskell Compiler, Version 6.8.2, for Haskell 98, stage 2 booted by GHC version 6.8.2 Using package config file: /usr/local/lib/ghc-6.8.2/package.conf wired-in package base mapped to base-3.0.1.0 wired-in package rts mapped to rts-1.0 wired-in package haskell98 mapped to haskell98-1.0.1.0 wired-in package template-haskell mapped to template-haskell-2.2.0.0 wired-in package ndp not found. Hsc static flags: -static *** Deleting temp files: Deleting: *** Deleting temp dirs: Deleting: ghc-6.8.2: no input files Usage: For basic information, try the `--help' option. vigalchin@ubuntu:~$ Here is the build: vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell Setup.lhs configure --prefix=$HOME Configuring mlock-1.0... vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell Setup.lhs build Preprocessing executables for mlock-1.0... Building mlock-1.0... vigalchin@ubuntu:~/FTP/Haskell/unix-2.2.0.0/tests/mlock$ runhaskell Setup.lhs install Installing: /home/vigalchin/bin Setup.lhs: dist/build/mlock/mlock: copyFile: does not exist (No such file or directory) The install step fails. I guess "copyFile" is used to copy the executable to the install directory?? Regards, vasili

2 3

LIPL: a tiny functional language implemented
by sam lee 27 May '08

27 May '08

Dear Haskell-Cafe, This is a sort of spam. I've been working on a tiny functional language as a term project to learn Haskell. And I submitted it today. I wrote the code in literate Haskell. So it could be used as Haskell tutorial (minus the fact that it could be error prone). Source code and documentation can be viewed at: http://www.lipl.googlepages.com/index.html#source Thank you. Sam.

3 2

Haskell ghc log?
by Galchin, Vasili 27 May '08

27 May '08

Hi Duncan, You mentioned a log in a posting vis-a-vis "configure". Where are all ghc-related logs? Kind regards, Vasili

2 1

ghc on mac
by Vikrant 27 May '08

27 May '08

Hi, I am trying to install ghc-6.8.2 on mac leopard. I get following error if I try to run ghci dyld: Library not loaded: /opt/local/lib/libreadline.5.2.dylib Referenced from: /Users/vikrant/Applications/ghc/lib/ghc-6.8.2/ghc-6.8.2 Reason: image not found Trace/BPT trap Vikrant

3 6

Examples of using Haskell for mathematics
by Galchin, Vasili 27 May '08

27 May '08

Hi Henning, I have often wondered if the notion of lazy list evaluation isn't an example of constructive mathematics. ? Vasili

1 0

status of dynamic loading
by Evan Laforge 26 May '08

26 May '08

I have an application where I'd like to load and run code at runtime. As far as I know, the possibilities are: Use hs-plugins. I'm not sure if this still works on modern ghc, or if it works on my platform (darwin intel), but I managed to get this compiled after "fixing" a use of STArray whose arity apparently changed, but I probably broke it because now I get "Error in array index" all the time. I gather Austin Seipp has been doing some work on this. Is there a newer version that should work? An easy fix for the error? Then there's the ghc api, which I gather is seen as the way forward from hs-plugins, saving it from hi-parsing brittleness and platform specific breakage. I think Yi uses this, apparently in in the Shim package. I poked around some, but wasn't too clear to me what was going on, if I was looking in the right place, and if this is a reasonable way forward. lambdabot also appears to have its own dynamic loading mechanism, I haven't looked at the source enough yet to understand what it's doing. Maybe there's some documentation out there. The low-tech solution, used by xmonad, would be to pass the "dynamic" code to main and just recompile the app for each instance, passing in an instance specific set of config arguments. Of course, this isn't really dynamic at all, and compiling all the various instances could be clunky and awkward, but I know it works and could possibly be reasonable if I also write my own little language for the stuff that really has to be dynamic (anyone got one of these? lisplike would be easy and ok, an haskell subset might be nicer... I would like to avoid having *two* languages to write extensions in). The last solution I can think of is to export an RPC API instead of dynamically loading code. The difficulty here is coming up with a vocabulary that can be flattened and shipped to another program without becoming an excessive maintenance issue or being too inflexible. All in all, the dynamic loading approach of hs-plugins seems like the easiest and most flexible, provided I can get its staged type checking. Before I go trying to hack hs-plugins into working, or poking around inside yi or lambdabot, can anyone point me at some documentation, resources, advice, etc.? Thanks!

5 5

Re: Haskell idioms for hierarchical memory modeling ?
by Dmitri O.Kondratiev 26 May '08

26 May '08

On Mon May 26 09:02:01 EDT 2008 Marc Weber [marco-oweber at gmx.de] wrote: >Searching haskell.org only gives one match: > http://jpmoresmau.blogspot.com/2007/06/very-dumb-neural-network-in-haskell.… >(I haven't read it) >http://hackage.haskell.org/packages/archive/pkg-list.html >is the other most commonly used source of finding aready existing code >(There is package about nn) > >Should your nn also support kind of learning by giving feedback? Marc, thanks for explaining how to use State and the links! As for your question about my NN learning, I need to tell more how it all works. My classifier NN (Memory Tree - MT - as I call it), that I previously described may work in two modes: 1) Usupervised learning. In this mode each node learns new categories when it encounters new input vectors that classifier has not seen before. These input vectors become new categories and get stored in node category memory (CM). When MT starts in this mode all nodes have empty CMs. Size of CM defines the number of categories that node may learn. 2) Supervised learning. In this mode MT also has a category node. Category node feeds in category numbers to a top level node. Learning is done with prepared in advance training data set. Traing data consits of pairs (input vector, category number). Bottom nodes read input vector from this pair while category node simultaneously sends corresponding category number to the top level node. Thus when input reaches top node it already knows what category this input belongs to. After MT consumes all training data it is belived to be fully learned and ready to infer categories from 'work' data set. Hope this answers your question about learning. -- Dmitri O. Kondratiev dokondr(a)gmail.com http://www.geocities.com/dkondr

1 0