TFP Best Student Paper
The Trends in Functional Programming (TFP) series is committed to providing a supportive platform for young researchers in the challenging process of publishing their first papers. We firmly believe that the quality of research publications is greatly enhanced by providing constructive feedback and, when necessary, extra guidance to the authors through the various stages of publication.
Our publication cycle is tailored to facilitate this process. The TFP model of publication, unlike the traditional conference publication model, produces an informal draft proceedings which is available at the symposium and a formal proceedings which is published post-symposium. For the draft proceedings we invite full-length papers without requiring that these papers go through a formal review process. This fosters opportunities for the latest research to be presented and openly discussed at the symposium. There is, however, a screening phase to ensure that submissions in the scope of TFP and of an acceptable academic standard. After the symposium, authors are given the opportunity to revise their papers before submitting to the formal review process. Before submitting to the formal review process, authors may take advantage of the feedback they received at the symposium to improve their papers. During the formal review process the program committee selects, using prevailing academic standards, the best papers that are publication-ripe to be included in the formal proceedings. At the discretion of the program committee, some papers may be shepherded to improve the presentation of a valuable contribution. Throughout the entire TFP publication cycle, the aim is to be as supportive as possible especially to new upcoming researchers.
As a testimony to our commitment of supporting early career researchers and to acknowledge their valuable contributions to new trends in our community, each year the program committee selects one submission as the best student paper. To be considered a student paper the majority of the work described in the submission must have been performed by the student. Co-authorship with senior peers, per se, does not prevent the paper from being considered a student paper.
Since 2012 we give out an overall best paper award:
- TFP'18:
"Improving Haskell"
Martin Handley and Graham Hutton
- TFP'17:
"Quickchecking Patricia Trees"
Jan Midtgaard
- TFP'16:
"Space-efficient Latent Contracts"
Michael Greenberg
- TFP'15:
"Lightweight Higher-Order Rewriting in Haskell"
Emil Axelsson and Andrea Vezzosi
- TFP'14:
"Resource Dependent Algebraic Effects"
Edwin Brady, University of St Andrews .
- TFP'13:
"Bytecode Closures"
Marco Morazan
- TFP'12:
"Combining Deep and Shallow Embedding for EDSL"
Josef Svenningsson and Emil Axelsson.
This award was sponsored by the European Association for Programming Languages and Systems (EAPLS).
Since 2014, we associate these awards with leaders in the functional programming community that had
a lasting impact on the development of functional programming languages.
- The student paper award is now called the David Turner award for the best student paper of TFP.
- The best paper award is now called the John McCarthy award for the best overall paper of TFP.
Our thanks go to David Turner and to the family of John McCarthy for supporting Trends in Functional Programming in this way.
Below is a list of the best student papers since 2004:
- TFP'18:
"Improving Haskell"
Martin Handley and Graham Hutton
- TFP'17:
"Automatically Introducing Tail Recursion in CakeML"
Oskar Abrahamsson
- TFP'16:
"Cactus Environment Machine: Shared Environment Call-by-Need"
George Stelle, Darko Stefanovic, Stephen Olivier and Stephanie Forrest
- TFP'15:
"Lightweight Higher-Order Rewriting in Haskell"
Emil Axelsson and Andrea Vezzosi
- TFP'14:
"Call Arity"
Joachim Breitner
Karlsruhe Institute Technology
- TFP'13:
"A Survey of Polyvariance in Control-Flow Analyses"
Thomas Gilray and Matthew Might
- TFP'12:
"The Blame Theorem for a Linear Lambda Calculus with Type Dynamic"
Luminous Fennell and Peter Thiemann
Institute for Computer Science, University of Freiburg
- TFP'11:
"Towards Modular Compilers for Effects"
Laurence E. Day and Graham Hutton
University of Nottingham
- TFP'10:
"Evaluating Call-By-Need on the Control Stack"
Stephen Chang, David Van Horn, and Matthias Felleisen
Northeastern University
- TFP'09:
"On Graph Rewriting, Reduction and Evaluation"
Ian Zerny
Department of Computer Science, Aarhus University
- TFP'08:
"Prediction of linear memory usage for first-order functional programs"
Brian Campbell
"Dependent Types for Distributed Arrays"
Wouter Swierstra, Thorsten Altenkirch
- TFP'07:
"Space-Efficient Gradual Typing"
David Herman and Aaron Tomb and Cormac Flanagan
- TFP'06:
"Extensible and modular generics for the masses"
Bruno C. D. S. Oliveira, Ralf Hinze, Andres Löh
"When is an abstract data type a functor?"
Pablo Nogueira
- TFP'05:
"A new approach to one-pass transformations"
Kevin Millikin
- TFP'04:
"Proof Support for General Type Classes"
Ron van Kesteren and Marko van Eekelen and Maarten de Mol