- Beginners - Haskell.org

Polymorphism
by Ford 11 Jul '16

11 Jul '16

Hello, Why exporting a function doesn't force you to make its inputs derive a typeclass? That would solve all name clashing (just derive also or give different name, because it is obviously too generic). Why can't you overload field accessor via typeclass easily? data Foo = Foo {HasSize => size :: Int} > :t size HasSize a => size a -> Int Why is String not deprecated yet, throwing warning into your face. I think that haskell is really missing some uniformity, there is nothing like AbstractString and AbstractArray (something like java Collections) so a lot of modules introduces its own functions that are just aliases for others. (Even Prelude itself suffers from this - map fmap liftM, pure return...). King regards! Odesláno z BlueMail

1 0

Haskell laziness and data structures.
by OxFord 09 Jul '16

09 Jul '16

Hello, Why is there no default O(1) random access list data structure in haskell (for example clojure has [] vector). I would expect that this kind of data structure is used very often, so you shouldn't need to import one yourself. Is it safe to assume that ' reverse [1, 2, 3, 4, 5] ' is O(1) ? Is it safe to assume that main = x = [1, 2, 3, 4, 5] x = reverse reverse x won't use more space than for the initial [1, 2, 3, 4, 5] list? (No copy of x) Why is array indexeded by ! and list by !!. Shouldn't they be both instances of something like Indexable? King regards, Ford

5 6

How to move nodes in Data.Tree.Zipper
by martin 09 Jul '16

09 Jul '16

Hello all, I've been playing with Data.Tree.Zipper and one of the tasks I set for myself was to move a node to another position. I endet up in a situation, where I no longer have a clear understanding what "moving" means. Data.Tree.Zipper distinguishes between Nodes ("Full") and Space ("Empty"). So I thought to move a nde I need to know the node to be moved ("Full") and the space where it shall be moved to ("Empty") But I need to do two things: (1) remove the node from its original position (2) insert the node at the empty space given. Both operations are supported by D.T.Z, but once I removed the node, I have a new Zipper, while the space given still refers to the original zipper. The new Zipper has no idea where the deleted node shall be inserted and the original empty space doesn't have the node removed. This is not the fault of D.T.Z, but in a way a real-world problem I had been unaware of. With my original idea I could have moved a node to a subspace of itself, which makes no real sense. It appears that giving two zippers to a tree-modifying function is utterly useless when they refer to the same tree and both undergo modifications by the function. What would be a correct way to think about this?

1 0

search function by type
by OxFord 08 Jul '16

08 Jul '16

Hello, is it possible to search for all functions that have concrete type? For example I want to convert [Char] to [Word], but I don't know whether function for that exist. Or I wanna find contructor for SomeSpecialType and I don't know it's name. Can you search those function in GHCI via some command? E.G. GHCi, version 8.0.1: http://www.haskell.org/ghc/ :? for help [}{] :searchtype / :st [Char] -> [Word] Found X match(es): foo1 :: (Char -> Word) -> [Char] -> [Word] foo2 :: [Char] -> [Word] ... [}{] :st SomeSpecialType Found 1 match(es): foo3 :: ... -> .. -> SomeSpecialType King Regards, Ford

3 2

Case vs Guards. I still don't know what is the difference
by Semih Masat 07 Jul '16

07 Jul '16

Hello, I am new to Haskell and trying to learn it with learnyouahaskell.com and Pluralsight Haskell course. And i have a very noob question. I understand that *if .. else* is just a syntactic sugar over *case. *But what about guards then ? Are guards also *case *in different syntax ? Or vice versa ? Like with an example. anyEven nums | (length (removeOdd nums)) > 0 = True | otherwise = False anyEven' nums = case (removeOdd nums) of [] -> False (x:xs) -> True I can do the same thing with both of them. As i understand the only different thing is, with *case *i can manipulate the parameter (like here in the example i used removeOdd) and can use the manipulated parameter to decide what to do after that. So i will not need to use removeOdd function inside the case. ( maybe i will need to use in every guard definition if i choose to use guards ) Is this it? Is this the only difference between them ? And if it is, why haskell needed do implement both of them. Can't we use function like removeOdd before using it on case or guard functions ? Thanks, and sorry if my english is bad. Semih Masat

3 4

Polymorphism ad hoc
by OxFord 06 Jul '16

06 Jul '16

Hello, why does haskell support only parametric polymorphism? Is it because ad hoc p. || multiple dispatch is bad in general? King Regards, Ford

2 1

Preorder function application
by OxFord 04 Jul '16

04 Jul '16

Hello, why Haskell doesn't apply functions in preorder? e.g. f x = x max 1 f 2 > 2 max f 1 f 2 > 2 max max f 1 f 2 f 3 > 3 f f f f f f f f f f f 1 > 1 Thus you would need to put the arguments into brackets only when you want to partially apply that function. Is the current method more readable or error prone? King regards, Ford

2 1

Howto reverse a Data.Array
by Timothy Washington 03 Jul '16

03 Jul '16

I'm still trying to get an intuitive understanding of Haskell's Data.Array <http://hackage.haskell.org/package/array-0.5.1.1/docs/Data-Array.html#g:5>, in contrast to Data.List or Data.Vector. I very much want a nested array (a matrix), where the parent list (or rows) are reversed. But neither *A.array* nor *A.istArray* allow indicies to be reversed in their constructors, nor the list comprehensions that generate the elements The only reason I'm using an array, is for the *A.//* function (operating on a matrix). Otherwise, I'd use Data.Vector <https://hackage.haskell.org/package/vector-0.11.0.0/candidate/docs/Data-Vec…> which does have a reverse function, but a less powerful *V.//* , that doesn't accept coordinates in a matrix. Can I reverse a Data.Array? If not, then why. Thanks Tim

2 2

Problem with numeric types
by Russ Abbott 02 Jul '16

02 Jul '16

I'm trying to define primes using just list comprehension. The following works. Prelude> odds = [3, 5..] Prelude> primes = 2 : [p | p <- odds, null [d | d <- take (p `div` 4) odds, p `mod` d == 0]] But when I replace "take (p `div` 4)" with takeWhile (<=(sqrt p)) as in Prelude> primes' = 2 : [p | p <- odds, null [d | d <- (takeWhile (<=(sqrt p)) odds), p `mod` d == 0]] I get no error message on entering the statement, but when I run Prelude> take 8 primes' I get an error message that I can't understand. <interactive>:23:1: error: • Ambiguous type variable ‘a0’ arising from a use of ‘it’ prevents the constraint ‘(Floating a0)’ from being solved. Probable fix: use a type annotation to specify what ‘a0’ should be. These potential instances exist: instance Floating Double -- Defined in ‘GHC.Float’ instance Floating Float -- Defined in ‘GHC.Float’ • In the first argument of ‘print’, namely ‘it’ In a stmt of an interactive GHCi command: print it I tried using (ceiling (sqrt p)), and I tried to explicitly declare it an Int, but neither of those helped. I'd appreciate some help. Thanks. P.S. The following runs fine. Prelude> takeWhile (<= (sqrt 99)) odds So I'm completely stumped.

2 1

Problem with installing GHCi 8.0.1
by Russ Abbott 01 Jul '16

01 Jul '16

I downloaded GHCi 8.0.1 for Windows. Since I don't have administrator privileges I repeatedly clicked no when asked if I wanted to stop and restart with elevated privileges. Eventually it installed (in a folder on the desktop). The next step tells me to change some lines in the cabal user-config file. I followed the instructions to find that file, but all I got was an html file, which didn't seem right. I looked manually in multiple directories, but nothing seemed like the right file. Would someone help me find the file that needs to be changed. Also, WinGHCi does not appear in my start menu. Should it appear there by this point? Thanks.

2 2