Can someone help me understand how this works? I've been reading the paper
Asynchronous Exceptions in Haskell. This gives a combinator
finally :: IO a - IO b - IO s
finally a b =
block (do {
r - catch (unblock a) (\e - do { b; throw e });
b;
return r; })
Now suppose we
peace
EPSRC CASE PhD Studentship
Department of Computer Science
University of Durham, U.K.
Applications are invited from students with good undergraduate or MSc
degrees in computer science, mathematics or a related subject to study for
Can someone help me understand how this works? I've been
reading the paper Asynchronous Exceptions in Haskell. This
gives a combinator
finally :: IO a - IO b - IO s
finally a b =
block (do {
r - catch (unblock a) (\e - do { b; throw e });
b;
return r; })
2 PhD positions
Institute for Informatics
University of Bergen, Norway
1. The project.
---
MoSIS is a IKT project funded by the Norwegian Science Council (NFR)
for the period 2002-2005. Its descriptive
Using the function partition from the List module, a control stack overflow
occurs when evaluating the following expression:
List head $ fst $ partition even [1..]
(35929 reductions, 63867 cells)
ERROR: Control stack overflow
The definition of partition in both hugs and GHC
It was wrong in the Haskell report too (now fixed; see my home page).
Also fixed in GHC 5.02.
Simon
| -Original Message-
| From: Bastiaan Heeren [mailto:[EMAIL PROTECTED]]
| Sent: 23 November 2001 13:55
| To: [EMAIL PROTECTED]
| Subject: List.partition should be more lazy
|
|
| Using
Hi,
Preliminary experimentation with code that compiles with
ghc-5.02 and falls over with ghc-5.02.1 suggests that
the -fno-warn-incomplete-patterns flag is ignored.
Ghc falls over with,
ghc-5.02.1:panic! (the `impossible' happened, GHC version 5.02.1):
/tmp/ghc[].lpp:[]: Non-exhaustive
(Yes, I know that's not very impressive, but you must all have been wondering what's
happened to me.)
The attached file, when compiled with ghc5.02.1, -fglasgow-exts
-fallow-overlapping-instances -fallow-undecidable-instances produces the error message
Haskell.hs:11: Illegal left hand side
Hello!
I have a very basic (and naive, probably) question:
What does one use to unpack a *.bz2 file?
I tried to find this information in the on-line installation guide, but
could not find it. Might be a good idea to put it there.
A quick response would be much appreciated.
Regards,
--
I have a very basic (and naive, probably) question:
What does one use to unpack a *.bz2 file?
I tried to find this information in the on-line installation
guide, but
could not find it. Might be a good idea to put it there.
A quick response would be much appreciated.
bzip2:
| Summarizing: without single-field existentially quantified
| constructors in newtypes either my code gets less readable or
| I have to pay a run-time price. Is it possible to relax the
| restriction on newtypes in combination with existentials?
Yes, that's a fair point.
Unfortunately,
12 matches
Mail list logo