Oui, si vous aves des questions ...
On Wednesday, February 5, 2020, 12:24:09 PM GMT+2, Olivier Revollat
wrote:
Bonjour,
Cette liste est elle toujours active ?
___
Haskell-fr mailing list
Haskell-fr@haskell.org
http://mail.haskell.org/cgi-bin
gift
- bind is something like: how to combine a function with a package. Open the
package, compose functions, take care to produce an other package (or capsule).
Hoping it helps,
Sincerely yours,
Dan Popa
- Forwarded Message -
From: Gautier DI FOLCO
To: La liste Haskell Francophone
Hi, Valentin,
You are on an .edu network, so may I speak english ?
The Fr/Haskell community was initiated by somebody which is not from France
(i.e. myself) after a discussinon with Simon P.J. concerning communities.
In the begining, 8 guys from France said: Well, thank you for doing this.
But
Hi,
Parsec is actually separated in "pieces".
But if you are using modular parser combinators from Parsec or other functions,
then is a good ideea to locate the exact module from where they belongs, and
include it, as it was told.
Use Hoogle to locate the needed module.
Make is forcing/instruc
Hi,
Have you tried ?
ghc --make main.hs
Dan
--- On Tue, 8/10/10, Marc Chantreux wrote:
> From: Marc Chantreux
> Subject: [Haskell-fr] premier essai avec Parsec
> To: haskell-fr@haskell.org
> Date: Tuesday, August 10, 2010, 7:02 AM
> Bonjour a tous,
>
> Je me suis lancé dans le tuto de DAA
Mine was wrong :(
Corrected version:
maximum [ (a*b) | a <- [1..1000], b<- [a..1000], let n'= (show $ a*b) in n' ==
reverse n' ]
inspired by yours.
Dan
--- On Mon, 2/1/10, David Virebayre wrote:
> From: David Virebayre
> Subject: Re: [Haskell-fr] euler 4: vos commentaires ?
> To: "La liste
Hi Marc
Une tres jolie petite probleme !
Voila une solution brute-force dans une ligne de code.
Esseyer !
Hugs> last [ a*b | a <- [1..100], b<- [1..100], (show $ a*b) == reverse ( show
$ a*b) ]
9009
Hugs> last [ a*b | a <- [1..1000], b<- [1..1000], (show $ a*b) == reverse (
show $ a*b) ]
9090
http://www.hakell.org/hakellwiki/Fr/Haskell
Il y a une version du "Gentle Introd. in Haskell"
traduit en Francais par N.V.
C'est bon pour commencer !
J'ai aussi commence avec ce livre !
Dan
--- On Tue, 1/12/10, jideel wrote:
> From: jideel
> Subject: Re: [Haskell-fr] lis tes ratures fonctio
e
la fonction (+) est definit
(+) :: a -> a -> a"
Le premier a est le type du premier argument,
la seconde est le type du seconde argument
la DERNIERE est le type du resultat.
Notes que la signe -> associer a droite.
Les deux sont equivalente:
(+) :: a -> a -> a
(+) :: a ->
Eseyes :
http://www.haskell.org/haskellwiki/Introduction_par_prof._Anthony_A._Aaby
Mais il y a une traduction automatique. Me vous pouvez y
corrige.
Dan
--- On Sat, 1/9/10, Marc Chantreux wrote:
> From: Marc Chantreux
> Subject: Re: [Haskell-fr] Document de référence
> To: "La liste Haskell
Non, je ne croit pas.
No, I do not think so.
Try the Haskell Reference and Report.
Some yeaqrs ago, I have been forced by the same situation to
write my own manual.Do the sam, I will help you or simply ask me.
Dan
--- On Sat, 1/9/10, jideel wrote:
> From: jideel
> Subject: [Haskell-fr] Do
11 matches
Mail list logo
