- Haskell-Cafe - Haskell.org

[ANN] task-distribution: simple distribution of new code in a cluster computing setup
by Axel Mannhardt 24 Mar '16

24 Mar '16

Hello cafe, I am happy to announce task-distribution, a framework written in order to distribute and execute tasks as fast as possible on a large data set. Its accentuation is that it supports distributing new logic to other nodes from within the program itself, thus avoiding both restarting slave node processes and a separated plugin-management infrastructure. An example use case is running continuously changing analytics logic on a given data set stored in HDFS. Avalailable on hackage and github: https://github.com/michaxm/task-distribution Cheers, Axel

1 0

Three Haskell dev roles at Standard Chartered
by Don Stewart 23 Mar '16

23 Mar '16

Hi all I'm hiring another 3 devs to join Strats at Standard Chartered in London or Singapore. This is a good chance to join a growing, experienced team using Haskell for a wide set of projects in finance. More details in https://donsbot.wordpress.com/2016/03/23/haskell-developer-roles-at-standar… -- Don

1 0

Haskell-related PhD Studentship at Kent
by Meng Wang 23 Mar '16

23 Mar '16

Dear Haskellers, I am seeking a PhD student on a Haskell-related project: http://www.cs.kent.ac.uk/research/studyingforaphd/phd-wang.html This would be a good opportunity for someone who is interested in applying Haskell ideas to real problems. The funding covers maintenance, EU student fees and research related expenses. But non-EU students are welcome to apply too. For Sep 2015 starting, the application deadline is 17 April 2015. If you are interested, please contact me at m.w.wang(a)kent.ac.uk<mailto:m.w.wang@kent.ac.uk>. Best wishes, Meng — Dr Meng Wang School of Computing University of Kent http://www.cs.kent.ac.uk/people/staff/mw516/

1 1

[TFPIE 2016] 2nd call for papers
by Peter Achten 22 Mar '16

22 Mar '16

Trends in Functional Programming in Education (TFPIE 2016) 2nd Call for papers https://wiki.science.ru.nl/tfpie/TFPIE2016 The 5th International Workshop on Trends in Functional Programming in Education, TFPIE 2016, will be held on June 7, 2016 at the University of Maryland College Park in the USA. It is co-located with the Symposium on Trends in Functional Programming (TFP 2016) which takes place from June 8 - 10. *** Goal *** 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 2016 will screen submissions to ensure that all presentations are within scope and are of interest to participants. 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/wiki. Visitors to the TFPIE 2016 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. 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. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), Soesterberg, The Netherlands (2014), and Sophia-Antipolis, France (2015). *** Program Committee *** Stephen Chang at Northeastern University in Massachusetts, USA Marc Feeley at Université de Montréal in Québec, Canada Patricia Johann at Appalachian State University in North Carolina, USA Jay McCarthy at University of Massachusetts Lowell in Massachusetts, USA (Chair) Prabhakar Ragde at University of Waterloo in Ontario, Canada Brent Yorgey at Hendrix College in Arkansas, USA *** Submission Guidelines *** TFPIE 2016 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 - Tools supporting learning FP - 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 *** Best Lectures *** In addition to papers, we request "best lecture" presentations. What is 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 *** Papers and abstracts can be submitted via EasyChair at the following link: https://easychair.org/conferences/?conf=tfpie2016 It is expected at at least one author for each submitted paper will attend the workshop. *** Registration & Local Information *** Please see the TFP site for registration and local information: http://tfp2016.org/ *** Important Dates *** April 27, 2016: Submission deadline for draft TFPIE papers and abstracts May 3, 2016: Notification of acceptance for presentation May 13, 2016: Registration for TFP/TFPIE closes June 7, 2016: Presentations in Maryland, USA July 7, 2016: Full papers for EPTCS proceedings due. September 1, 2016: Notification of acceptance for proceedings September 22, 2016: Camera ready copy due for EPTCS Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn.

1 0

Stuck on a type family problem where kind inference fails
by Oliver Charles 22 Mar '16

22 Mar '16

Hi all, This is a little tricky to explain, so bear with me. I'm working on some code that roughly models a PostgreSQL schema. Users begin by defining their tables as Haskell records, parametrized over some f :: k -> *, and use a special Col type family that applies some normalisation: data Table f = Table { tableId :: Col f ('NotNullable 'DBInt) , tableX :: Col f ('Nullable 'DBString) } is one such example. The idea behind Col is that sometimes we don't need information about the "full type" when we know more about f. One such choice of f is Expr, which corresponds to expressions inside a query. In this case, I would desire tableId :: Col Expr ('NotNullable 'DBInt) = tableId :: Expr 'DBInt tableX :: Col Expr ('Nullable 'DBString) = tableX :: Expr ('Nullable 'DBString) Notice here that if you use 'NotNullable, then this information is erased - but it's important if the column is 'Nullable. However, I'm struggling to work out any way to actually pull this off in the general case. Here's what I've been attempting: {-# LANGUAGE FunctionalDependencies #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE RankNTypes #-} {-# LANGUAGE MultiParamTypeClasses #-} {-# LANGUAGE DataKinds #-} {-# LANGUAGE TypeOperators #-} {-# LANGUAGE TypeFamilies #-} {-# LANGUAGE KindSignatures #-} {-# LANGUAGE PolyKinds #-} {-# LANGUAGE TemplateHaskell #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE UndecidableInstances #-} {-# LANGUAGE ScopedTypeVariables #-} module ExprTest where import Data.Singletons import Data.Singletons.Prelude hiding (Null) import Data.Singletons.TH data Expr (a :: k) data MyExprSym :: TyFun k * -> * type instance Apply MyExprSym (x :: k) = Expr x $(singletons [d| data Null a = Nullable a | NotNullable a |]) $(promote [d| notNullableType k (NotNullable a) = baseType k a nullableType k (Nullable a) = baseType (k . Nullable) a baseType k a = k a |]) So far, this seems to work well. If I ask GHCI: *ExprTest> :kind! Apply (Apply NullableTypeSym0 MyExprSym) ('Nullable 'DBString) Apply (Apply NullableTypeSym0 MyExprSym) ('Nullable 'DBString) :: * = Expr ('Nullable 'DBString) *ExprTest> :kind! Apply (Apply NotNullableTypeSym0 MyExprSym) ('NotNullable 'DBInt) Apply (Apply NotNullableTypeSym0 MyExprSym) ('NotNullable 'DBInt) :: * = Expr 'DBInt This is exactly what I want, but note that I had to choose the necessary symbols NullableTypeSym0 and NotNullableTypeSym0. I would like to calculate those symbols from the column type itself. Looking at the kinds of these symbols though, they are both different: *ExprTest> :kind! NotNullableTypeSym0 NotNullableTypeSym0 :: TyFun (TyFun k1 k -> *) (TyFun (Null k1) k -> *) -> * = NotNullableTypeSym0 *ExprTest> :kind! NullableTypeSym0 NullableTypeSym0 :: TyFun (TyFun (Null k1) k -> *) (TyFun (Null k1) k -> *) -> * = NullableTypeSym0 So I can't see a way to write a single type family that returns them. To summarise, I'd like a way to write this following instance for Col: type instance Col Expr x = Apply (Apply ?? MyExprSym) x such that Col Expr ('Nullable a) = Expr ('Nullable a') and Col Expr ('NotNullable a) = Expr a but I cannot work out how to write the placeholder ?? above. One attempt is type family ExprTyfun (col :: colK) :: TyFun (TyFun k * -> *) (TyFun j * -> *) -> * type instance ExprTyfun ('NotNullable a) = NotNullableTypeSym0 type instance ExprTyfun ('Nullable a) = NullableTypeSym0 But neither of these instances actually normalise as I'd like, presumably because of k and j being forall'd in the return type: *ExprTest> :set -fprint-explicit-kinds *ExprTest> :kind! ExprTyfun ('Nullable 'DBInt) ExprTyfun ('Nullable 'DBInt) :: TyFun (TyFun k * -> *) (TyFun k1 * -> *) -> * = ExprTyfun k k1 (Null DBType) ('Nullable DBType 'DBInt) *ExprTest> :kind! ExprTyfun ('NotNullable 'DBInt) ExprTyfun ('NotNullable 'DBInt) :: TyFun (TyFun k * -> *) (TyFun k1 * -> *) -> * = ExprTyfun k k1 (Null DBType) ('NotNullable DBType 'DBInt) *ExprTest> :i ExprTyfun type family ExprTyfun (k :: BOX) (j :: BOX) (colK :: BOX) (col :: colK) :: TyFun (TyFun k * -> *) (TyFun j * -> *) -> * -- Defined at src/Opaleye/TF/ExprTest.hs:39:1 type instance ExprTyfun (Null k) (Null k) (Null k1) ('Nullable k1 a) = NullableTypeSym0 * k -- Defined at src/Opaleye/TF/ExprTest.hs:41:1 type instance ExprTyfun k (Null k) (Null k1) ('NotNullable k1 a) = NotNullableTypeSym0 * k -- Defined at src/Opaleye/TF/ExprTest.hs:40:1 I'd also like to point out that in my full code the types to Col can be a lot bigger, and I'd like to not assume any ordering. For example, here's a possible type: userId :: Col f ('Column "id" ('NotNullable ('HasDefault 'DBInt))) In this case Col Expr ('Column "id" ('NotNullable ('HasDefault 'DBInt))) = Expr 'DBInt I hope this question is understandable! Please let me know if there's anything I can do to provide more clarity. - Ollie

2 10

Using rebox2 (emacs) with Haskell
by Henry Laxen 21 Mar '16

21 Mar '16

If any of you have tried using rebox2 with haskell, you've discovered that it does not have a built in Haskell comment mode. I was looking for something like this: ------------------------------------- -- You can put a nice comment here -- -- and surround with a pretty box -- ------------------------------------- Actually, it is easy to set this up with a few lines in your .emacs file. Here is what you need: (require 'rebox2) (add-to-list 'rebox-language-character-alist '(7 . "-")) (setq rebox-style-loop '(725)) (rebox-register-all-templates) (add-hook 'haskell-mode-hook 'rebox-mode) Then just type Meta-q if you want to refill the comment, and Meta-Q if you don't want to refill. I hope this is helpful. Best wishes, Henry Laxen

1 0

Odd list comprehension behaviour
by Krisztian Pinter 21 Mar '16

21 Mar '16

Hello, I noticed some odd behaviour with list comprehensions. [1..1] == [1] BUT [1,1..1] == [1..] I noticed this while writing a Clean program, but it seems Haskell inherited this as well. In the case of integer lists with step size >= 0 the up_list function[1] is used: up_list :: Integer -> Integer -> Integer -> [Integer] up_list x0 delta lim = go (x0 :: Integer) where go x | x > lim = [] | otherwise = x : go (x+delta) In the case of [1,1..1] x0 == lim, so go will recurse infinitely, producing an infinite list. I think the reasonable behaviour would be [1,1..1] == [1]. Is there a reason it doesn't work like this? [1] http://hackage.haskell.org/package/base-4.8.2.0/docs/src/GHC.Enum.html#up_l… Thanks, Krisztián

9 14

Ambiguous type variable ‘f0’ arising from a use of ‘f’
by Tom Ellis 21 Mar '16

21 Mar '16

Can anyone explain what happened in GHC 8 such that it forced this change: -data PackMap a b s t = PackMap (Applicative f => (a -> f b) -> s -> f t) +data PackMap a b s t = PackMap (forall f. Applicative f => (a -> f b) -> s -> f t) ... instance PP.SumProfunctor (PackMap a b) where - f +++! g = (PackMap (\x -> eitherFunction (f' x) (g' x))) - where PackMap f' = f - PackMap g' = g + f +++! g = + PackMap (\x -> + case f of + PackMap f' -> + case g of + PackMap g' -> + eitherFunction (f' x) + (g' x)) https://github.com/tomjaguarpaw/haskell-opaleye/pull/140/files The errors are Ambiguous type variable ‘f0’ arising from a use of ‘f’ etc., as seen here https://github.com/tomjaguarpaw/haskell-opaleye/pull/140#issuecomment-19829… Thanks, Tom

2 5

Gaussian Elimination over GF2
by Mick Francis 20 Mar '16

20 Mar '16

Does anyone know of any implementation in Haskell of Gaussian Elimination over GF2? I'm experimenting with congruence-based factoring algorithms, and need an implementation for the Linear Algebra stage. Mick.

1 0

[ANN] servant 0.5
by Julian Arni 19 Mar '16

19 Mar '16

Dear all, We have just released a new major version (0.5) of the official servant packages: - servant - servant-server - servant-client - servant-docs - servant-foreign - servant-js - servant-cassava - servant-blaze - servant-lucid - servant-mock (servant-js and servant-foreign are being released for the first time. servant-jquery will be deprecated in favour of servant-js) This new version brings quite a number of significant changes. Servant is now faster, more correct, more replete with features, and more consistent. We have a blog post going into more details about the changes: http://haskell-servant.github.io/posts/2016-03-19-servant-0.5-release.html Note also that we have revamped our tutorial, and moved it to readthedocs: http://haskell-servant.readthedocs.org/en/master/ Enjoy the weekend, Julian

1 0