2009 Proceeding- Program Chair:
- Andreas Rossberg
- Sponsor:
- sigplan
We are pleased to welcome you to the 2009 ACM-SIGPLAN Workshop on ML -- ML 2009. ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology, that is, higher-order, typed, or strict programming languages.
The 2009 Workshop on ML is held in conjunction with the 14th ACM-SIGPLAN International Conference on Functional Programming (ICFP 2009) in Edinburgh, Scotland, UK. Previous instances were ML 2005 in Tallinn, Estonia, ML 2006 in Portland, Oregon, USA, ML 2007 in Freiburg, Germany, and ML 2008 in Victoria, British Columbia, Canada).
The call for papers attracted 11 submissions from Europe, the United States, Asia, and New Zealand. Each paper was reviewed by at least three international referees. After a 4-day electronic meeting, the program committee accepted 6 papers for presentation at the workshop. One PC submission was received but not accepted.
In addition to regular papers, this year's workshop features an informal demo track for live demonstrations of software written in or for ML. We received 11 submissions of demo proposals, out of which the program committee selected the best for presentation.
The program committee is also happy to have an invited talk by Cédric Fournet, researcher in security and distributed systems in the Programming Principles and Tools group at Microsoft Research Cambridge, and project leader at the MSR-INRIA Joint Center in Orsay, France. An abstract of his talk is included in these proceedings.
Finally, we will have a panel discussion on Future Directions of ML, to which we invited leading researchers in the field. It is our hope that it will inspire fruitful discussion about future directions for research into ML and evolution of the ML family of programming languages.
Proceeding Downloads
A cryptographic protocol compiler for multiparty sessions
We present the design and implementation of a verifying compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols.
Our sessions specify pre-arranged patterns of message exchanges and data accesses between ...
QML: explicit first-class polymorphism for ML
Recent years have seen a revival of interest in extending ML's predicative type inference system with impredicative quantification in the style of System F, for which type inference is undecidable. This paper suggests a modest extension of ML with ...
Greedy bidirectional polymorphism
Bidirectional typechecking has become popular in advanced type systems because it works in many situations where inference is undecidable. In this paper, I show how to cleanly handle parametric polymorphism in a bidirectional setting. The key ...
Correctly translating concurrency primitives
Motivated by the question of correctness of a specific implementation of concurrent buffers in the lambda calculus with futures underlying Alice ML, we prove that concurrent buffers and handled futures can correctly encode each other. Our translations ...
Who: a verifier for effectful higher-order programs
We present Who, a tool for verifying effectful higher-order functions. It features Effect polymorphism, higher-order logic and the possibility to reason about state in the logic, which enable highly modular specifications of generic code. Several small ...
Direct implementation of shift and reset in the MinCaml compiler
Although delimited control operators are becoming one of the useful tools to manipulate flow of programs, their direct and compiled implementation in a low-level language has not been proposed so far. The only direct and low-level implementations ...
Fast and sound random generation for automated testing and benchmarking in objective Caml
Numerous software testing methods involve random generation of data structures. However, random sampling methods currently in use by testing frameworks are not satisfactory: often manually written by the programmer or at best extracted in an ad-hoc way ...
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| ML '09 | 11 | 6 | 55% |
| Overall | 11 | 6 | 55% |