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 the call for papers for more details.
This year, the event is taking place in-person at UMass Boston. It will be a 4-day event, with TFPIE taking place Thurs Jan 12, followed by TFP on Fri Jan 13 - Sun Jan 15.
TFP offers a friendly and constructive reviewing process designed to help less experienced authors succeed, with an opportunity for two rounds of review, both before and after the symposium itself. Authors thus have an opportunity to address reviewers’ concerns before the final decision on publication in the Proceedings is taken, in the light of previous reviews and discussions at the symposium.
TFP offers two “best paper” awards, the John McCarthy award for best paper, and the David Turner award for best student paper.
Register in advance using the following link:
Reach: A Language for DApp Development
Reach is a functionally-inspired programming language and platform for developing decentralized applications (DApps) that aspires to be the smartest, fastest, and safest way to build. In this talk, we explain DApp development and what Reach provides for it. We discuss a few interesting theoretical parts, as well as the practical aspects of deploying a new language in an active industry, acquiring thousands of users, and managing millions of dollars of assets. Reach is implemented with Haskell, Z3, TypeScript, and glorious shell scripts.
Jay McCarthy is the technical side of the pair that founded Reach. Previously, he has been a professor of Computer Science at UMass Lowell and Brigham Young University. He is also part of the Racket Project Leadership Committee.
Applying Cryptography’s Real/Ideal Paradigm to PL Security
The Real/Ideal Paradigm is the standard approach for defining security in theoretical cryptography. In this paradigm, the real and ideal worlds are parameterized by an adversary with certain powers of observation or corruption. The real world is a model of an actual protocol/system. The ideal world consists of an ideal functionality with the same API as the real world, but which is connected with a simulator whose job is to try to convince the adversary it is interacting with the real world, but where the simulator must work with the limited information leaked to it by the ideal functionality. If the adversary can only tell the difference between the real and ideal worlds with negligible probability, we say the real world is secure.
Beginning with a paper I presented at PLAS’14, I’ve been arguing in favor of using the real/ideal paradigm for defining security in a programming languages context, even when systems are entirely non-probabilistic. E.g., even though a system might be implemented using information flow control, its definition of security could be given using the real/ideal paradigm. I will illustrate this approach using the two party game Battleship, giving a definition of when one player is secure against a possibly malicious opponent, and showing two secure implementations, one using information flow control (Haskell/LIO), and one using access control in Concurrent ML.
Alley Stoughton is a research professor at Boston University. She earned her doctorate in computer science from University of Edinburgh in 1987, and has a background in programming language semantics and functional programming. But in recent years her focus has been on security, mainly using the EasyCrypt proof assistant to prove the security of cryptographic protocols.
A New Book on Programming Languages. Why?
Norman Ramsey is an associate professor in the Department of Computer Science at Tufts University, which he joined after eight years as an assistant and associate professor at Harvard University. He has also held faculty appointments at the University of Virginia and at Purdue University, as well as research positions at Bellcore, Bell Labs, and Microsoft Research. He was a Hertz Fellow and an Alfred P. Sloan Research Fellow. Ramsey’s work spans the range from theory to practice and covers topics in both programming languages and software engineering. He is best known for work on low-level programming-language infrastructure: code generation, debugging, linking, binary translation, register allocation, and so on.
He has taught programming languages and functional programming for over 25 years, and in 2015 he received Tufts University’s Lerman-Neubauer Prize for Outstanding Teaching and Advising.
|Submission deadline: pre-symposium, full papers|
|Submission deadline: pre-symposium, draft papers|
|Notification: pre-symposium submissions|
|Submission deadline: post-symposium review||Friday 17th February, 2023|
|Notification: post-symposium submissions||Friday 31st March, 2023|
|Peter Achten||Radboud University Nijmegen, Netherlands|
|Nada Amin||Harvard University, USA|
|Ambrose Bonnaire-Sergeant||Untypable LLC, USA|
|Laura M. Castro||University of A Coruña, Spain|
|Stephen Chang (Chair)||University of Massachusetts Boston, USA|
|John Clements||Cal Poly, USA|
|Youyou Cong||Tokyo Institute of Technology, Japan|
|Paul Downen||University of Massachusetts Lowell, USA|
|Kathy Gray||Meta Platforms, Inc., UK|
|Ben Greenman||University of Utah, USA|
|Jason Hemann||Seton Hall University, USA|
|Patricia Johann||Appalachian State University, USA|
|Alexis King||Tweag, USA|
|Julia Lawall||Inria-Paris, France|
|Daniel Patterson||Northeastern University, USA|
|Barak Pearlmutter||Maynooth University, Ireland|
|Norman Ramsey||Tufts University, USA|
|Ilya Sergey||National University of Singapore, Singapore|
|Melinda Tóth||Eötvös Loránd University, Hungary|
|Ningning Xie||University of Toronto, Canada|
Call for Papers
The call for papers is here.
Past TFP conferences:    [Others]