zghost123:
>hello, im interested in using haskell to generate code and make
>little AI applications for fun..
>
>is anyone already doing this sort of thi
claus.reinke:
> >>> I have a standard Data.Map.Map as the base structure for one of my
> >>> macid data tables (jobs), but I noticed something
> >>> that is probably causing problems for me.
> >>> Even a simple 20 million record with int/int key values causes an out
> >>> of memory error for me in
tphyahoo:
> {-# LANGUAGE BangPatterns #-}
> import qualified Data.Map as M
> import Debug.Trace
> {-
> I'm trying to run a HAppS web site with a large amount of data: stress
> testing happstutorial.com.
> Well, 20 million records doesn't sound that large by today's
> standards, but anyway that's my
= News about Haskell on Arch Linux =
Arch Linux now has 639 Haskell packages in AUR.
That’s an increase of 15 new Haskell packages in the last 7 days. Growth appears
to be holding steady at just over 2 new packages a day on Hackage this
month.
Noteworthy
* haskell-gnuplot-0.2: “2D and 3D pl
tphyahoo:
> >For the first time ever, we're able to have all the 3rd party code
> >tested and ready to go
>
> By "all the third party code" do you mean everything on
>
> http://hackage.haskell.org/packages/archive/pkg-list.html ?
>
> My two packages, happs-tutorial and external-sort, are not rep
kyagrd:
> There is an impressive HaskellDB Talk trailer on the web.
>
> http://www.vimeo.com/1983774
>
> Cheers to the HaskellDB developers :-)
AWESOME!
Trailers for talks, eh? The bar has been raised.
-- Don
___
Haskell-Cafe mailing list
Haskell-Caf
derek.a.elkins:
> On Thu, 2008-10-16 at 13:53 -0700, Daryoush Mehrtash wrote:
> > So does this mean that the reason for complexity of generics is the
> > Java inheritance?
> >
> > BTW, in addition to the article I posted, This site:
> > http://www.angelikalanger.com/GenericsFAQ/JavaGenericsFAQ.htm
wren:
> Simon Marlow wrote:
> >wren ng thornton wrote:
> >>Simon Marlow wrote:
> >>>Don Stewart wrote:
> >>>> * GHC.Prim was moved,
> >>>
> >>>Nobody should be importing GHC.Prim, use GHC.Exts instead.
> >>
&
asandroq:
> Hallo,
>
> Andrew Coppin wrote:
> >
> > C++ has some interesting ideas. I haven't learned how to use templates
> > yet, but what I do find interesting is that there is no automatic memory
> > management, and yet you can still do fairly dynamic programming. I've
> > never seen any othe
simon:
> I'm pleased to announce the first release of hledger, a command-line
> accounting tool similar to John Wiegley's c++ ledger. hledger generates
> simple ledger-compatible transaction & account balance reports from a
> plain text ledger file. It's simple to use, at least for techies.
>
A
schlepptop:
> Don Stewart schrieb:
>
> > numeric-prelude-0.0.4
> > Easy: Lanuage pragma
>
> My question was still not answered: I used the non-existing pragma
> LANGUAGE_HOW_CAN_WE_ENABLE - I hoped it would be ignored, but it was
> parsed and made
mjm2002:
> On 10/13/08, Andrew Coppin wrote:
> > Cool. Is there any progress on getting GHC to *not* freak out when you
> > ask it to compile a CAF containing several hundred KB of string literal? :-}
>
> Yes and no. There's dons' compiled-constants pkg which has a solution:
>
> http://code.has
magicloud.magiclouds:
> Hi,
>I wanted to install this package. Well,
> Building hprotoc-0.3.1...
> ...
> [3 of 7] Compiling Text.ProtocolBuffers.ProtoCompile.Parser ...
>
> Text/ProtocolBuffers/ProtoCompile/Parser.hs:48:0:
>Type synonym `GenParser' should have 2 arguments, but has been giv
Hey all.
The GHC 6.10 RCs are out, and we're preparing the release of GHC proper.
To help manage the transistion to GHC 6.10 it is now possible to
actually build all the 3rd party Haskell packages, and publish their
results wrt. the release candidate.
For the first time ever, we're able to have a
marlowsd:
> Don Stewart wrote:
>
> >Note that these builds are with "soft deps", provided on hackage,
> >
> >base < 4
> >parsec < 3
> >HaXml == 1.13.*
> >QuickCheck < 2
> >
> >which train cabal-install to bu
ryani.spam:
> On Mon, Oct 13, 2008 at 2:04 AM, J. Garrett Morris
> <[EMAIL PROTECTED]> wrote:
> > Indeed - MTL seems to have been rewritten at some point in the past to
> > prefer exhaustive enumeration to overlap.
>
> Indeed, and I actually think this is a weakness of the current
> implementation
Hey all.
The GHC 6.10 RCs are out, and we're preparing the release. To help manage the
transistion to GHC 6.10 it is now possible to actually build all the 3rd party
Haskell packages, and publish their results wrt. the release candidate.
For the first time ever, we're able to have all the 3rd pa
jgmorris:
> Hello everyone,
>
> As part of a project to formalize the theory of overlapping instances,
> I'm looking for examples of overlapping and incoherent instances and
> their usage. One such example would be the old version of the Monad
> Transformer Library, which used overlapping instanc
News about Haskell on Arch Linux
http://archhaskell.wordpress.com/2008/10/12/arch-haskell-news-oct-12-2008/
Arch now has 624 Haskell packages in AUR.
That’s an increase of 15 new packages in the last 7 days.
Planning is also underway for the GHC 6.10 release, and the 6.10 release
candidate is in
ashley:
> Don Stewart wrote:
> >* Arch now has 609 Haskell packages in AUR.
>
> Have you thought about doing this for Ubuntu? If you know how to
> automatically generate packages, you could set up a PPA (private package
> archive) on Launchpad.
I've spoken with Je
I just want to congratulate the wxHaskell team on their new release.
With GHC 6.10 RC, cabal 1.6, and cabal-install 0.6, I was able to
simply,
cabal install wxcore wx
And it all worked.
Well done!
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe
jason.dusek:
> Tommy M. McGuire <[EMAIL PROTECTED]> wrote:
> > Is it wrong to use Parsec to parse regular expressions for a
> > really simple regex engine[4]?
>
> I sometimes think it is better, from a maintainability
> standpoint, to just use Parsec for all that stuff and forget
> about reg
This could be a game changer.
Great work Andrew!!
-- Don
andrew.appleyard:
> I'd like to announce the first release of Salsa, an experimental Haskell
> library that allows Haskell programs to access .NET libraries.
>
> Here's a taste:
>
> > type Hello.hs
> import Foreign.Salsa
> import B
dmehrtash:
>What is the difference between empty list [] and list with one unit
>element [()]?
Prelude> length []
0
Prelude> length [()]
1
:-)
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/
lrpalmer:
>Several very elegant FRP approaches are emerging, most visibly
>FRP.Reactive, which rely on blocking on multiple variables at once,
>continuing when the *first* of them is available. . . inside an
>unsafePerformIO, so the beautiful STM "orElse" solution is not available.
dlb:
> OK, I suspect this is a real newbie error, but please have mercy. I have
> downloaded and installed cabal (at least it responds to the --help command
> from the command line). Yet when I do, say (to give a real example):
>
> cabal configure parameterized_ data
>
> (having done he fetch
666wman:
>ghc -Onot -fstrictness --make Main1.hs && ghc -Onot -fstrictness --make
>Main2.hs && ghc -Onot -fstrictness --make Main3.hs
>
>time Main1 < nums
>real0m39.530s
>user0m0.015s
>sys 0m0.030s
>
>time Main2 < nums
>real0m14.078s
>user0m
666wman:
>just for the kicks i tried the new version of bytestring without -O2 and
>the results were even worse:
Note that without -O or -O2 no strictness analysis is performed. So that
tail recursive loop ... won't be. You could try -Onot -fstrictness just
for kicks, to see why strictness
magicloud.magiclouds:
> Just a simple text process program. When I runhaskell it. I got:
>
> GHCi runtime linker: fatal error: I found a duplicate definition for symbol
> fps_minimum
> whilst processing object file
> ~/.cabal/lib/bytestring-0.9.1.3/ghc-6.8.3/HSbytestring-0.9.1.3.o
> This could
tutufan:
> Thanks for your replies. Hoogle is pretty cool--I didn't know about that.
>
> I ended up with this, which is pretty close to the original (it will
> also bomb if given non-integer input):
>
> import qualified Data.ByteString.Lazy.Char8 as L
> import qualified Data.Maybe as M
>
> main
w_, at least using my
>test script :-((
>
>On Tue, Oct 7, 2008 at 5:12 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
>
> 666wman:
> >a slight modification to compile it :
> >
> >change:
> >where sumFile = su
666wman:
>a slight modification to compile it :
>
>change:
>where sumFile = sum . map read . L.words
>to :
>where sumFile = sum . map (read . L.unpack) . L.words
>
>but it's actually _slower_ than the non-bytestring version.
Never unpack a bytestring.
import qualifie
dagit:
>As the top search result.
>
>This means that you can convert any list of maybes into a list of what you
>want. It just tosses out the Nothings.
>
> 2. Why doesn't ByteString implement 'read'? Is it just that this
> function (like 'input' in Python) isn't really ve
vanenkj:
>Hello All,
>
>I'm working on a Haskell based VPN. I can't think of any good names, so
>I'm crowd sourcing it.
>
>A few details that may help in naming it:
>1. It's distributed (doesn't need a "master" or "server").
>2. It's secure (duh)
>3. It uses TUN/TAP
>
dagit:
>data and newtype vary in one more subtle way, and that's how/when they
>evaluate to bottom. Most of the time they behave identically, but in the
>right cases they act sightly differently. newtype is usually regarded as
>more efficient than data. This is because the compil
ink that I used "newtype"
>appropriately but not perhaps with full understanding.
>
>Thanks, Vasili
>
>On Mon, Oct 6, 2008 at 12:37 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
>
> vigalchin:
> >Hello,
> >
> >
vigalchin:
>Hello,
>
> I am reading some extant Haskell code that uses Posix signals I am
>confused by the motivation of the following ...
>
>type [1]Signal = [2]CInt
>[3]nullSignal :: [4]Signal
>[5]internalAbort :: [6]Signal
>[7]sigABRT :: [8]CInt
http://sandersn.com/blog/index.php?title=two_weeks_of_haskell
Has some good thoughts on what tripped him up in his first two weeks of
Haskell programming. Anything people want to work on there? :-)
Worth a read if you're thinking about how to make Haskell yet more
accessible.
-- Don
A weekly update about Haskell on Arch Linux.
Highlights,
* Arch now has 609 Haskell packages in AUR.
That’s a record increase of 19 new packages in the last 7 days.
Noteworthy,
* mp3decoder-0.0.1: “MP3 decoder for teaching.”
* yi-0.4.6.2: “The Haskell-Scr
derek.a.elkins:
> On Fri, 2008-10-03 at 15:38 -0400, David Menendez wrote:
> > On Fri, Oct 3, 2008 at 3:17 AM, Jason Dusek <[EMAIL PROTECTED]> wrote:
> > > Perhaps I am lacking in imagination, but I still can't see the
> > > value of one tuples.
> >
> > You can use them to defeat seq.
> >
> > u
wchogg:
> On Fri, Oct 3, 2008 at 5:47 AM, Dougal Stanton <[EMAIL PROTECTED]> wrote:
> > 2008/10/3 Galchin, Vasili <[EMAIL PROTECTED]>:
> >> Hello,
> >>
> >> One of my interests based on my education is "grand challenge science".
> >> Ok .. let's take the CERN Hadrian Accelerator.
> >>
> >>
anton.tayanovskyy:
> Hello,
>
> SCGI module from Hackage is not working for me with Apache mod_scgi, I
> think because it uses LazyBytestring to hGetContents on a socket
> handle and the Apache side does not close the socket. Also, looking at
> the source I didn't see any fork* calls, so I assume
bulat.ziganshin:
> Hello Wolfgang,
>
> Thursday, October 2, 2008, 11:25:52 PM, you wrote:
>
> >> > You mean shared libraries without the opportunity to inline library code?
> >> > This would result in a huge performance loss, I think.
> >>
> >> Usually _mild_ performance loss, in exchange for maj
manlio_perillo:
> Don Stewart ha scritto:
> >Thanks to those guys who've submitted parallel programs to the language
> >benchmarks game, we're climbing up the rankings, now in 3rd, and ahead
> >of C :)
> >
> >http://shootout.alioth.debian.org/u64q/
simonpj:
> | > Unless you use a different compiler.
> | >
> | > Malcolm "keeping the dream of multiple implementations alive"
> |
> | And keep dividing our compiler teams' efforts, while
> | single-implementation languages conquer :)
> |
> | Don "thinking that compiler developer fragmentati
malcolm.wallace:
> Just a small nuance to what Don wrote:
>
> > * Haskell libraries are always statically linked and agressively
> > inlined,
>
> But only for GHC (and jhc?).
>
> > so opinion seems to be that LGPL licensed *Haskell
> > libaries* are unsuitable for any proje
magnus:
> On Wed, Oct 1, 2008 at 3:31 AM, brian <[EMAIL PROTECTED]> wrote:
> [..]
> > as big a problem as I imagined. My understanding is that I can satisfy
> > the requirements of the LGPL by dynamically linking, and that's
> > already happening. Is there something else to worry about? I'd be in
>
vigalchin:
>Hello,
>
> I probably missed some details for which I apologize. My feeling is
>that "periodically" the "haskell platform server" should attempt to
>rebuild the Haskell library. Any library that fails to rebuild then the
>"maintainer" of that library should be
alfonso.acosta:
> Hi everyone,
>
> I am glad to announce the 3.0 release of ForSyDe's implementation, now
> available from HackageDB.
>
Awesome, native packages now available,
http://aur.archlinux.org/packages.php?ID=20422
-- Don
___
Haskell-Cafe
brianchina60221:
> On Tue, Sep 30, 2008 at 8:54 PM, Stefan Monnier
> <[EMAIL PROTECTED]> wrote:
> >> That still leaves anyone free to use LGPL if they want to, but please
> >> don't assume that it allows commercial use by all potential users.
> >
> > It *does* allow commercial use. Your example ju
noteed:
> Hi,
>
> I'd like to know, now that time got by a bit, what the writers of the
> X monad think about the use of the ReaderT/WriterT/IO brought to them
> (to isolate Configuration data and dynamic data and glue them together
> with IO). Are you happy of it, did it make things easier or not
claus.reinke:
> >for the libraries?
> >
> > * http://haskell.org/haskellwiki/Haskell_Platform
>
> You might have mentioned that there is finally a tracker (*) and
> an approximate .cabal meta-package (for dependencies only).
>
> - is the programs are not registered by Cabal issue going to be
>
dons:
> kr.angelov:
> > On Tue, Sep 30, 2008 at 8:46 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
> > > There's almost 800 Haskell libraries on hackage.haskell.org (millions of
> > > lines of code). On average, 2 new libraries are released each day
> > >
kr.angelov:
> On Tue, Sep 30, 2008 at 8:46 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
> > There's almost 800 Haskell libraries on hackage.haskell.org (millions of
> > lines of code). On average, 2 new libraries are released each day
> > (though 12 new libs we
vigalchin:
>ok .. is there a "roadmap" for Haskell??
for the language?
* http://video.google.com/videoplay?docid=5177116830079185902
for the compiler?
* http://hackage.haskell.org/trac/ghc/wiki/Status/Releases
for the libraries?
* http://haskell.org/haskellwiki/Haskell_Platfor
neil.mitchell.2:
>
> Hi,
>
> For libraries F# is probably superior to all, as it has libraries for
> virtually everything, and can interoperate seamlessly with COM and .NET.
> I doubt there will be any library functionality that can't be found or
> bought.
Libraries for monad transformers or com
noteed:
> Haskell is growing really fast (in community, libraries and tools). But,
> Vasili,
> Dons pushes a lot into Arch, so although he gives a correct statement, you
> shouldn't build your point of view relying only on that part of his answer
>
> Just rember the number about the Haskell l
vigalchin:
>Hello,
>
> Frank mode on ... ;^) In terms of functionality, where is Haskell
>superior vs inferior to ML, Caml, OCaml, F#, Erlang, etc.? E.g. in terms
>of library functionality?
>
Without more information, all we can really do is an overview.
There's almost 8
magnus:
> 2008/9/29 Bit Connor <[EMAIL PROTECTED]>:
> [..]
>
> Basically it seems to me that you believe in the benevolence and
> enligtenment of companies. Something I don't. I believe you are
> right in splitting the LGPL into two different objectives, and you are
> right in saying that I real
Malcolm.Wallace:
> Guerilla videos of the Haskell Symposium 2008 presentations. Enjoy.
Now on haskell.org,
http://haskell.org/haskellwiki/Video_presentations/Haskell_Symposium_2008
Great work Malcolm!!
___
Haskell-Cafe mailing list
Haskell-Cafe@h
bulat.ziganshin:
> Hello Andrew,
>
> Saturday, September 27, 2008, 1:37:12 AM, you wrote:
>
> answering your questions
>
> 1) there is 2 libs providing common Java-like interfaces to
> containers: Edison and Collections. almost noone uses it
>
> 2) having common type class for various things is
jgoerzen:
> Hi everyone,
>
> I'm finding Haskell to be a really handy language for writing programs
> designed to be used from shell scripts of late. hpodder, twidge, and
> datapacker are al on Hackage.
>
> I released dataacker 1.0.1 recently. It's about one fifth the size of
> a close competi
simonmarhaskell:
> Manlio Perillo wrote:
> >Don Stewart ha scritto:
> >>[...]
> >>Ok. So I'll just say: high level, efficient code is an overriding theme
> >>of many individuals working on Haskell. Things are better and better
> >>each year.
manlio_perillo:
> However I'm looking for a good environment for implementing generic
> internet servers, or web applications with special needs.
> As an example one of my "maybe future" tasks is to write a simple
> BitTorrent tracker + seeder.
You could look at conjure, the bitorrent client tha
daveroundy:
> On Wed, Sep 24, 2008 at 1:06 AM, Malcolm Wallace
> <[EMAIL PROTECTED]> wrote:
> > The ICFP programming contest results presentation:
> > http://video.google.com/videoplay?docid=-4697764813432201693
> >
> > Feel free to pass on this link to any other appropriate forum.
>
> Yikes. Has
aeyakovenko:
> is there anyway the modifyWith functions could work on uboxed types?
If they're inlined, the modify functions on boxed types may well end up
unboxed.
What's the particular problem you're having?
-- Don
___
Haskell-Cafe mailing list
Haske
nicolas.pouillard:
> Hi All,
>
> Here is an Haskell implementation of an algorithm that builds a binary tree
> with
> minimum weighted path length from weighted leaf nodes given in symmetric
> order.
>
> This can be used to build optimum search tables, to balance a
> 'ropes' data structure in a
bulat.ziganshin:
> Hello Don,
>
> Tuesday, September 23, 2008, 4:22:19 AM, you wrote:
>
> > bulat.ziganshin:
> >> when gcc developers will start to add to C libraries functions
> >> performing shootout benchmarks we will continue this discussion :D
>
> > atoi(3).
>
> it isn't the same as readIn
bulat.ziganshin:
> when gcc developers will start to add to C libraries functions
> performing shootout benchmarks we will continue this discussion :D
atoi(3).
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/
bulat.ziganshin:
> Hello Donnie,
>
> Tuesday, September 23, 2008, 2:53:17 AM, you wrote:
>
> > i mean that naive haskell code is very slow and 3 or 5 or twelve libs
> > can't solve the problem of ghc generating slow code
>
> > I'm fairly new to Haskell and the Haskell community, but I can say
>
ICFP is on now, for those wondering why the list is a bit quiet :)
http://www.icfpconference.org/icfp2008/schedule.html
I'm doing live updates of events at ICFP/Haskell Symposium here in Canada.
http://twitter.com/galoisinc
So you can follow events remotely.
Cheers,
Don
_
aeyakovenko:
> If i have functions in the IO monad, is there a way to use quickcheck
> to test them? I have a bunch of C bindings that unfortunately are not
> "safe". But i would like to be able to use QuickCheck to test them.
>
Typically, via unsafePerformIO, and check the invariants that need
igouy2:
>
> --- Simon Brenner <[EMAIL PROTECTED]> wrote:
>
> > On Mon, Sep 22, 2008 at 2:07 PM, Bulat Ziganshin
> > <[EMAIL PROTECTED]> wrote:
> > > this overall test is uselles for speed comparison. afair, there are
> > > only 2-3 programs whose speed isn't heavily depend on libraries. in
> > >
igouy2:
>
> --- Simon Brenner <[EMAIL PROTECTED]> wrote:
>
> > On Mon, Sep 22, 2008 at 2:07 PM, Bulat Ziganshin
> > <[EMAIL PROTECTED]> wrote:
> > > this overall test is uselles for speed comparison. afair, there are
> > > only 2-3 programs whose speed isn't heavily depend on libraries. in
> > >
jwlato:
> > On Wed, 17 Sep 2008, Mitchell, Neil wrote:
> >
> >> I tend to use openFile, hGetContents, hClose - your initial readFile
> >> like call should be openFile/hGetContents, which gives you a lazy
> >> stream, and on a parse error call hClose.
> >
> > I could use a function like
> > withRe
Thanks to those guys who've submitted parallel programs to the language
benchmarks game, we're climbing up the rankings, now in 3rd, and ahead
of C :)
http://shootout.alioth.debian.org/u64q/benchmark.php?test=all&lang=all
Just one or two more parallel programs required...
Submit them here, a
andrewcoppin:
> Ivan Lazar Miljenovic wrote:
> >On Sat, 20 Sep 2008 23:38:16 -0700
> >Don Stewart <[EMAIL PROTECTED]> wrote:
> >
> >
> >>And by now you know where which distro has it:
> >>
> >>http://aur.archlinux.org/packages.
ivan.miljenovic:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On Sat, 20 Sep 2008 23:38:16 -0700
> Don Stewart <[EMAIL PROTECTED]> wrote:
>
> >
> > And by now you know where which distro has it:
> >
> > http://aur.archlinux.or
ivan.miljenovic:
> The latest version of Matthew Sackman's Haskell bindings to Graphviz
> [1] are now available on Hackage [2]. The reason there's a new
> release only two weeks after the previous one is that I've made some
> extensions to it (hence why I'm writing the announcement) that Matthew
>
oleg:
> It seems there is another approach, which is neither unsafe nor
> imperative. It relies neither on lazy IO nor on Handles. The input
> data can come from a file or from an embedded (e.g., chunk-encoded or
> encrypted) stream; the depth of embedding is arbitrary. The approach
> is naturally
newsham:
> >a) have you submitted it to the shootout.
>
> no
>
> >b) is it faster
>
> yes
>
> >c) can you put it on the parallel shootout wiki,
> > http://haskell.org/haskellwiki/Shootout/Parallel
>
> http://haskell.org/haskellwiki/Shootout/Parallel/Mandelbrot
Nice, on quad core, the old en
newsham:
> Since this one's trivially parallizable, I took a crack at the
> mandelbrot test case. It was fairly easy to thread it on a
> per-line basis in Haskell without changing the original too much.
> It might be more efficient to break the work into larger chunks,
> but that would require som
RafaelGCPP.Linux:
>Hi all,
>
>Is there any implementation of the rope data structure in Haskell?
>
>I couldn't find any on Hackage, and I am intending to implement it.
There's no mature rope implementation. Can you write a bytestring-rope
that outperforms lazy bytestrings please :)
_
leather:
>Extensible and Modular Generics for the Masses
>==
>
>Extensible and Modular Generics for the Masses (EMGM) is a library for
>generic programming in Haskell using type classes.
>
>This is the initial release of a maintained
manlio_perillo:
> Hi again.
>
> In
> http://book.realworldhaskell.org/read/concurrent-and-multicore-programming.html#id676390
> there is a map reduce based log parser.
>
> I have written an alternative version:
> http://paste.pocoo.org/show/85699/
>
> but, with a file of 315 MB, I have [1]:
>
manlio_perillo:
> Hi.
>
> After having read
> http://book.realworldhaskell.org/read/concurrent-and-multicore-programming.html#id676390
>
> I have a doubt about Data.ByteString.Lazy.
>
> Why getContents function don't use pread (or an emulation, if not
> available)?
Why would it?
-- Don
__
oleg:
> Given the stance against top-level mutable variables, I have not
> expected to see this Lazy IO code. After all, what could be more against
> the spirit of Haskell than a `pure' function with observable side
> effects. With Lazy IO, one indeed has to choose between correctness
> and perform
wchogg:
>
> Hi Don,
> I have a bit more of a followup, actually. You make use of the built
> in bytestring consumer count, which itself is built upon the
> foldlChunks function which is only exported in the
> ByteString.Lazy.Internal. If I want to make my own efficient
> bytestring consumer, is
dagit:
> On Thu, Sep 18, 2008 at 12:31 PM, Creighton Hogg <[EMAIL PROTECTED]> wrote:
> > On Thu, Sep 18, 2008 at 1:55 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
> >> wchogg:
> >>> On Thu, Sep 18, 2008 at 1:29 PM, Don Stewart <[EMAIL PROT
manlio_perillo:
> Hi.
>
> I have a question about concurrent Haskell in GHC.
>
> Suppose I want to write a native pure Haskell PostgreSQL client.
> I have done this for Python (using Twisted):
> http://hg.mperillo.ath.cx/twisted/pglib/
>
> and I would like to do this in Haskell, as an exercise.
wchogg:
> To ask an overly general question, if lazy bytestring makes a nice
> provider for incremental processing are there reasons to _not_ reach
> for that as my default when processing large files?
At the moment, it would always be my first choice. Consider,
http://shootout.alioth.debian.
wchogg:
> On Thu, Sep 18, 2008 at 1:29 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
> > wchogg:
> >> Hey Haskell,
> >> So for a fairly inane reason, I ended up taking a couple of minutes
> >> and writing a program that would spit out, to the console, the nu
wchogg:
> Hey Haskell,
> So for a fairly inane reason, I ended up taking a couple of minutes
> and writing a program that would spit out, to the console, the number
> of lines in a file. Off the top of my head, I came up with this which
> worked fine with files that had 100k lines:
>
> main = do
Something like what Hayoo uses?
http://holumbus.fh-wedel.de/hayoo/hayoo.html
Lots of async stuff, JS and server chatter?
-- Don
titto:
> Hi Greg,
>
> have a look at: http://www.haskell.org/haskellwiki/Hajax
>
> Best,
>
> titto
>
> 2008/9/17 Greg Meredith <[EMAIL PROTECTED]>:
> > H
jason.dusek:
> What does Haskell have to say about cloud computing?
I'm not sure cloud computing is well-enough defined to say anything yet.
"paradigm in which information is permanently stored in servers on
the Internet and cached temporarily on clients that include
desktops, enter
jonathanccast:
>
> > The fact that people use thread-pools
>
> I don't think people use thread-pools with Concurrent Haskell, or with
> libthread.
>
Sure. A Chan with N worker forkIO threads taking jobs from a queue is a
useful idiom I've employed on occasion.
-- Don
__
manlio_perillo:
> Dougal Stanton ha scritto:
> >On Wed, Sep 17, 2008 at 1:17 PM, Manlio Perillo
> ><[EMAIL PROTECTED]> wrote:
> >>The Python tempfile module, as an example, implements a wrapper around
> >>mkstemp function that does exactly this, and the code is portable; on
> >>Windows it uses O_TE
manlio_perillo:
> Hi.
>
> After reading the chapter about IO in the "Real Word Haskell" book, I
> have noted that there is no support for opening a temporary file that
> will be automatically removed at program termination.
>
> The Python tempfile module, as an example, implements a wrapper aro
http://www.heise-online.co.uk/open/Shuttleworth-Python-needs-to-focus-on-future--/news/111534
"cloud computing, transactional memory and future multicore processors"
Get writing that multicore, STM, web app code!
-- Don
___
Haskell-Cafe mailing list
H
Very nice. Easy?
miguelimo38:
> Did that.
> http://migmit.vox.com/library/photo/6a00e398c5c26f000500fa9696d8c40002.html
>
> On 14 Sep 2008, at 14:17, Alberto R. Galdo wrote:
>
> >Hi, is there any chance of having hugs compile for the iPhone?
> >
> >Cross-compiling? Compiling directly on the i
1001 - 1100 of 1785 matches
Mail list logo
