TFP 2015 - 16th Symposium on Trends in Functional Programming

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 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd.
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;
and in Soesterberg (The Netherlands) in 2014.
For further general information about TFP please see the TFP homepage.
INVITED SPEAKERS
TFP is pleased to announce talks by the following two invited speakers:
* Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully.
Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of
the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson...) that is a first step to the classification of finite groups
and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering.