Hello,
All this talk about Haskell classes, ML modules and improved record types
reminds me of the rumours of a "First Class Modules" system for Haskell,
but the only documentation I found was a fairly brief document that looked
like an application for a research grant. So...
Could somebody expl
Marcin 'Qrczak' Kowalczyk writes:
> Could somebody show an example which requires fundeps and cannot be
> expressed using a simpler model explained below - a model that I
> can even understand? Is the model self-consistent at all?
>
[a model which uses key constraints instead of functional d
Sun, 7 Jan 2001 20:00:51 +0200 (IST), Shlomi Fish <[EMAIL PROTECTED]> pisze:
> Does anybody knows of an implementation for an efficient dictionary
> (such as a hash, an AVL tree, a B-Tree etc. ) in Haskell?
ghc's library contains FiniteMap, implemented as a balanced binary tree
(not exactly AVL)
Sebastien Carlier wrote:
> Sometimes I need to write code which looks like this:
> >do x <- m1
> > let y = unzip x
> > ... -- never using x anymore
>
> I thinks the following extension to do-notation would be useful:
> >pat <- exp1 # exp2 ; exp3
> would be rewritten as
> >
Does anybody knows of an implementation for an efficient dictionary (such
as a hash, an AVL tree, a B-Tree etc. ) in Haskell? Can an array do that?
I'd like something that can map any type to any other type based on a
comparison function, and perhaps a hashing function.
TIA,
Shlomi Fis
"R.Daniel" wrote:
> Hi, could anyone tell me where to find some info about generating
> movement on a frictionless environment? [...]
I'd recommend one of the game programming sites, they have tons of
useful stuff related to physics, too:
http://www.devgames.com/
http://www.gdmag.com/
http://www
Sebastien Carlier wrote:
> I'm constantly amazed by the number of tricks one has
> to know before he can write concise code using the
> do-notation [...]
In my experience it is not the do-notation itself, but the mixture
of monadic actions and higher-order functions. But after a while
you´ll real
Hi, could anyone tell me where to find some info about generating
movement on a frictionless environment?
I need to put a ball running in a window, given an initial speed and then
let it run along with the rules of phisicscan anyone give me a hint
on where to find info, or on how to do that?
> import Monad
> ...
> do y <- liftM unzip m1
Thanks.
I'm constantly amazed by the number of tricks one has
to know before he can write concise code using the
do-notation (among other things, I used to write
"x <- return $ m" instead of "let x = m").
Is there a paper demonstrating the most
Sun, 7 Jan 2001 15:03:07 +0100, Sebastien Carlier <[EMAIL PROTECTED]> pisze:
> Does this extension already exist ?
Yes.
import Monad
...
do y <- liftM unzip m1
--
__("< Marcin Kowalczyk * [EMAIL PROTECTED] http://qrczak.ids.net.pl/
\__/
^^ SYGNATURA ZASTÊPCZA
QRC
On Sun, 7 Jan 2001, Sebastien Carlier wrote:
>
> Sometimes I need to write code which looks like this:
> >do x <- m1
> > let y = unzip x
> > ... -- never using x anymore
>
> I thinks the following extension to do-notation would be useful:
> >pat <- exp1 # exp2 ; exp3
> wo
Sometimes I need to write code which looks like this:
>do x <- m1
> let y = unzip x
> ... -- never using x anymore
I thinks the following extension to do-notation would be useful:
>pat <- exp1 # exp2 ; exp3
would be rewritten as
>exp2 >>= ((\pat -> exp3) . exp1)
so that
[EMAIL PROTECTED] wrote,
> which is the function in haskell that allows to generate us an amount
> of aleatory numbers
I guess, you want to generate random numbers. Check out
http://haskell.org/onlinelibrary/random.html
Cheers,
Manuel
___
Haske
which is the function in haskell that allows to generate us an amount
of aleatory numbers
I thank your help
__
Mensagem enviada pelo Xekmail: webmail grátis do AEIOU
http://xekmail.aeiou.pt
__
14 matches
Mail list logo
