Re: [Haskell] JustHub 'Sherkin' Release

Hi Tim. >> Nix can install such Haskell environments on all Linux variants and >> on MacOS X without requiring superuser privileges. > > Is this actually the case? Yes. > When I tried this a year or so ago I had lots of problems with Redhat > Enterprise Linux 5, due to issues with it's qui

Re: [Haskell] JustHub 'Sherkin' Release

Chris Dornan wrote: > The JustHub distribution is distinctive in providing a comprehensive > back-catalogue of GHC tool chains (back to 6.10.4) and major Haskell > Platform releases (currently back to 2011.2.0.1) as well as the timely > appearance of leading edge GHC releases (such as GHC 7.4.

[arch-haskell] broken permissions (was: AUR Comment for haskell-pandoc)

Hi guys, > from http://aur.archlinux.org/packages.php?ID=19804 > frabjous wrote: > > Tiny easily fixed detail: the man page isn't given read access for > users, which is very slightly annoying. apparently, "runhaskell Setup copy --destdir=${pkgdir}" installs the man pages in $pkgdir without

Re: [arch-haskell] HABS makeworld script not recognizing remotely built packages during makepkg?

Hi Leif, > When running makeworld, it says: > > "Not building haskell-failure-0.1.0.1-3-x86_64.pkg.tar.xz (already built)." > > It got that package from the repo. But then at the bottom, it fails > with: > > ==> Making package: haskell-hamlet 0.8.0-1 (Wed Apr 20 06:39:01 UTC 2011) >

Re: [arch-haskell] Transitive version bump/update of dependents?

Hi Leif, > Is there a tool for bumping the version numbers / checking for newer > versions of all the packages that transitively depend on those that > would need to be rebuilt? my repository contains the program scripts/reverse-dependencies.hs, which can

Re: [arch-haskell] Spec ready to go!

Hi Rémy, > Is there anything depending on haskell-packedstring in the haskell repo? no, there isn't. The package appears to be obsolete. Take care, Peter ___ arch-haskell mailing list arch-hask...@haskell.org http://www.haskell.org/mailman/listinfo/

[arch-haskell] Most popular Haskell packages based on AUR voting

Hi guys, for your information, AUR allows users to vote for packages. If you a haven't done that yet, you might want to install "aurvote" and run the following command (in bash): aurvote -v $(pacman -Qqm) Anyway, these are our top 50 most popular packages: |-

[arch-haskell] release plan (was: What version of cabal2arch should be used to build HABS?)

Hi guys, I've re-generated all our PKGBUILDs using the latest version of the tool-chain. The Git repository for HABS is visible here: http://github.com/archhaskell/habs One major change is that our PKGBUILDs now require very specific versions of those packages provided by Haskel

[arch-haskell] State of Affairs: Summarizing 83 days worth of experience

Hi guys, it's been 83 days since I've begun to actively contribute to the ArchHaskell project. During that period, I've maintained our habs tree. I've seen to it that AUR is in sync with that tree. I've made an effort to compile a repository of binary packages, and I've also addressed all kinds of

[arch-haskell] Re: Where are we headed?

Hi Xyne, >> Hi Xyne, still working on it. Funny thing is I actually brought the whole >> thing back onto a Linode 1536 because EC2 in the end just didn't have the >> cost / performance / persistence ratio I wanted. I'm still working on the >> new authentication stack, which is a Kerberos / GSS

[Haskell] Re: Streams: the extensible I/O library

Bulat Ziganshin writes: > You can find further information about the library at the > page http://haskell.org/haskellwiki/Library/Streams and > download it as http://freearc.narod.ru/Streams.tar.gz Is there any chance of running this code on a non-Windows system? I tried to compile the example

[Haskell] Re: Parsing bug in GHC 6.4.1 ?

Bruno Oliveira writes: >> class Foo o where >> (:+) :: o -> o -> o The Haskell report specifies in section "2.4 Identifiers and Operators": An operator symbol starting with a colon is a constructor. Think of ':' as a character that is interpreted as "uppercase"; you can't use it to start

[Haskell] Re: Announcing initial release of Shaskell

David Mercer writes: > Speaking of testing, is anyone aware of any good test > harnesses for benchmark comparison testing, it's been > quite a while since I cared about such things and am out > of touch with that corner of computing! At you'll find Haskell bindings

[Haskell] Re: Drawing charts via Haskell

Gerbrand van Dieijen writes: > There are several graphic-libraries for Haskell, but I > couldn't find any specifically for drawing charts. Functional MetaPost is not exactly a "chart library", but I guess it might be close enough to be useful for your purposes: http://cryp.to/funcmp/ Peter

[Haskell] Re: runProcess with out=err

Ian Lynagh writes: > With the below code (compiled by ghc) I get > "a.out: thread blocked indefinitely". You need to compile with '-threaded' to avoid this problem. Unfortunately, this doesn't mean that your program will actually work. ;-) GHC 6.4 produces a binary that waits forever. When com

[Haskell] Re: Bignums in Haskell

Wolfgang Jeltsch writes: > And it's free. :-) And apparently doesn't work with GCC 4.x. ;-) Peter ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Re: Using newArray with hGetArray

Andre Pang writes: > [...] if I could use hGetBuf and somehow efficiently > create an array from a (Ptr Word8). I've never actually tried this, but shouldn't it be possible to create a 'StorableArray' and have hGetBufNonBlocking read into that with the help of 'withStorableArray'? Peter

[Haskell] Re: new to haskell

wenduan writes: > I have an IO action up and running in a module I defined > as following: > calculate = do > putStrLn "Give me a number (or 0 to stop):" > number <- getLine > let n = read number > if n == 0 >then do > return [] >

[Haskell] Re: Existing Haskell IPv6 Code

Ravi Nanavati writes: > http://developers.sun.com/techtopics/mobility/midp/articles/genericframework/ It does look quite interesting. We'd probably need only a fraction of all those options, but the schemes socket://www.j2medeveloper.com:80 datagram://www.j2medeveloper.com:7001 file:///

[Haskell] Re: Existing Haskell IPv6 Code

Graham Klyne writes: >> The longer I think about this whole thing, the more I am >> convinced that using URIs is the answer. > FWIW, the revised URI parsing code [2][3] in the latest > libraries includes support for IPv6 literals, as > specified by RFC 3986 [1]. Thanks for the pointer, Grah

[Haskell] Re: Haddock Problem

Dominic Steinitz writes: > I've now used the -v option and it looks like haddock > can't find the html files even though they are there :-( > Anyone have any ideas? Maybe the interface description files are broken, incomplete, or incompatible with your Haddock version? budweis:~/work/Codec$

[Haskell] Re: Existing Haskell IPv6 Code

Einar Karttunen writes: >> Well, I certainly _do_ need [a representation of network >> addresses in Haskell]. > You can certainly get it: > getHost mySocketAddress niNumerichost > getServ mySocketAddress niNumericserv Um, yes, but 'String' isn't a very good representation for manipulating n

[Haskell] Re: Existing Haskell IPv6 Code

Einar Karttunen writes: > Lifting [network address information] to Haskell level > seems quite pointless, as it is usually just fed back to > the C functions. Well, I certainly _do_ need it. > The current way is to ignore adress families as much as > possible while still supporting multipl

[Haskell] Re: Existing Haskell IPv6 Code

Shae Matijs Erisson writes: > Einar Karttunen's network-alt supports IPv6, datagram, and more: > http://www.cs.helsinki.fi/u/ekarttun/network-alt/ Duh, I didn't even know this library existed! Thanks for the pointer. Judging from a quick glance, the code seems to marshal the POSIX API: type

[Haskell] Re: Should inet_ntoa Be Pure?

Dominic Steinitz writes: > inet_addr' :: (Octet,Octet,Octet,Octet) -> HostAddress > inet_ntoa' :: HostAddress -> (Octet,Octet,Octet,Octet) > > I see Peter Simons has already written something: > > http://cryp.to/hsdns/docs/Network.IP.Address.html#v%3Aha2tpl

[Haskell] Re: rekursive array problem

Andreas Fuertig writes: > fillArray ["a"] > should be something like this: > [[("a",True)],[("a",False)]] A pretty generic solution using the "Bounded" and "Enum" type classes to calculate the list of all values for a given type would be: enumAll :: (Bounded a, Enum a) => [a] enumAll = [ minB

[Haskell] Cabal problems

Hi, I've run into a problem when trying to build a package with Cabal using a different GHC version than the one found in the $PATH. It looks like this: $ runghc Setup.lhs configure --with-compiler=/opt/ghc/bin/ghc-6.2.2 Warning: No license-file field. Configuring hsemail-0.0-2005-02-14...

[Haskell] Re: Enum class

Jaime Nino writes: > I would like to write a function with type >next :: Enum a => a -> a > which will wrap a values around [...]. You'll need (Bounded a, Enum a) to implement that. The function you are looking for is 'maxBound'. Enumerable types are not necessarily bounded in the general

[Haskell] Re: Network.CGI: ?

Johannes Waldmann writes: > How can I use an element? The Network.CGI module can't deal with that, unfortunately. You might want to take a look at the module FormData, which is (temporarily!) available here: http://peti.cryp.to/FormData.hs I'm using this module instead of Network.CGI and it

[Haskell] Re: Better Exception Handling

Bayley, Alistair writes: > data SqliteException = SqliteException Int String > deriving (Typeable) > catchSqlite :: IO a -> (SqliteException -> IO a) -> IO a > catchSqlite = catchDyn > throwSqlite :: SqliteException -> a > throwSqlite = throwDyn I, too, think that's a good way to do it.

[Haskell] Re: Announcing: Postmaster ESMTP Server

To follow up to my own posting: > at you will find the first > beta release of Postmaster, a mail transport agent > written in Haskell. If anyone feels like being an "early adopter", I've just made a release of the software available for download. So you don't need

[Haskell] Dtd2Haskell question

I'd like to add one more question / feature request into the mix. I have a DTD which defines two elements with (almost) identical attributes: Dtd2Haskell generates these data types: data Link = Link { linkPriority :: Link_priority , } data Link_priority

[Haskell] Announcing: Postmaster ESMTP Server

Fellow Haskellers, at you will find the first beta release of Postmaster, a mail transport agent written in Haskell. It can act as a full ESMTP server for leaf sites already, and if you have another MTA installed, then you can use it as a front-end for that to do mail

[Haskell] Re: Reading a directory tree

Tom Hofte writes: > I'm looking for a way to iteratively read all the files > in a directory and its subdirectories, given the filepath > of the top-level dir. Hope this helps: \begin{code} module ReadDirHier ( Entry(..) , name , readDirHier ) where import System.Directory (g

[Haskell] Re: HsDNS -- asynchronous DNS resolver

Tomasz Zielonka writes: > Maybe we could have two implementations behind one > interface? It sure sounds nice, but the problem is that the API is basically nothing more than the data types used to represent DNS queries and answers. My API has just one single function: query. So having the same

[Haskell] Re: HsDNS -- asynchronous DNS resolver

Tomasz Zielonka writes: >> http://cryp.to/hsdns/ > You stole my project's name! I have to admit that I am uncertain whether you are kidding or whether this is a serious complaint, but in case of the latter, I'll change the name to HsADNS or whatever. I can't say I am emotionally invested in ho

[Haskell] HsDNS -- asynchronous DNS resolver

On top of the GNU adns library, I have implemented a pretty simple-to-use DNS resolver, which hides the concurrency from the user through the use of MVars. I thought, maybe someone found this useful. You can get the source code at: http://cryp.to/hsdns/ Peter __

Re: Use of tab characters in indentation-sensitive code

Graham Klyne writes: > I think that compilers should issue a warning when > indentation that determines the scope of a construct is > found to contain tab characters. I second that. In the same spirit, the compiler should issue a warning when is used in literal strings, rather than \t, becau

Re: Haddock and man pages

Per Larsson writes: > Are there any plans of adding this as an alternative > output format in Haddock? It might be easiest to support Docbook output in Haddock and to generate all other formats from that -- including "man" a.k.a. nroff. Adapting the HTML output for SGML or XML is probably less

Re: How to best add logging/debugging code?

Ben Escoto writes: > 1. Use some kind of logging monad. This is definitely the way to go. The 'MonadWriter' class provides a very general interface, which often proves to be much more useful than just for logging. Especially, when you use it to return data types with useful information -- rathe

Re: haskell httpd

S Alexander Jacobson writes: > 1. Is there ssl support for the haskell httpd somewhere? Not that I'd know. > 2. Does this httpd actually build w/ modern GHC? It probably will, but not out-of-the-box. The code hasn't been actively maintained for a while. > More complex question: [...] HWS

Re: haskell httpd

Paul Graunke writes: > [...] event driven servers (which are supposedly oh so > much faster.) At least in my experience, multiplexing servers _are_ significantly faster than those relying on the OS (or whatever library) to do the scheduling. They also tend to be much more efficient in terms of

Re: haskell httpd

S Alexander Jacobson writes: > Is there a reasonably efficient Haskell httpd > implementation around that uses poll/select? There is a web server written in Haskell: HWS-WP -- or "Haskell Web Server with Plug-ins". You'll find it at: http://sourceforge.net/forum/forum.php?forum_id=253134

I/O multiplexing

Hi, I have a question concerning "manual" I/O multiplexing in Haskell, or specifically with GHC. I have written an interface to the C library ADNS, which performs asynchronous DNS queries. Everything is fine and dandy, but now comes the hard part: The function foreign import ccall adns_befor