I seriously considered switching frlom Hugs to GHC for my introductory
programming class this year, but in the end stayed with Hugs because of
a single feature.
I'm teaching beginning programmers, and for them at least, there is an
overwhelming volume of names to learn -- what's that function?
On Mon, 10 Jan 2005, John Hughes wrote:
What IS useful, right from the beginning, is the list of instances. What
are Num types? Oh, integers and reals. What are Show types? Oh, pretty
much everything. Particularly when debugging missing instance errors,
this is just the information you
On Sat, 8 Jan 2005, Lemming wrote:
Jon Cast wrote:
Absolutely. In Haskell's syntax, if-then-else-if interacts badly with
do notation, and Haskell lacks a direct analogy to Lisp's cond.
case () of
() | p1 - e1
| p2 - e2
...
No problem:
select :: a - [(Bool,
Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] writes:
- Do the character class functions (isUpper, isAlpha etc.) work
correctly on the full range of Unicode characters?
It's not obvious what the predicates should really mean, e.g. should
isDigit and isHexDigit include non-ASCII digits or
On Mon, 10 Jan 2005 10:15:57 +0100, John Hughes [EMAIL PROTECTED] wrote:
snip
How about changing the behaviour of :i, Simon, so I can use GHCi
throughout next year?
Agreed. GHCi also produces what can be perceived as odd output when
typing, for instance, :i +
-- + is a method in class Num
On Mon, 10 Jan 2005 10:30:46 +0100 (MEZ), Henning Thielemann
[EMAIL PROTECTED] wrote:
What I also would like to see is the Haddock documentation
string of a function printed by :info or some other command.
Now _that_ would be truly useful.
/S
--
Sebastian Sylvan
+46(0)736-818655
UIN:
Hello!
I am thinking about writing a system, using which it is possible to store
information about the structure of a bureaucratic system.
Coarse-grained features of the program include:
1) The program should allow the user to enter the hierarchy (like: authority X
has a board of Y
On Mon, 10 Jan 2005, Dmitri Pissarenko wrote:
(snip)
At the moment, I think that it makes more sense to store the data in form of
facts (not tables as in relational database).
(snip)
A Haskell binding for something some of the stuff at
http://www.ai.sri.com/~gfp/ might be useful?
I'd often
On 07 January 2005 22:17, Tomasz Zielonka wrote:
On Fri, Jan 07, 2005 at 11:00:27PM +0100, Tomasz Zielonka wrote:
Hmmm, TMVar's seem to be significantly (ie. 6 times) faster than
MVars in some simple tests :)
Is it expected?
If it is, we can reimplement MVars using STM, when STM becomes
On 07 January 2005 20:00, Sebastian Sylvan wrote:
On Fri, 7 Jan 2005 20:56:42 +0100, Sebastian Sylvan
[EMAIL PROTECTED] wrote:
On Fri, 07 Jan 2005 15:31:10 +0200, Einar Karttunen
ekarttun@cs.helsinki.fi wrote:
Hello
What is the best way of doing an computation with a timeout?
I like
On 08 January 2005 08:09, Aaron Denney wrote:
On 2005-01-07, Simon Marlow [EMAIL PROTECTED] wrote:
- Can you use (some encoding of) Unicode for your Haskell source
files? I don't think this is true in any Haskell compiler right
now.
I assume this won't be be done until the next one is
Jrmy Bobbio [EMAIL PROTECTED] writes:
Once this is agreed, it would be easy to make scripts which generate
C code from UnicodeData.txt tables from Unicode. I think table-driven
predicates and toUpper/toLower should better be implemented in C;
Haskell is not good at static constant tables with
Simon Marlow wrote:
Not a problem. Have you looked at the streams proposal?
Is there a Wiki page or URL with the steram proposal?
--
% Andre Pang : trust.in.love.to.save http://www.algorithm.com.au/
___
Haskell-Cafe mailing list
Andre Pang wrote:
Is there a Wiki page or URL with the steram proposal?
It's here:
http://www.haskell.org/~simonmar/io/System.IO.html
-- Ben
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
14 matches
Mail list logo
