On Wed, 2009-02-11 at 01:50 +0100, Manlio Perillo wrote:
George Pollard ha scritto:
[...]
So, it seems nanosleep get interruped by a signal.
This works:
import System.Posix
main = do
putStrLn Waiting for 5 seconds.
blockSignals $ addSignal sigVTALRM emptySignalSet
Hello Jamie,
Wednesday, February 11, 2009, 5:54:09 AM, you wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
anyway it's impossible due to slow code generated by ghc
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Hi,
I noticed last year Haskell.org was a mentoring organization for
Google's Summer of Code, and I barely noticed some discussion about it
applying again this year :)
I participated for GCC in 2008 and would like to try again this year;
while I'm still active for GCC and will surely stay
Yes, Just must be executed because by the very definition of bind for the
Maybe mondad,
(=) Nothing f = Nothing
(=) (Just x) f = f x
He need to know if the value injected is Just or Nothing, but anyway, my
point is : it is just plain lazy functional code!. No magic inside.
2009/2/11 Gwern Branwen gwe...@gmail.com:
[^complaints]: I can hear the wankers in the peanut gallery - Yeah,
and it's been buggy ever since! Hush you.
Those (aforementioned) people should keep in mind we tried to keep the
scope of the project down to just making the new Haddock support the
On Tue, 2009-02-10 at 10:21 -0800, Corey O'Connor wrote:
I released a new version of data-spacepart that resolved some of the
issues with the previous release. One issue I had was the previous
release used the version numbering scheme I use at work:
[date].[release] Which does not appear to
Peter Gavin wrote:
https://sourceforge.net/project/showfiles.php?group_id=49207package_id=42440release_id=659598
Maybe you could update your central page http://www.haskell.org/gtk2hs/
at least with a link to a new central page. You also did not care much
about bug tracking via
I've released a new version of the Data.Stream package, a modest
library for manipulating infinite lists.
Changes include:
* Support for lazy SmallCheck;
* Improved Show instance;
* Stricter scans;
* Various documentation fixes;
* Several new functions from Data.List.
Many of these
Great job! I have been using the RC1 version for a while and it works well.
- Full switch to the new model-view implementation using a Haskell model
This is very interesting. Do demos exist to show this?
On Wed, Feb 11, 2009 at 5:32 AM, Peter Gavin pga...@gmail.com wrote:
Hi everyone,
I'd
Am Mittwoch, 11. Februar 2009 00:46 schrieben Sie:
I suppose I should point out what seems obvious to me, which is that one
could embed a substantial chunk of MathML (possibly all of it) in TeX. I
mean, give it a TeX-parseable syntax.
You can convert MathML into TeX but not the other way
Nice. The demos are now included only in the source distri right?
On Wed, Feb 11, 2009 at 1:40 PM, Axel Simon axel.si...@ens.fr wrote:
On Wed, 2009-02-11 at 13:36 +0100, Peter Verswyvelen wrote:
Great job! I have been using the RC1 version for a while and it works
well.
- Full switch
I wonder whether this can be done in Haskell (see muleherd's comment):
http://www.reddit.com/r/programming/comments/7wi7s/how_continuationbased_web_frameworks_work/
Cristiano
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could do, but as far as I understand it, it is
still work in progress.
On Wed, Feb 11, 2009 at 2:22 PM, Cristiano Paris
cristiano.pa...@gmail.comwrote:
I wonder whether this can be done in
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com:
I wonder whether this can be done in Haskell (see muleherd's comment):
http://www.reddit.com/r/programming/comments/7wi7s/how_continuationbased_web_frameworks_work/
WASH did/does something similar. You can certainly write applications
in a
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com wrote:
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could do, but as far as I understand it, it is
still work in progress.
I'm interested in the possibility of
On Wed, Feb 11, 2009 at 9:34 PM, Alistair Bayley alist...@abayley.org wrote:
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com:
I wonder whether this can be done in Haskell (see muleherd's comment):
http://www.reddit.com/r/programming/comments/7wi7s/how_continuationbased_web_frameworks_work/
On Wed, Feb 11, 2009 at 1:41 PM, Cristiano Paris
cristiano.pa...@gmail.comwrote:
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com
wrote:
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could do, but as far as I
Hi Bulat,
On Wed, 11 Feb 2009, Bulat Ziganshin wrote:
Hello Jamie,
Wednesday, February 11, 2009, 5:54:09 AM, you wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
anyway it's impossible due to slow code generated by ghc
I see, I guess I'll have to stuck
On Wed, Feb 11, 2009 at 2:53 PM, Sebastian Sylvan
syl...@student.chalmers.se wrote:
I think that would be difficult. You could probably store the continuation
in a server-side cache if you aren't doing CGI but have a persistent server
process, but eventually you'll need to discard unused
On Tue, Feb 10, 2009 at 11:40 PM, Peter Gavin pga...@gmail.com wrote:
Hi everyone,
Oh, dear... it seems I've forgotten how to spell cafe, and sent this
message to haskell-c...@haskell.org the first time around. I resent it to
all the lists again (just to make sure everyone interested receives
Does this version work from ghci?
-- Lennart
On Wed, Feb 11, 2009 at 5:40 AM, Peter Gavin pga...@gmail.com wrote:
Hi everyone,
Oh, dear... it seems I've forgotten how to spell cafe, and sent this
message to haskell-c...@haskell.org the first time around. I resent it to
all the lists
Seems like it is ok to write H.264 in Haskell and released via GPL license?
There is theora.org but H.264 would be ideal. Ditto for H.263.
Software patent issues are entirely orthogonal to the copyright issues of who
wrote what under which license. That's why software patents suck so very
On Wed, Feb 11, 2009 at 09:43:34PM +0800, Evan Laforge wrote:
On Wed, Feb 11, 2009 at 9:34 PM, Alistair Bayley alist...@abayley.org wrote:
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com:
I wonder whether this can be done in Haskell (see muleherd's comment):
On Wed, Feb 11, 2009 at 9:40 AM, Bulat Ziganshin
bulat.zigans...@gmail.comwrote:
Hello Jamie,
Wednesday, February 11, 2009, 5:54:09 AM, you wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
anyway it's impossible due to slow code generated by ghc
Cristiano Paris ha scritto:
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com wrote:
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could do, but as far as I understand it, it is
still work in progress.
I'm interested in
On Wed, Feb 11, 2009 at 10:00 AM, Jamie hask...@datakids.org wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
There is theora.org but H.264 would be ideal. Ditto for H.263.
Software patent issues are entirely orthogonal to the copyright issues of
who
Conrad Meyer wrote:
On Tuesday 10 February 2009 06:41:54 am Simon Marlow wrote:
John Goerzen wrote:
Just to close -- I will point out that ghci doesn't work on many
platforms that Hugs does (though ghc does). Hugs is the only
interpreter on some of these platforms.
I didn't see anyone follow
Hi Jamie,
As a side note - I'd be very interested to see a Haskell implementation of
H264 decoding. I'm currently having to use the ffmpeg library in C, and
it's notoriously buggy with memory leaks left right and centre. A
haskell solution would be very much welcome!
Regards,
Chris.
On Wed, 11
On Wed, Feb 11, 2009 at 4:08 PM, Manlio Perillo
manlio_peri...@libero.it wrote:
Cristiano Paris ha scritto:
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com
wrote:
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could
Jake McArthur wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Henning Thielemann wrote:
| in that module I defined the text to be printed as top-level
| variable which might have been the problem. But this can't be the
| problem of the compiled version of the program, where I encountered
John Goerzen ha scritto:
[...]
There were also issues with people using the back button.
It reminded me a fair bit of the issues I ran into when using Python's
Twisted framework, actually.
Same experience, with Twisted Web + Nevow.
All solved after switching to WSGI and a simple WSGI
Yes, I was really surprised that this was the case. I while ago I did a
little FRP experiment. I made a top level binding to a list of timer event
occurrences. The list was generated on another thread. To my surprise, I did
not have space leak, which is amazingly cool, but it felt odd :) Is it
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Simon Marlow wrote:
| FUD! CAFs are definitely garbage collected, in fact we have a big lump
| of code generator and runtime complexity (Static Reference Tables, SRTs)
| to ensure that they do.
|
| However, GHCi doesn't always GC CAFs, perhaps
Hello,
I'm working on some code like the following:
class Chunkable c el | c - el where
cLength :: c - Int
cHead :: c - Maybe el
I want to be able to map over this type, like this:
cMap :: Chunkable c' el' = (el - el') - c - c'
but this isn't quite right. c' shouldn't be any
What do you mean by parameterized over a different type?
will c have a kind of * - * ? I don't think it has to be for what you
want to work, but the idea of same instance will go out the window.
Do you have a small usage example?
On Wed, Feb 11, 2009 at 11:52 AM, John Lato jwl...@gmail.com
gwern0:
(The following is a quasi essay/list of past Summer of Code projects;
my hope is to guide thinking about what Summer of Code projects would
be good to pick, and more specifically what should be avoided.
If you're in a hurry, my conclusions are at the bottom.
The whole thing is written
bulat.ziganshin:
Hello Jamie,
Wednesday, February 11, 2009, 5:54:09 AM, you wrote:
Seems like it is ok to write H.264 in Haskell and released via GPL
license?
anyway it's impossible due to slow code generated by ghc
Been a long time since you did high perf code -- we routinely now
Hi Job,
Thanks for answering. What I'm trying to do is probably very simple,
and I think the biggest problem is that I don't fully understand kinds
yet.
Here's an example instance:
instance Chunkable [a] a where
cmap = map
--etc.
In the class I wrote, c has kind * (e.g. [a]), but then I
Evan Laforge qdun...@gmail.com wrote:
On Wed, Feb 11, 2009 at 9:34 PM, Alistair Bayley
alist...@abayley.org wrote:
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com:
I wonder whether this can be done in Haskell (see muleherd's
comment):
On Wed, Feb 11, 2009 at 12:27 PM, Don Stewart d...@galois.com wrote:
gwern0:
(The following is a quasi essay/list of past Summer of Code projects;
my hope is to guide thinking about what Summer of Code projects would
be good to pick, and more specifically what should be avoided.
If you're in
d:
Hi,
I noticed last year Haskell.org was a mentoring organization for
Google's Summer of Code, and I barely noticed some discussion about it
applying again this year :)
I participated for GCC in 2008 and would like to try again this year;
while I'm still active for GCC and will
Hi Bulat,
I know you've talked about performance in the past, and I don't want
to start a huge argument, but do you have recent data to back this up?
IIRC you're using ghc 6.6, yes?
I haven't looked at H.264 (and I realize it's compressed, so the
situation is different from my work), however
Manlio Perillo ha scritto:
The only thing I miss is a little higher level of abstraction.
Right now I operate on request bodies (in a text format, usually
request body should be replaced with response body
Manlio
___
Haskell-Cafe mailing list
Bulat Ziganshin bulat.zigans...@gmail.com wrote:
impossible
impossible, adj:
1) admittance of loosing an argument
2) tease to make someone do something
--
(c) this sig last receiving data processing entity. Inspect headers
for copyright history. All rights reserved. Copying, hiring,
Bulat Ziganshin wrote:
Hello Andrew,
Thursday, February 5, 2009, 11:10:42 AM, you wrote:
Does anybody know how to make this stuff actually work?
nvidia has cuda site where you can download sdk. afair, dr dobbs
journal has (online) series of arcticles which describes how to
program
OK, so I have a small question.
I was just wondering what the current state of development with GHC is.
So, I had a look at the developer wiki. Unfortunately, as best as I can
tell, most of the status pages haven't been updated in many months.
(Most of them still talk about what will or won't
andrewcoppin:
OK, so I have a small question.
I was just wondering what the current state of development with GHC is.
So, I had a look at the developer wiki. Unfortunately, as best as I can
tell, most of the status pages haven't been updated in many months.
(Most of them still talk
On Wed, Feb 11, 2009 at 5:41 PM, Achim Schneider bars...@web.de wrote:
Evan Laforge qdun...@gmail.com wrote:
On Wed, Feb 11, 2009 at 9:34 PM, Alistair Bayley
alist...@abayley.org wrote:
2009/2/11 Cristiano Paris cristiano.pa...@gmail.com:
I wonder whether this can be done in Haskell
I'm wondering if there are people in the West Michigan, USA area who'd be
interested in forming WMHUG (West Michigan Haskell Users Group).
Any one on here from that area?
/jve
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2009/2/10 John Van Enk vane...@gmail.com:
I'd like to see some good libgcrypt[1] bindings to complement our existing
cryptography packages.
/jve
Here are the projects I favor (in no particular order):
* I'd like to see the X-saiga parser library finished:
I was wondering if anyone could point me to a more in-depth explanation of
why we are (currently) restricted to using a special-purpose standard
Prelude when writing vectorised code with DPH. We're prototyping using
several data-parallel languages for a research project here at Northwestern
You should have mentioned this a year ago! I must moved out of that area
middle of last year...
2009/2/11 John Van Enk vane...@gmail.com
I'm wondering if there are people in the West Michigan, USA area who'd be
interested in forming WMHUG (West Michigan Haskell Users Group).
Any one on here
D:
Tragedy!
/jve
On Wed, Feb 11, 2009 at 2:46 PM, Tim Wawrzynczak inforichl...@gmail.comwrote:
You should have mentioned this a year ago! I must moved out of that area
middle of last year...
2009/2/11 John Van Enk vane...@gmail.com
I'm wondering if there are people in the West Michigan,
Hi Gwern,
On Wed, 11 Feb 2009, Gwern Branwen wrote:
I just checked H.263 and it looks like it does not require patent licensing
at all (it is created by ITU-T Video Coding Experts Group (VCEG)) so one can
write H.263 in Haskell and release freely without patent licensing issues.
So writing
Hello Don,
Wednesday, February 11, 2009, 8:28:33 PM, you wrote:
anyway it's impossible due to slow code generated by ghc
Been a long time since you did high perf code -- we routinely now write
code that previously was considered not feasible.
which is still slower than C and need more time
I apologize - I forgot to include this in my previous posting.
I also couldn't seem to find an implementation of the foldP function, which
is included in several of Roman's papers on DPH and ndp in general. Is this
not implemented yet?
Thanks,
James Swaine
Hello John,
Wednesday, February 11, 2009, 8:54:35 PM, you wrote:
I know you've talked about performance in the past, and I don't want
to start a huge argument, but do you have recent data to back this up?
IIRC you're using ghc 6.6, yes?
i don't seen examples of high-performance code written
You can do this with another type class.
class (Chunkable c1 el1, Chunkable c2 el2) = ChunkMap c1 el1 c2 el2 where
cMap :: (el1 - el2) - c1 - c2
instance ChunkMap [a] a [b] b where cMap = map
If you want to assert that c1 and c2 are really related, you can add
functional dependencies to
Hi John,
In the class I wrote, c has kind * (e.g. [a]), but then I don't see
how to write a suitable map function. For that, I would want c to
have kind * - *. Unfortunately then I don't know to write the
others.
Would I have to do something with c having kind (* - *) ?
class
I think what you probably want is something like this:
class Chunckable c where
cLength :: c el - Int
cHead :: c el - Maybe el
cMap :: (a - b) - c a - c b
instance Chunckable [] where
cLength [] = 0
cLength (x:xs) = 1 + cLength xs
cHead [] = Nothing
cHead (x:xs) = Just x
cMap =
Thanks Don!
On Tue, Feb 10, 2009 at 10:29 PM, Don Stewart d...@galois.com wrote:
leimy2k:
Was there a reason for this? If so, it'd be nice if the package that was
build
explained why... otherwise it feels kind of arbitrary, and would be nice
if
there was documentation available to make
On Wed, Feb 11, 2009 at 8:05 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello John,
Wednesday, February 11, 2009, 8:54:35 PM, you wrote:
I know you've talked about performance in the past, and I don't want
to start a huge argument, but do you have recent data to back this up?
bulat.ziganshin:
Hello Don,
Wednesday, February 11, 2009, 8:28:33 PM, you wrote:
anyway it's impossible due to slow code generated by ghc
Been a long time since you did high perf code -- we routinely now write
code that previously was considered not feasible.
which is still slower
Hello John,
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
it's exactly example of tight loop. and let's compare HP code written
for this task with analogous code written in C. i expect that haskell
code is much more complex
I think it's fair to point out that tight loops are nearly
Hello Don,
Wednesday, February 11, 2009, 11:58:13 PM, you wrote:
fast as possible, but i don't know anyone using haskell to write
high-performance code. so you ask for non-existing specialists
We're doing it at Galois regularly. Check out the blog.
i scanned through
bulat.ziganshin:
Hello John,
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
it's exactly example of tight loop. and let's compare HP code written
for this task with analogous code written in C. i expect that haskell
code is much more complex
I think it's fair to point out
On Thu, Feb 12, 2009 at 12:41 AM, Cristiano Paris
cristiano.pa...@gmail.com wrote:
On Wed, Feb 11, 2009 at 2:30 PM, Peter Verswyvelen bugf...@gmail.com wrote:
I haven't looked at the details, but I think this is what a library like
Reactive from Conal Elliott could do, but as far as I
When i try to cabal install happs-tutorial I get the following error:
ghc: panic! (the 'impossible' happened)
(GHC version 6.10.1 for i386-unknown-linux):
RegAllocLinear.getStackSlotFor: out of stack slots, try -fregs-graph
Please report this as a GHC bug:
This is a known issue:
http://hackage.haskell.org/trac/ghc/ticket/1993
Try:
cabal install --ghc-options=-fregs-graph Crypto
and then try installing happs-tutorial again.
-Ross
On Feb 11, 2009, at 4:31 PM, Daryoush Mehrtash wrote:
When i try to cabal install happs-tutorial I get the
On 12 Feb 2009, at 1:40 am, Wolfgang Jeltsch wrote:
Am Mittwoch, 11. Februar 2009 00:46 schrieben Sie:
I suppose I should point out what seems obvious to me, which is
that one
could embed a substantial chunk of MathML (possibly all of it) in
TeX. I
mean, give it a TeX-parseable syntax.
number schemes of the X.Y.Z form are easier to work
with when defining cabal depends constraints. A user of the library
can use the constrain data-spacepart == 0.1.* to specifying a
dependency on any 0.1 release. For date-based version numbers what
would the constraint be? data-spacepart == 20090211
2009/2/11 Gwern Branwen gwe...@gmail.com:
touch tools/c2hs/c2hsLocal.deps; /home/gwern/bin/bin/ghc -M -dep-makefile
-optdeptools/c2hs/c2hsLocal.deps -fglasgow-exts -O
On Thu, Feb 12, 2009 at 8:11 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
And ghc is still making large improvements with
each release, whereas gcc isn't likely to get significantly better.
yes, it's close to perfect
LOL!
Hi Haskell Cafe,
I'm interested in writing some events and event handlers in Haskell. I
already have a Loop data structure, and I intend to use it for this purpose:
-- Create event
tEvent - newLoop (return ())
-- Register event handlers
tHandler1 - newLoop (putStrLn Handler1)
tHandler2 -
On Wed, Feb 11, 2009 at 21:00, Jamie hask...@datakids.org wrote:
Hi Gwern,
On Wed, 11 Feb 2009, Gwern Branwen wrote:
I just checked H.263 and it looks like it does not require patent
licensing
at all (it is created by ITU-T Video Coding Experts Group (VCEG)) so one
can
write H.263 in
Thanks for the analysis, this clarifies things greatly.
Feasibility and scope is a big part of how we determine what projects to
work on.
gtener:
On Wed, Feb 11, 2009 at 21:00, Jamie hask...@datakids.org wrote:
Hi Gwern,
On Wed, 11 Feb 2009, Gwern Branwen wrote:
I just checked H.263
On Wed, 2009-02-11 at 15:49 +0100, Lennart Augustsson wrote:
Does this version work from ghci?
-- Lennart
Specifically I believe Lennart is asking about Windows. It's worked in
ghci in Linux for ages and it worked in ghci in Windows prior to the
0.9.13 release.
In the 0.9.13 release on
Hello Don,
Thursday, February 12, 2009, 12:23:16 AM, you wrote:
Check out what GHC is doing these days, and come back with an analysis
of what still needs to be improved. We can't wait to hear!
can you point me to any haskell code that is as fast as it's C
equivalent?
--
Best regards,
bulat.ziganshin:
Hello Don,
Thursday, February 12, 2009, 12:23:16 AM, you wrote:
Check out what GHC is doing these days, and come back with an analysis
of what still needs to be improved. We can't wait to hear!
can you point me to any haskell code that is as fast as it's C
Hi all,
On Tue, Feb 10, 2009 at 3:26 PM, Malcolm Wallace
malcolm.wall...@cs.york.ac.uk wrote:
If you have ideas for student projects that you think would benefit the
Haskell community, now is the time to start discussing them on mailing
lists of your choice. We especially encourage students
Do we already have enough information to turn
http://okmij.org/ftp/Haskell/Iteratee/ into a nice, generic, cabalized
package? I think Iteratees may prove themselves as useful as
ByteStrings.
--
Felipe.
___
Haskell-Cafe mailing list
Hello Don,
Thursday, February 12, 2009, 3:45:36 AM, you wrote:
You should do your own benchmarking!
well, when you say that ghc can generate code that is fast as gcc, i
expect that you can supply some arguments. is the your only argument
that ghc was improved in last years? :)
--
Best
On Thu, Feb 12, 2009 at 2:12 AM, Felipe Lessa felipe.le...@gmail.com wrote:
Do we already have enough information to turn
http://okmij.org/ftp/Haskell/Iteratee/ into a nice, generic, cabalized
package? I think Iteratees may prove themselves as useful as
ByteStrings.
I still haven't figured
Malcolm Wallace:
(Also... Haskell on the GPU. It's been talked about for years, but
will
it ever actually happen?)
gpu is just set of simd-like instructions. so the reason why you will
never see haskell on gpu is the same as why you will never see it
implemented via simd instructions :D
2009/2/12 Don Stewart d...@galois.com:
Thanks for the analysis, this clarifies things greatly.
Feasibility and scope is a big part of how we determine what projects to
work on.
I agree that it's beyond the scope of a SoC project.
Rather than H.263 or H.264 I was going to suggest
Corey O'Connor wrote:
Part of the reason they seem awkward to me is that I expect the
difference between version numbers to indicate something about what
has changed between the two versions. This only ends up being a
heuristic but a useful one. Date based version numbers don't
communicate much
On Wed, Feb 11, 2009 at 10:20 PM, wren ng thornton w...@freegeek.org wrote:
For projects which are released very frequently (i.e. on the order of daily)
or very infrequently (e.g. semiannually, annually) then date-based releases
can make sense. However, the releases do need to be quite regular
Hello,
Are there Haskell users in the Houston area?
Regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Cristiano Paris wrote:
Manlio Perillo wrote:
Cristiano Paris ha scritto:
I'm interested in the possibility of
stopping/pickling/unpickling/resuming a computation.
Not sure this is a good thing in a web application.
I'm thinking of complex workflows and inversion of control.
A
On 2009 Feb 12, at 1:04, wren ng thornton wrote:
It's ugly, but one option is to just reify your continuations as an
ADT, where there are constructors for each function and fields for
each variable that needs closing over. Serializing that ADT should
be simple (unless some of those
These seem to be good starting points:
http://donsbot.wordpress.com/2008/05/06/write-haskell-as-fast-as-c-exploiting-strictness-laziness-and-recursion/
http://donsbot.wordpress.com/2008/06/04/haskell-as-fast-as-c-working-at-a-high-altitude-for-low-level-performance/
A: X has some problems with runtime performance.
B: My work solves all your problems. There is no problem.
Beware of the Turing tar-pit in which everything is possible but
nothing of interest is easy - Alan Perlis.
can /= can be bothered.
:)
Ben.
On 12/02/2009, at 5:26 PM, Daniel
Sebastian Sylvan syl...@student.chalmers.se wrote:
On Wed, Feb 11, 2009 at 5:41 PM, Achim Schneider bars...@web.de
wrote:
I got curious and made two pages point to each other, resulting in
as many stale continuations as your left mouse button would permit.
While the model certainly is
On the same note, does anyone have ideas for the following snippet? Tried the
pointfree package but the output was useless.
pointwise op (x0,y0) (x1,y1) = (x0 `op` x1, y0 `op` y1)
Edsko de Vries wrote:
Perfect! Beautiful. I was hoping there'd be a simple solution like that.
Thanks!
Am Mittwoch, 11. Februar 2009 22:38 schrieben Sie:
On 12 Feb 2009, at 1:40 am, Wolfgang Jeltsch wrote:
Am Mittwoch, 11. Februar 2009 00:46 schrieben Sie:
I suppose I should point out what seems obvious to me, which is
that one
could embed a substantial chunk of MathML (possibly all of it)
Am Mittwoch, 11. Februar 2009 20:45 schrieb Gwern Branwen:
Here are the projects I favor (in no particular order):
[…]
* A GUI interface to Darcs
(http://hackage.haskell.org/trac/summer-of-code/ticket/17); this could
possibly be based on TortoiseDarcs http://tortoisedarcs.sourceforge.net/.
96 matches
Mail list logo
