- Haskell-Cafe - Haskell.org

intero-neovim: Bring the joy of Intero to your Neovim!
by Matt 18 Jul '17

18 Jul '17

Hi everyone, I would like to invite you to try out my intero-neovim[1] plugin for giving Neovim IDE-like features. It's a port of the excellent intero plugin for emacs, and does many of the same things: type at point, go to definition, loading specific stack targets, etc. It has recently been significantly refactored and a ton of bugs have been fixed thanks to contributions by Reuben D'Netto and Jake Zimmerman. It's been working great for me on my work projects (stack-based with about a dozen packages) as well as one-off files and smaller projects. I would appreciate any and all feedback on features or bugs :D https://github.com/parsonsmatt/intero-neovim Thanks, Matt Parsons

1 0

Haskell IDE Engine progress report for July 2017
by Alan & Kim Zimmerman 17 Jul '17

17 Jul '17

This report is also available online at [1] Haskell IDE Engine progress report for July 2017. <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…>What is Haskell IDE Engine? Not an IDE. It is a common point for people in the Haskell community to pool their efforts with respect to tooling. For tool writers, provide tools as a HIE plugin, so it can be available on supported IDEs For IDE developers, integrate to HIE, and all the Haskell tools supported as plugins become available For users, it means the overall Haskell experience should improve. Currently, we are targeting the Language Server Protocol as the channel via which we talk to IDEs and editors. This would allow much broader IDE support. <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…>Important developments Zubin Duggal started work on a Summer of Haskell project to improve the LSP support in HIE and implement more of the protocol. Large portions of the HIE codebase have been refactored and rearchitectured with LSP support in mind. Plugins for brittany and hoogle have been implemented. A new plugin request and dispatcher system has been implemented, along with a new architecture for the loading and caching of TypecheckedModules from source, which are used to drive many queries and features like type information, document symbols, document highlights and go to definition. Technical details regarding these changes are described in Architecture <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Architecture…> . As of July 2017, HIE supports a large portion of the LSP. For the complete feature list, check the README <https://github.com/haskell/haskell-ide-engine/blob/master/README.md>. <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…>Current project focus HIE (with vscode support via a plugin) is ready for an alpha release. Currently, the focus is on bug fixing and hooking up already existing features in HIE to LSP, like Hoogle queries and HaRe refactorings, and also providing additional features via LSP Code Actions and Code Lenses If you have experience writing Typescript or developing Visual Studio Code extensions, your help is needed to improve the vscode hie extension. <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…>Contributors active in June and July Alan Zimmerman, Zubin Duggal, Lennart Spitzner <https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…> Contributing Haskell IDE Engine needs volunteers like any other open source project. For more information see: https://github.com/haskell/haskell-ide-engine Also drop by our IRC channel: #haskell-ide-engine at irc.freenode.net. Thanks! Zubin and Alan [1] https://github.com/haskell/haskell-ide-engine/blob/master/docs/Report-2017-…

1 0

Wrapping Turtle ls function to work with 0 or 1 arguments (polyvariadic)
by Cody Goodman 17 Jul '17

17 Jul '17

I'm trying to get ls to work in ghci like it does in bash using variadiac arguments in Haskell. I'm stuck at the moment so I thought I'd send this to #haskell-cafe for some help. I'm not quite sure how to proceed. See the main function for what I want the end result to look like. Here is the code: {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE OverloadedStrings #-} -- | An example module. module Example (main) where import qualified Turtle as Turtle import Control.Foldl import Control.Monad.IO.Class lsDirEx :: MonadIO io => io [Turtle.FilePath] lsDirEx = do Turtle.fold (Turtle.ls "/home") list class PrintAllType t where -- use PrintAllType from https://rosettacode.org/wiki/Variadic_function#Haskell process :: [Turtle.FilePath] -> t -- instance MonadIO io => PrintAllType (io [Turtle.FilePath]) where instance PrintAllType (IO [Turtle.FilePath]) where process [] = do -- ls received no args print current directory Turtle.pwd >>= \fp -> Turtle.fold (Turtle.ls fp) list process (filePath:[]) = do -- ls recieved one filePath liftIO $ Turtle.fold (Turtle.ls filePath) list process _ = error "multiple arguments not currently supported" -- instance (Show a, PrintAllType r) => PrintAllType (a -> r) where -- process args = \a -> process (args ++ [fmt a]) -- where fmt thing = _ $ Turtle.format Turtle.w thing ls :: (PrintAllType t) => t ls = process [] -- | An example function. main :: IO () main = do ls -- lists current directory ls ("/home" :: String) -- lists /home directory Thanks, Cody

3 2

Re: [Haskell-cafe] parallelism and state
by dominic＠steinitz.org 16 Jul '17

16 Jul '17

Excellent news! How did you test it? One way would be to make it callable by C and then use testu01 but perhaps you have already done this or similar? See here for a bit more detail: https://idontgetoutmuch.wordpress.com/2017/01/14/calling-haskell-from-c/ <https://idontgetoutmuch.wordpress.com/2017/01/14/calling-haskell-from-c/>. Testing the split function might need thinking about though. > I recently made a SplitMix implentation: > http://hackage.haskell.org/package/splitmix <http://hackage.haskell.org/package/splitmix> > > When generating `Word64`s it's noticeable faster than `tf-random` (and > `mwc-random` and obviously `random). I didn't benchmark `Double` > generation, as `tf-random` own `Random` class doesn't support it [1], > and using `random`'s class would be very unfair. > > I haven't announced it (well, mentioned on Twitter), but please give it > a try! > > - Oleg Dominic Steinitz dominic(a)steinitz.org http://idontgetoutmuch.wordpress.com

1 0

Feedback on use of State monad
by Atrudyjane 15 Jul '17

15 Jul '17

Hello Everyone, In the HPFFP book, there's a homework problem where you're supposed to refactor a recursive function that rolls dice to return the number of rolls it takes to reach or exceed an input sum and the list of die that occurred. As practice, decided to take the solution and implement it using the State monad: -- Refactor rollsCountLoggged to use State -- limit sum count StdGen [Die] type RollsState = (Int, Int, Int, StdGen, [Die]) -- count [Die] type RollsValue = (Int, [Die]) runRolls :: State RollsState RollsValue runRolls = do (l, s, c, sg, xs) <- get if (s >= l) then return (c, reverse xs) else do let (d, ng) = randomR (1, 6) sg put (l, s + d, c + 1, ng, intToDie d : xs) runRolls rollsCountState :: Int -> IO () rollsCountState n = print $ evalState (runRolls) (n, 0, 0, mkStdGen 0, []) I'm wondering if that 'do' block under the else is a not so great stylistic choice. If the 'let' and 'put' is moved above the 'if', then that's just an unnecessary call at the end. Or is it just the nature of running inside a monad? Thank You, Andrea Sent with [ProtonMail](https://protonmail.com) Secure Email.

2 2

Safely reading RemoteRefs?
by amindfv＠gmail.com 15 Jul '17

15 Jul '17

I notice I'm able to retrieve haskell variables after a :r in ghci: :m + Data.Binary :m + GHCi.RemoteTypes > encodeFile "/tmp/foo" =<< mkRemoteRef "hello!" (:reload) > putStrLn =<< localRef =<< decodeFile "/tmp/foo" "hello!" Is this safe? It works correctly in the common case but are there things I need to be careful of? In the string case it's not too interesting but it would be great to e.g. retrieve the pid of a running process. Tom

1 0

parallelism and state
by Dennis Raddle 15 Jul '17

15 Jul '17

I'm trying to parallelize a Monte Carlo backtracking search algorithm. The trick is that my algorithm is expressed in a State monad, because I need to hold a StdGen as well as keep several records of computations and metrics. So I know that if I'm going to run a State computation in several parallel lines of execution, I need to conceive of a way to split the state and later recombine it. Here is a simple example I came up with. I have no idea if I'm doing this in a good way, so any comments are welcome. http://lpaste.net/356879 D

3 2

2nd CfP: IFL 2017 (29th Symposium on Implementation and Application of Functional Languages)
by publicityifl＠gmail.com 14 Jul '17

14 Jul '17

<div dir="ltr">Hello, Please, find below the second call for papers for IFL 2017. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage Publicity Chair of IFL --- IFL 2017 - CALL FOR PAPERS ========================== 29th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES ======================================================================== University of Bristol, UK In cooperation with ACM SIGPLAN Wednesday 30 August - Friday 1 September, 2017 <a href="http://iflconference.org/" target="_blank">http://iflconference.org/</a> Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2017 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Peer-review ----------- Following the IFL tradition, IFL 2017 will use a post-symposium review process to produce the formal proceedings. All participants of IFL 2017 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: <a href="http://www.sigplan.org/Resources/Policies/Republication" target="_blank">http://www.sigplan.org/Resources/Policies/Republication</a> The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. Hence, publications that appear only in the draft proceedings are not subject to the ACM SIGPLAN republication policy. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. The formal proceedings will appear in the International Conference Proceedings Series of the ACM Digital Library. Important dates --------------- Mon 31 July 2017 : Submission deadline draft papers Wed 2 August 2017 : Notification of acceptance for presentation Fri 4 August 2017 : Early registration deadline Fri 11 August 2017 : Late registration deadline Mon 21 August 2017 : Submission deadline for pre-symposium proceedings Wed 30 August 2017 - Fri 1 September 2017 : IFL Symposium Mon 4 December 2017 : Submission deadline for post-symposium proceedings Wed 31 January 2018 : Notification of acceptance for post-symposium proceedings Mon 12 March 2018 : Camera-ready version for post-symposium proceedings Submission details ------------------ Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English. Papers must use the new ACM two columns conference format, which can be found at: <a href="http://www.acm.org/publications/proceedings-template" target="_blank">http://www.acm.org/publications/proceedings-template</a> For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages. For the post-symposium proceedings the page limit of 12 pages is firm. Authors submit through EasyChair: <a href="https://easychair.org/conferences/?conf=ifl2017" target="_blank">https://easychair.org/conferences/?conf=ifl2017</a> Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools in the context of functional programming. If you are not sure whether your work is appropriate for IFL 2017, please contact the PC chair at <a href="mailto:nicolas.wu@bristol.ac.uk" target="_blank">nicolas.wu(a)bristol.ac.uk</a>. Topics of interest include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialization - run-time code generation - partial evaluation - (abstract) interpretation - metaprogramming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques - (industrial) applications Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Chair: Nicolas Wu, University of Bristol, UK - Kenichi Asai, Ochanomizu University, Japan - Sandrine Blazy, University of Rennes 1, France - Carlos Camarao, Universidade Federal de Minas Gerais, Brazil - Stephen Dolan, University of Cambridge, UK - Jurriaan Hage, Utrecht University, Netherlands - Yukiyoshi Kameyama, University of Tsukuba, Japan - Benjamin Lerner, Brown University, USA - Bas Lijnse, Radboud University, Netherlands - Garrett Morris, University of Kansas, USA - Miguel Pagano, Universidad Nacional de C√≥rdoba, Argentina - Tomas Petricek, Alan Turing Institute, UK - Maciej Pir√≥g, University of Wroclaw, Poland - Exequiel Rivas, Universidad Nacional de Rosario, Argentina - Neil Sculthorpe, Nottingham Trent University, UK - Melinda Toth, Eotvos Lorand University, Hungary - Phil Trinder, Glasgow University, UK - Kanae Tsushima, National Institute of Informatics, Japan - Marcos Viera, Universidad de la Republica, Uruguay - Meng Wang, University of Kent, UK Venue ----- The IFL 2017 will be held in association with the Department of Computer Science, University of Bristol, UK. Bristol is located in South West England, and can be easily reached from Bristol Airport. See the website for more information on the venue.</div>  <a style='display: block; margin: 32px 0 40px 0; padding: 10px; font-size: 1em; text-align: center; border: 0; border-top: 1px solid gray; ' href='https://goo.gl/2ksdRv'>powered by GSM. Free mail merge and email marketing software for Gmail.</a>

1 0

Unicode silliness
by David Turner 13 Jul '17

13 Jul '17

Hi, One of my colleagues asked about using Unicode symbols in Haskell operators and I initially thought that this was supported. However, the code at the bottom of this message doesn't parse, reporting a lexical error on basically all of the funny characters of the form: Main.hs:1:5: error: lexical error at character '\65288' Character 65288 (0xff08) is punctuation [Ps] which I understand to mean it counts as a uniSymbol in the lexical structure described in the Haskell Report. https://www.haskell.org/onlinereport/haskell2010/haskellch2.html#x7-160002.2 Should this work? Not that I really want this specific example to work, but I'm interested to know why. Many thanks, David $ cat app/Main.hs foo （›’-’）› bar = False foo ‹（’-’‹） bar = False foo ∧（’-’）∧ bar = False foo ∨（’-’）∨ bar = False $ cat app/Main.hs | base64 # try and avoid mangling in email Zm9vIO+8iOKAuuKAmS3igJnvvInigLogYmFyID0gRmFsc2UKZm9vIOKAue+8iOKAmS3igJnigLnv vIkgYmFyID0gRmFsc2UKZm9vIOKIp++8iOKAmS3igJnvvIniiKcgYmFyID0gRmFsc2UKZm9vIOKI qO+8iOKAmS3igJnvvIniiKggYmFyID0gRmFsc2UK

3 6

Issue 63 :: Haskell Weekly
by Taylor Fausak 13 Jul '17

13 Jul '17

\ Haskell Weekly \/\/ Issue 63 <https://haskellweekly.news/issues/63.html> Welcome to another issue of Haskell Weekly! Haskell is a purely functional programming language that focuses on robustness, concision, and correctness. This is a weekly summary of what's going on in its community. ## Featured ## - GHC 8.2.1 release candidate 3 available <https://mail.haskell.org/pipermail/ghc-devs/2017-July/014364.html> > This release candidate fixes a number of regressions from 8.0.2 found in release candidate 2, as well as a major correctness bug present in several previous GHC major releases. Users taking advantage of parallelism in their programs will be strongly encouraged to upgrade to 8.2.1 once it is released. Editor's note: Use this stack.yaml to test GHC 8.2.1-rc3 with Stack. <https://gist.github.com/tfausak/623d283cfe7a338bcbfca56ddfec0ecd/cc31f36373…> - Stack's new extensible snapshots <https://www.fpcomplete.com/blog/2017/07/stacks-new-extensible-snapshots> > There is a collection of features in Stack that have been added in bit by bit, as opposed to being designed into a cohesive whole from the start. The features work, but could be a bit better. We've known for a while that, instead of putting in place strategic fixes, a more general refactoring of the core dependency management logic was in order. - ZuriHac 2017 <https://www.youtube.com/playlist?list=PLOvRW_utVPVkoZ5GuodkejFU8MiH6_SB7> Videos of the Haskell keynotes from ZuriHac, the Zurich Haskell hackathon. Includes presentations from Edward Kmett, Stephen Diehl, Simon Thompson, Neil Mitchell, and Julie Moronuki. - Front Row is hiring a senior backend Haskell engineer <https://frontrow.workable.com/j/463B843754> > Come change how 6.5+ million K-12 US students learn Math, Language Arts, Social Studies and more. Use data, advanced type systems, great product design and deep pedagogy to change lives. - Iterators and streams in Rust and Haskell <https://www.fpcomplete.com/blog/2017/07/iterators-streams-rust-haskell> > Real streaming data is handled at the library level in Haskell, with many different options available. Rust does things differently: it bakes in a concept called iterators not only with the standard library, but the language itself: `for` loops are built-in syntax for iterators. - Introducing Vaultenv: Keeping your secrets secure with Vault and Haskell <https://tech.channable.com/posts/2017-07-06-introducing-vaultenv-keeping-yo…> > We're pleased to announce our first bit of open source code. It is a CLI utility that fetches secrets from the HashiCorp Vault secret store. It makes secrets available using environment variables to a process of your choosing. - Danger and HLint <http://allocinit.io/haskell/danger-and-hlint/> > Danger is a Ruby gem that you can use on your continuous integration process to automate code reviews. Danger can automatically go through the code in a an open pull request and check if it respects the rules your team and you have established. - Reader monad part 2 <https://medium.com/@jonathangfischoff/monad-reader-part-2-d812dda1d03e> > In part 1 I went over the basics of the reader monad. In this post I'll cover some more advanced topics and alternatives to the reader monad. - Encoding objects <https://www.schoolofhaskell.com/user/fumieval/encoding-objects> > Objects can be thought of as Mealy machines of effects, and their Haskell encoding is actually straightforward. This novel building block might be too strong to use everyday, but I'm pretty sure there are places where this abstraction fits well, like game programming. - Playing match maker <https://mmhaskell.com/blog/2017/7/10/playing-match-maker> > So at this point, are we condemned to choose between a fast inaccurate algorithm and a correct but slow one? In this case the answer is no! This problem is actually best solved by using a graph algorithm! ## Package of the week ## This week's package of the week is Solga, a library for easily specifying web APIs and implementing them in a type-safe way. <https://www.stackage.org/lts-8.22/package/solga-0.1.0.2> ## Call for participation ## Are you interested in contributing to open-source Haskell projects but not sure where to start? Here are some tasks from the Haskell community for you to pick and get started! - aeson: Hindent? <https://github.com/bos/aeson/issues/527> - cabal: Print out more information about the effective configuration when you build <https://github.com/haskell/cabal/issues/3945> - esqueleto: Make examples for the README buildable <https://github.com/bitemyapp/esqueleto/issues/4> - miso: phantomjs2 fails to build on OSX <https://github.com/dmjio/miso/issues/160> - servant: BasicAuthentication has no documentation for client-side use <https://github.com/haskell-servant/servant/issues/752> - stack: `stack new` can't be pointed at an intranet site <https://github.com/commercialhaskell/stack/issues/2804> - text: Add tshow function <https://github.com/bos/text/issues/183> Email <info(a)haskellweekly.news> with your beginner-friendly issues to get them included. ## In brief ## - A tale of two provers: Verifying monoidal string matching in Liquid Haskell and Coq <https://nikivazou.github.io/static/Haskell17/a-tale.pdf> - Named extensible effects <https://www.schoolofhaskell.com/user/fumieval/extensible/named-extensible-e…> - Profunctor optics: Modular data accessors <https://arxiv.org/abs/1703.10857> - Profunctor optics: The categorical view <https://bartoszmilewski.com/2017/07/07/profunctor-optics-the-categorical-vi…> - PureScript 0.11.6 <https://github.com/purescript/purescript/releases/tag/v0.11.6>

1 0