Dear Nicholas,
Nicholas Nethercote (Wed, Nov 12, 2003 at 11:32:54AM +):
> On Wed, 12 Nov 2003, Tom Pledger wrote:
>
> > Hal Daume III writes:
> > :
> > | *all* i care about is being able to quickly calculate the size of
> > | the intersection of two sets. these sets are, in general, very
Position Description
The Coordination and Component Based Software group in SEN3 at CWI
has two open positions for:
(1) a postdoc for a period of four years, and
(2) a PhD student (OIO) for four years.
Both positions are within the project number 600.065.1
W liście z śro, 12-11-2003, godz. 11:06, Graham Klyne pisze:
> I've sometimes thought that a functional language would be the ideal
> platform to usher in a purely graphical style of programming;
I don't understand why so many people talk about graphical programming,
i.e. putting together functi
Graham Klyne writes:
> This looks like much fun. I took a quick look at the screenshots, but
> don't see any provision for graphical display of *programs* -- is there?
At present, there isn't. But plans are to incorporate a graphical style of
programming, much along the lines of the Dami and
I'd like to embed pictures (.png) in a CGI-generated output.
This doesn't seem to fit directly into ghc's Network.CGI setting.
(Not entirely ghc's fault, of course :-)
By the html definition, including a picture seems to require an
indirection. But I don't want to expose a static address,
so I am
John Meacham wrote:
my intuition says something like binary trees annotated with the minimum
and maximum value contained beneath each node so you may prune whole
subtrees in constant time...
Yes. This may be one dimension too high,
but check out "segment trees" from Computational Geometry.
See Ben
On Wed, Nov 12, 2003 at 11:32:54AM +, Nicholas Nethercote wrote:
> > Hal Daume III writes:
> > :
> > | *all* i care about is being able to quickly calculate the size of
> > | the intersection of two sets. these sets are, in general, very
> > | sparse, which means that the intersections ten
Hi Hal,
On Tue, 11 Nov 2003 16:45:56 -0800 (PST), Hal Daume III <[EMAIL PROTECTED]>
wrote:
i'm looking for a representation for a set of natural numbers. right
now, my representation is sorted array, which works well. *all* i care
about
is being able to quickly calculate the size of the inte
On Wed, Nov 12, 2003 at 03:00:38PM +1300, Tom Pledger wrote:
> The total time (including the up front time for building the data
> structure) can't go below O(n+m), because if it did, you'd be
> neglecting to look at some of the elements at all.
that would be true if there wern't a total ordering
This looks like much fun. I took a quick look at the screenshots, but
don't see any provision for graphical display of *programs* -- is there?
I've sometimes thought that a functional language would be the ideal
platform to usher in a purely graphical style of programming; there have
been a f
On Wed, 12 Nov 2003, Tom Pledger wrote:
> Hal Daume III writes:
> :
> | *all* i care about is being able to quickly calculate the size of
> | the intersection of two sets. these sets are, in general, very
> | sparse, which means that the intersections tend to be small.
> |
> | for example,
On Wed, 12 Nov 2003 10:07:58 -
"Simon Marlow" <[EMAIL PROTECTED]> wrote:
> Yes, they're binary incompatible I'm afraid.
Oh, well... :)
> The path is the path to the HTML files, and the filename is the name of
> the .haddock file. They can be completely different, e.g.
Of course. Silly me.
> On Tue, 11 Nov 2003 11:01:00 -, "Simon Marlow"
> <[EMAIL PROTECTED]> wrote:
>
> > There is a new release of Haddock, version 0.6.
>
> Are interface files binary-incompatible with those of
> previous releases?
>
> With a Cygwin-compiled 0.6, I get an error:
>
> Fail: end of file
>
I think you'll maximise your chances by sending mail about GUM and
Glasgow Parallel Haskell to the GpH mailing list
http://www.macs.hw.ac.uk/~dsg/gph/
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Yang, Qing
| Sent: 12 November 2003 0
Hi All,
I have a question about GUM - the runtime system for Parallel Haskell.
There are below words in the paper addressing GUM architecture:
"The first action of GUM program is to create a PVM manager task, whose
job is to control startup and termination. The manager spawns the
required number o
I think we all owe Claus a big "Thank You" for initiating and running
the Haskell Communities Report. It's done a great job of telling us
what's going on. Thank you Claus!
I hope someone else will step in for May 2004...
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMA
16 matches
Mail list logo
