- Haskell-Cafe - Haskell.org

Final call for papers: Trends in Functional Programming, 19-21 june 2017, University of Kent, Canterbury
by Peter Achten 01 May '17

01 May '17

----------------------------- F I N A L C A L L F O R P A P E R S ----------------------------- ======== TFP 2017 =========== 18th Symposium on Trends in Functional Programming 19-21 June, 2017 University of Kent, Canterbury https://www.cs.kent.ac.uk/events/tfp17/index.html The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. TFP 2017 will be the main event of a pair of functional programming events. TFP 2017 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on 22 June. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * Soesterberg (The Netherlands) in 2014; * Inria Sophia-Antipolis (France) in 2015; * and Maryland (USA) in 2016. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/) == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include, but are not limited to: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2017 program chairs, Scott Owens and Meng Wang. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp17 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == INVITED SPEAKERS == Conor McBride University of Strathclyde (UK) Cătălin Hriţcu INRIA Paris (FR) == IMPORTANT DATES == Submission of draft papers: 5 May, 2017 Notification: 12 May, 2017 Registration: 11 June, 2017 TFP Symposium: 19-21 June, 2017 Student papers feedback: 29 June, 2017 Submission for formal review: 2 August, 2017 Notification of acceptance: 3 November, 2017 Camera ready paper: 2 December, 2017 == PROGRAM COMMITTEE == Co-Chairs Meng Wang University of Kent (UK) Scott Owens University of Kent (UK) PC Jeremy Yallop University of Cambridge (UK) Nicolas Wu University of Bristol (UK) Laura Castro University of A Coruña (ES) Gabriel Scherer Northeastern University (US) Edwin Brady University of St Andrews (UK) Janis Voigtländer Radboud University Nijmegen (NL) Peter Achten Radboud University Nijmegen (NL) Tom Schrijvers KU Leuven (BE) Matthew Fluet Rochester Institute of Technology (US) Mauro Jaskelioff CIFASIS/Universidad Nacional de Rosario (AG) Patricia Johann Appalachian State University (US) Bruno Oliveira The University of Hong Kong (HK) Rita Loogen Philipps-Universität Marburg (GE) David Van Horn University of Marylan (US) Soichiro Hidaka Hosei University (JP) Michał Pałka Chalmers University of Technology (SE) Sandrine Blazy University of Rennes 1 - IRISA (FR)

1 0

hash map/associative structure
by Ketil Malde 30 Apr '17

30 Apr '17

Hi, I've been using Judy arrays as a fast and even more importatnly, compact associative structure. Infortunately, I'm getting occasional segfaults, and I'm unable to find anything wrong with my code. Others also report something similar. The Debian maintainer of libjudy made a version without some dubious optimizations, but that didn't help...at least not substantially. So the question is, what is a good replacement? I just need Word64 -> Integral, but again, I expect to fill all of main memory with data, so memory compactness is important. Anything using trees and boxed values (e.g. Data.IntMap and friends) out. I only need to be able to insert, modify (add one), and finally extract the key-value pairs (e.g. 'elems'). Any suggestions? -k -- If I haven't seen further, it is by standing in the footprints of giants

2 1

How can I find out which functions can be run on an expression?
by Julian Leviston 30 Apr '17

30 Apr '17

I'd like to programmatically find out which functions in a module could possibly apply to a particular expression. I also posted this to stack overflow. To make this concrete: {-# LANGUAGE TemplateHaskell #-} module Test where -- we'll import template-haskell from Lens -- so we can create prisms automatically for our 'AST' import qualified Control.Lens.TH as LTH --- some 'AST' in a toy language data CExp = CLit Int -- a literal integer | CAdd CExp CExp -- addition | CMul CExp CExp -- multiplication | CSub CExp CExp -- subtraction deriving Show -- an eval for our AST eval :: CExp -> Int eval exp = case exp of CLit i -> i CAdd e1 e2 -> eval e1 + eval e2 CMul e1 e2 -> eval e1 * eval e2 CSub e1 e2 -> eval e1 - eval e2 -- a function to build a sum using add with our AST, from a list of Int values listToSums :: [Int] -> CExp listToSums = foldr CAdd (CLit 0) . fmap CLit -- here we make prisms for looking at particular values -- in the CExp AST LTH.makePrisms ''CExp -- let's have an expression: theList1 :: CExp theList1 = listToSums [1..38] Now, at this point, I'd like a function that can give me a list of all the top level functions of a particular module (including this one) that are able to be applied to the expression theList1. This will include the prisms that were created with makePrisms. It would be fine if it uses the hint library's Interpreter monad. I've been experimenting with it a bit, and while I can get a list of all of the definitions at the top level of any module, and I can find the types of them, too (more or less), I'm a bit lost about how to pass an expression in as an argument to these functions then check if that exprssions will typecheck. If I can do that, I can run filter across all of the functions in a module, which lets me find out which ones are applicable. Many thanks in advance.

1 0

State of Haskell IDE Engine
by Alan & Kim Zimmerman 30 Apr '17

30 Apr '17

Some of you have been wondering what has happened to the haskell-ide-engine[1], and whether it may perhaps have died. Development has resumed, based mainly on the existence of an enabling technology in the Language Server Protocol[2] which is starting to have implementations for IDEs and Languages[3]. It was always the intention to leverage off common infrastructure at the IDE side, and this protocol is making that possible. The current state for haskell-ide-engine is that support is provided in master[4], which has been tested in emacs using[5] (and [6] until the branch is merged). It is also tested against vscode[7] using the vscode-hie-server plugin[8]. Current features include - diagnostics provided via hlint and ghc-mod (using flycheck in emacs) - hover support giving the type under the cursor - ability to apply hlint suggestions as codeActions, via apply-refact - HaRe refactorings exposed in the emacs version. The vscode plugin lags in this, my skills are limited There is a lot of development happening on the emacs lsp-mode, as it benefits many languages, not just haskell, and so developers from other languages are also contributing. The LSP support for haskell-ide-engine is supplied by a separate library[9] which is being used in at least 3 other LSP servers to my knowledge. These will be made public when/if it suits their creators to do so. The general plan going forward is to focus HIE on being an LSP server. Other transports will not be removed, but the driving paradigm will be LSP support. The longer term plan is to use this as a platform to drive more interactivity back into GHC, starting with exploring incremental parsing driven by the document change notifications provided in the LSP protocol, and supported in haskell-lsp[9]. Alan [1] https://github.com/haskell/haskell-ide-engine/issues/218 [2] https://github.com/Microsoft/language-server-protocol [3] https://github.com/Microsoft/language-server-protocol/wiki/Protocol-Impleme… [4] https://github.com/haskell/haskell-ide-engine [5] https://github.com/alanz/lsp-haskell [6] https://github.com/alanz/lsp-mode/tree/project-ask [7] http://code.visualstudio.com/ [8] https://github.com/alanz/vscode-hie-server [9] https://github.com/alanz/haskell-lsp

3 3

Deadline Extension: International Workshop on OCL and Textual Modeling (OCL 2017)
by Achim D. Brucker 29 Apr '17

29 Apr '17

(Apologies for duplicates) New Deadline: May 7, 2017 CALL FOR PAPERS 17th International Workshop on OCL and Textual Modeling Co-located with STAF 2017 SOFTWARE TECHNOLOGIES: APPLICATIONS AND FOUNDATIONS July 20, 2017, Marburg, Germany http://oclworkshop.github.io Modeling started out with UML and its precursors as a graphical notation. Such visual representations enable direct intuitive capturing of reality, but they have weaknesses: for example, detailed visual representations bear the risk of becoming overcrowded faster than textual models and some of the visual features lack the level of precision required to create complete and unambiguous specifications. These weaknesses of graphical notations encouraged the development of text-based modeling languages that either integrate with or replace graphical notations for modeling. Typical examples of such languages are OCL, textual MOF, Epsilon, and Alloy. Textual modeling languages have their roots in formal language paradigms like logic, programming and databases. The goal of this workshop is to create a forum where researchers and practitioners interested in building models using OCL or other kinds of textual languages can directly interact, report advances, share results, identify tools for language development, and discuss appropriate standards. In particular, the workshop will encourage discussions for achieving synergy from different modeling language concepts and modeling language use. The close interaction will enable researchers and practitioners to identify common interests and options for potential cooperation. ## Topics of interest Topics of interest include (but are not limited to): - Mappings between textual modeling languages and other languages/formalisms - Algorithms, evaluation strategies and optimizations in the context of textual modeling languages for: - validation, verification, and testing, - model transformation and code generation, - meta-modeling and DSLs, and - query and constraint specifications - Alternative graphical/textual notations for textual modeling languages - Evolution, transformation and simplification of textual modeling expressions - Libraries, templates and patterns for textual modeling languages - Tools that support textual modeling languages (e.g., verification of OCL formulae, runtime monitoring of invariants) - Complexity results for textual modeling languages - Quality models and benchmarks for comparing and evaluating textual modeling tools and algorithms - Successful applications of textual modeling languages - Case studies on industrial applications of textual modeling languages - Experience reports: - usage of textual modeling languages and tools in complex domains, - usability of textual modeling languages and tools for end-users - Empirical studies about the benefits and drawbacks of textual modeling languages - Innovative textual modeling tools - Comparison, evaluation and integration of modeling languages - Correlation between modeling languages and modeling tasks This year, we particularly encourage submissions describing applications and case studies of textual modeling as well as test suites and benchmark collections for evaluating textual modeling tools. ## Venue This workshop will be organized as a part of STAF 2017 Conferenze in Marburg, Germany. It was previously organized as part of the MODELS conference. Similar to its predecessors , the workshop addresses both people from academia and industry . The aim is to provide a forum for addressing integration of OCL and other textual modeling languages , as well as tools for textual modeling , and for disseminating good practice and discussing the new requirements for textual modeling . ## Workshop Format The workshop will include short (about 15 min) presentations, parallel sessions of working groups, and sum-up discussions. ## Submissions Two types of papers will be considered: * Short contributions (between 6 and 8 pages) describing new ideas, innovative tools or position papers. * Full papers (between 12 and 16 pages). in LNCS format. Submissions should be uploaded to [EasyChair](https://easychair.org/conferences/?conf=ocl2017). The program committee will review the submissions (minimum 2 reviews per paper, usually 3 reviews) and select papers according to their relevance and interest for discussions that will take place at the workshop. Accepted papers will be published online in a post-conference edition of [CEUR](http://www.ceur-ws.org). ## Important Dates - Submission of papers: May 7, 2017 (extended) - Notification: May 25, 2017 - Workshop date: July 20, 2017 -- Dr. Achim D. Brucker | Software Assurance & Security | University of Sheffield https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking

1 0

th-abstraction: A new library for inspecting datatypes from Template Haskell
by Eric Mertens 29 Apr '17

29 Apr '17

Hello, I've uploaded a new library to Hackage that helps normalize the information one can get by reifying the type constructor of a type declared with data or newtype. https://hackage.haskell.org/package/th-abstraction https://github.com/glguy/th-abstraction I've found that I was duplicating a lot of code when trying to maintain compatibility across a range of Template Haskell versions when using the 'reify' operation. Currently I'm testing against GHC versions as old as 7.4.2 and as new as 8.2.1-rc1. This package eliminates some of the noise that comes from reify's syntax-oriented constructors and eliminates the differences across normal and GADT syntax. I expect to add more Template Haskell functionality to this package over time as needed with a focus on being able to maintain compatibility across a wide range of template-haskell package versions. I hope others are able to find it useful! Best regards, Eric Mertens "glguy"

1 0

ANN: wxHaskell 0.92.3.0
by Henk-Jan van Tuyl 29 Apr '17

29 Apr '17

L.S., I am happy to announce a new version of wxHaskell: 0.92.3.0 Windows users can still use wxInstall Achelanne 0.1 to install this new version of wxHaskell.[0][1] Changes in wxHaskell since 0.92.2: - Improvements for compilation on BSD platform - Improved commandline handling - Sample program PaintGC.hs added - Compilation can now be done with an alternative wx-config.exe - Simplification of Windows build process with Stack - Several bugs solved Thanks to everyone who contributed! What is wxHaskell? ------------------ wxHaskell[2] is a portable and native GUI library for Haskell. The goal of the project is to provide an industrial strength GUI library for Haskell, but without the burden of developing (and maintaining) one ourselves. wxHaskell is therefore built on top of wxWidgets[3] – a comprehensive C++ library that is portable across all major GUI platforms; including GTK, Windows, X11, and MacOS X. Furthermore, it is a mature library (in development since 1992) that supports a wide range of widgets with the native look-and-feel. Links ----- See the homepage of wxHaskell for more information: https://wiki.haskell.org/WxHaskell Repository: https://github.com/wxHaskell/wxHaskell Tickets: https://sourceforge.net/p/wxhaskell/_list/tickets The packages are: - wxc https://hackage.haskell.org/package/wxc - wxdirect https://hackage.haskell.org/package/wxdirect - wxcore https://hackage.haskell.org/package/wxcore - wx https://hackage.haskell.org/package/wx Regards, Henk-Jan van Tuyl [0] http://sourceforge.net/projects/wxhaskell/files/wxInstall/ [1] https://wiki.haskell.org/WxHaskell/Windows#Installing_the_easy_way [2] https://wiki.haskell.org/WxHaskell [3] https://wxwidgets.org/ -- Folding@home What if you could share your unused computer power to help find a cure? In just 5 minutes you can join the world's biggest networked computer and get us closer sooner. Watch the video. http://folding.stanford.edu/ http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html Haskell programming --

1 0

bounty for vty on Windows
by Simon Michael 29 Apr '17

29 Apr '17

Hi all, vty is a nice full-screen curses-style API, and the basis for the nice higher-level brick TUI (text UI) framework, that builds on POSIX platforms only. All agree that it would be nice to make it work on Windows too. This would allow building cross-platform TUIs with haskell. Also there are things in vty, such as the Graphics.Vty.Attributes, that would be useful for CLIs too. I summarised current status and have kicked off a bounty towards getting Windows support added to the vty lib. I'm sending this to raise interest and invite your help, be you a person with a Windows machine, a potential bounty donor, or someone interested in improving Haskell's portability and applicability. https://github.com/jtdaugherty/vty/pull/1#issuecomment-297143444 <https://github.com/jtdaugherty/vty/pull/1#issuecomment-297143444> My particular interest is in making hledger-ui[1] cross platform, and in being able to use vty's higher-level terminal styles in CLI tools on all platforms. Best! Simon [1] http://hledger.org/hledger-ui.html <http://hledger.org/hledger-ui.html>

2 2

Should I report a bug on GHC 7.10.3, or is it past it's end-of-life?
by Ramin Honary 29 Apr '17

29 Apr '17

I'm getting an "internal error: evacuate: strange closure type" in GHC 7.10.3. Should I report it? Would it even do any good? It doesn't seem there is any more development on the 7.10 branch anymore. If it is still being developed, should I try updating my GHC to a more recent build of 7.10.3? Looking at the core dump file, it appears to be a problem in the garbage collector. I've done a bit of work trying get around the bug, including using -dcore-lint and -O0, and updating my dependency libraries, and I can still reproduce the issue very regularly in my own environment by calling a single method in my code base, either in GHCi or in a compiled binary test program.

4 3

Trends in Functional Programming in Education TFPIE 2017, Canterbury 22 June, SECOND CALL FOR PAPERS
by Simon Thompson 28 Apr '17

28 Apr '17

TFPIE 2017 Trends in Functional Programming in Education, 2017 https://www.cs.kent.ac.uk/people/staff/sjt/TFPIE2017/ The sixth workshop on Trends in Functional Programming in Education, 2017, which is to be held on the Canterbury campus of the University of Kent on Thursday, 22 June, following the 2017 TFP meeting on 19–21 June. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), Soesterberg, The Netherlands (2014), and Sophia-Antipolis, France (2015), College Park, USA (2016). A particular topic of this year's TFPIE will be MOOCs and other online learning, and as well as a session on this, we're looking forward to announcing a keynote speaker in this area very soon. The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2017 will screen submissions to ensure that all presentations are within scope and are of interest to participants. After the workshop, presenters will be invited to submit revised versions of their articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Second call for papers TFPIE 2017 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy - The pedagogy of teaching FP - FP and e-learning: MOOCs, automated assessment etc. - Best Lectures – more details below In addition to papers, we are requesting best lecture presentations. What’s your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. Submission Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website. Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2017 After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Programme committee Dr Laura Castro, University of A Coruña Prof Ralf Lämmel, University of Koblenz-Landau Dr Elena Machkasova, University of Minnesota, Morris Prof Michel Mauny, Inria, Paris Dr Jeremy Singer, University of Glasgow Prof Simon Thompson, University of Kent (chair) Important dates Submissions of draft papers: 10 May, 2017 Notification: 17 May, 2017 Registration: 11 June, 2017 Workshop: 22 June 2017 Submission for formal review: 18 August, 2017 Notification of acceptance: 6 October, 2017 Camera ready paper: 3 November, 2017 Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson(a)kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt

1 0