- Haskell - Haskell.org

Uluslararas� �� FIRSATI..
by �� F�rsat� 25 Jul '02

25 Jul '02

Uluslararası amerikan firması sağlık, kozmetik, gıda ve telekomünikasyon alanında uluslar arası çalışma imkanı tanıyor. Önkoşulsuz, sermayesiz ve risksiz. Dilerseniz ek gelir dilerseniz milyon $ 'lık bir iş; .......ve bağımsız! İlgileniyorsanız. AYLA HAYBAT wayscanada(a)hotmail.com Ayrıntılı Bilgi: www.herbalife.com ---------------------------------------------------------------------------------------------------------------------------- AMERİKA GREEN CARD GÖÇMENLİK ÇEKİLİŞİ KANADA GÖÇMENLİĞİ İNGİLTERE DE ÜCRETSİZ ingilizce EĞİTİM..... BİLGİ İÇİN www.myvizyon.com u ziyaret ediniz....

1 0

Bug in library report
by Simon Peyton-Jones 25 Jul '02

25 Jul '02

Folks, Another small but long-standing bug in the Haskell Library report: the recursive calls to 'reads' and 'shows' in the Read and Show instances for Ratio and Array should be calls to readsPrec and showsPrec respectively. The corrected defintions are below. (c.f. the example of derived instances in Appendix D of the language report.) Anyone disagree? (How do these bugs last so long?) Simon ================== Page 5 ======================== instance (Read a, Integral a) => Read (Ratio a) where readsPrec p = readParen (p > prec) (\r -> [(x%y,u) | (x,s) <- readsPrec (prec+1) r, ("%",t) <- lex s, (y,u) <- readsPrec (prec+1) t ]) instance (Integral a) => Show (Ratio a) where showsPrec p (x:%y) = showParen (p > prec) (showsPrec (prec+1) x . showString " % " . showsPrec (prec+1) y) ================== Page 24 ======================== instance (Ix a, Show a, Show b) => Show (Array a b) where showsPrec p a = showParen (p > arrPrec) ( showString "array " . showsPrec (arrPrec+1) (bounds a) . showChar ' ' . showsPrec (arrPrec+1) (assocs a) ) instance (Ix a, Read a, Read b) => Read (Array a b) where readsPrec p = readParen (p > arrPrec) (\r -> [ (array b as, u) | ("array",s) <- lex r, (b,t) <- readsPrec (arrPrec+1) s, (as,u) <- readsPrec (arrPrec+1) t ]) -- Precedence of the 'array' function is that of application itself arrPrec = 10

5 6

(no subject)
by MDjekic 25 Jul '02

25 Jul '02

1 0

still random number problem
by Junjie Xu 25 Jul '02

25 Jul '02

Hi there, First of all, I would say thank you very much for all who helped me during the past days. Since I am a beginner , sometime I spent even several hours to solve a very simple problem.So, I still need your help in the future. The problem is: ******************************************************** import Random uni :: IO () -> Float uni = do xs <- newStdGen let m = (head (randoms xs) :: Float ) doubleit :: Float -> Float doubleit n = 2.0*n main = print (doubleit uni) ******************************************************** The result is: bash-2.05$ ghci ___ ___ _ / _ \ /\ /\/ __(_) / /_\// /_/ / / | | GHC Interactive, version 5.02.2, for Haskell 98. / /_\\/ __ / /___| | http://www.haskell.org/ghc/ \____/\/ /_/\____/|_| Type :? for help. Loading package std ... linking ... done. Prelude> :cd test Prelude> :l random.ls can't find module `random.ls' Prelude> :l random.hs Compiling Main ( random.hs, interpreted ) random.hs:11: The last statement in a 'do' construct must be an expression Failed, modules loaded: none. Prelude> ******************************************************* What is wrong with it? Thank you very much. Kevin

4 3

Need help
by Junjie Xu 24 Jul '02

24 Jul '02

Hi there, I found I can't generate a random float number(between 0 to 1) use the following method. ***************************************************************** module Main where import System(getArgs) import Random uni :: Float uni = head (randoms g) where g = mkStdGen 77 main = print (show (uni)) ********************************************** once I run it, it will generate a float number. When I run it again, it genetrate the same result. I think maybe the cause is that the seed is 77. To solve this, I think the seed should be replaced by current time .But I don't know how to capture the time. I referenced the relevant library, but I still have no idea. Who know the solution, please give me a hand. Thank you very much. Kevin Xu

4 6

Size �zell....
by seni＠istiyorum.com 24 Jul '02

24 Jul '02

Sizler icin cok ozel býr sýte hazýrladýk http://www.pembelisex.com Bu adreste 18 kategoride 100 lerce galeri binlerce resim ve video ya ulaþabilirsiniz. http://www.pembelisex.com --------------------------------------------------------------------

1 0

RE: functional dependencies
by Ashley Yakeley 24 Jul '02

24 Jul '02

At 2002-07-23 09:06, Simon Peyton-Jones wrote: >Dead right! Imagine there was a method in class D: > > class C a b => D a where > op :: a -> b > >The type of 'op' is > > op :: D a => a -> b > >You can't really expect that the 'b' here is determined by 'a'! Agreed. If you were going to allow "D a", they would have to be considered different "b"s. >Still, I suppose that if the methods in class D mention >only 'a', then it is strange to require D to be parameterised over >'b'. Thus, this seems more reasonable: > > class C a b => D a where > op :: a -> a > >Even this seems odd, because we would get the deduction > > D a |- C a b > >(i.e. from a (D a) dictionary you can get a (C a b) dictionary) >and that's only true for a particular 'b'. Well that's OK. From a (D a) dictionary, you get a (C a b) dictionary, where you're given "a", and you can find "b" from the fundep. -- Ashley Yakeley, Seattle WA

1 0

RE: Bug in library report
by Simon Peyton-Jones 24 Jul '02

24 Jul '02

| As near as I can tell, the precedence of the bounds and | indices in an array doesn't matter at all. Simon M's | suggested change to Page 24 is therefore good for | consistency, but doesn't appear to actually have any effect. | Am I missing something? I think you are right, because the bounds are always a tuple, which is in parens by construction. Similarly the list of index value pairs is always enclosed in square brackets. But the consistency appeals to me. And it definitely matters for Ratio. Simon

1 0

Need Help
by David Feuer 23 Jul '02

23 Jul '02

One possible solution under Linux is to use Haskell's lazy file I/O with /dev/urandom (or /dev/random if you're doing cryptography). David

2 2

PADL'03: Final Call (subm. deadline: July 31)
by Dr. Gopal Gupta 23 Jul '02

23 Jul '02

FINAL CALL FOR PAPERS!!! Fifth International Symposium on Practical Aspects of Declarative Languages 2003 (PADL '03) http://www.research.avayalabs.com/user/wadler/padl03/ New Orleans, Louisiana, USA Jan 13-14, 2003 Co-located with POPL 2003 o PAPER SUBMISSION DEADLINE: July 31. o PADL'03 proceedings will be published as Springer Verlag LNCS, o $500 award for best/most-practical paper.

1 0