"Dominic Steinitz" <[EMAIL PROTECTED]> writes:
> Would it be possible to set up a mailing list for those interested?
We're getting a lot of these lists now (gui, libs, cafe) -- are they
really warranted? Couldn't they all fit in the libraries list? I'd
like to keep an ear to all of these develo
Le Jeudi 23 Janvier 2003 06:40, Matthew Donadio a écrit :
> Hi all,
>
> I have yet another question. I think I have too much time on my hands.
>
> I have two functions:
> > rf :: (RealFloat a, Integral b) => [a] -> b -> Complex a
> > rf x k = ...
> >
> > cf :: (RealFloat a, Integral b) =>
On Sun, 19 Jan 2003, Nick Name wrote:
> I got another trouble: I need to build a record type like
>
> Package { name :: String, version :: Int , mantainer :: String ... other
> fields ... }
>
> from a list of string of the form
>
> ["Package: ..." , "Mantainer: ..." , "Version: ..." , ... ]
>
Hi all,
I have yet another question. I think I have too much time on my hands.
I have two functions:
> rf :: (RealFloat a, Integral b) => [a] -> b -> Complex a
> rf x k = ...
> cf :: (RealFloat a, Integral b) => [Complex a] -> b -> Complex a
> cf x k = ...
I would like to add these to
There seems to be a small group of Haskell users who are interested in
building and using interfaces to databases.
Would it be possible to set up a mailing list for those interested? I'd be
happy to administer it if required (although someone would have to show /
tell me what needs doing).
Domini
Why not use QT as the underlying GUI library? As you noted it is platform
independent. It is something of a bitch to build, but most GUI libraries are.
On 22-Jan-2003 David Sankel wrote:
> Hello Everyone,
>
> I believe that haskell would have great benifit from
> a platform independant speci
I ask everyone to discuss this subject onto the GUI mailing list,
because there are already replies there.
Thanks
Vincenzo
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hello Everyone,
I believe that haskell would have great benifit from
a platform independant specification for a graphical
user interface module or set of modules. I've been
blessed with a lot of time on my hands so I'd be
willing to organize this project if needed.
Since there are several wo
System.Time.getClockTime, IIRC. A quick browse through the libraries
confirms this.
--
Hal Daume III
"Computer science is no more about computers| [EMAIL PROTECTED]
than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume
On Wed, 22 Jan 2003, Cesar Augusto Acosta Minoli wrote
I'm working in Delphi for long time and there's a way to get the computer time (Clock) and date too. My Question is, Is there some Function in Haskell that do this?
Protect your PC - Click here for McAfee.com VirusScan Online
___
Haskell mailing li
[We apologize if you receive multiple copies of this message.]
===
F I R S T C A L L F O R P A P E R S
DALT 2003
First International Workshop on
Declarative Agent Languages and
> SAC has syntactic forms to define arrays that are somewhat reminiscent of
> array comprehensions, although they are much more restricted. An interesting
> route for a *real* array-optimizing Haskell compiler could be to try to find
> instances of array comprehensions that can be mapped to constru
| You could check out SAC. SAC is a functional language specialized for
| arrays, with restrictions in the language to ensure efficient
compilation.
| The SAC compiler can apparently do a very good job on
scheduling/memory
| allocation as to optimize for cache performance: this is an important
iss
Matthew Donadio:
>| Many spectral estimation routines are defined in terms of special
>| matrices (ie, Toeplitz, etc). Arrays defined recursively by list
>| comprehensions make it easy to implement algorithms like
>Levinson-Durbin
>| recursion, and they look very similar to the mathematical defini
Matthew
| Many spectral estimation routines are defined in terms of special
| matrices (ie, Toeplitz, etc). Arrays defined recursively by list
| comprehensions make it easy to implement algorithms like
Levinson-Durbin
| recursion, and they look very similar to the mathematical definitions:
|
| >
Matthew Donadio <[EMAIL PROTECTED]> writes:
> OK, my question then has to do with the efficiency of lists versus
> arrays. Do the latest compilers handle handle arrays efficiently, or
> are lists really the way to go?
I've currently struggled a bit with arrays. I have a list based
program (ca
16 matches
Mail list logo