October 2018 - Haskell-Cafe

Re: [Haskell-cafe] property testing with context
by Olaf Klinke 24 Oct '18

24 Oct '18

Ben, the solution might be simple: Don't express the property as an atomic function (a -> Bool). This reminds me a bit of the Cutty-Howard correspondence, only that proofs are replaced by counterexamples. A testing library should have an operator for each of the logical connectives, where - a counterexample to True is never found - a counterexample to False is () - a counterexample to (not x) is an example for x - a counterexample to (x && y) is either a counterexample to x or a counterexample to y, whichever is found first - a counterexample to (x || y) is a pair of counterexamples to both x and y - a counterexample to (x ==> y) is an example for x together with a counterexample for y Then, if you build your property out of smaller properties and the connectives above, the counterexample-finder would be able to inform you which part of the property failed. I'm pretty sure at least one of the testing libraries has a system like this. Cheers, Olaf

2 1

ANN: Yampa-0.12 and yampa-test (QuickCheck-based FRP testing)
by Ivan Perez 22 Oct '18

22 Oct '18

Dear all, I am please to announce version 0.12 of Yampa! Yampa is a mature and robust FRP implementation that has been used to create mobile, desktop, and web games and applications, including commercial mobile games available on iTunes and Google Play, and open source games that use devices like wiimotes and kinect [1-2]. This version comes with an accompanying library, yampa-test, which includes QuickCheck-based testing with LTL-based signal predicates. These features are described in the ICFP 2017 paper "Testing and Debugging Functional Reactive Programming" [3]. Thanks to Christina Zeller for reporting bugs. Both libraries can be found here: http://hackage.haskell.org/package/Yampa http://hackage.haskell.org/package/yampa-test This version has been tested against all major GHC versions from 7.6 to 8.6. Some legacy code has been deprecated, which has triggered a major version bump (0.12). I would expect all projects that use Yampa to work by, at most, adapting the version constraints in the cabal files. New versions of Yampa will present a simpler API, better documentation and benchmarks [4]. As always, contributions are welcome. There are a number of issues on the github page that are particularly suitable for beginners [5]. Happy Haskelling! Ivan [1] https://github.com/ivanperez-keera/Yampa#other-examples [2] https://haskell.games [3] https://dl.acm.org/citation.cfm?id=3110246 [4] https://github.com/ivanperez-keera/Yampa/milestones [5] https://github.com/ivanperez-keera/Yampa/labels/help%20wanted

1 0

(Sample) bioinformatics applications
by Vasili I. Galchin 22 Oct '18

22 Oct '18

Hello, Do any of these beasts exist for reference? Regards, Vasily

1 0

Well typed OS
by Yotam Ohad 21 Oct '18

21 Oct '18

Hi, In the last couple of days, I've been toying with the thought of an operating system in which programs (or more accurately, any process) has a distinct type which limits its use of the machine. For example, `echo` (String -> String) won't be able to print an output without a second program which would handle changing stdout. I think it could "break down" the IO monad into other structures that are better at specifying what is changing: A file is read / memory written / etc. I do, however, not sure how to incorporate drivers (which handles IO and external devices) into this. Giving them an `IO a` type feels like cheating. I would be much cooler if there was a way to treat them like the `echo` function from earlier. What are your thoughts/suggestions? I'll be happy to hear them. Yotam

13 26

Why is the Cabal User's Guide left outdated?
by Yuji Yamamoto 20 Oct '18

20 Oct '18

Getting interested in the features since Cabal 2.2 (esp. common stanzas), I looked up with the User's Guide <https://www.haskell.org/cabal/users-guide/>, which is (and should be) listed in the search result first, but can't find because the User's Guide is still about Cabal 2.0. Why is it left outdated? Actually User's Guide (HEAD) <https://cabal.readthedocs.io/en/latest/> is kept updated, but it's hard to find, and can include some information too new to release. Thanks in advance. -- 山本悠滋 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

2 2

"Update
by Nikita Fufaev 19 Oct '18

19 Oct '18

-- Nikita Fufaev, +7 999 825-95-07

1 0

BOB - Call for Contributions 2019
by Matthias Fischmann 19 Oct '18

19 Oct '18

Subject: Call for Contributions: BOB 2019 - Berlin, Mar 22, 2019 BOB Conference 2019 "What happens when we use what's best for a change?" http://bobkonf.de/2019/en/cfc.html Berlin, March 22 Call for Contributions Deadline: November 23, 2018 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 databases - 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/bob2019/cfp Organisation ------------ - Direct questions to contact at bobkonf dot de - Proposal deadline: November 23, 2018 - Notification: December 7, 2018 - Program: December 21, 2018 Program Committee ----------------- (more information here: http://bobkonf.de/2019/en/programmkomitee.html) - Matthias Fischmann, zerobuzz UG - 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

Fwd: [Haskell] Help inform GHC's development priorities
by Takenobu Tani 19 Oct '18

19 Oct '18

(It is sending to the correct address of haskell-cafe ML.) ---------- Forwarded message --------- From: Ben Gamari <ben(a)well-typed.com> Date: Fri, Oct 19, 2018 at 4:45 AM Subject: [Haskell] Help inform GHC's development priorities To: GHC developers <ghc-devs(a)haskell.org>, <haskell(a)haskell.org>, Haskell Cafe <haskell-cafe(a)googlegroups.com>, GHC users < glasgow-haskell-users(a)haskell.org> tl;dr. Please a take a minute to express your thoughts on GHC's development priorities via this survey [1]. Hello everyone, The GHC developers want to ensure that we are working on problems that of most importance to you, the Haskell community. To this end we are surveying the community [1], asking how our users interact with GHC and which problems need to be addressed most urgently. We hope you will take a few minutes to give us your thoughts [1]. Thanks in advance for your time and, finally, thanks to the financial supporters that make our work GHC possible. Cheers, - Ben and the rest of the GHC developers [1] https://docs.google.com/forms/d/e/1FAIpQLSdh7sf2MqHoEmjt38r1cxCF-tV76OFCJqU… _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell

1 0

ANN: Extrapolate: generalized QuickCheck-style counterexamples.
by Rudy Matela 16 Oct '18

16 Oct '18

Hello Haskell-Café, A new version of Extrapolate is out: v0.3.5. Since the last announcement here improvements have been made in performance and stability. In addition, the IFL revised accepted paper is finally out (see end of the e-mail). For those who don't know Extrapolate, it is a property testing library capable of reporting generalized counterexamples to properties. Here is a simple example: $ ghci > import Test.Extrapolate > import Data.List (nub) > check $ \xs -> nub xs == (xs :: [Int]) *** Failed! Falsifiable (after 3 tests): [0,0] Generalization: x:x:_ Conditional Generalization: x:xs when elem x xs The above property not only fails for the list `[0,0]` but also for any list of the form `x:x:_`. This hints that the above property fails whenever the argument list has repeated elements. The above example is perhaps artificial: the property is obviously wrong! But it does illustrate what Extrapolate is able to produce: aside from the fully defined counterexample it reports a conjectured generalization with some parts of the counterexample replaced by variables or holes. Generalization is particularly helpful when dealing with bigger counterexamples. The following fully-defined counterexample to one of XMonad's properties StackSet { current = Screen { workspace = Workspace { tag = 0, layout = 0, stack = Just ( Stack { focus = 'a', up = "", down = "" } ) }, screen = 0, screenDetail = 0 }, visible = [], hidden = [], floating = fromList [] } is reported by Extrapolate alongside a much simpler generalization: StackSet (Screen (Workspace _ _ (Just _)) _ _) _ _ _ Full details for the above example are given in the research paper. Get Extrapolate with: $ cabal install extrapolate See the Haddock documentation and the project README for more details. I'm interested in input from the Haskell community about Extrapolate. Please let me know if it works (or not) for you. Links: * Research paper (link 1): https://matela.com.br/paper/extrapolate.pdf * Research paper (link 2): https://dl.acm.org/citation.cfm?id=3205371 * Hackage: https://hackage.haskell.org/package/extrapolate * GitHub: https://github.com/rudymatela/extrapolate Best Regards, Rudy

1 0

ANN: DBFunctor – Functional Data Management / ETL Data Processing in Haskell
by Nikos Karagiannidis 16 Oct '18

16 Oct '18

Dear all, I am pleased to announce the release on Hackage of a new Haskell ETL Library, namely DBFunctor-0.1.0.0. (“ETL” stands for Extract Transform and Load and is the standard technology for accomplishing data management tasks in Data Warehouses / Data Marts and in general for data migrations, or for preparing data for any analytic purpose (Ad hoc queries, data exploration/data analysis, Reporting and Business Intelligence, feeding Machine Learning algorithms, etc.)) Version 0.1.0.0 can be used for **in-memory** data processing without the need of some external database. It is just a Haskell library linked in your Haskell program that enables full SQL functionality over tabular data (e.g., CSV files) but also the ability to write a full ETL data processing flow. Key features of this release are: 1. ** Julius DSL ** : A Type-Level Embedded Domain Specific Language (EDSL) for ETL 2. Supports all known relational algebra operations 3. Implements the ETL Mapping and other typical ETL constructs and operations 4. Applicable to all kinds of tabular data 5. In-memory, database-less data processing For more information please check out the project homepage: https://github.com/nkarag/haskell-DBFunctor Also there is a tutorial that can help you to easily get started with Julius DSL: https://github.com/nkarag/haskell-DBFunctor/blob/master/doc/JULIUS-TUTORIAL… * Learn how to implement your ETL flows with Julius DSL * Learn how to implement common ETL operations (e.g., append a delta to some target table, or create a surrogate key column etc.) * Build your own aggregate or analytic functions (e.g., string_agg, or a montlhy running total) * Express complex queries with Julius (equivalent to the WITH-clause in SQL) * and many more ... For any issues/problems with the DBFunctor package please open an issue on github. Happy data processing! Thank you. Best Regards, Nikos

1 0