I tend to deal a lot with very very large data files in Haskell and my
current approach to dealing with getting data out of one program an into
another is writing it to a file using 'show' and then reading it in using
'read'. Unfortunately, this is very slow and produces very large files
which
Richard Uhtenwoldt [EMAIL PROTECTED] writes:
Here are some Google search results that suggest how many web pages
are devoted to particular langauges. (Google tells you how many pages
match your query.) A better survey of language popularity would
include newsgroup and mailing list traffic,
PLAN-X: PROGRAMMING LANGUAGE TECHNOLOGIES FOR XML
Oct 3, 2002 Pittsburgh, PA
(Co-located with PLI)
CALL FOR PAPERS
Submission deadline: May 1, 2002
XML has emerged as the de facto
Hello,
I have put on-line alpha version of Haskell reference:
http://zvon.org/other/haskell/Outputglobal/index.html
I would appreciate your comments and suggestions.
--
**
firstName Miloslav /firstName
surname Nic /surname
mail[EMAIL
anatoli anatoli at yahoo wrote:
This is all, of course, of purely academical interest. The notation
is extremely inconvenient to do any real work. I'd rather prefer
a real, language-supported lambda over types.
Or... wait a minute! You did find all those problems; does it mean
you tried
On Tue, 2 Apr 2002 10:00:37 +0200 (MET DST), John Hughes
[EMAIL PROTECTED] wrote:
If (as a human reader of a programme) I see
do a - thing1
expression
and I notice (perhaps after some modifications) that a is
not present in expression, then I
I am wondering about a design decision in the List module.
To wit: sort, in both the H98 library report and the Hugs file
List.hs, is implemented using a quadratic sort (insertion sort).
Using the name sort certainly suggests that this is a good function
to use for sorting. I would think it is
1. Changes So Far
The following changes have been checked into CVS since the 0.1 release:
Native/
* MacOS X support
* Beginnings of mingw32 support
* New Sun 1.4 JVM
* Now installs in /usr/lib/jvm-bridge/
* ExecuteFunction bindings now done at run-time
Haskell/
* MacOS X
Is it possible to get the result of function happyError, in the main module
of my program (which imports the module generated by Happy)?
Thanks a lot,
-- Andre
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Glenn G. Chappell [EMAIL PROTECTED] writes
I am wondering about a design decision in the List module.
To wit: sort, in both the H98 library report and the Hugs file
List.hs, is implemented using a quadratic sort (insertion sort).
Using the name sort certainly suggests that this is a good
On Tue, Apr 02, 2002 at 08:48:41PM +0100, Jon Fairbairn wrote:
Point taken, but I remain unconvinced. What comes out of the
monad /isn't/ abstract; there's nothing to ensure that
subsequent use respects the abstraction.
Sure. That's the programmer's responsibility to keep track of. To me
At 10:41 1/04/2002 -0500, Paul Hudak wrote:
It's really not as obscure as it first seems. A fixpoint of a function
foo is a value x such that foo x = x. The fix operator tells us one way
(not the only way) to generate such a fixpoint:
fix foo = foo (fix foo)
Note from this equation that
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
snip OP
Depending on why you need random numbers, you might want to consider
using a fixed seed, i.e.
a = randoms (mkStdGen 4711)
will get you a sequence of random numbers. Of course, it will be
the same sequence for every run of
On Wed, Apr 03, 2002 at 09:35:51AM +0400, Serge D. Mechveliani wrote:
The Standard library specifies only the map related to the name
`sort'. This map can be described, for example, via sort-by-insertion
program.
And the algorithm choice is a matter of each particular
implementation.
14 matches
Mail list logo
