Jon Mountjoy wrote:
> Is CSE very useful for Haskell programs?
>
> I would guess 'sometimes'. In some cases of course is it, but in
> other cases you might increase the scope of an expression and thereby
> worsen the space behaviour. Have there been any attempts to
> identify/quantify this?
Se
While on this topic I would like to ask the question:
Is CSE very useful for Haskell programs?
I would guess 'sometimes'. In some cases of course is it, but in
other cases you might increase the scope of an expression and thereby
worsen the space behaviour. Have there been any attempts to
i
"S. Alexander Jacobson" <[EMAIL PROTECTED]> writes:
> I am writing CGI scripts in Haskell and would prefer not to pay the
> process creation overhead of CGI.
>
> Apache allows you to compile apache modules directly into the httpd.
> You just need to make sure that the code exports functions the
On 10 May 1998, Carl R. Witty wrote:
> > > qsort [] = []
> > > qsort (x:xs) = let (a,b) = foldr (\y -> (y ?: (=x))) ([],[]) xs
> > >in qsort a ++ [x] ++ qsort b
> > > f # g = \(x,y) -> (f x,g y)
> > > x ?: p = if p x then (x:) else id
> > > qsort' [] = []
> > > qsort' (x:
> Incidentally, I don't think it would be sensible to change
> the type system to allow the
>
> demo1 :: (a -> b) -> Either a c -> Either b c
> demo1 f (Left a) = Left (f a)
> demo1 _ r@(Right c) = r
>
> What type does r have? Either a c.
> What type does the result of the fn have? Eit
I am writing CGI scripts in Haskell and would prefer not to pay the
process creation overhead of CGI.
Apache allows you to compile apache modules directly into the httpd.
You just need to make sure that the code exports functions the functions
that apache requires.
The Netscape Server API has a
> Ok, clearly I was wrong about list concatenation, but I think I have now
> figured out what was bothering me about Ralf's objection to the of ++.
>
> The argument that the use of ++ in qsort means too many traversals of the
> list makes sense if ++ is strict (or you are using a non-lazy languag
On May 10 (18:58 -0300), Mariano Suarez Alvarez wrote with possible deletions:
| [...]
| The same idea works in general: if E is some expression,
|
| E (foldr f1 b1 xs) (foldr f2 b2 xs)
| = let (a,b) = (foldr f1 b1 xs,foldr f2 b2 xs)
| in E a b
| = let (a,b) = (foldr f1 b1 xs,foldr
Yes, GHC does some CSE stuff, but not very much. I don't think it has a large
performance impact, but (as luck would have it) but I plan to work on it a bit
in the newt few months.
My advice would be: write clear code, and let the compiler do the
CSE. If it doesn't, complain to the compiler wri
> "KA" == Krzysztof Arciszewski <[EMAIL PROTECTED]> writes:
KA> - Have anybody done Partial Evaluator for Haskel?
Here's one---it really is for Gofer as it requires multi-parameter
constructor classes. Things should work fine for the upcoming
Standard Haskell, however:
@InProceedings{Thie
--1EE659728831F92233ED083F
Content-Type: text/plain; charset="us-ascii"
I apologize if you receive multiple copies of this mass mailing.
--1EE659728831F92233ED083F
Content-Disposition: inline; filename="sigplan.ascii"
Content-Type: text/plain; charset="us-ascii"; name="si
11 matches
Mail list logo
