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), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication.

Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS) volume.

TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP.

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, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage.


The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories:

Research Articles: leading-edge, previously unpublished research work
Position Articles: on what new trends should or should not be
Project Articles: descriptions of recently started new projects
Evaluation Articles: what lessons can be drawn from a finished project
Overview Articles: summarising work with respect to a trendy subject

Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium.

Articles on the following subject areas are particularly welcome:

  • Functional programming and multicore/manycore computing
  • Functional programming in the cloud
  • Functional programming in education
  • High performance functional computing
  • Extra-functional (behavioural) properties of functional programs
  • Dependently typed functional programming
  • Validation and verification of functional programs
  • Using functional techniques to verify/reason about imperative/object-oriented programs
  • Debugging for functional languages
  • Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc.
  • Interoperability with imperative programming languages
  • Novel memory management techniques
  • Program transformation techniques
  • Empirical performance studies
  • Abstract/virtual machines and compilers for functional languages
  • New implementation strategies
  • Any new emerging trend in the functional programming area

If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy.

Best Student Paper Award

TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year.

Submission and Draft Proceedings

Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (

The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students.

Paper submission is done through TFP13's EasyChair page:

The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree.

Post-Symposium Refereeing and Publication

In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper.

Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper.


Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page linked below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline.

Registration Site

If you are registering for TFPIE as well, it is referred to as the "One Day Workshop" on the registration site.

Local Arrangments

The conference will be held on BYU campus in the Wilkinson Student Center (building 88 or WSC on BYU's campus map) in room 5519. (Many participants are curious about the impact the BYU Honor Code will have on their attendance. This code is for students, not for visitors to BYU. The only way it will impact participants is, for example, potential confusion from on-lookers who see you smoke in areas permitted by the Utah Clean Air Act, and in the inability of the conference to pay for or provide prohibited substances like alcohol, tea, or coffee. You can, of course, bring your own drinks, etc.)

We have arranged for a room block at the Provo Marriott Hotel & Conference Center in Downtown Provo. We will be running shuttles to and from the hotel and BYU. Please use the group code tfptfpa or this reservation link.

When planning your flight, you should plan on flying into Salt Lake International Airport (Code: SLC). There are variety of option for traveling to Provo from the airport, such as shuttles and public transit. You may want to coordinate with other attendees via Facebook to share transportation costs.

Part way through the conference, we will be organizing an excursion to Historic Temple Square and the City Creek Center, the most popular tourist attraction in Utah. As part of the excursion, we'll have the chance to listen to a live choir and organ concert, visit the world's largest genealogical library, and have a small tour in one of 40 different languages, including nearly all European languages, so you can have a tour with a guide from your home country in your native tongue.

Tuesday, May 14th
Session 1
09:00-09:25 Expelled From Class No More: Constraining Your Problem Kind
Philip K.F. Hölzenspies
(University of Twente)
09:25-09:50Correctness of Functionally Specified Denotational and Operational Semantics
Marko van Eekelen
(Radboud University Nijmegen and Open University of the Netherlands)
09:50-10:15Total Functional Software Engineering
Trancón Widemann, Baltasar <baltasar.trancon AT>
(Ilmenau University of Technology)
Session 2
10:45-11:10 A Dataflow Inspired Programming Paradigm for Coarse-Grained Reconfigurable Arrays
Anja Niedermeier
(University of Twente)
11:10-11:35 Using Rewriting to Synthesize Functional Languages to Digital Circuits
Christiaan Baaij <c.p.r.baaij AT>
(University of Twente)
11:35-12:00 A Transformation-Based Foundation for Semantics-Directed Code Generation
Arthur Nunes-Harwitt
12:00-13:45Lunch (SC Meeting)
Session 3
13:45-14:10 Distributed Places
Kevin Tew <tew AT>
(Brigham Young University and PLT)
14:10-14:35 Bytecode Closures
Marco T. Morazán <morazanm AT>
(Seton Hall University)
14:35-15:00 Towards Efficient Abstractions for Concurrent Consensus
Carlo Spaccasassi
(Trinity College Dublin)
Session 4
15:30-15:55 Design and development of Proof Pad, A Pedagogic Development Environment for the ACL2 Theorem Prover
Caleb Eggensperger <calebegg AT>
(University of Oklahoma)
15:55-16:20 A Comparison of Task Oriented Programming with GUIs in Functional Languages
Peter Achten <P.Achten AT cs DOT ru DOT nl>
(Radboud University Nijmegen, the Netherlands)
16:20-16:45 Analyzing ACL2's Usability
Ryan Ralston
(University of Oklahoma)
Wednesday, May 15th
Session 1
09:00-09:25 HLearn: A Machine Learning Library for Haskell
Mike Izbicki <mike AT>
(UC Riverside)
09:25-09:50 Running Probabilistic Programs Backwards
Neil Toronto <neil.toronto AT>
(Brigham Young University)
09:50-10:15 Sunroof: A Monadic DSL to Generate JavaScript
Jan Bracker <jbra AT>
(ITTC / EECS @ The University of Kansas and Institut für Informatik @ Christian-Albrechts-Universität)
10:45-11:45 Invited Talk: The gradual typing approach to mixing static and dynamic typing

The gradual typing approach to mixing static and dynamic typing enables the programmer to choose which parts of a program should be statically typed and which parts should be dynamically typed. The gradual typing approach was proposed in 2006 and we have made considerable progress in understanding the design and implementation of languages with gradual typing, but much more research is needed. In this talk I give a whirlwind tour of the problems and research results from the past seven years and discuss some open problems.

Jeremy Siek
(University of Colorado at Boulder)
Thursday, May 16th
Session 1
09:00-09:25 DOMain Specific Type Error Diagnosis
Jurriaan Hage
(Utrecht University)
09:25-09:50 Blame Prediction
Dries Harnie <dries.harnie AT>
(Vrije Universiteit Brussel)
09:50-10:15 Model-Based Shrinking for State Based Testing
Pieter Koopman <pieter AT>
(Radboud University Nijmegen, The Netherlands)
Session 2
10:45-11:10 Implementing a Vau-based Language With Multiple Evaluation Strategies
Logan Kearsley <chronosurfer AT>
(Brigham Young University)
11:10-11:35 Control Flow Analysis with SAT Solvers
Steven Lyde
(University of Utah)
11:35-12:00 A Survey of Polyvariance in Control-Flow Analysis
Thomas Gilray
(University of Utah)
Session 3
13:45-14:10 How to Interact with a HERMIT
Andy Gill
(University of Kansas)
14:10-14:35 A Language for Domain Specific Optimizations in Haskell
Andrew Farmer
(University of Kansas)
14:35-15:00 A Target Implementation for High-Performance Functional Programs
Andy Jost <ajost AT>
(Synopsys, Inc. and Portland State University)
Session 4
15:30-15:55 Pure Continuation Marks
Kimball Germane
(University of Utah)
15:55-16:20 Functional Video Games in CS1 III
Marco T. Morazán <morazanm AT>
(Seton Hall University)


TFP 2013 is sponsored by the Brigham Young University Computer Science department.


Steering Committee Chair Marko van Eekelen, Radboud University Nijmegen and Open University, NL
Steering Committee Treasurer Hans-Wolfgang Loidl, Heriot-Watt University, UK
Steering Committee Secretary Marco T. Morazán, Seton Hall University, New Jersey, U.S.A.
Chair Jay McCarthy, Brigham Young University, Utah, U.S.A.
Program Committee Andy Gill from the University of Kansas
Arjun Guha from Cornell University
Clara Segura from Complutense University of Madrid
Henrik Nilsson from University of Nottingham
James Caldwell from the University of Wyoming
John Clements from California Polytechnic State University
Jurriaan Hage from Universiteit Utrecht
Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology
Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen
Nikhil Swamy from Microsoft Research
Rita Loogen from Philipps-Universität Marburg
Sergio Antoy from Portland State University
Suresh Jagannathan from Purdue University
Tom Schrijvers from Ghent University
Viktória Zsók from Eötvös Loránd University, Budapest
Wolfgang De Meuter from Vrije Universiteit Brussel