dvde:
Don Stewart schrieb:
It is not possible to write a modifyIORef that *doesn't* leak memory!
Why? Or can one read about it somewhere?
Try writing a version of this program, using modifyIORef only,
such that it doesn't exhaust the heap:
import Data.IORef
import Control.Monad
dvde:
Don Stewart schrieb:
dvde:
Don Stewart schrieb:
It is not possible to write a modifyIORef that *doesn't* leak memory!
Why? Or can one read about it somewhere?
Try writing a version of this program, using modifyIORef only, such
that it doesn't exhaust
matthias.goergens:
Still, a fast and general way to output primitive data types would be
quite welcome.
Data.Binary is the way (though it doesn't yet use direct output for
float and double bits)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
toby.hutton:
On Wed, Jun 17, 2009 at 4:31 PM, Erik de Castro Lopo mle...@mega-nerd.com
wrote:
Well if the android phones have a JVM then something like OpenQuark
should do the trick.
The Android phones actually have a different VM which essentially takes
compiled/translated
tom.davie:
On 16 Jun 2009, at 05:18, Don Stewart wrote:
keithshep:
The answer is sometimes (only if you use an optimize flag):
You're turning on the strictness analyser. That's enabled with -O or
-O2.
But sum should be using a tail recursive foldl'. It's a bug in the H98
report, IMO
briand:
I have included a new and improved version.
Just to make the comparison a little more reasonable I re-wrote the
program using ML and ran it with SMLNJ
eal 0m3.175s
user 0m0.935s
sys 0m0.319s
Here's the compiled haskell (ghc -O2 foo.hs -o foo):
real 0m16.855s
user
si:
Dear Haskellers,
who needs this kind of documentation?
http://hackage.haskell.org/packages/archive/tfp/0.2/doc/html/Types-Data-Num-Decimal-Literals.html
isn't this a kind of spam?
Seems like a good case for the haddock -hide option.
-- Don
keithshep:
Is there any reason that sum isn't strict? I can't think of any case
where that is a good thing.
Prelude sum [0 .. 100]
*** Exception: stack overflow
It is strict when subject to strictness analysis (try compiling it).
-- Don
keithshep:
The answer is sometimes (only if you use an optimize flag):
You're turning on the strictness analyser. That's enabled with -O or
-O2.
But sum should be using a tail recursive foldl'. It's a bug in the H98
report, IMO.
-- Don
___
Galois is hiring.
Bringing together mathematicians, researchers and technologists, Galois,
based in Portland, Oregon, was founded in 1999 with the mission to apply
functional languages and formal methods to solve real world problems.
Today, over 30 members strong, we’re living the vision,
Can you use the bytestring csv parser (or convert it into a pretty
printer?)
bartek:
Hi Folks,
I had to transform Packed Decimal file into csv format (does anybody here
know
what this Mainframe format is?). Because of the file size I could not do
this on mainframe directly. So I've
simon:
Hi Chris.. thanks for your extensive work on haskell regex libs.
I'm looking for a good way to make my regex-using app more portable to
windows.
I couldn't figure out the difference between the regex-pcre and regex-
pcre-builtin on hackage. Could you clarify ?
pcre-builtin ships
coreyoconnor:
I'm interested in the feasibility of extending the compiler using a
construct similar to type synonym families to determine runtime
representation and evaluation strategy for types. Can anybody point me
to existing work in this area?
There's a lot of work on controlling data
nowgate:
Got it working.
I downloaded two packages, primes and Numbers. Since Numbers has the three
functions I want to use, primes, isPrime and isProbablyPrime, how do I
uninstall the primes package so there won't be a conflict?
Easy!
$ ghc-pkg unregister primes
-- Don
We're pleased to announce the second release of the Haskell Platform: a
single, standard Haskell distribution for everyone.
The specification, along with installers (including Windows and Unix
installers for a full Haskell environment) are available.
Download the Haskell Platform 2009.2.0.1:
leimy2k:
I'm also trying to figure out how bad/good Haskell Binary IO really is that
it's been addressed a few times differently :-)
FWIW Binary IO as implemented in Data.Binary is widely used in our
production systems at Galois. I'd be fairly confident in it.
-- Don
leimy2k:
encode/decode do Big Endian, and 9P does little endian.
From the man page:
Each message consists of a sequence of bytes. Two , four , and eight byte
fields hold unsigned integers represented in little endian order (least
significant byte first).
encode/decode just won't work
bos:
On Wed, May 27, 2009 at 11:02 AM, Robin Green gree...@greenrd.org wrote:
I would like to use the HsJudy bindings to the Judy high-performance
trie library (on hackage), but unfortunately they have bitrotted. I can
have a go at mending them but I have no experience with FFI.
jason.dusek:
On the IRC channel a few days ago, it was said that, as long
as we allow `seq`, Hask is not a valid category.
Doesn't this basically mean that a very large amount of
Haskell -- anything with strictness annotations -- can not be
described in a category Hask?
I'm not
duncan.coutts:
On Fri, 2009-05-22 at 05:30 -0700, Don Stewart wrote:
Answer recorded at:
http://haskell.org/haskellwiki/Performance/Parallel
I have to complain, this answer doesn't explain anything. This isn't
like straight-line performance, there's no reason as far as I can see
mblazevic:
On Fri 22/05/09 10:51 AM , John Lato jwl...@gmail.com sent:
Hi Mario,
It looks like the parallelize function is getting inlined when it's in
the same file, but not when it's in a separate file.
Adding a {-# INLINE parallelize #-} pragma to the module with
parallelize
matthias.goergens:
Hello,
Please pardon my naive question: Is there a way to sign on for ICFP
09? The homepage (http://www.cs.nott.ac.uk/~gmh/icfp09.html) only
seems to mention how to submit papers. Is there a way to attend as a
mere participant?
Registration will be open soon.
-- Don
matthias.goergens:
Registration will be open soon.
Thanks.
(I could have written an Experience Report about how I am using
Haskell at Deutsche Bahn, but that deadlines had already passed.)
You could add a brief abstract to:
http://haskell.org/haskellwiki/Haskell_in_industry
As a
matthias.goergens:
Hi,
By the way: Would it be considered good style to include QuickTest
properties into the pidigit submission?
Not in the submission, no.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
That's fixed in GHC 6.10.2 + though, IIRC.
arnaud.payement:
By the way, I did submit my solution. It improved the score a bit but it
is still very memory hungry.
- Original Message - From: Don Stewart d...@galois.com
To: Matthias Görgens matthias.goerg...@googlemail.com
Cc: Arnaud
brian:
Maybe most of the a.b people are thinking major.minor, and most of the
a.b.c people are thinking breaking.feature.implementation like the
rational RubyGems scheme described in
http://rubygems.org/read/chapter/7#page24 , but I don't know. It makes
it hard to describe dependencies. Will
Answer recorded at:
http://haskell.org/haskellwiki/Performance/Parallel
daniel.is.fischer:
Am Freitag 22 Mai 2009 04:59:51 schrieb Mario Blažević:
I'll cut to the chase. The short program below works perfectly: when I
compile it with -O2 -threaded and run with +RTS -N2 command-line
duncan.coutts:
What we're currently missing is a PVP checker: a tool to compare APIs of
package versions and check that it is following the PVP. Ideally, we
will have packages opt-in to follow the PVP for those packages that do
opt-in we have the PVP enforced on hackage using the checker tool.
vanenkj:
A bit off topic, but what's the chance we can get the Hackage RSS feed to
include some more information about the package? I'd like to see at least the
description, but it might be nice to see things like dependencies and home
pages.
what you really want is a way to query hackage
arnaud.payement:
Hi all,
I recently decided to rewrite the pidigits benchmark of the debian shootout
(shootout.alioth.debian.org) as toy project.
However, it seems that on my machine, the code seems to be more performant
than
both the current entry and the proposed replacement (see
vigalchin:
Hello,
I have some code with several test cases that use HUnit. I added hunit as
one of my cabal dependencies but cabal complained with:
Setup: At least the following dependencies are missing:
hutil -any
^
Typo.
-- Don
___
I guess my larger point is just a plea to the community: please be
really careful about what you do to GHC in point releases. This is not
the first issue that has screwed me in the GHC 6.10.x point releases.
I hope that the Haskell Platform will solve a lot of these issues.
Clear, planned
kenneth.hoste:
Hello,
For a while now, I've been trying to come up with a fast Haskell-only
function which implements Euclidean distance in n-dimensional space.
So far, I've been disappointed by the performance of my best effort
in Haskell, compared to C. I'm hoping some of the Haskell
vanenkj:
Hi all,
I'm giving a presentation to an IEEE group on Embedded DSL's and Haskell at
the
end of June. I need a 3 to 4 slide introduction to Haskell. What suggestions
does the community have? Is such a short intro possible?
It just needs to introduce the basics so I can show
code? For instance, how did you generate the content below? I guess
this is the core language version?
I'm a C/C++ coder and looking for the equivalent of Show Disassembly.
Cheers,
Sam
-Original Message-
From: haskell-cafe-boun...@haskell.org on behalf of Don Stewart
Sent: Mon 18
claus.reinke:
dist_fast :: UArr Double - UArr Double - Double
dist_fast p1 p2 = sumDs `seq` sqrt sumDs
where
sumDs = sumU ds
ds= zipWithU euclidean p1 p2
euclidean x y = d*d
where
jfredett:
While an incredibly small font is a clever option, a more serious
suggestion may be as follows.
3-4 slides imply 3-4 topics, so the question is what are the 3-4 biggest
topics in haskell? I would think they would be:
* Purity/Referential Transparency
* Lazy Evaluation
*
ekirpichov:
Actually, I don't think it's a good idea to introduce monads on one of
the 3-4 slides. While it *is* a core concept, it's not one of the
advertising bullet points; and 1 slide is not enough to show what
*use* monads are, let alone what they actually *are*.
I'd probably suggest
adam.turoff:
On Mon, May 18, 2009 at 2:06 PM, Don Stewart d...@galois.com wrote:
Exactly: focus on what the user wants to do (e.g. write multicore code,
write safe code, write code quickly), not how that is achieved:
bounded parametric polymorphism or monads
Parametric polymorphism
claus.reinke:
Once I actually add a 'dist_fast_inline_caller', that indirection
disappears in the inlined code, just as it does for dist_fast itself.
dist_fast_inlined_caller :: UArr Double - UArr Double - Bool
dist_fast_inlined_caller p1 p2 = dist_fast_inlined p1 p2 2
However, in
Sven.Panne:
Am Freitag, 15. Mai 2009 06:37:22 schrieb Don Stewart:
timd:
On a related matter, I am using Data.Binary to serialise data from
haskell for use from other languages. [...]
[...]
Yep, it's possible, just not portably so. Google for Data.Binary IEEE
discussions.
I think
vigalchin:
Hello,
I am confused between Haskell as delineated in the Haskell Report VS ghc
pragmas which extend Haskell beyond the Haskell Report. I am sure I am not
the first to ask. Caveat: on my part, I am not against innovation/extensions,
but I don't like to see language bloat.
Data.Map in the containers library.
vigalchin:
Hello,
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/FiniteMap
...
since this is deprecated what is the orthodox way to implement finite map??
Thanks,
Vasili
___
thestonetable:
Hey,
Besides fgl, are there any graph libraries in Haskell that are still
maintained? Are there other papers (or books) besides Erwig's that I
could use to understand how graph algorithms have been implemented in
functional languages?
Has anything even been published on
nowgate:
Why won't this code compile?
[mich...@localhost ~]$ ghc ex14.hs -o ex14
Missing --make
I'd also add -O2, but I'm like that.
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
jmaessen:
On May 14, 2009, at 11:01 AM, Dan Doel wrote:
On Thursday 14 May 2009 9:03:30 am Jan-Willem Maessen wrote:
Hmm, I think neither of the data structures you name actually support
both O(lg n) indexing and O(lg n) cons or append. That said, your
point is well taken, so let's instead
leimy2k:
I actually need little endian encoding... wondering if anyone else hit this
with Data.Binary. (because I'm working with Bell Lab's 9P protocol which does
encode things on the network in little-endian order).
Anyone got some tricks for this?
Yes!
There are big, little and
leimy2k:
On Thu, May 14, 2009 at 8:40 PM, Don Stewart d...@galois.com wrote:
leimy2k:
I actually need little endian encoding... wondering if anyone else hit
this
with Data.Binary. (because I'm working with Bell Lab's 9P protocol which
does
encode things
I'm speaking specifically of the encode/decode functions. I have no idea how
they're implemented.
Are you saying that encode is doing something really simple and the default
encodings for things just happen to be big endian? If so, then I understand
the pain but it still means I have
timd:
On a related matter, I am using Data.Binary to serialise data from
haskell
for use from other languages. The Data.Binary encoding of a Double is a
long
integer for the mantissa, and an int for the exponent. This doesn't
work too well for interacting with other languages as I'd need to
ketil:
Not of the same gravity as mtl, but I was a bit surprised to see that
PackedString was included, in spite of it being marked as deprecated
on Hackage.
Ketil, I would encourage you to open a ticket on the platform wiki
summarising the state of the packedstring issue.
-- Don
wrwills:
The only web-oriented frp framework that I know of is Flapjax
http://www.flapjax-lang.org/
Flapjax is javascript so possibly there could be a way to integrate it
into Haskell using HJavascript? Maybe it could even be integrated
into Happstack?
I'm also quite new to Haskell.
gwern0:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
On Wed, May 13, 2009 at 7:45 AM, Robin Green wrote:
I don't agree. TH can sometimes slow down a build considerably. I don't
want to see it getting even slower.
I once switched TH to Strings. All the uses are trivial, and the
wren:
Jan-Willem Maessen wrote:
I wanted to clear up one misconception here...
wren ng thornton wrote:
In heavily GCed languages like Haskell allocation and collection is
cheap, so we don't mind too much; but in Java and the like, both
allocation and collection are expensive so the
heringtonlacey:
I have a large body of C/C++ code at work that I'd like to be able to
access from Haskell via FFI. Because the interface to this code is
broad, hsffig would seem to be ideal for the task.
I've run across one serious hitch, though. The existing #include file
graph is
heringtonlacey:
At 9:59 PM -0700 5/13/09, Don Stewart wrote:
heringtonlacey:
I have a large body of C/C++ code at work that I'd like to be able
to access from Haskell via FFI. Because the interface to this code
is broad, hsffig would seem to be ideal for the task.
I've run across one
rjones:
I added some partial bindings for libguestfs[1] here:
http://git.et.redhat.com/?p=libguestfs.git;a=blob;f=haskell/Guestfs.hs;hb=HEAD
Some very simple example programs which use these bindings:
http://git.et.redhat.com/?p=libguestfs.git;a=tree;f=haskell;hb=HEAD
Any comments
paulfrancis:
Does any programmer on this mailing list have experience with developing 3
dimensional interactive environments/functional objects within them, au Second
Life? Is Haskell useful for such an endeavor?
Mm..
Anygma
http://www.anygma.com/JobOfferA.html
gamr7
rjones:
On Tue, May 12, 2009 at 08:18:08AM -0700, Don Stewart wrote:
rjones:
I added some partial bindings for libguestfs[1] here:
http://git.et.redhat.com/?p=libguestfs.git;a=blob;f=haskell/Guestfs.hs;hb=HEAD
Some very simple example programs which use these bindings
rl:
On 12/05/2009, at 14:45, Reiner Pope wrote:
The Stream datatype seems to be much better suited to representing
loops than the list datatype is. So, instead of programming with the
lists, why don't we just use the Stream datatype directly?
I think the main reason is that streams don't
Lee, Chakravarty et al
Data Parallelism in Haskell : ICFP PC Portland 2009
http://bit.ly/17EQcl
The other thing to look for is Obsidian, from Chalmers
danielkcook:
Hi,
Does anyone know if there's a compiler from Data-Parallel Haskell to GPU
code? I saw a paper on it a while back,
wagner.andrew:
So I've been reading a lot about a (relatively) new language called Clojure.
One of its goals is to make concurrency easier via a built-in home-grown STM.
Anyway, one of the ways it tries to do this is to have completely immutable
data structures. Every time I read a tutorial
wagner.andrew:
Purity allows our data structures to have a lot of sharing.
This is separate to laziness.
Ah, so haskell does do it. Interesting that it so rarely comes up, whereas
it's
frequently mentioned in clojure.
I think it is just assumed, since that's been the case for 20
Andy Gill has been advocating programmatic access to the 'is evaluated'
status bit for years now. 'seq' becomes cheaper, and we can write
operational properties/assertions about strictness.
-- Don
jochem:
Nikhil Patil wrote:
Hi,
I am curious to know if there is a function in Haskell to
We're all on haskell-cafe@ :)
itsme213:
I could not find any contact info for Brian O'Sullivan, Don Stewart, or John
Goerzen on their book site. Any pointers to how I might locate any of them
much appreciated.
Thanks!
Sophie
___
Haskell-Cafe
kyagrd:
Thanks for this great effort!
Are we going to have a meta-package on hackage as well?
(which makes it able to build it through cabal-install)
Yes, this ticket tracks that stuff:
http://trac.haskell.org/haskell-platform/ticket/15
___
vigalchin:
Hello,
With Haskell Foundation,
1) Can we still publish packages on Hackage?
2) Is Hackage going away?
???
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
) Will Hackage go away?
Vasili
On Thu, May 7, 2009 at 6:07 PM, Don Stewart d...@galois.com wrote:
vigalchin:
Hello,
With Haskell Foundation,
1) Can we still publish packages on Hackage?
2) Is Hackage going away?
???
-- Don
fft1976:
I've heard it's hard to contain a long-running Haskell application in
a finite amount of memory, but this is probably not a problem if your
Hmm. Gossip driven development?
web site sleeps 0.001% of the time (like XMonad), or you can restart
it every once in a while without anyone
dagit:
In particular, we need expert Haskell programmers, such as Don, to
write more about how they avoid space leaks in long running apps.
Again, profiling is nice, but that's more of a tuning effort.
I talk a bit about that in my LondonHUG talk:
ok:
On 5 May 2009, at 8:30 pm, Magnus Therning wrote:
On Tue, May 5, 2009 at 1:04 AM, Richard O'Keefe o...@cs.otago.ac.nz
wrote:
I never really understood why it was thought to be relevant,
but I was challenged to show that n+k patterns occurred in
Hackage.
Why is it relevant?
Some
We're pleased to announce the first release of the Haskell Platform:
a single, standard Haskell distribution for every system.
Download the Haskell Platform 2009.2.0 installers and specification:
http://hackage.haskell.org/platform/
The Haskell Platform is a blessed library and tool suite
andrewcoppin:
OK, so I'm pretty sure I'm not the first person to run into this...
I've got a fairly large, complex program. It seems to work fine. But now
I want to add some counters to measure various things.
Trouble is, to do that, I'd have to infect the entire program with
, as I plan to use BerkeleyDB and
Haskell bindings for it are poorly written.
Best regards
Christopher Skrzętnicki
2009/5/3 Don Stewart d...@galois.com:
gtener:
Hi
I'm looking for a data structure with following characteristics:
1. O(1) lookup
2. O(1) modification
3. amortized O
I think the Hinze streams package I uploaded on Sunday uses n+k...
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hinze-streams-1.0
turn :: (Integral a) = a - [a]
turn 0= []
turn (n + 1) = turn n ++ [n] ++ turn n
vanenkj:
Which package?
/jve
On Mon,
rise to
the top of the window stack--it remains behind the terminal window.
Thanks for you help,
-- Duane
On May 2, 2009, at 6:07 PM, Don Stewart wrote:
Yes, it is quite fun.
I think it should be using cabal's datadir from Paths_silkworm.hs to
install (and find) the resources.
Yell
Excellent work!
Time to upload to hackage??
-- Don
duane.johnson:
Reprinted from my blog post [1]:
===
The semester is over, my final project was a success (at least in that I
passed the class) and it’s time now to release the game I made for
Graphics 455: Silkworm!
This is my first
Yes, it is quite fun.
I think it should be using cabal's datadir from Paths_silkworm.hs to
install (and find) the resources.
Yell if you can't figure out how to do that. (xmonad has an example)
-- Don
bugfact:
Congratulations!!! It is actually a fun game to play too :-)
On Sat, May 2, 2009
Just a reminder, the Haskell Reddit is live and active:
http://www.reddit.com/r/haskell/
It is a a place for fast, daily, comprehensive news about what's going
on in the Haskell community, combining blogs, mail, irc, ghc's patches,
the freaking types@ mailing list! It's all here, with
briqueabraque:
Hi,
Do you understand very well a C library and would like Haskell
to have a binding for it?
I've been working on this package:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bindings
My goal is to have a place where one can find reliable and
comprehensive
dons:
briqueabraque:
Hi,
Do you understand very well a C library and would like Haskell
to have a binding for it?
I've been working on this package:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bindings
My goal is to have a place where one can find reliable
briqueabraque:
Do you understand very well a C library and would like
Haskell to have a binding for it? (...) If you are
willing to help me with questions about your favorite C
library, like compile options I should be carefull about
or differences I may find between systems, I'll be
tomahawkins:
Atom is a DSL in Haskell for designed hard realtime embedded programs.
At Eaton, we are using it to control hydraulic hybrid refuse trucks
and shuttle buses. After my talk at CUFP
(http://cufp.galois.com/2008/schedule.html), a few people inquired
about atom -- I finally had a
lane:
Is there any interest or movement in developing thread priority or any
other realtime support in Haskell?
I think thread priorities would be really cool :)
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
semanticphilosopher:
Count me in too
I've got a library that endeavours to deliver 'rate-equivalence' - i.e
there may be some jitter in when the events should have occurred but
their long term rate of progress is stable.
Testing has shown that I can get events to occur at the right time
semanticphilosopher:
Count me in too
I've got a library that endeavours to deliver 'rate-equivalence' - i.e
there may be some jitter in when the events should have occurred but
their long term rate of progress is stable.
Testing has shown that I can get events to occur at the right time
Slides from last week's London HUG http://www.londonhug.net/ talk are
now online. The talk attempts to document some of the tips and tricks
Galois has accumulated using Haskell commercially for the past 10 years.
You can now read the slides of the talk here:
tom.davie:
On 19 Apr 2009, at 11:10, Duncan Coutts wrote:
On Sun, 2009-04-19 at 10:02 +0200, Thomas Davie wrote:
It really rather makes cabal install rather odd – because it
doesn't actually install anything you can use without providing
extra
options!
It should work fine, you'll need
Very cool!
We need an hmatrix-static tutorial!
aruiz:
Using hmatrix-static:
import Numeric.LinearAlgebra.Static
m = [$mat| 46.0,37.0;
71.0,83.0 |]
es = [$mat| 40.9746835443038,42.0253164556962;
76.0253164556962,77.9746835443038 |]
chisquare = sum . toList .
dbueno:
Hi all,
In a command-line app of mine I want to have a --version flag, like
many GNU apps do to report their version. The only way I know to
provide the version number is to hardcode it in the source code
somewhere. That means I have the version number in two places: the
.cabal
-fno-state-hack?
xofon:
Hello all,
I have a haskell program that runs an order of magnitude slower
when compiled with optimisations turned on. This happens on 6.8.2
as well as 6.10.1:
p...@r4at184:/tmp[1]% ghc --make -fforce-recomp -o out buga.hs
[1 of 1] Compiling
johan.tibell:
Hi,
I just uploaded network-2.2.1. It appears on Hackage [1] but a `cabal
update` followed by `cabal install network-2.2.1` results in:
Resolving dependencies...
cabal: There is no available version of network that satisfies ==2.2.1
The upload took a very long time and it
cristiano.paris:
On Sat, Apr 4, 2009 at 10:21 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Cristiano,
...
there was a large thread a few months ago and many peoples voted for
excluding any OS-specific packages at all since this decreases
portability of code developed by
bugfact:
Rumor goes that this is very difficult to do with Darcs. Is this correct?
darcs unpull
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Please upload!!
moonpatio:
Holy crap! That looks amazing. I think you should most definitely upload it.
2009/4/1 Gleb Alexeyev gleb.alex...@gmail.com
Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell
library
for interactive
Did you use hubigraph?
http://ooxo.org/hubigraph/
This cabalized project doesn't appear to be on hackage!
gleb.alexeev:
Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell library
for interactive rendering and display of values on the GHC heap using
Matt
Yes. It would be fairly easy to check this in the docs, too :)
bugfact:
Okay, thanks. So the rumors about this must be incorrect?
On Wed, Apr 1, 2009 at 9:57 PM, Ketil Malde ke...@malde.org wrote:
Don Stewart d...@galois.com writes:
Rumor goes that this is very difficult to do
malcolm.wallace:
On 30 Mar 2009, at 20:16, Andrew Coppin wrote:
Lennart, what is the next language DSL you are going to build?
Prolog? XSLT?
Declarative 3D scene construction? ;-)
The ICFP programming contest in year 2000 was to write a ray tracer for a
given declarative 3D scene
Is there a Mac OSX packaging team?
sebf:
On Mar 31, 2009, at 7:40 AM, Don Stewart wrote:
I am pleased to announce the release of vacuum-cairo, a Haskell
library
for interactive rendering and display of values on the GHC heap using
Matt Morrow's vacuum library.
Awesome! I want to try
Can I close this ticket as not being to do with uvector?
-- Don
manlio_perillo:
Claus Reinke ha scritto:
But Claus was right, appendU is lazy; this seems to be the cause of
the problem.
appendU is strict, insertWith just doesn't force it (follow the source link
in the haddocks to see
501 - 600 of 1711 matches
Mail list logo
