- Haskell-Cafe - Haskell.org

A Haskell meetup in San Francisco today
by Dimitri DeFigueiredo 29 Oct '19

29 Oct '19

After a long wait, there's a haskell meetup in San Francisco today. https://www.meetup.com/Bay-Area-Haskell-Users-Group/events/265110367/ Exciting! :-) Dimitri -- 2E45 D376 A744 C671 5100 A261 210B 8461 0FB0 CA1F

1 0

ANN: reflex-basic-host-0.2.0.1, reflex-backend-socket-0.2.0.0
by Jack Kelly 29 Oct '19

29 Oct '19

I have just pushed two packages to hackage: 1. reflex-basic-host-0.2.0.1[1], a reflex host library for backend work, and 2. reflex-backend-socket-0.2.0.0[2] a reflex-flavoured wrapper around TCP sockets. The most important changes to reflex-basic-host are: * Hosts no longer needlessly fork a thread, meaning that it is safe to call native code which expects all library calls to come from a common thread; and * Each host runs in a separate Reflex timeline, which makes it possible to run multiple Reflex hosts in parallel. There is an example[3] on GitHub demonstrating two hosts passing messages to each other. I hope people find it useful. GitHub issues and PRs welcome[4, 5]. Best, -- Jack [1] https://hackage.haskell.org/package/reflex-basic-host-0.2.0.1 [2] https://hackage.haskell.org/package/reflex-backend-socket-0.2.0.0 [3] https://github.com/qfpl/reflex-basic-host/blob/master/example/Multithread.hs [4] https://github.com/qfpl/reflex-basic-host [5] https://github.com/qfpl/reflex-backend-socket

1 0

Functional Conference 2019 with Edward Kmett keynote | Bengaluru, 13-17 November
by John Sinclair 28 Oct '19

28 Oct '19

Hi haskell-cafe! If you're in India, you'll be interested in Functional Conference 2019. It's an opportunity to meet up with other functional programmers and Haskell users. You'll learn from Edward Kmett who is chairman of the Haskell Core Libraries Committee. He'll be delivering a keynote, a workshop and more. https://confng.in/Kmg8m-Tx Michael Snoyman from Israel will be giving an Applied Haskell workshop. https://confng.in/24haPWyw All up their are 15 sessions covering Haskell to broaden your horizons and deepen your knowledge. Functional Conf is the premiere event for Functional programmers in India. Our goal is to support the community with access to high quality speakers, who are innovating in this field. Learn more about the conference here: https://confng.in/wAQ41Z4q To get 10% off when you register, use the code: FnConf19Dis$ https://twitter.com/FnConf <https://llink.to/?u=https:%2F%2Ftwitter.com%2FFnConf&e=df52b49527f43fa29bda…> https://www.linkedin.com/showcase/functional-conf <https://llink.to/?u=https:%2F%2Fwww.linkedin.com%2Fshowcase%2Ffunctional-co…>

1 0

reading from a unix pipe and then from the user
by Aramís Concepción Durán 27 Oct '19

27 Oct '19

Hello, I'm trying to write a program that first reads input from a pipe and then reads keyboard input from the user (like fzf, the fuzzy finder). Under different circumstances I could open a handle to `/dev/tty` and use the `hGet...` functions from `System.IO` to get the user's keyboard input, but I'm constructing the text user interface with the brick library, which doesn't seem to give my any way to sneak in alternative handles through its application entry point functions. So, what I'm looking for is a function which takes an `IO ()` function like the usual `main` and a `Handle` and turns it into an `IO ()` function that reads from the provided handle instead of `stdin`. Does that make sense? I might be looking for something that doesn't exist. Or I'm lacking the language to get results from a search engine. To illustrate the problem further, here is a condensed brick application: import qualified Brick.Main as Main import qualified Brick.Types as Types import qualified Graphics.Vty as Vty import Brick.AttrMap ( attrMap ) import Brick.Widgets.Core ( str ) type Event = Types.EventM () ( Types.Next () ) main = let app = Main.App { Main.appChooseCursor = Main.neverShowCursor , Main.appHandleEvent = \ _ _ -> Main.halt () :: Event , Main.appStartEvent = pure , Main.appAttrMap = \ _ -> attrMap Vty.currentAttr [] , Main.appDraw = \ _ -> [ str Hit any key to exit. ] } in Main.defaultMain app () How do I get this `main` function to read from a custom handle intead of stdin?

3 4

Munich Haskell Meeting, 2019-10-29 @ 19:30
by Leah Neukirchen 27 Oct '19

27 Oct '19

Dear all, Next week, our monthly Munich Haskell Meeting will take place again on Tuesday, October 29 at Augustiner-Gaststätte Rumpler at 19h30. For details see here: http://muenchen.haskell.bayern/dates.html If you plan to join, please add yourself to this dudle so we can reserve enough seats! It is OK to add yourself to the dudle anonymously or pseudonymously. https://dudle.inf.tu-dresden.de/haskell-munich-oct-2019/ Everybody is welcome! cu, -- Leah Neukirchen <leah(a)vuxu.org> https://leahneukirchen.org/

1 0

2nd Call for Contributions: BOB 2020 [Feb 28, Deadline Nov 8]
by Stefan Wehr 24 Oct '19

24 Oct '19

BOB Conference 2020 "What happens when we use what's best for a change?" http://bobkonf.de/2020/cfc.html Berlin, February 28 Call for Contributions Deadline: November 8, 2019 You are actively engaged in advanced software engineering methods, implement ambitious architectures and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! NOTE: The conference fee will be waived for presenters. Travel expenses will not be covered (for exceptions see "Speaker Grants"). Speaker Grants -------------- BOB has Speaker Grants available to support speakers from groups under-represented in technology. We specifically seek women speakers and speakers who are not be able to attend the conference for financial reasons. Shepherding ----------- The program committee offers shepherding to all speakers. Shepherding provides speakers assistance with preparing their sessions, as well as a review of the talk slides. Topics ------ We are looking for talks about best-of-breed software technology, e.g.: - functional programming - persistent data structures and database - event-based modelling and architectures - types - formal methods for correctness and robustness - abstractions for concurrency and parallelism - metaprogramming - probabilistic programming - math and programming - controlled side effects - beyond REST and SOAP - effective abstractions for data analytics - ... everything really that isn’t mainstream, but you think should be. Presenters should provide the audience with information that is practically useful for software developers. We're especially interested in experience reports. Other topics are also relevant, e.g.: - introductory talks on technical background - overviews of a given field - demos and how-tos Requirements ------------- We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. Your proposal should include (in your presentation language of choice): - An abstract of max. 1500 characters. - A short bio/cv - Contact information (including at least email address) - A list of 3-5 concrete ideas of how your work can be applied in a developer's daily life - additional material (websites, blogs, slides, videos of past presentations, …) Submit here: https://bobcfc.active-group.de/en/bob2020/cfp Organisation ------------ - Direct questions to contact at bobkonf dot de - Proposal deadline: November 8, 2019 - Notification: November 22, 2019 - Program: December 6, 2019 Program Committee ----------------- (more information here: https://bobkonf.de/2020/programmkomitee.html) - Matthias Fischmann, Wire - Matthias Neubauer, SICK AG - Nicole Rauch, Softwareentwicklung und Entwicklungscoaching - Michael Sperber, Active Group - Stefan Wehr, factis research Scientific Advisory Board - Annette Bieniusa, TU Kaiserslautern - Torsten Grust, Uni Tübingen - Peter Thiemann, Uni Freiburg

1 0

postgresql-pure released
by 岡本和樹 24 Oct '19

24 Oct '19

Hello. I published a library “postgresql-pure”, which is a PostgreSQL driver written in pure Haskell, a few days ago. This library is developed to aim: - to increase the performance on multi CPU core environments - to run on multi platform - to build it easier especially on Windows to remove the dependency on libpq, which is made by C - there is postgres-wire which is a fast implementation but it doesn't support Windows I confirmed that: - the performance was proportional to the number of cores - the performance on 12 cores were 28% better than postgres-wire, 300% better than postgresql-simple Both test cases are simple constant value queries like “SELECT 2147483647 :: int4, …” to decrease server's load. I'm writing a report about this development and I will send email again. Please try this and feel free to report issues. Best, Kazuki Okamoto Hackage: http://hackage.haskell.org/package/postgresql-pure GitHub: https://github.com/iij-ii/postgresql-pure

1 0

[CC2020] Paper registration deadline *extended*. Last CFP for the ACM SIGPLAN 2020 International Conference on Compiler Construction
by Gabriel Rodríguez Álvarez 23 Oct '19

23 Oct '19

ACM SIGPLAN 2020 International Conference on Compiler Construction (CC'20) co-located with CGO, PPoPP and HPCA San Diego, CA, USA February 22 - 23, 2020 https://conf.researchr.org/home/CC-2020 The ACM SIGPLAN 2020 International Conference on Compiler Construction (CC 2020) is interested in work on processing programs in the most general sense: analyzing, transforming or executing input programs that describe how a system operates, including traditional compiler construction as a special case. Original contributions are solicited on the topics of interest which include, but are not limited to: - Compilation and interpretation techniques, including program representation, analysis, and transformation; code generation, optimization, and synthesis; the verification thereof - Run-time techniques, including memory management, virtual machines, and dynamic and just-in-time compilation - Programming tools, including refactoring editors, checkers, verifiers, compilers, debuggers, and profilers - Techniques for specific domains, such as secure, parallel, distributed, embedded or mobile environments - Design and implementation of novel language constructs, programming models, and domain-specific languages CC 2020 is the 29th edition of the conference. From this year onwards, CC is an ACM SIGPLAN conference and will implement guidelines and procedures recommended by SIGPLAN https://www.sigplan.org. ============================================================================================== To subscribe to the CC announce mailing list, see cc_conference_announce(a)googlegroups.com To subscribe to the CC announce Twitter account, see @cc2020conf (https://twitter.com/cc2020conf) ============================================================================================== IMPORTANT DATES Abstract Submission: 25 October 2019 ***** EXTENDED ***** Paper Submission : 30 October 2019 Rebuttal : 4-6 December 2019 Artifact Submission: 13 December 2019 Author Notification: 24 December 2019 Final papers due : 15 January 2020 Conference : 22–23 February 2020 All submissions must be made electronically through the conference web site and include an abstract (100–400 words), author contact information, the full list of authors and their affiliations. Full paper submissions must be in PDF formatted printable on both A4 and US letter size paper. All papers must be prepared in ACM Conference Format using the 2-column acmart format. Papers should contain a maximum of 10 pages of text (in a typeface no smaller than 10 point) or figures, NOT INCLUDING references. There is no page limit for references and they must include the name of all authors (not {et al.}). Appendices are not allowed, but the authors may submit supplementary material, such as proofs or source code; all supplementary material must be in PDF or ZIP format. Looking at supplementary material is at the discretion of the reviewers. Submission is double blind and authors will need to identify any potential conflicts of interest with PC, as defined here: http://www.sigplan.org/Resources/Policies/Review/ (ACM SIGPLAN policy). Authors are encouraged to submit their artifacts for the Artifact Evaluation (AE). The Artifact Evaluation process is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. To ease the organization of the AE committee, we kindly ask authors to submit their artifact at the latest 10 days after the rebuttal. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Additional information will be made available on the CC AE web page. Deadlines expire at midnight anywhere on earth. ORGANIZERS General Chair Louis-Noel Pouchet Colorado State University <pouchet AT colostate.edu> Program Chair Alexandra Jimborean Uppsala University <alexandra.jimborean AT it.uu.se> Artifact Evaluation Chairs Michel Steuwer University of Glasgow <Michel.Steuwer AT glasgow.ac.uk> Martin Kong University of Oklahoma Publicity Chair Gabriel Rodriguez University of A Coruna Web Chair Mihail Popov Uppsala University Steering Committee Bjorn Franke University of Edinburgh <bfranke AT inf.ed.ac.uk> Sebastian Hack Saarland University Manuel Hermenegildo IMDEA SW Institute and Technical U. of Madrid Peng Wu Huawei America Research Lab Ayal Zaks Intel and Technion, Israel Jingling Xue University of New South Wales, Australia Christophe Dubach University of Edinburgh Nelson J. Amaral University of Alberta Milind Kulkarni Purdue University Program Committee Apan Qasem AMD/Texas State University Bernhard Scholz University of Sydney Bettina Heim Microsoft Bilha Mendelson Optitura Brian Demsky UC Irvine Changhee Jung Purdue University Christian Schulte KTH EJ Park Los Alamos National Laboratory Delphine Demange Inria Dongyoon Lee Stony Brook University Fernando Magno Quintao Pereira UFMG Brazil Haowei Wu Google Manuel Hermenegildo IMDEA and T.U. Madrid Matin Hashemi Sharif University of Technology Michel Steuwer University of Glasgow Mila Dalla Preda University of Verona Nelson J. Amaral University of Alberta Philippe Clauss University of Strasbourg Pavlos Petoumenos University of Edinburgh Rumyana Neykova Brunel London Santosh Nagarakatte Rutgers University Sebastian Hack University of Saarland Tomofumi Yuki Inria Xu Liu College of William and Mary

1 0

Bristol Haskell Hackathon 2020
by Matthew Pickering 21 Oct '19

21 Oct '19

I have decided to organise an informal hackathon in Bristol at the start of next year. When 25th-26th January 2020 Where Merchant Venturers Building - University of Bristol Time 09:00 - 17:00 Anyone interested in Haskell is welcome to attend. Whether you are a beginner or an expert it would be great to meet you in Bristol. It is a no-frills hackathon, we’ll provide a room for hacking and wifi but expect little else! There will be no t-shirts, food, talks or other perks. The focus will be 100% on hacking and meeting other Haskell programmers. For further information about the event and how to register please refer to the dedicated page. https://mpickering.github.io/bristol2020.html Cheers, Matt

1 0

Re: [Haskell-cafe] Explicit approach to lazy effects For probability monad?
by Olaf Klinke 20 Oct '19

20 Oct '19

> It kind of seems like this can't work if >>= has type 'm a -> (a -> m b) > -> mb', assuming m a = (a,state). The second argument needs to have > type (m a -> m b) instead of (a -> m b), since the computation needs to > have access to the state produced by the first "m a" computation, in > order to (optionally) depend on the state thread for first computation. My earlier suggestion of using the pure reader monad is not useful for two reasons: (1) A single random number is shared among all sub-computations, which destroys statistical independence. (2) Multi-dimensional distributions arguably require more than a single floating point number to parametrize. Maybe the following two monads hint at a better way, although none of them exhibits the two desirable properties I suggested in my first reply. It seems that both exhibit the sequential nature that you want to avoid, if the underlying monad m is sequential (i.e. stateful). (a) The free monad over the reader functor. type Distribution a = Free ((->) Double) a = Pure a | Impure (r -> Free ((->) Double) a) This is a reader monad of functions (Double,Double,...,Double) -> a where the tuple length may be any finite number. -- @choose p@ chooses the first distribution with probability @p@. choose :: Double -> Distribution a -> Distribution a -> Distribution a choose p x y = Impure (\r -> if r <= p then x else y) -- Feed a random number generator into a distribution. -- You get to decide which monad that is. sample :: Monad m => m r -> Free ((->) r) a -> m a sample _ (Pure a) = pure a sample gen (Impure f) = (sample gen) =<< (fmap f gen) (b) A reader monad which passes copies of the random number generator around, not the generator state. Again, you get to choose which monad the random number generator lives in. type DistrT m a = ReaderT (m Double) m a ~ m Double -> m a -- 'chooseT' queries the random number generator once -- and then passes it down to either of the two choices. chooseT :: Monad m => Double -> DistrT m a -> DistrT m a -> DistrT m a chooseT p x y = ReaderT (\gen -> gen >>= (\r -> if r <= p then runReaderT x gen else runReaderT y gen)) sampleT = runReaderT :: DistrT m a -> m Double -> m a Apologies that I can not be any more helpful at the moment. But the topic really interests me, please do post any progress on haskell-cafe. Olaf

1 0