[Haskell] MSFP - early registration: 30 August

Venanzio Capretta vxc at Cs.Nott.AC.UK
Fri Aug 27 04:32:09 EDT 2010

Early registration for MSFP closes on 30 August.
To register, please use the ICFP registration page:

Third Workshop on
25 September 2010,  Baltimore, Maryland, USA
A satellite workshop of ICFP 2010

The workshop on Mathematically Structured Functional Programming 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. Monadic programming 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.

The first MSFP workshop was held in Kuressaare, Estonia, in July 2006.
Selected papers were published as a special issue of the Journal of
Functional Programming (volume 19, issue 3-4).
The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP


9:00 - 10:00 Invited talk: Amy Felty,
             "Hybrid: Reasoning with Higher-Order Abstract Syntax
              in Coq and Isabelle"
10:00 - 10:30 break
10:30 - 11:00 Chantal Keller and Thorsten Altenkirch,
              "Normalization by hereditary substitutions"
11:00 - 11:30 Paul Tarau, 
              "Hereditarily finite representations of natural numbers
               and self delimiting codes"
11:30 - 12:30 Tutorial: Adam Chlipala,
              "Foundational Program Verification in Coq
               with Automated Proofs"
12:30 - 2:00 lunch break
2:00 - 3:00 Invited talk: Martín Escardó,
            "What Tic-Tac-Toe, the Tychonoff Theorem,
             and the Double-Negation Shift have in common"
3:00 - 3:30 break
3:30 - 4:00 Kazuyuki Asada, "Arrows are Strong Monads"
4:00 - 4:30 Adam Gundry, Conor McBride and James McKinna,
            "Type inference in context"
4:30 - 5:00 break
5:00 - 6:00 Tutorial: Peter Morris, "Epigram Prime: A Demonstration"

Workshop homepage:
Registration link:
Local arrangements:

More information about the Haskell mailing list