- Haskell-Cafe - Haskell.org

WST 2020 - 2nd Call for Papers
by Samir Genaim 05 Mar '20

05 Mar '20

========================================================================== WST 2020 - Call for Papers 17th International Workshop on Termination http://costa.fdi.ucm.es/wst2020 June 29-30, 2020, Paris, France co-located with IJCAR and FSCD 2020. ========================================================================== The Workshop on Termination (WST) traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications. The workshop is part of "Paris Nord Summer of LoVe 2020", a joint event on LOgic and VErification at Université Paris 13, made of Petri Nets 2020, IJCAR 2020, FSCD 2020, and over 20 satellite events. https://lipn.univ-paris13.fr/summer-of-love-2020/ IMPORTANT DATES: * submission deadline: April 12, 2020 * notification: May 10, 2020 * final version due: May 31, 2020 * workshop: June 29-30, 2020 TOPICS: The 17th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): * abstraction methods in termination analysis * certification of termination and complexity proofs * challenging termination problems * comparison and classification of termination methods * complexity analysis in any domain * implementation of termination methods * non-termination analysis and loop detection * normalization and infinitary normalization * operational termination of logic-based systems * ordinal notation and subrecursive hierarchies * SAT, SMT, and constraint solving for (non-)termination analysis * scalability and modularity of termination methods * termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.) * well-founded relations and well-quasi-orders COMPETITION: Since 2003, the catalytic effect of WST to stimulate new research on termination has been enhanced by the celebration of the Termination Competition and its continuously developing problem databases containing thousands of programs as challenges for termination analysis in different categories, see http://termination-portal.org/wiki/Termination_Competition In 2020, the Termination Competition will run shortly before WST and the main venues (IJCAR-FSCD), and the results will be presented at IJCAR or FSCD. PROGRAM COMMITTEE: Martin Avanzini - INRIA Sophia, Antipolis Florian Frohn - Max-Planck-Institut für Informatik, Saarbrücken Carsten Fuhs - Birkbeck, U. of London Samir Genaim (chair) - U. Complutense de Madrid Jürgen Giesl - RWTH Aachen Matthias Heizmann - U. of Freiburg Cynthia Kop - Radboud U. Nijmegen Salvador Lucas - U. Politècnica de València Étienne Payet - U. de La Réunion Albert Rubio - U. Complutense de Madrid René Thiemann - U. of Innsbruck Johannes Waldmann - HTWK Leipzig INVITED SPEAKERS: tba SUBMISSION: Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page: https://easychair.org/conferences/?conf=wst2020 Please, use LaTeX and the LIPIcs style file http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz to prepare your submission.

1 0

LF: senior Haskeller to be GSoC mentor
by Jason Chau 04 Mar '20

04 Mar '20

Hi, I am looking for a someone who has a lot of Haskell, OS, networking, and databases experience and knowledge to be a mentor for Google Summer of Code. I need advise on best practises. The project URL is https://github.com/jasonsychau/graphql-w-persistent. Jason Sent from my iPhone

1 0

lib for drawing with mouse
by mechvel＠scico.botik.ru 04 Mar '20

04 Mar '20

Please, does there exist a tool (library) in Haskell that supports doing the following with graphics? (1) To draw a curve by mouse on a screen and save this picture in a file (many different curves to be input this way). (2) To save in data.txt the coordinates of the points of this curve, say, 800 pairs of numbers (floating point or rational ...). (3) Reversely: to draw a curve on a screen by inputting from such data.txt. The main is (1)&(2). Because currently I set a curve by putting many times the '*' character and `space' to a text file, and this takes long. Thanks, ------ Sergei

5 8

ANN: hledger 1.16
by Simon Michael 02 Mar '20

02 Mar '20

I'm pleased to announce hledger 1.17 ! hledger is a robust, cross-platform, plain text accounting tool, with command-line, terminal and web UIs. It is a modern and largely compatible reimplementation of Ledger CLI with many improvements. You can use it to track time, money, investents, cryptocurrencies, inventory and more. See: http://hledger.org http://plaintextaccounting.org hledger 1.17 is released on schedule on 2020-03-01. Thanks to release contributors Aleksandar Dimitrov, Brian Wignall, Stephen Morgan, Jacek Generowicz, Gaith Hallak, Eric Mertens, Jakob Schöttl, Carl Richard Theodor Schneider, David Zhang, Amarandus, Evilham, Mateus Furquim, and Rui Chen. HIGHLIGHTS: CSV single-field matching, easier SSV/TSV conversion, fixed/enhanced close command, undo in add command, more JSON output, org headline support in timedot format, GHC 8.10 support. See all changes at https://hledger.org/release-notes . GETTING STARTED: Many install methods are described at http://hledger.org/download. Here are three ways to build from source: stack update; stack install --resolver=lts hledger-lib-1.17 hledger-1.17 hledger-ui-1.17 hledger-web-1.17 --silent or: cabal v2-update; cabal v2-install hledger-1.17 hledger-web-1.17 hledger-ui-1.17 or: curl -sO https://raw.githubusercontent.com/simonmichael/hledger/master/hledger-insta… less hledger-install.sh bash hledger-install.sh While building, peruse https://hledger.org/start For help, see http://hledger.org#help-feedback and join us on Freenode (#hledger, http://irc.hledger.org) or via Matrix (#freenode_#hledger:matrix.org, http://riot.hledger.org) New and old users, contributors, sponsors, and all feedback are most welcome! Best, -Simon

1 1

Re: [Haskell-cafe] [ANNOUNCE] GHC 8.8.3 is now available
by Ben Gamari 29 Feb '20

29 Feb '20

Ben Gamari <ben(a)well-typed.com> writes: > --text follows this line-- > <#part sign=pgpmime> > > Hello everyone, > > The GHC team is proud to announce the release of GHC 8.8.3. The source > distribution, binary distributions, and documentation are available at > > https://downloads.haskell.org/~ghc/8.8.3 > > Release notes are also available [1]. > Unfortunately there has been a slight mix-up in the binary distributions associated with this release and I will need to do a re-spin. I have pulled down the binary distributions for the time being. They should be back in a few hours. Many apologies for the confusion! Cheers, - Ben

2 2

How to deal with HTML input select option on a form using in a scotty and Text.Blaze.Html5
by Tebogo Sikwane 27 Feb '20

27 Feb '20

I am using scotty and Text.Blaze.Html5 Text.Digestive Text.Digestive.Blaze.Html5 What I want to achieve is a list of options as shown below. I have a Option sum type and will like to restrict the user to those options. data Options = Option1 | Option2 | Option3 | Option4 deriving Show Below is the Register record typeY data Register = Register { regName::Text , regOption::Options } deriving (Show,Eq) My problem is with Text.Digestive.choice. I don't know how to use it with Text.Digestive.Blaze.Html5 and will appreciate your help on the correct way to achieve this. I have tried to use the code below but battle to get it right. registerForm :: Monad m => Form Text m Register registerForm = Register <$> "name" .: text Nothing <*> "options" .: choice options Nothing where options= [(Option1,"Option1"),(Option2,"Option2"), (Option3, "Option3"),Option4,"Option4"] registerView:: View H.Html -> H.Html registerView view = do label "name" view "Name: " inputText "name" view H.br label "options" view "Options: " inputSelect "options" view H.br I get the following error when I compile my code: /root/work/src/Adapter/HTTP/Web/Auth.hs:107:29: error: • Couldn't match type ‘Text’ with ‘Char’ arising from the literal ‘"Option1"’ • In the first argument of ‘pack’, namely ‘"Option1"’ In the expression: pack "Option1" In the expression: (Option1, pack "Option1") | 107 | options= [(Option1,pack "Option1"),(Option2,pack "Option2"),(Option3,pack "Option3"),(Option4,pack "Option4")] Your help will be highly appreciated.

1 0

GHC profiling overhead
by Kolář Dušan 26 Feb '20

26 Feb '20

Dear Café, I'm quite curious about overhead of the profiler... I've compiled my program with --make -threaded -rtsopts -O2 -prof options. It was started with +RTS -N5 -p Usually, the program evaluates like 6-7 hours of real time. What is the overhead of the profiling? After 8 hours of working, the program has not finished yet. I've looked over the Internet and it seems like the overhead may be 25 times slowdown and even worse. Is it true? If yes, it's not worth waiting then :-) Best regards, Dusan

3 2

[ANNOUNCE] GHC 8.8.2 is now available
by Ben Gamari 25 Feb '20

25 Feb '20

Hello everyone, The GHC team is proud to announce the release of GHC 8.8.2. The source distribution, binary distributions, and documentation are available at https://downloads.haskell.org/~ghc/8.8.2 Release notes are also available [1]. This release fixes a handful of issues affecting 8.8.1: - A bug (#17088) in the compacting garbage collector resulting in segmentations faults under specific circumstances. Note that this may affect user programs even if they did not explicitly request the compacting GC (using the -c RTS flag) since GHC may fallback to compacting collection during times of high memory pressure. - A code generation bug (#17334) resulting in GHC panics has been fixed. - A bug in the `process` library causing builds using `hsc2hs` to fail non-deterministically on Windows has been fixed (Trac #17480) - A typechecker bug (#12088) resulting in programs being unexpectedly rejected has been fixed. - A bug in the implementation of compact normal forms resulting in segmentation faults in some uses (#17044) has been fixed. - A bug causing GHC to incorrectly complain about incompatible LLVM versions when using LLVM 7.0.1 has been fixed (#16990). As always, if anything looks amiss do let us know. Happy compiling! Cheers, - Ben [1] https://downloads.haskell.org/ghc/8.8.2/docs/html/users_guide/8.8.2-notes.h…

2 3

Lecturer, Senior Lecturer or Associate Professor in Programming Languages: University of Bristol
by Steven Ramsay 23 Feb '20

23 Feb '20

The University of Bristol are seeking to appoint an assistant/associate professor in Programming Languages, those with expertise in functional programming especially welcome! (Postdoc and funded PhD positions also available). Position: Lecturer, Senior Lecturer or Associate Professor in Programming Languages Location: University of Bristol, UK Type: Full time, open-ended contract Salary: £38,017 -- £59,135 per annum Applications deadline: March 11 Website: http://www.bristol.ac.uk/jobs/find/details.html?nPostingId=65334&nPostingTa… The Department of Computer Science at the University of Bristol is seeking to appoint a full-time faculty member in Programming Languages at Lecturer, Senior Lecturer or Associate Professor level; comparable to Assistant / Associate Professorship. You will be expected to both deliver outstanding teaching and undertake internationally leading research in the area of Programming Languages. There is opportunity to play a significant role in shaping and leading a new Programming Languages research group. The Department of Computer Science is an international centre of excellence in the foundations and applications of computing, ranked 4th in the UK for research intensity by the 2014 REF. The Department is already home to expertise in functional programming, program analysis, algorithms and complexity; it benefits from a close association with neighbouring groups in Cryptography and Trustworthy Systems. The University of Bristol is a leading institution among the UK's Russell Group Universities and is regularly placed among the top-ranking institutions in global league tables. Bristol is a friendly, green, coastal city with a rich and lively cultural scene and has consistently been voted one of the best places to live in the UK. This post is being offered on a full-time, open-ended contract. A recruitment supplement scheme is available up to £5K. For informal discussion about the post you are welcome to contact: Seth Bullock (Head of Department, mailto:seth.bullock@bristol.ac.uk) or Steven Ramsay (Lecturer in Programming Languages, mailto:steven.ramsay@bristol.ac.uk). The closing date for all applications is 23:59 on Wednesday 11 March 2020. Interviews are expected to take place shortly after the closing date.

1 0

A static analyzer
by Eirik Ravnskog 23 Feb '20

23 Feb '20

3 2