TFP 2017

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.

Invited Speakers

Conor McBride, University of Strathclyde (UK)
Cătălin Hriţcu, INRIA Paris (FR)
TFPIE Invited speaker Heather Miller, Northeastern University (USA)

Directions

Canterbury West is the station you want. Take the high speed train from London St. Pancras. From there you can walk to the campus (25 minutes or so, but up hill), or take a taxi. The accommodation is at Keynes college. And the conference is in Grimond (lecture theatre 2).

Accepted papers

• Oskar Abrahamsson. Automatically Introducing Tail Recursion in CakeML
• Stephen Dolan, Spiros Eliopoulos, Daniel Hillerström, Anil Madhavapeddy, Kc Sivaramakrishnan and Leo White. Concurrent System Programming with Effect Handlers
• Thomas Dorrington and Kathryn E Gray. Dynamic Witnesses For Ill-Typed Programs Using Parametric Polymorphism In SML
• Shamil Dzhatdoyev and Marco T. Morazan. On the Implementation of Bignum Multiplication
• Rikard Hjort, Jakob Holmgren and Christian Persson. The CakeML Compiler Explorer: Tracking Intermediate Representations in a Verified Compiler
• Jeff Horemans, Bob Reynders, Dominique Devriese and Frank Piessens. Towards Multi-tier Time Travel Debugging for the Web
• Pieter Koopman, Mart Lubbers and Rinus Plasmeijer. A Task-Based DSL for Microcomputers
• Petr Lozov, Andrei Vyatkin and Dmitry Boulytchev. Typed Relational Conversion
• John Magnus Morton and Phil Trinder. A Communications Cost Model for a distributed Scheme
• Jan Midtgaard. QuickChecking Patricia Trees
• Marco T. Morazan, Lindsey Reams, Nicholas R. Olson and Shamil Dzhatdoyev. Memoized Flat Closures for CPS
• Boldizsár Németh, Máté Tejfel and Zoltán Kelemen. Haskell-tools Refact: a new way to refactor Haskell programs
• João Paulo Pizani Flor and Wouter Swierstra. Combinational and Sequential Circuits in Agda
• Juan Carlos Saenz-Carrasco, Mike Stannett and Paolo Veronelli. Managing k-ary Trees in Haskell: Towards a Dynamic Data Structure in Functional Programming
• Joanna Sharrad and Olaf Chitil. Discovering the source of Haskell Type Errors using Delta Debugging
• Jurriën Stutterheim, Peter Achten and Rinus Plasmeijer. Maintaining Separation of Concerns Through Task-Oriented Software Development
• Thorkil Værge, Mads Gram and Omri Ross. Secure Execution of Financial Contracts on Ethereum
• Michael Walker and Colin Runciman. Cheap Remarks about Concurrent Programs
• Ningning Xie and Bruno C. D. S. Oliveira. Towards Unification for Dependent Types
• Anton Ekblad. Scoping Monadic Relational Database Queries