July 2018 - Haskell-Cafe

Access violation when stack haddock haskell-src-exts since LTS 12.0
by Yuji Yamamoto 23 Aug '18

23 Aug '18

I always get an " Access violation in generated code when reading 0x28900000" error when executing > stack haddock haskell-src-exts since LTS 12.0. I'm not sure to which project I should submit a bug report. GHC? Haddock? Or Stack? And how can I make a smaller case to reproduce the same error? I attached a log when executing with --verbose --cabal-verbose for your info. -- 山本悠滋 twitter: @igrep GitHub: https://github.com/igrep GitLab: https://gitlab.com/igrep Facebook: http://www.facebook.com/igrep Google+: https://plus.google.com/u/0/+YujiYamamoto_igrep

8 11

Need some help figuring out how to use the repl with reflex using only stack
by Michael Litchard 03 Aug '18

03 Aug '18

I've created a minimal example to show you what I've tried. Below is also a truncated error log. Could someone help me figure out how to get ghci working with this example? https://github.com/mlitchard/reflex-todo stack repl --stack-yaml=stack-ghc.yaml Truncated error log Error: -- While building custom Setup.hs for package jsaddle-dom-0.9.2.0 using: /home/mlitchard/.stack/setup-exe-cache/x86_64-linux/Cabal-simple_mPHDZzAJ_1.24.2.0_ghc-8.0.2 --builddir=.stack-work/dist/x86_64-linux/Cabal-1.24.2.0 build lib:jsaddle-dom --ghc-options " -ddump-hi -ddump-to-file" Process exited with code: ExitFailure 1 Logs have been written to: /home/mlitchard/projects/git/reflex-todo/.stack-work/logs/jsaddle-dom-0.9.2.0.log Preprocessing library jsaddle-dom-0.9.2.0... [587 of 599] Compiling JSDOM.Custom.XMLHttpRequest ( src/JSDOM/Custom/XMLHttpRequest.hs, .stack-work/dist/x86_64-linux/Cabal-1.24.2.0/build/JSDOM/Custom/XMLHttpRequest.o ) /home/mlitchard/projects/git/reflex-todo/.stack-work/downloaded/Vheiln5kqwE0/src/JSDOM/Custom/XMLHttpRequest.hs:39:46: error: • Could not deduce (Control.Monad.Catch.MonadThrow Language.Javascript.JSaddle.Types.JSM) arising from a use of ‘throwM’ from the context: MonadDOM m bound by the type signature for: throwXHRError :: MonadDOM m => Maybe XHRError -> m () at src/JSDOM/Custom/XMLHttpRequest.hs:38:1-53 • In the second argument of ‘(.)’, namely ‘throwM’ In the second argument of ‘maybe’, namely ‘(liftDOM . throwM)’ In the expression: maybe (return ()) (liftDOM . throwM) /home/mlitchard/projects/git/reflex-todo/.stack-work/downloaded/Vheiln5kqwE0/src/JSDOM/Custom/XMLHttpRequest.hs:42:20: error: • No instance for (Control.Monad.Catch.MonadMask Language.Javascript.JSaddle.Types.JSM) arising from a use of ‘bracket’ • In the first argument of ‘(.)’, namely ‘bracket aquire id’ In the expression: bracket aquire id . const In an equation for ‘withEvent’: withEvent aquire = bracket aquire id . const /home/mlitchard/projects/git/reflex-todo/.stack-work/downloaded/Vheiln5kqwE0/src/JSDOM/Custom/XMLHttpRequest.hs:45:31: error: • Could not deduce (Control.Monad.Catch.MonadCatch Language.Javascript.JSaddle.Types.JSM) arising from an operator section from the context: MonadDOM m bound by the type signature for: send' :: MonadDOM m => XMLHttpRequest -> Maybe JSVal -> m () at src/JSDOM/Custom/XMLHttpRequest.hs:44:1-62 • In the expression: (`onException` abort self) In the second argument of ‘($)’, namely ‘(`onException` abort self) $ do { result <- liftIO newEmptyMVar; r <- withEvent (onAsync self Generated.error . liftIO $ putMVar result (Just XHRError)) $ withEvent (onAsync self abortEvent . liftIO $ putMVar result (Just XHRAborted)) $ withEvent (onAsync self load . liftIO $ putMVar result Nothing) $ do { void $ case mbVal of { Nothing -> ... Just val -> ... }; liftIO $ takeMVar result }; throwXHRError r }’ In the expression: liftDOM $ (`onException` abort self) $ do { result <- liftIO newEmptyMVar; r <- withEvent (onAsync self Generated.error . liftIO $ putMVar result (Just XHRError)) $ withEvent (onAsync self abortEvent . liftIO $ putMVar result (Just XHRAborted)) $ withEvent (onAsync self load . liftIO $ putMVar result Nothing) $ do { void $ case mbVal of { Nothing -> ... Just val -> ... }; liftIO $ takeMVar result }; throwXHRError r }

4 4

Missing common function for Maybe types
by Marc Busqué 31 Jul '18

31 Jul '18

Hi! I have two functions: ``` foo :: a -> Maybe b bar :: a -> Maybe c ``` >From which I want to build a higher order function: ``` foobar :: a -> (a -> Maybe b) -> (a -> Maybe c) -> Either b c ``` The implementation I need is: ``` foobar x f g = case (f x) of Nothing -> g x Just y -> Just y ``` I'm a bit surprised that looking at hoogle I don't find a built-in solution for this quite common need for `Maybe` types (or perhaps for any monad). Am I looking in the wrong way? Does it exist a similar abstraction but with a different shape? Thanks in advance, Marc Busqué http://waiting-for-dev.github.io/about/

7 16

Testing a collision detection system
by mpevnev＠gmail.com 30 Jul '18

30 Jul '18

As a part of a project, I write a collision detection system. It is in dire need of testing, but designing and writing tests for all possible pairs of types of colliding geometry would be a pretty big effort - not only I would have to calculate the fact of collision manually for 20-something pairs of types of colliding geometry, I would also have to do so multiple times for each pair, since each pair requires several test cases. So the idea is to use an existing collision detection library to generate (a lot of) test cases from random data. I've found two such libraries for Haskell - HODE and Bullet. The problem is, Bullet bindings aren't documented at all, and HODE (which isn't really documented either, but at least lists available functions) is extremely ugly with IO all over the place, and manual tracking of objects' lifetimes (at least that's what I infer from `create :: World -> IO Body` and `destroyBody :: Body -> IO ()`, because again - no documentation). So my question is: does anyone know a library I could use? I'll pretty much settle for whatever. -- Michail.

5 4

using Haskell more like scripting language
by Dennis Raddle 29 Jul '18

29 Jul '18

I'm actually working in Purescript, but the issue is pretty much the same as one would encounter in Haskell. My application (animation of math-related ideas) is changing constantly. It's research, and I don't know where I'll be with it next week, or even tomorrow. For instance, the kinds of "objects" I'm animating (numbers, equations) and the way they move and interact with each other is a research project, and I'm constantly ripping out parts of my application and scavenging them for variations on a theme. My objects need state. At this point I'm thinking of just putting the state into a map with strings as keys and some kind of sum type to represent each data item I might need. So if I want to represent that an object has a particular color and position and velocity, itemState = M.fromList [("color" , DataColor blue ) ,("position", DataPoint 500.0 100.0) ,("velocity", DataVector 50.0 45.0 ) ] Which starts to look more like a dynamically-typed scripting language. But it's not hard to work with. I can uses lenses/prisms to inspect and update state, and it's okay if my program crashes on encountering malformed state. What this lets me do is create new objects that mix and match parts of old objects, and copy and paste a lot of the code. Is there a better way to do this? Is there a compromise I can make that will allow the compiler to help me out more with finding errors at compile time? D

4 4

stack test hangs when using 1.7.1 but completes with 1.4.0
by Olaf Klinke 29 Jul '18

29 Jul '18

Dear cafe, I recently upgraded (with some trouble) to stack-1.7.1 from 1.4.0. I have an older project using lts-9.2 that builds just fine when using the new stack, but it hangs on `stack test`. The difference is shown below. I suspect it is something that needs to be upgraded alongside stack. Maybe Cabal? Upgrading stack was troublesome because of different index formats, which is why using the other stack causes the rebuilds of my extra-deps, I suppose. When using stack --verbosity debug I see messages of the form Error while decoding $HOME/.stack/indices/Hackage/01-index.cache ... (this might not be an error, when switching between stack versions) Any help welcome. Olaf $> /usr/bin/stack-1.7.1 test Populated index cache. $MYPACKAGE: unregistering (missing dependencies: glpk-hs) gasp-1.0.1.0: unregistering (old configure information not found) glpk-hs-0.5: unregistering (missing dependencies: gasp) gasp-1.0.1.0: configure gasp-1.0.1.0: build gasp-1.0.1.0: copy/register glpk-hs-0.5: configure glpk-hs-0.5: build glpk-hs-0.5: copy/register $MYPACKAGE: configure (lib + exe + test) Configuring $MYPACKAGE... $MYPACKAGE: build (lib + exe + test) Preprocessing library $MYPACKAGE... <<< some more output ... >>> Registering $MYPACKAGE... $MYPACKAGE: test (suite: $PACKAGENAME-test) <<< with --verbosity debug >>> [debug] Run process within $PACKAGEDIR/: $PACKAGEDIR/.stack-work/dist/x86_64-linux/Cabal-1.24.2.0/build/$PACKAGENAME-testStub/$PACKAGENAME-testStub @(src/Stack/Build/Execute.hs:1711:27) Progress 1/2: $MYPACKAGE <<< Hangs from here on, does not consume CPU cycles >>> $> /usr/bin/stack-1.4.0 test Populated index cache. $MYPACKAGE: unregistering (missing dependencies: glpk-hs) gasp-1.0.1.0: unregistering (old configure information not found) glpk-hs-0.5: unregistering (missing dependencies: gasp) gasp-1.0.1.0: configure gasp-1.0.1.0: build gasp-1.0.1.0: copy/register glpk-hs-0.5: configure glpk-hs-0.5: build glpk-hs-0.5: copy/register $MYPACKAGE: configure (lib + exe + test) Configuring $MYPACKAGE... $MYPACKAGE: build (lib + exe + test) Preprocessing library $MYPACKAGE... <<< some more output >>> Progress: 3/4+++ OK, passed 100 tests. <<< some more output >>> Completed 4 action(s).

2 1

Monad Reader pubs?
by Donald Sitompul 27 Jul '18

27 Jul '18

I’m looking for past publications of the Monad Reader, where are they now? Donald Sitompul

2 1

Re: [Haskell-cafe] Why does this result in a runtime loop instead of a type error or typechecker loop?
by Anthony Clayden 26 Jul '18

26 Jul '18

On Thurs, Jul 26, 2018 at 05:39:00, Emil Axelsson wrote: >> Den 2018-07-26 kl. 01:02, skrev Anthony Clayden: >> >>> * On Tue, Jul 24, 2018 at 5:52 AM,Ryan Reich wrote: *>*>> This seems like the canonical illustration of the dangers of * >>>* UndecidableInstances.* >> >>* No I don't buy that explanation. The worst UndecidableInstances can do * >>* is send the type checker into a loop.* > I used to have a counter-example to that claim: https://mail.haskell.org/pipermail/haskell-cafe/2010-January/072357.html > That example was causing looping dictionaries at run time on GHC 6.10. > But now, on GHC 8.2, the program terminates. 6.10 was rather a long time ago. The whole type inference/improvement engine has had several overhauls since 2010. To be clear: you can write looping programs without type classes at all -- such as mutually recursive functions. You can write looping programs with type classes -- by turning those functions into methods in classes. You can write looping programs with type classes that need `UndecidableInstances` -- by making those classes mutual superclasses or mutual constraints on instances. That doesn't mean the `UndecidableInstances` are to 'blame' for the looping. I would blame the functions/method calls for not reducing the problem. > But one wonders if there are other ways to create looping dictionaries? With `UndecidableInstances`, yes there's plenty. And I expect that'll make the typechecker loop at compile time. The O.P. here is not getting typechecker looping, so I think the explanation is to do with method calls -- for which we need to see what's going on in the imports. AntC

1 0

Integrate GHC-API with Cabal
by Félix Baylac 26 Jul '18

26 Jul '18

Dear cafe, I am currently working on a project [1] which aims to index the code published on Stackage in order to provide a "code example" database. Basically, for each library, I want to generate a real-world example corpus for each exported symbol. Before generating this database, I need to retrieve the exported symbol of a package. So far, I have been gathering the dependencies and integrating them in the GHC pkg database using an external stack call, I then parse the cabal file and load the exposed modules using the GHC API and gather the exported symbols*. It works pretty reliably on the simple packages, however, I end up with some missing dynamic flags for some more advanced packages (missing c includes, c libraries, ASM flags, etc.). I then started to parse and load these missing attributes to GHC until I stepped back for a moment and realized I was re-implementing cabal build. I then looked for a way to "hook" my GHC API code in cabal build. This would allow cabal to both handle the dependencies gathering as well as setting up the correct GHC dyn-flags. The only resource I found was [2]. It's really clever, however, looks a bit hacky to me. Is there a better way to perform this kind of "hook"? [1] https://git.alternativebit.fr/NinjaTrappeur/Exhs [2] http://blog.ezyang.com/2017/02/how-to-integrate-ghc-api-programs-with-cabal/ * I am aware of the hoogle index generated by haddock. However, this index is missing when the haddock documentation of a package cannot be generated.

4 4

Re: [Haskell-cafe] Why does this result in a runtime loop instead of a type error or typechecker loop?
by Anthony Clayden 26 Jul '18

26 Jul '18

On Tue, Jul 24, 2018 at 5:52 AM,Ryan Reich wrote: > This seems like the canonical illustration of the dangers of UndecidableInstances. No I don't buy that explanation. The worst UndecidableInstances can do is send the type checker into a loop. For mutually recursive functions to cause looping, you don't need classes at all: foo :: Bool -> () foo x = bar x bar :: () -> Bool bar x = foo x No typechecking will detect that loop. This `HasBool` example is just an obfuscated way to write that loop(?) There's some odd thigs in the OP: Why use OVERLAPPABLE? Neither of those instances need it. Or are there more instances in the imports? (There must at least be the definition for class `Has`.) If so, what are their constraints? And what are their implementations? Perhaps that's causing the looping? Will `runRIO` or `view` use one of those other instances? What does this mean: "I can compile an equivalent program; it loops on execution."? There doesn't need to be a `Bool` in the "environment": the `HasBool a` instance introduces `Bool` in its constraint. I suggest boiling this down to a stand-alone program not needing imports. Then tell the whole story. AntC On Mon, Jul 23, 2018 at 2:10 PM, Theodore Lief Gannon < tanuki at gmail.com <http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe>> wrote: >* λ. :set -XFlexibleContexts -XFlexibleInstances -XMultiParamTypeClasses *>* -XUndecidableInstances *>* λ. import RIO *>* λ. import Data.Has *>* λ. class HasBool a where boolL :: Lens' a Bool *>* λ. instance {-#OVERLAPPABLE#-} HasBool a => Has Bool a where hasLens = *>* boolL *>* λ. instance {-#OVERLAPPABLE#-} Has Bool a => HasBool a where boolL = *>* hasLens *>* λ. runRIO () $ view boolL *>* ^CInterrupted. *>>* The RIO environment () doesn't contain a Bool. I can see how the *>* typechecker might get lost in this, but I can compile an equivalent *>* program; it loops on execution. *>>* _______________________________________________ *>* Haskell-Cafe mailing list *>* To (un)subscribe, modify options or view archives go to: *>* http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe <http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe> *>* Only members subscribed via the mailman list are allowed to post. *>

2 1