- Haskell-Cafe - Haskell.org

on termination
by Cagdas Ozgenc 09 May '03

09 May '03

Greetings. This may be a little off topic, but I could not get much response from comp.theory, so here it goes: Is it possible to have a programming language that can be used to produce only the programs that terminate, but at the same time decide all recursive languages? Or does such limitation automatically reduce the class of languages that such a programming language decide to primitive-recursive? Perhaps, I couldn't explain it very clearly. I suppose another way of saying this is: Is there a strongly normalizing system that can decide the class of recursive languages? Perhaps something less strong than a Turing Machine, for example deciding all recursive languages but not recognizing any recursively enumerable languages. Thanks

5 12

Re: [Arrays] Random Access Times ?
by Ron de Bruijn 08 May '03

08 May '03

--- Hal Daume III <hdaume(a)ISI.EDU> wrote: > > The one is use is a unboxed and you mean I should > > import the Hugslibrary IOExts, just like in my > code , > > right? > > if you're using arrays of complex values like your > data type, i seriously > doubt you're using unboxed arrays. you will have to > write special > instance methods for them. and yes, you should just > be able to use it as > is. > I really don't have any idea about how to create an instance of that IOArray. The only thing I know about this instance is: instance IOArray bounds myDataType where, but that's nog enough. Can you (again) help me? __________________________________ Do you Yahoo!? The New Yahoo! Search - Faster. Easier. Bingo. http://search.yahoo.com

2 4

Annuity Payment
by sdGrego99＠email.com 07 May '03

07 May '03

http://www.helpu-web.com/annuities/ Here is that great annuity site Frank told me about! http://www.helpu-web.com/annuities/ Thanks, Alan you want out: http://1st-helpu.com/rm.html

1 0

writing a function to build a list of ints from user input
by sashan 06 May '03

06 May '03

I'm trying to write a function that builds a list from user input. This is what I've come up with so far. --a program that makes a list of numbers from user input makeList :: IO [Int] makeList = do s <- getLine if read s /= 0 then return (read s:makeList) else return [] However it fails with the following error: Couldn't match `[a]' against `IO [Int]' Expected type: [a] Inferred type: IO [Int] In the second argument of `(:)', namely `makeList' In the first argument of `return', namely `((read s) : makeList)' It's trying to match a list, [a], with type IO [Int]. This causes it to fail. How do I get around this? -- sashan http://sashan.netfirms.com --------------------------- Brain: Here we are, Pinky--at the dawn of time! Pinky: Narf, Brain. Wake me at the noon of time.

3 4

RE: writing a function to build a list of ints from user input
by Simon Marlow 06 May '03

06 May '03

> On Tue, May 06, 2003 at 05:02:56AM -0500, Galen Menzel wrote: > > > > makeList :: IO [Int] > > makeList = do s <- getLine > > case read s of > > 0 -> return [] > > x -> do xs <- makeList > > return (x:xs) > > > > I changed the if to a case so that (read s) doesn't get > called twice. > > Does the compiler not optimize away identical calls? Or is it > not allowed to, for some reason? Yes, GHC will common up the repeated expression when -O is turned on. > On the other hand, if I write a function like: > > long_list = [1..100000] ++ [1..100000] ++ [1..100000] ++ [1..100000] > > And then run a > > putStr $ unlines $ map show long_list > > I would expect this to take very little memory, which would > mean that the > [1..100000] would need to be calculated four separate times > rather than > being calculated once and stored... Well, this is one of the disadvantages of common sub-expression elimination: you have to store the result of the sub-expression between uses. It is a space/time tradeoff, and in cases like the above, a pretty poor one. But GHC does it anyway, because in most (probably all) of the cases we've seen it is a win. Cheers, Simon

1 0

do expression
by sashan 05 May '03

05 May '03

Hi I'm trying to write a simple program to get user input and execute a function based on the input. The program follows: import IO main = do putStrLn "1) f1" putStrLn "2) f2" choice <- getLine case choice of 1 -> do putStrLn "f1" 2 -> do putStrLn "f2" _ -> do putStrLn "" When compiled with ghc I get the following error: test.hs:8: No instance for (Num String) arising from the pattern `2' at test.hs:8 In a case alternative: 2 -> do putStrLn "f2" In the case expression: case choice of 1 -> do putStrLn "f1" 2 -> do putStrLn "f2" _ -> do putStrLn "" Please can someone explain. Thanks

3 2

Maximum value in a list
by sashan 05 May '03

05 May '03

Hi I was reading through the tutorial Yet Another Haskell Tutorial and doing chapter 3 ex 5, write a function using foldr and max to return the maximum value in a list. I came up with the following that will work for positive numbers. maxInList :: [Int]->Int maxInList [] = 0 maxInList l = foldr max 0 l Is there an identity for the max function? Because currently if the list [-1,-3,-4] is passed to maxInList it will return 0.

4 4

Re: Fast Mutable arrays and a general question about IO
by Jon Cast 05 May '03

05 May '03

Ron de Bruijn <rondebruijn(a)yahoo.com> wrote: > > Why? It's not always necessary to go for maximum speed; do you have > > a reason for needing it in this case? > > Almost any operation in my program works on array's and before the > program terminates, there have been an awful lot of operations on > it. If there is an other kind of array that mutates and doesn't create > a copy of it when changing a value and isn't more than 1,5 times as > slow as an array in C++ then that should also be ok. The program would > run in a scale of hours or days. And if it's twice as fast, than I > could calculate two times as much. Alright. <snip> > > I think you mean `above'. In any case, could you show us some code > > you have that's not working? That'll make it much easier for us to > > answer your questions. > > > > Well I don't have really code, because I want to begin programming it. > > I will restate my goal: I want to be able to read, update and create > arrays in Haskell of type myDataType (suppose my constructor function > is Con Int String Int) Alright. You seem to have the concepts down here, so I would recommend you try to start on your own, and mail us back when you have a problem. > on a way that's fast, preferabily the fastest method. I don't know what the fastest method is, although I doubt you'll get anything (natively) faster than IOArray, or IOUArray if you only need arrays of primitive types. <snip> > > > So to put it more concrete: In any Haskell program that does IO > > > there is always some function that has this form: > > > > > > do x<-someSource > > > putBoundVariableToSomeOtherFunctionThatDoesMonadicOperations > > > (restOfPureFunctionalProgramForExample x) > > > > No. > > Why not? Sorry; I put that reply in the wrong place; I meant it to refer to the item below it (meaning it's not possible to do IO within a value of type Int). You are correct that there must be a function in any program with /at least/ that form (i.e., there could be more statements, but if you want to do processing within pure Haskell, you need to wrap that processing ultimately roughly as shown above). Jon Cast

4 5

popen bug?
by Mark Preston 05 May '03

05 May '03

Is there a bug in the GHC implementation of the popen function that manifests itself when more than 4k is written to the pipe? I'm trying to reproduce in Haskell the standard UNIX shell pipe idiom: cat 4097 | cat where 4097 is a file containing 4097 bytes. My Haskell code looks as follows: -- snip -- import Posix import IO import System main :: IO () main = do sequence_ $ map printChunk chunks printChunk :: String -> IO () printChunk str = do (find_output, _, _) <- popen "cat" [] (Just str) (cat_output, _, _) <- popen "cat" [] (Just find_output) putStrLn cat_output putStrLn $ show (length str) lengths = [4095,4096..] str = repeat 'a' chunks = zipWith take lengths (repeat str) -- end snip -- I get two pieces of output, one for each of the 4095 and 4096 bytes, but nothing for 4097 bytes, the program just hangs. Is this some bizarre feature of lazy evaluation, or a mistake in the way that popen is implemented (or both)? I'm using ghc-5.04.3 on linux 2.4.20-8 (Red Hat 9). Thanks, Mark. _________________________________________________________________ On the move? Get Hotmail on your mobile phone http://www.msn.co.uk/mobile

2 1

RE: Maximum value in a list
by Garner, Robin 05 May '03

05 May '03

You'll find in the Prelude that Int is an instance of Bounded, so minBound and maxBound are defined, and are the identities you need. cheers -----Original Message----- From: sashan [mailto:sashang@ihug.co.nz] Sent: Monday, May 05, 2003 12:30 PM To: haskell-cafe(a)haskell.org Subject: Maximum value in a list Hi I was reading through the tutorial Yet Another Haskell Tutorial and doing chapter 3 ex 5, write a function using foldr and max to return the maximum value in a list. I came up with the following that will work for positive numbers. maxInList :: [Int]->Int maxInList [] = 0 maxInList l = foldr max 0 l Is there an identity for the max function? Because currently if the list [-1,-3,-4] is passed to maxInList it will return 0. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0