description in the
MR.
Bye
Christian Sievers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
but is used in at most one specific overloading and is not exported.
How does that relate to the report?
Maybe I have to withdraw what I said about haskell being well defined.
All the best
Christian Sievers
___
Haskell mailing list
Haskell@haskell.org
http
John Ky wrote:
I finally realised that hGetLine strips out the \n newline character
so when I forward the line to the server, I need to append it again.
Or use hPutStrLn instead of hPutStr ?
(I may be missing something...)
Bye
Christian Sievers
in one of my earlier mails.
Seems we need a glossary.
Bye
Christian Sievers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
referential
transparency.
Only if you expect referential transparency for implicitly typed values.
All you have to do is say
k :: Num a = a
k = 2
and everything is fine.
Bye
Christian Sievers
___
Haskell mailing list
Haskell@haskell.org
http
,
Christian Sievers
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
don't
want types to depend on arbitrary other modules - think of
seperate compilation.
I'm afraid I'm also still not clear about why 2 doesn't default to
2::Integer in the same way that k defaults to k::Integer,
It does, that's why show 2 works.
Hope that helps
Christian Sievers
Dominic Steinitz asked:
Is asTypeOf really Haskell 98?
Yes, it is in the Prelude.
And there is no special magic, it is Haskell-98-implementable, see
http://haskell.org/onlinereport/standard-prelude.html#$vasTypeOf
Bye
Christian Sievers
___
Haskell
them...)
the generalized solution being simply,
f mf x = do
f - mf
return (f x)
Or just replace map by fmap in your flist from above.
All the best
Christian Sievers
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
neutral l = ...
If f is not defined for empty lists, you can combine (with a bit more work)
the results of scanl1 and scanr1.
HTH
Christian Sievers
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
if there is a special name for it.
Bye
Christian Sievers
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
...)
^ ^ ^ only one type variable allowed here
aren't Haskell 98.
All the best
Christian Sievers
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
which is in turn just the same as
single x = (x==)
which is, amazingly, nothing more than
single = (==)
-- one can debatte whether this is still better style than the first variant,
but it's surely interesting to realize.
All the best,
Christian Sievers
Simon Peyton-Jones wrote:
Feedback please...
One typo:
In the change for
Page 93, Appendix A, Standard Prelude
the comment should not talk about a fixtity declaration.
^
Bye
Christian Sievers
___
Haskell
...
^
and could as well be
Since qualified names are lexemes, no spaces are allowed...
All the best
Christian Sievers
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
| special | reservedop | reservedid | opencom
It's all not new. See:
http://www.dcs.gla.ac.uk/mail-www/haskell/msg01596.html
http://www.dcs.gla.ac.uk/mail-www/haskell/msg01730.html
All the best
Christian Sievers
___
Haskell mailing list
[EMAIL PROTECTED
for PreludeList
replace "Sum" by "sum".
Christian Sievers
enough. "volatile" variables are
MVars, and what are non-volatile variables changed in signal
handlers? Uncaught type errors? Enough of that.
All the best,
Christian Sievers
impression that "c"
is the way to name a Char, so I suggest to change this to
unzip [("", 1), ("a", 2), ("aa", 3)] = (["", "a", "aa"], [1, 2, 3])
which even is no longer!
All the best,
Christian Sievers
. (But if
they are using an interpreter and don't have to write a main function,
you can as well leave this out.) But in order to explain monads even
to someone who wouldn't define his own, I'd surely not conceal (=).
Alll the best,
Christian Sievers
?
If not, we could use this extra information for less permissive type
checking, for example only allowing a square root from an argument
that has only even exponents.
(Cayenne doesn't happen to have c*n-patterns?)
Christian Sievers
in this case?)
I really like Cayenne.
All the best,
Christian Sievers
, namely
| "application/x-haskell".
Maybe the Haskell-Version should also go into the MIME type name, as
in "application/x-haskell98".
All the best,
Christian Sievers
a typo, as I
think no one intended to allow expressions like
x ` {- look ma -} elem -- comments inside!
` l
All the best,
Christian Sievers
says:
A nested comment begins with the lexeme "{-" ...
There is no such lexeme.
We'd need lexeme - ... | opencom
What does M.-- mean?
All the best,
Christian Sievers
--
Freeing Software is a good beginning. Now how about people?
tion written somewhere. Most of the
rest is what is usually used in mathematics or is done in any computer
language (such as c for Char).
Yes, a list of these things might be helpful.
Christian Sievers
(\(_,b)-(b,inc b)) (zer,zer)) where zer s z = z
Of course, you wouldn't really use built-in pairing, would you?
Christian Sievers
Frank A. Christoph gave examples for unintended non-linear patterns,
among them:
Or, even more more common:
f (x@(x,y)) = ... --- oops!
If I don't oversee something obvious, this just would fail to
type-check, so this shouldn't be a problem.
Christian Sievers
= fst (show x, show f)
I don't see why it should be illegal, but then nor does Hugs 98.
It is happy with this definition and gives "1True" for f.
So if you found a subtle strange thing in Haskell 98, you also found a
bug in Hugs.
Christian Sievers
-warning
version, or even keep the MR - we could make our editors smarter and
let them add the types if they change too often or are just too weird
for us, rather than introduce new syntax only in order to be able to
leave them out.
Christian Sievers
dled by the
syntax, so I guess this should be done in this case also. Doing that
'exactly uniformly' would mean productions for expressions e:e,
patterns (p:p) and the constructor (:). But we surely don't want to
loose the sections (e:) and (:e).
Please don't forget them!
All the best,
Christian Sievers
doing non-hurting class definition changes, let
me repeat this: please let succ and pred be Enum class members.
Christian Sievers
, the library report defines types for zeroOrMore and
oneOrMore, which both are (MonadPlus m) = m a - m [a],
but doesn't mention them later.
Christian Sievers
can't give good (let alone new) reasons for that.
Christian Sievers
Nat
where succ=Succ is not only more natural, but also much more
efficient.
Of course the same holds for pred.
What do you think?
Are there any drawbacks?
Could it be like this in standard haskell?
Christian Sievers
...
Buzzz. No, it's not. It does not actually give any instance of D.
You have to declare all of them seperately, and you would rather want
to just say instance C a = D a but you can't.
It's much like the Textual example.
Christian Sievers
Thank you for pointing me to the System library. However, while I was
indeed implying that there is no way of returning an exit code, my main
question was which type main should have. You seem not to like IO Int
(one even for several reasons ;-) but it still looks quite natural to me.
Christian
les. Still, I'd prefer if they were allowed...
Christian Sievers
,
then maybe in Curry:).
I now only would like to know why this design decission was made,
are there any problems with the instance declarations I have in mind?
Christian Sievers
with Linux and SunOS,
and the hugs version calls itself 970410.
Christian Sievers
40 matches
Mail list logo
