If you or one of your students recently completed a PhD
in the area of functional programming, please submit the
dissertation abstract for publication in JFP: simple
process, no refereeing, deadline 30th April 2016.
CALL FOR PHD ABSTRACTS
Journal of Functional Programming
Deadline: 30th April 2016
Many students complete PhDs in functional programming each
year. As a service to the community, the Journal of Functional
Programming publishes the abstracts from PhD dissertations
completed during the previous year.
The abstracts are made freely available on the JFP website,
i.e. not behind any paywall. They do not require any transfer
of copyright, merely a license from the author. A dissertation
is eligible for inclusion if parts of it have or could have
appeared in JFP, that is, if it is in the general area of
David Turner was one of the two people who changed my life by introducing me to functional programming (*). David designed and implemented a succession of functional languages, Sasl, KRC, and Miranda, that made lazy functional programming into a tool you could use to get work done. They all used SK-combinator reduction in their implementations, a technique of irresistibly simple beauty, invented by Curry and Feys, but refined and popularised by David.
For David’s 70th birthday, the Journal of Universal Computer Science is running a special Festschrift issue on “Functional programming: past, present, and future” in David’s honour.
The Call for Papers is attached. Here’s the timetable.
· 1 July 2016: Paper submissions.
· 1 September 2016: Author notification.
· 1 October, 2016: Revised version due.
· 15 October 2016: Final notification.
· 30 October 2016: Camera Ready Copy.
Do consider submitting a paper.
(*) Arthur Norman w
I recently read Pinker's The Sense of Style, and urge you to read it too. It is chock full of practical advice on how to make your writing better. Chapter One shows you how to appreciate good writing; I never knew an obituary could be so zippy. Chapter Two explains the approach to writing called 'the classical style', which I have used my whole life without realising it. Chapter Three describes how to keep knowing what you are talking about from getting in the way of communicating clearly. Pinker is an expert on modern grammar, and Chapter Four clarifies how to parse your sentences to avoid ambiguity and employ referents correctly. Chapter Five details the mechanics of how to make a passage cohere. Chapter Six catalogues, from Pinker's position on the usage panel for the American Heritage dictionary, contentious points of diction, with his advice on how to resolve them and what points to consider when resolving them for yourself.
I recommend it highly, and doubly so if you are ever likely to write something that I will have to read.
The 11th Darcs Sprint, organised by and jointly with the Pijul team,
will be in Helsinki, on Friday May 6th-Sunday May 8th, at Aalto
University's startup sauna in the Otaniemi Campus.
Please check the details at
Many thanks to Pierre-Étienne Meunier for organising it.
The Darcs planning page is at:
Here are three things to know:
1. Everybody is welcome to join us. We'd love to have you, whatever
your hacking experience with Pijul or Darcs. Also, if you've got a
wacky idea for the future of version control, or a cool use for the
Darcs or Pijul libraries, you should join us too.
2. If you're attending please add your name to
3. We may be able to reimburse travel costs (within reason!).
Let us know if you'd like a reimbursement, and save your receipts.
Many thanks to everybody who participated in our fundraising drives
or who gave money on the side. Tha
bond-haskell and bond-haskell-compiler is a pair of packages adding Haskell
support to bond serialization framework.
Bond is an open source, cross-platform framework for working with
schematized data. It supports cross-language serialization/deserialization
and powerful generic mechanisms for efficiently manipulating data. It is
broadly used at Microsoft in high scale services. For a discussion how Bond
compares to similar frameworks (most notably protobufs) see
Microsoft's bond package or other foreign code is not needed for building
or using bond-haskell, all dependencies are published to hackage. For those
interested, Microsoft's code is published at
Haskell-Cafe mailing list
Haskell-Cafe< at >haskell.org
I've just released protobuf-simple, an Haskell implementation of Google's
Protocol Buffers with an emphasis on simplicity. This implementation
consists of a library for the encoding and decoding of data and an
executable for generating Haskell types from proto files.
The code can be found at https://github.com/sru-systems/protobuf-simple
[Apologies if you receive multiple copies of this CFP]
*** Deadline for Abstracts Approaching***
The Brazilian Symposium on Programming Languages is a well-established
symposium which provides a venue for researchers and practitioners
interested in the fundamental principles and innovations in the design and
implementation of programming languages and systems. SBLP 2016 will be held
in Maringá, in the Southern region of Brazil, and will be the 20th edition
of the symposium. SBLP is part of the 7th edition of CBSoft, the Brazilian
Congress on Software: Theory and Practice. More information is available at
Abstract submission: April 8th 2016
Paper submission: April 15th 2016
Author notification: May 27th 2016
Camera ready deadline: June 10th 2016
Symposium dates: September 22nd and 23rd
Authors are invited to submit original research on any relevant top
In a traditional "pointful" definition of a function in Haskell, the names of the function parameters can provide documentation of what the argument is for:
f num_oranges = ...
In point-free style, that opportunity for documentation goes away.
However, if the function has a type signature, then each type element of the signature can be annotated with documentation stating what it is. The feature already exists in Haddock, though it is not too frequently used.
f :: Int -- ^ The 'Int' argument
-> Float -- ^ The 'Float' argument
-> IO () -- ^ The return value
13th International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools
August 29 - September 2, 2016
In-cooperation with ACM SIGPLAN, SIGSOFT, SIGAPP and SPEC RG
Abstract submission deadline: June 2, 2016
Submission deadline: June 6, 2016
Author notification: July 11, 2016
I am writing to let you know that I am no longer able to maintain the
I have enjoyed working on containers for several years, but I can no
longer find the time needed for the job (with two little kids
and building a house).
I am not sure what is the best future of the containers package -- it
could go to CLC, or it could get a new maintainer. If you look at the
commit logs and on the github issues/requests, you will find out that
David Feuer has a thorough understanding of the package (notably
Data.Sequence) and has been competently moderating the issues/requests
for some time now, so he would be the first choice. (I did not contact
him sooner, so it is surprise for him as well -- sorry, David :-)
Could I humbly ask David/CLC members/anyone for comments?
CALL FOR PAPERS
The 5th ACM SIGPLAN Workshop on
Functional High-Performance Computing
September 22, 2016
Co-located with the International Conference on Functional Programming
Submission Deadline: Friday, 10 June, 2016 (anywhere on earth)
The FHPC workshop aims at bringing together researchers exploring uses
of functional (or more generally, declarative or high-level)
programming technology in application domains where high performance
is essential. The aim of the meeting is to enable sharing of results,
experiences, and novel ideas about how high-level, declarative
specifications of computationally challen
Milan Straka and I agree that we want Data.Sequence to offer pattern
synonyms to make it more convenient to work with the ends of sequences. I
wanted to check with everyone here what names to use. Relevant names
1. <|, |>, and empty for cons, snoc, and empty
2. data ViewL a = EmptyL | a :< Seq a, and the equivalent on the right.
I suggested Empty, :<<, and :>> as the pattern synonyms, the latter chosen
for the relative convenience of the double tap. Milan suggested (correctly,
I suspect) that the greater clarity of Empty, :<|, and :|> is worth the
price in typing.
Libraries mailing list
Libraries< at >haskell.org
We have an ongoing project developing an auto-parallelizing pure
functional language implementation using GHC as the front end to dump
Core or STG (much like Intel's approach here
If you are a United States citizen or permanent resident alien studying
computer science or mathematics at the undergraduate level with strong
interests in Haskell programming, compiler/runtime development, and
pursuing a fall semester (2016) internship at Los Alamos National
Laboratory this could be for you.
We don't expect applicants to necessarily already be highly accomplished
Haskell programmers--such an internship is expected to be a combination
of (further) developing your programming/Haskell skills and putting them
to good use. If you're already a strong C hacker we could use that too.
The application deadline is May 31, 2016. It's a bit of a process so
don't leave inquiries until the last day.
Email me if interested in more information,
C A L L F O R P A P E R S
======== TFP 2016 ===========
17th Symposium on Trends in Functional Programming
June 8-10, 2016
University of Maryland, College Park
Near Washington, DC
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.
CALL FOR PAPERS
3rd ACM SIGPLAN International Workshop
on Libraries, Languages and Compilers for
Santa Barbara, CA, USA
June 14, 2016
EXTENDED DEADLINE: April 11, 2016 (FIRM!)
ARRAY 2016 is part of PLDI 2016
37th Annual ACM SIGPLAN Conference on
Programming Language Design and Implementation
June 13-17, 2016
I was recently faced with some unexpected behaviour from a piece of
code that type checks and has zero warnings (even with -Wall). The
code is below (and depends on the hashtables package).
The error was using the <$> operator instead of the =<< operator.
Using the former, it just builds up a list of IO actions that never
As pointed out to me on IRC (thanks pjdeport), chaning the type
signature of `forM_` to
forM_' :: (Monad m, Foldable t) => t a -> (a -> m ()) -> m ()
would have resulted in an error.
Yes, this change would break existing code (breaking code would require
an explicit `void $` inside the `forM_`) but does anyone else think
this is a good idea?
import qualified Data.HashTable.IO as HT
type EvenCache = HT.BasicHashTable Int Bool
main :: IO ()
main = do
ht <- buildTable
xs <- HT.toList ht
putStrLn $ "cache: length " ++ show (length xs)
buildTable :: IO EvenCache
buildTable = do
ht <- HT.new
forM_ pairs $ \ (k,v) -
My institution just bought a D-Wave 2X adiabatic quantum computer.
The problem is, no one really has a grasp on how to *program* an
adiabatic quantum computer. It's a totally different beast from the
gate-model quantum computers that most people imply when they talk
about quantum computing.
I'm looking to hire a postdoc to work with me on designing and
implementing programming models suitable for execution on D-Wave-style
quantum computers. The formal job ad can be found at
http://tinyurl.com/jdlo556 or go to http://jobs.lanl.gov/ and look up
Disclaimer: This is not specifically a Haskell-hacking position,
although you can use any language you want for the classical-side
development. I'm posting here because a key skill I'm looking for is
breadth of language knowledge. I see a candidate who knows nonstrict
functional programming, declarative programming, and maybe a few
"fringe" programming models as more valuable than one who knows only a
dozen isomorphic imperative languages.
8 Rules of Fat Loss. Warning: Fast Results! Click Here to Watch Video...
Thanks to John Lato and Duncan Coutts for the latest bugfix release! The latest packages should be buildable on GHC 7.6, and the cairo package should behave a bit nicer in ghci on Windows. Thanks to all!