Hello,
Recently, I came accross this
expression:
[ x + y | x - xs | y - ys ]
As far as I can see (Haskell Report),
this is not allowed by the haskell 98
standard. So I assume it to be an ex-
tension. Where can I find information
about this?
This is a parallel list comprehension, a
Will Haddock understand implicit parameters soon? As of now I'm not using
them because I think documentation is more important...
Cheers, Jan de Wit
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
= Foo { host :: String, port :: Int }
defaultFoo = Foo { port = }
myFoo = defaultFoo { host = haskell.org }
yourFoo = defaultFoo { host = haskell.org, port = 80 }
HTH,
Jan de Wit
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
Hi,
data T -- has 1 value: _|_
Minor nitpick: that Hugs and GHCi accept it, doesn't mean it's legal
Haskell'98. Otherwise we would have existential and universal quantified
types as well :-)
Cheers,
Jan
___
Haskell-Cafe mailing list
Hi,
testfunc = do
r - newSTRef ('x',0)
foo r
bar r
(c,n) - readSTRef r
return n
Yeap, I could do it like this myself :)
The whole problem is with passing the 'r' as a parameter, which is
precisly
what I'm trying to avoid. I
version, curVarId allocates a new reference to 0
every time newVar is called.
Hope this works, Jan de Wit
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
with 0.
Cheers, Jan de Wit
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
, I run 'strip' on them and, if I'm on Linux or Win32, I
run UPX on it as well. UPX is an executable packer, see
http://upx.sourceforge.net/ for details. This routinely brings programs down
from over 2 MB to around 250Kb which is small enough for me.
Hope this helps,
Jan de Wit
not using Cygwin)
Any help would be appreciated!
Cheers,
Jan de Wit
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
see:
| Cons{hd='a',tl=(Cons{hd='b',tl=Nil})}
| *** Exception: Prelude.read: no parse
So, at least ghc and hugs disagree... My ghc version is 5.02 and my hugs
is February 2000/2001 (both give the same output).
Cheers,
Jan de Wit
8
module Test where
data List a = Nil | Cons { hd :: a, tl
the universally quantified types...
The problem also occurs in 5.00.1 and 4.08.1, with line numbers 5292 and
10787 respectively.
I've tried to submit to the SourceForge bug list as well, but that doesn't
seem to be working for me...
All the best,
Jan de Wit
- a - Perfect a
| mkPerfect 1 x = One x
| mkPerfect (n+1) x = Two (mkPerfect n (x,x))
mkPerfect will be called with a number of different types for its second
argument, depending on the first argument.
HTH,
Jan de Wit
___
Haskell mailing list
[EMAIL PROTECTED
"failure?"
The idea is that comparing for equality walks over the entire data
structure, forcing evaluation because every location has to be inspected.
Hope this helps,
Jan de Wit
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskel
- but maybe somebody
could mail his supervisor, prof. Krzysztof Apt at cwi.nl (his login name is
apt)
Hope this helps,
Jan de Wit
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
u.nl/~erik/Publications/1999-28.pdf
(the paper itself might be at Chalmers, but the site seems to be
down...)
Hope this helps,
Jan de Wit
will enjoy this program,
Jan de Wit
er.
Hope this helps (or leads to someone else giving a better definition :-)
Jan de Wit
changed source files somewhere.
Drop me a line (and you'll get the ':kompile' command thrown in for free!)
Bye, Jan de Wit
and weaknesses and its niche).
So will the features of Hugs eventually be supported by all platforms and
integrated into a future version of Haskell or will I have to keep seperate
versions of my code?
All the best,
Jan de Wit
(and also
stand a good chance of remedying them :-)
This is not a rant against the people at Hilt, it's just that I'm
*interested* at how Clean works...
All the best,
Jan de Wit
for this?), but
I think the main problem is in implementing the IO library... Also writing
a code generator would be a very large task.
What would be the best approach to tackle this problem?
All the best,
Jan de Wit
which would resolve this issue. See http://www.cse.ogi.edu/~mpj/fds.html
for details - I really hope the September release comes quickly !!!
Bye,
Jan de Wit
are
in some sense isomorphic to the arguments, ie
newtype Compose ff gg a = Compose { unCompose :: ff (gg a) } and suchlike.
Jan de Wit
23 matches
Mail list logo