On Wed, 8 Jan 2003, Andrew J Bromage wrote:
> One is to allow function overloading. This is probably not desirable
> because it turns type checking into an NP-hard problem.
it already is much harder (even without static overloading)
Helmut Seidl. : Haskell overloading is DEXPTIME-complete.
EACL 2003 in Budapest, April 12-17, 2003
Workshop Programme and Very Last Call for Workshop Papers
[ EXTENDED DEADLINE FOR ALL WORKSHOPS IS MONDAY, JANUARY 13 2003 ]
Important dates for all workshops:
--
Submission deadline: Jan 13, 2003
It would be nice to be able to overload class-functions like
classes:
instance (+), (-) -> Vector where
(+) v1 v2 = ...
(-) v1 v2 = ...
instead of overloading parts of a class... (because of
runtime-errors!)
instance Num Vector where
(+) v1 v
--Just changed the syntax:
...
or BETTER just to split classes:
type class HalfBody a = (Num a => (+), (-))
instance HalfBody Vector where
(+) v1 v2 = ...
(-) v1 v2 = ...
...
- Original Message -
From: "Marc Ziegert" <[EMAIL PROTECTED]>
To: <[EMAIL PROTEC
How can I recursively collect a list of things while in the IO monad,
and return the list lazily as it's constructed rather than waiting until
they've all been collected?
Perhaps an example will make things clearer:
main =
do xs <- getStrings
putStrLn (head xs)
getStrings =
do x <- g
The following works for me:
import IOExts
main = do xs <- unsafeInterleaveIO getStrings
putStrLn (head xs)
getStrings = do
x <- getLine
if x == "stop"
then return []
else do xs <- unsafeInterleaveIO getStrings; return (x:xs)
in this particular case, the unsafeInterleaveIO
I don't think you can do what you want to using standard lists,
not without some dirty trickery...
But you can define a datatype for such a purpose which would essentially
have to put the tail into the Monad.
Disadvantage: you would have to redo lots of the list stuff yourself.
I had once started
Hi all,
I am having a tough time debugging an array problem, and I was wondering
if anyone had some pointers.
I am working on a complicated function that relies on a few mutually
recursive arrays (AR parameter estimation using Burg's Method). I am
getting a runtime error, index: Index out of ran
If you're willing to use something other than Hugs, you're set. With GHC
or NHC you could use the HAT debugger (www.cs.york.ac.uk/fp/hat/). Or
even just with GHC if you compile with -prof -auto-all (for profiling),
you can run with +RTS -xc to get a stack backtrace on errors.
Otherwise, if you i
