2010 Proceeding- General Chairs:
- Venanzio Capretta,
- James Chapman
- Sponsor:
- sigplan
It is our great pleasure to welcome you to the third workshop on Mathematically Structured Functional Programming (MSFP 2010). This year, MSFP is affiliated with the International Conference on Functional Programming (ICFP) and takes place in Baltimore, Maryland (US) on 25 September.
MSFP is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadicprogramming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control.
We selected four high-quality articles from all the submitted papers. Each one was thoroughly refereed by at least three experts in the relevant field. In addition we invited two leading researchers, Amy Felty and Martín Escardó, to give overview talks in two important areas of the mathematical foundation of functional programming. Finally, we asked two experts, Adam Chlipala and Peter Morris, to give tutorials on two major systems based on dependently typed functional programming.
Thus, this year's workshop offers an exciting mixture of different kinds of contributions, all of exceptional quality. We hope that you will gain an enlightening vista of one of the most fertile area of research in theoretical computer science.
Proceeding Downloads
Hybrid: reasoning with higher-order abstract syntax in coq and isabelle
We present recent work on the Hybrid system, a logical framework for specifying and reasoning about languages and deductive systems. One of the main areas of application of this system is developing formal proofs of properties of programming languages. ...
Hereditary substitutions for simple types, formalized
We analyze a normalization function for the simply typed λ-calculus based on hereditary substitutions, a technique developed by Pfenning et al. The normalizer is implemented in Agda, a total language where all programs terminate. It requires no ...
Hereditarily finite representations of natural numbers and self-delimiting codes
Using a bijection between natural numbers and hereditarily finite functions we derive a new reversible variable length self-delimiting code through a bitstring representation in a balanced parenthesis language. The code features the ability to encode ...
Foundational program verification in Coq with automated proofs
Most people who know of the proof assistant Coq associate it with long, manual proofs via tactic scripts. In contrast, classical verification tools, based on automated theorem-provers for first-order logic, are well established as supporting program ...
What sequential games, the tychonoff theorem and the double-negation shift have in common
This is a tutorial for mathematically inclined functional programmers, based on previously published, peered reviewed theoretical work. We discuss a higher-type functional, written here in the functional programming language Haskell, which (1) optimally ...
Arrows are strong monads
Hughes' arrows were shown, by Jacobs et al., to be roughly monads in the bicategory Prof of profunctors (distributors, modules). However in their work as well as others', the categorical nature of the first operator was not pursued and its formulation ...
Type inference in context
We consider the problems of first-order unification and type inference from a general perspective on problem-solving, namely that of information increase in the problem context. This leads to a powerful technique for implementing type inference ...
Epigram prime: a demonstration
It would not be too much of a stretch to imagine that dependent types will be the next big thing in programming language research. The key benefit is that by allowing types to be indexed by data, it is possible to expose more and more of the structure ...
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| MSFP '10 | 8 | 4 | 50% |
| Overall | 8 | 4 | 50% |