News aggregator

async docs not on hackage for some reason?

haskell-cafe - Sat, 01/09/2016 - 8:16am
Hello, Does anyone have any thoughts why the async docs aren't available on hackage yet? - https://hackage.haskell.org/package/async-2.1.0 It says this version was uploaded a few days ago, but no docs are available. I did a `cabal get` locally and build the docs using stack; so it works fine.
Categories: Offsite Discussion

Detecting type errors with GHCi commands?

Haskell on Reddit - Sat, 01/09/2016 - 5:36am

I do a lot of exploratory coding in GHCi, and as such, I'm tinkering with a script to persist definitions across GHCi sessions and reloads like so:

*> :sr narp = putStrLn "Narp!" *> :do m <- return "Ok" *> narp Narp! *> m "Ok" *> :q ...>ghci *> :ls *> narp Narp! *> m "Ok"

... and I've run into a snag. If I use :sr to define a function which does not type check, I still persist it. Now, I do have a :dl command to delete the last definition persisted with :sr, but that is subject to human error. Is there any fairly simple trick I'm overlooking that would let me catch this automatically?

Alternatively, is there something that already does this so I don't have to?

submitted by WarDaft
[link] [4 comments]
Categories: Incoming News

Is there any tutorial about the reducers package ?

Haskell on Reddit - Sat, 01/09/2016 - 3:32am

The question is in the title. I know that with the reducers, I can transform

getSum $ mconcat (map Sum xs)

to something like getSum $ reduce?? xs

or

??? getSum xs

But it always take me half an hour to figure out which import to do and which function to call. This package seems great though.

In the example I gave, it doesn't look really usefull, but it is when you reducing tuples and could do thing like

(getSum a, getSum b, getMax c) = reduce??? [(1,2,3), (4,5,6)] submitted by maxigit
[link] [2 comments]
Categories: Incoming News

Why is Apply defined as `forall a b. f (a -> b) -> f a -> f b`?

Haskell on Reddit - Fri, 01/08/2016 - 9:42pm

Even after years of programming in Haskell, I always get hung up on this when implementing Applicative or Apply for some type.

I get that <*> has this signature to allow the SomeConstructor <$> foo <*> bar pattern which is definitely useful. But why are applicative functor instances defined in this specific pattern, when, for example, forall a b. f a -> f b -> f (a, b) is isomorphic and may be easier to grok (given that there are similar patterns in other languages, for example Promise.all in JavaScript)?

Is it this way because of historic reason, is there a benefit to the former representation (performance?), or is it purely arbitrary?

submitted by srijs
[link] [21 comments]
Categories: Incoming News

What do you call this kind of type inference

Haskell on Reddit - Fri, 01/08/2016 - 8:38pm

(Spinning off from this post on g+)

So given

data Proxy (t :: k) = Proxy proxify :: forall c. (forall a. c a => a -> String) -> Proxy c proxify _ = Proxy

GHC-7.8.2 can confirm my type inferences for applications of proxify:

λ :t proxify show :: Proxy Show proxify show :: Proxy Show :: Proxy Show λ :t proxify id :: Proxy ((~) String) proxify id :: Proxy ((~) String) :: Proxy ((~) String)

But can't make those predictions itself:

λ :t proxify show <interactive>:1:9: Could not deduce (Show a) arising from a use of ‘show’ from the context (c a) ... λ :t proxify id <interactive>:1:9: Could not deduce (a ~ String) from the context (c a) ...

My problem isn't that GHC can't do it (maybe GHC-7.10 can), so much as I don't even know how to describe this kind of type inference.

submitted by rampion
[link] [8 comments]
Categories: Incoming News

What is the current state of ghci or any editor documentation tools?

Haskell on Reddit - Fri, 01/08/2016 - 7:17pm

Problem: I think everyone guessed from the title, but maybe my language is bad and ambiguous. Well, for example you use :browse Data.List and found dropWhile which sounds like what you need, but there is also dropWhileEnd with same type. To see difference you open hoogle, search by name, search in list, read the docs. There should be something faster, like command line tool and something smart enough to get documentation for current entity. Example: python's "help" function. My search of solution was difficult, because there is a lot of noise: people recommend to use type information and hoogle instead of documentation, but it is addition to documentation - not replacement.

Possible solutions:

  • As far as I discovered - there is the ticket for haddock documentation in ghci https://ghc.haskell.org/trac/ghc/ticket/2168 - it is sounds nice but it is 8 years old. 10 month ago was posted two nice comments and priority changed to normal, but it means nothing. Is there any published plans about .hi metadata?
  • hoogle. Well, it is nice cli search tool, can I somehow specify package, open item in browser?
  • dash, zeal. I am found two tools ( https://github.com/jfeltz/dash-haskell/ and https://github.com/philopon/haddocset ) for generating docsets from cabal (second tool using stack) packages. Zeal have command line util, so may be used from ghci. Also zeal may specify package. I'm not tried yet, but it is very close to that I want and still can't be used with loaded entities - only manual typing.
  • Haddock have api!. Which used in two tools above. And also in leksah (someone using lesah? any documentation support for entity under cursor?).

What I want to know:

  • anyone has a better solution? (any solution)
  • anyone want a better solution?
  • is it possible to solve the problem? I am planning to spend some time for it. But as far as I can see there is no any interest or it is very hard (more then 8 years) task.

Probably developer of solution need to get current modules loaded in ghci and pass to haddock api and get entity by name.

submitted by vlastachu
[link] [3 comments]
Categories: Incoming News

A good Haskell graph library which can check for embeddability?

Haskell on Reddit - Fri, 01/08/2016 - 6:59pm

I need a graph library in Haskell which, given node-labelled graphs G and H, can check if G can be embedded into H. We can assume that the graphs have the same set of node labels. Can anyone make any suggestion, or am I rolling an extension?

submitted by KozRoss
[link] [1 comment]
Categories: Incoming News

Your favourite language extension?

Haskell on Reddit - Fri, 01/08/2016 - 6:29pm

What's you favourite GHC language extension and what do you like about it (e.g. removing boiler plate code, extending the type system etc.)?

submitted by MyFunc
[link] [36 comments]
Categories: Incoming News

how to make it work so that I can do two things after a maybe ->

Haskell on Reddit - Fri, 01/08/2016 - 4:11pm

I have this code :

doDepositAccount :: [Account] -> IO [Account] doDepositAccount accounts = do putStrLn "On which account to do want to deposit?" accountNameToDeposit <- getLine let newAccounts = depositAccount accountNameToDeposit accounts return newAccounts depositAccount :: String -> [Account] -> [Account] depositAccount s accts = acctsAfter where maybeIndex = findIndex (isAccount s) accts acctsAfter = case maybeIndex of Nothing -> accts Just idx -> accts

Now I want to ask a user to enter another thing and update a value nl the right part of the accounts array.

Is this possibe and how do I achieve this ?

submitted by wobbenr
[link] [2 comments]
Categories: Incoming News

Unifying distinct type variables in TypeApplications

Haskell on Reddit - Fri, 01/08/2016 - 2:52pm

Given these types from constraints:

data Dict a where Dict :: a => Dict a newtype a ⊢ b = Sub (a => Dict b) >>> :set -fprint-explicit-kinds >>> :set -fprint-explicit-foralls >>> :t Sub Sub :: forall (a :: Constraint) (b :: Constraint). (a => Dict b) -> a ⊢ b

I want to be able to use TypeApplications (new feature in GHC 8) to witness that Ord a implies Eq a for all a. Writing Sub @(Ord a) fails because a is not in scope so I use partial type signatures:

>>> :t Sub @(Ord _) Sub @(Ord _) :: forall {t} (b :: Constraint). (Ord t => Dict b) -> Ord t ⊢ b >>> :t Sub @(Ord _) @(Eq _) Sub @(Ord _) @(Eq _) :: forall {t} {t1}. (Ord t => Dict (Eq t1)) -> Ord t ⊢ Eq t1 >>> :t Sub @(Ord _) @(Eq _) Dict Sub @(Ord _) @(Eq _) Dict :: forall {t} {t1}. Eq t1 => Ord t ⊢ Eq t1

but now t and t1 are distinct type variables, same with Sub @(Ord _a) @(Ord _a) Dict.

One way is to add a type annotation and a quantifier:

>>> :t Sub @(Ord a) @(Eq a) Dict :: forall a. _ Sub @(Ord a) @(Eq a) Dict :: forall a. _ :: forall a. Ord a ⊢ Eq a

Is there any trick to getting them to unify without a type annotation or signature?

Edit: Created ticket #11385.

submitted by Iceland_jack
[link] [4 comments]
Categories: Incoming News

What is the motivation for extensible effects?

Haskell on Reddit - Fri, 01/08/2016 - 1:48pm

I'm struggling to understand the overarching motivation for extensible effects, i.e. for tracking arbitrary categories of effects in the type system and how to compose them. It seems similar to the pursuit of checked exceptions, which appears good in theory but is practically more trouble than it's worth. I'm not trying to pass a value judgment; I'm only confused as to why so many people find this approach valuable. Can someone enlighten me?

submitted by eacameron
[link] [39 comments]
Categories: Incoming News

Haskell Weekly News

General haskell list - Fri, 01/08/2016 - 1:34pm
Folks: Recall the quote from the May Day 2015 issue: <http://haskell.1045720.n5.nabble.com/Haskell-Weekly-News-td5808226.html> The MLs and Haskell remind me of Brian Eno's line about how the first Velvet Underground album only sold 30,000 copies, but "everyone who bought one of those 30,000 copies started a band". This issue spotlights Elm and Idris, two languages implemented in Haskell. Enjoy! *Top Picks:* - Evan Czaplicki of the Elm web-front-end language leaves Prezi for NoRedInk <http://elm-lang.org/blog/new-adventures-for-elm>. A startup dedicated to improving high-school English grammar, NoRedInk already employs 5 engineers writing Elm full-time. A HN comment hyperbolizes that Elm <https://news.ycombinator.com/item?id=10837278#up_10838052> "is Clojure without parens, it's Haskell without academy, it's Redux without facebook, it's duck-typing without quacks, it's MVC without objects, and last but not least Evan Czaplicki (the creator) is the new Aaron Patterson (bright a
Categories: Incoming News

Data declaration vs type classes

haskell-cafe - Fri, 01/08/2016 - 11:55am
Dear haskellers, What is the difference between writing data Task = GroceryTask String | LaundryTask Int doTask :: Task -> IO () doTask (GroceryTask s) = print "Going to " ++ s doTask (LaundryTask n) = print (show n ++ " pieces washed" and class Task a where work :: a -> IO () data GroceryTask = GroceryTask String data LaundryTask = LaundryTask Int instance Task GroceryTask where .. instance Task LaundryTask where .. doTask :: Task a => a -> IO () doTask = work They seem to be similar functionality wise, except that one is on the data level and another is on the class level. How should one go about deciding to use data or class? Is there a semantic difference? Which is more appropriate here? Happy new year, Hon _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe< at >haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Categories: Offsite Discussion