Please, find below the 1st call for participation for IFL 2018.
Please forward these to anyone you think may be interested.
Apologies for any duplicates you may receive.
CALL FOR PARTICIPATION:
30th Symposium on Implementation and Application of Functional Languages
University of Massachusetts Lowell, MA, USA
September 5th-7th, 2018 http://iflconference.org
September 5th: Haskell Mini-Course by Galois, Inc, see details below.
The goal of the IFL symposia is to bring together researchers actively engaged
in the implementation and application of functional and function-based
programming languages. IFL 2018 will be a venue for researchers to present and
discuss new ideas and concepts, work in progress, and publication-ripe results
related to the implementation and application of functional languages and
### Keynote Speakers
* Adam Chlipala, Massachusetts Institute of Technology CSAIL
* Arjun Guha, University of Massachusetts Amherst
### Haskell Mini-Course (September 5th, 2018)
Mini-course on Haskell by Galois, Inc,
presented by David Thrane Christiansen and Jose Manuel Calderon Trilla.
Register: Attendance at the course is free, but you must RSVP.
(Link to RSVP form can be found at http://iflconference.org
Recent versions of the GHC compiler for Haskell feature support for a number of
advanced type system features, including pattern-matching functions in the type
system (type families), indexed families (generalized algebraic datatypes, or
GADTs), type-level data structures (data kinds), and general compile-time
metaprogramming (Template Haskell). At Galois, we use these features in a number
of our projects, which allows us to build deep embeddings of programming
languages and have GHC enforce the target language's type system for us. This
style of programming ensures that we only produce well-typed terms, including
that we do not forget any of the run-time checks that are necessary to preserve
our invariants when accepting input from untyped sources such as files.
In the course of developing these projects, some common problems and programming
patterns emerged. We developed the `parameterized-utils` library to codify
solutions to these problems, and provide necessary generalizations of interfaces
from the standard library (Eq, Applicative, Traversable, etc.)
We will expect that participants in the course have used Haskell before, but we
will not expect everyone to be experts. We will introduce GADTs, type families,
and data kinds, and then show how to use them together with the tools from
parameterized-utils with an implementation of the simply-typed lambda calculus,
including basic AST definitions, evaluation, and parsing.
### Peter Landin Prize
The Peter Landin Prize is awarded to the best paper presented at the
symposium every year. The honored article is selected by the program committee
based on the submissions received for the formal review process. The prize
carries a cash award equivalent to 150 Euros.
### Organization and Program committee
Chairs: Jay McCarthy & Matteo Cimini, University of Massachusetts Lowell, USA
* Arthur Chargueraud, Inria, FR
* Ben Delaware, Purdue University, USA
* Christos Dimoulas, Northwestern University, USA
* David Darais, University of Vermont, USA
* Dominic Orchard, University of Kent, UK
* Ekaterina Komendantskaya, Heriot-Watt University, UK
* Garrett Morris, University of Kansas, USA
* Heather Miller, EPFL & Northeastern University, CH & USA
* Jeremy Yallop, University of Cambridge, UK
* Keiko Nakata, SAP Innovation Center Potsdam, DE
* Laura Castro, University of A Coruna, ESP
* Magnus Myreen, Chalmers University of Technology, SWE
* Natalia Chechina, Bournemouth University, UK
* Peter Achten, Radboud Universiteit Nijmegen, NL
* Peter-Michael Osera, Grinnell College, USA
* Richard Eisenberg, Bryn Mawr College, USA
* Trevor McDonell, University of New South Wales, AUS
* Yukiyoshi Kameyama, University of Tsukuba, JAP
The 30th IFL is organized by the University of Massachusetts Lowell.
The City of Lowell is located at the heart of the Merrimack Valley just 30 miles
northwest of Boston. Lowell can be easily reached by train or taxi.
See the website for more information on the venue.