- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] Where would I find fromInt?
by Tom Harper 09 Sep '07

09 Sep '07

Hi Paul -- The function you want is called fromIntegral, and works for all Integral types. Using it, you can add a type signature to specify what you want to change the number to (Float, Double, other Integral type, etc. Example: > fromIntegral (4 :: Int) :: Double 4.0 Hope this helps! -- Tom Harper rtharper(a)aftereternity.co.uk +1 949 235 0185 Public Key: http://aftereternity.co.uk/rth.asc On 9/9/07, PR Stanley <prstanley(a)ntlworld.com> wrote: > Hi > Where would I find the fromInt function, please? > Better still, would anyone know how to write a func for converting > int to float and vice versa? > Thanks, Paul > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > -- Tom Harper rtharper(a)aftereternity.co.uk +1 949 235 0185 Public Key: http://aftereternity.co.uk/rth.asc

1 0

Help understanding type error
by Levi Stephen 09 Sep '07

09 Sep '07

Hi, I'm after some help understanding either what I'm doing wrong, or why this error occurs. I have a data type: > data T a = forall b. (Show b) => T b a and I want to use/extract 'b' from this. > extShow (T b _) = b This gives the following compilation error: extest.hs:5:0: Inferred type is less polymorphic than expected Quantified type variable `b' escapes When checking an existential match that binds $dShow :: {Show b} b :: b The pattern(s) have type(s): T t The body has type: b In the definition of `extShow': extShow (T b _) = b I tried adding a type signature: > extShow' :: (Show b) => T a -> b > extShow' (T b _) = b Now I get a different error: extest.hs:8:19: Couldn't match expected type `b' (a rigid variable) against inferred type `b1' (a rigid variable) `b' is bound by the type signature for `extShow'' at extest.hs:7:18 `b1' is bound by the pattern for `T' at extest.hs:8:10-14 In the expression: b In the definition of `extShow'': extShow' (T b _) = b It seems (to newbie me ;) ) like it should be possible to extract the first part of T, and deduce that it is an instance of the class 'Show'. The following seems ok: > doShow (T b _) = putStrLn (show b) Thanks, Levi

7 7

Hackage and GHC 6.8
by Neil Davies 09 Sep '07

09 Sep '07

Given that GHC 6.8 is just around the corner and, given how it has re-organised the libraries so that the dependencies in many (most/all) the packages in the hackage DB are now not correct. Is there a plan of how to get hackage DB up to speed with GHC 6.8 ? Cheers Neil

5 6

((a -> b) -> c) -> (a -> m b) -> m c
by Stuart Cook 09 Sep '07

09 Sep '07

(Inspired by this[1] reddit thread.) When combining monadic and non-monadic code, I've often wished for a magical combinator of type (Monad m) => ((a -> b) -> c) -> (a -> m b) -> m c which would let me inject a monadic function into a pure one, then wrap the ultimate result to ensure that no nastiness escapes. Now, I'm pretty sure that writing such a combinator as-is is impossible. My question is, what restrictions/changes would be necessary for a similar combinator to be definable and well-behaved? (Obviously it would be impossible to ensure that the (m b)s get chained in any particular order, for order-sensitive monads, but it would be the caller's responsibility to ensure order-irrelevance in this case.) As a thought experiment, I imagined an implementation for IO using unsafePerformIO. This makes it easy to give the injected function the right type, and it's possible to use return to give the result the correct type too. Unfortunately, the semantics fail: if the injected function is used lazily, there's no way to ensure that the unsafe IO actions actually take place before the rest of the IO-based program, and it's possible for them to show up later than expected. I suspect that even in a strict language, lambda-abstractions would cause similar trouble. [1] http://programming.reddit.com/info/2n6eh/comments Stuart Cook

3 3

ICMP in Haskell (was Elevator pitch for Haskell)
by Dominic Steinitz 09 Sep '07

09 Sep '07

> > Does it enable you to, say, send raw ICMP packets? > > AFAIK, Haskell supports TCP, and nothing else. (A while back I wanted to > write an automated pinging program. But the only way I could figure out > how to do it is to call the OS "ping" utility and attempt to parse what > it writes to stdout. Oh, did I mention that's different on WinNT, WinXP > and UNIX?) > Andrew, I thought this was relatively straightforward. Look in http://www.haskell.org/networktools/src for multi-threaded versions. Beware I wrote ping and traceroute about 5 years ago. They're pretty much straight from Stevens' book. On the other hand, I quite liked this: sequenceWhile_ :: Monad m => (a -> Bool) -> [m a] -> m () sequenceWhile_ p [] = return () sequenceWhile_ p (x:xs) = x >>= \c -> if (p c) then sequenceWhile_ p xs else return () I'd forgotten about them and I'm not particularly proud of them. I guess I could put them in hackage so that they are at least a starting point for someone. Dominic.

1 0

"Cofunctor" as a name
by Conal Elliott 09 Sep '07

09 Sep '07

I've heard contravariant functors referred to as "cofunctors", and I've also heard objections to that term. As I'm preparing to release some libraries using contravariant functors, I'd appreciate hearing preferences and/or reasons. For instance, another name would be "Contrafunctor". -- | Contravariant functors. often useful for /acceptors/ (consumers, -- sinks) of values. class Cofunctor acc where cofmap :: (a -> b) -> (acc b -> acc a) Thanks, - Conal

1 0

Serial Communications in Haskell
by Ronald Guida 08 Sep '07

08 Sep '07

I'm on a Windows box and I'm looking for a way to talk to a serial port (for example, RS-232) from Haskell. I couldn't find a library to do this, so I am wondering how to create one. I have a fairly thorough understanding of how to open and use a serial port with the Windows API. In particular, to open a serial port, I have to use CreateFile, which is the same API call that opens files. In fact, if I call openFile from GHC, and pass "COM1:" as the filename, then I can get a writable serial port. > module Serial > where > import System.IO > > main = do > h <- openFile "COM1:" ReadWriteMode > hPutStrLn h "Hello World" I can't read from the port (I always get an immediate EOF), and I have no way of configuring things like the baud rate or the parity settings. Nevertheless, this demonstrates that openFile can at least open the serial port. What I would like to do is create some functions that would allow me to open and configure a serial port, and get a Handle back so that I can use the existing IO functions like hGetChar and hPutChar. I am assuming that hGetChar eventually calls win32::ReadFile and hPutChar eventually calls win32::WriteFile. These same two API calls would work for serial ports. In Windows, there are 23 API functions that apply specifically to serial ports. Out of these 23 functions, only a few of them are actually necessary if I just want to send and receive data. Of course, I don't know how to call Windows API functions from Haskell, and I have no idea how to hook things to the IO library so that I can use a Handle for a serial port. I'm looking for some advice on how to proceed. -- Ron

5 6

generate a news summary page from web services
by brad clawsie 08 Sep '07

08 Sep '07

i recently worked up a little example program i use to generate a general news summary page using yahoo web services if you are interested in an example of XHT and Text.XHtml.Strict in action, you can see it here http://www.b7j0c.org/content/haskell-newspage.html

2 2

Block-wise lazy sequences in Haskell
by Henning Thielemann 07 Sep '07

07 Sep '07

I want to have a data structure like Data.ByteString.Lazy, that is block-wise lazy, but polymorphic. I could use a lazy list of unboxed arrays (UArray) but the documentation says, that the element types are restricted. But I will need (strict) pairs of Double and the like as elements. It seems that I need generalized instances in order to use these arrays. I thought it must be possible to define an unboxed array type with Storable elements. I cannot find such a type in the standard libraries. Further on, I wonder why pairs are not instances of Storable.

12 15

Extending the idea of a general Num to other types?
by Peter Verswyvelen 07 Sep '07

07 Sep '07

I like the fact that Haskel treats numbers in a generic way, so you can lift them to any other datatype by instantiating Num. Can the same be done on other builtin constructs? For example, if I have [a], can this list be lifted to other types? I guess not, because no type class exists for the list type? Does this make sense? I'm still searching for correct terminology... Thanks, Peter

15 30