> "TLB" == Thomas L Bevan <[EMAIL PROTECTED]> writes:
TLB> If anyone ports this to work with GHC6.0 please let
TLB> us know. Tom
The patch below allows me to build hws with ghc-6.0.1 and
run it without plugins. However when trying to run it with
loading modules I see:
hws-wp% sudo
In Haskell, data types and contructors must be designated by
names whose first letter is capitalised.
So,
> data currency = ...
is illegal.
Instead use,
> data Currency = Dollar Double | Pound Double | Zloty Double | Euro Double
Above are four data constructors and they can be used to contruct
[EMAIL PROTECTED] wrote:
G'day all.
Tom Pledger wrote:
How about adapting splay trees so that their pointers become weak
after a certain depth? The advantage for caching is that the more
frequently used elements move closer to the root, so you wouldn't have
to add much code for tracking recent
Brian Demsky's master's thesis compares servers written in direct style
(using a thread per connection) to event driven servers (which are
supposedly
oh so much faster.) He shows how you can CPS the thread
per connection server and end up with the event driven server.
That way you don't need to m
G'day all.
Quoting Tom Pledger <[EMAIL PROTECTED]>:
> It sounds like the term "splay tree" means different things to
> different people. I was thinking in particular of one which, whenever
> it finds a key it was looking for, does some rotation so that the
> key's node's depth is reduced.
The o
[EMAIL PROTECTED] writes:
| G'day all.
|
| Tom Pledger wrote:
|
| > How about adapting splay trees so that their pointers become weak
| > after a certain depth? The advantage for caching is that the more
| > frequently used elements move closer to the root, so you wouldn't have
| > to ad
G'day all.
Tom Pledger wrote:
> How about adapting splay trees so that their pointers become weak
> after a certain depth? The advantage for caching is that the more
> frequently used elements move closer to the root, so you wouldn't have
> to add much code for tracking recent use, just a depth
G'day all.
On Sun, 2 Nov 2003 22:58:41 -0300 (CLST)
"andrew cooke" <[EMAIL PROTECTED]> wrote:
> > What options do I have in Haskell? I'm interested both in general
> > solutions (maybe some compilers do this anyway?) and in approaches
> > to structuring the program so that I can control caching
Hi,
For those who are curious about what we have been up to in the
Programatica project (perhaps because you who saw the demo at the
Haskell Workshop this year, or read the demo abstract), we now have a
web page where you can
* find out more about what the tools can be used for,
* downlo
If anyone ports this to work with GHC6.0 please let us know.
Tom
On Wed, 5 Nov 2003 09:58 am, Peter Simons wrote:
> 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-W
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
Without looking too much at your code, my immediate guess is that you
should use one of the boilerplate functions that can stop at a certain
depth. One pitfall pointed out in the original boilerplate paper is that
if you have some data type like:
> data Foo = Foo Int String
and you're looking
Perhaps some remember the question I posted about
avoiding boilerplate some time ago:
(http://haskell.org/pipermail/haskell/2003-August/012479.html)
After some experimentation I employed Hal's DynamicMap as well
as the Generics library. This worked fine for a while, but after
I started using my
I've been working on a new project and evaluating
the Twisted python framework which relies on
asynchIO rather than threading to achieve speed.
The resulting idioms feel like they would be much
more elegant in Haskell.
So my question at this point is:
Is there a reasonably efficient Haskell http
[[ -- Apologies for multiple copies of this message -- ]]
+ + + + + WRLA'04 + + + + + SECOND CALL FOR PAPERS + + + + + WRLA'04 + + + + +
+--+
| |
| 5th
15 matches
Mail list logo
