On 28-Mar-2000, S. Alexander Jacobson <[EMAIL PROTECTED]> wrote:
> The issue is not just generating the data for a particular running
> instance, but rather:
> 1. generating the data from all/many running instances on user machines
> 2. sending that data back to the developer for analysis
> 3. gen
on Stephen's time.
>
> If this isn't what you meant, maybe you can say more precisely what
> you were after?
>
> Simon
>
> | -Original Message-
> | From: S. Alexander Jacobson [mailto:[EMAIL PROTECTED]]
> | Sent: 28 March 2000 02:43
> | To: [EMAIL
en's time.
If this isn't what you meant, maybe you can say more precisely what
you were after?
Simon
| -Original Message-
| From: S. Alexander Jacobson [mailto:[EMAIL PROTECTED]]
| Sent: 28 March 2000 02:43
| To: [EMAIL PROTECTED]
| Cc: [EMAIL PROTECTED]
| Subject: Re: r
Good web developers do log analysis to figure out what users like and what
they don't and to figure out which paths to shorten.
It would be nice if haskell programs could generate similar "access
logs" or traces that would feedback to the programmer or maintainer
information about which functions
--- Forwarded Message Follows ---
From: Rob MacAulay <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
Subject: Re: runtime optimization of haskell
Date sent: Fri, 24 Mar 2000 10:59:33 -
Date sent: Thu,
I'm not currently working on dynamic compilation, but I went to
Vasanth Bala's talks at the Dynamic Compilation Workshop before PoPL
and later at MIT. I, too, was intrigued by the possibility of doing
this sort of dynamic compilation for functional languages. I've given
the technical points some
On Thu, 23 Mar 2000, D. Tweed wrote:
> such things? (The closest thing I'm aware of is David Lester's stuff on
> throw away compilation (sorry no pointer)) It just seems that functional
As Julian Seward kindly mentioned to me, I meant David Wakeling.
___cheers,_dave_
