********************************************************************* CALL FOR PARTICIPATION HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects Sunday, September 9, 2012 Copenhagen, Denmark To be held in conjunction with ICFP 2012 http://hope2012.mpi-sws.org ********************************************************************* IMPORTANT DATES Early registration deadline: August 9, 2012 *** only days away! *** Hotel reservation deadline: August 9, 2012 (for most hotels) VENUE HOPE 2012 and all ICFP'12 affiliated events will take place at DGI-byen's conference center - CPH Conference, Tietgensgade 65, DK 1704 Copenhagen V. More information at: http://icfpconference.org/icfp2012/local.html HOPE 2012 HOPE is a *new workshop* that is intended to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. There were 21 talk submissions, of extraordinarily high quality. As the workshop is only one day long, we were only able to accept 13 of them for presentation at the workshop. So there will be 13 contributed talks, but no invited talks or other sessions. We expect this to be a very high-octane workshop! PROGRAM The program is included at the end of this email; it can also be found here: http://hope2012.mpi-sws.org/ PROGRAM CHAIRS Amal Ahmed (Northeastern University) Derek Dreyer (MPI-SWS, Germany) PROGRAM COMMITTEE Jim Laird (University of Bath) Rasmus Møgelberg (IT University of Copenhagen) Greg Morrisett (Harvard University) Aleks Nanevski (IMDEA Software Institute) David Naumann (Stevens Institute of Technology) Matthew Parkinson (Microsoft Research Cambridge) François Pottier (INRIA Rocquencourt) Amr Sabry (Indiana University) Eijiro Sumii (Tohoku University) Nikhil Swamy (Microsoft Research Redmond) Nobuko Yoshida (Imperial College London) PRELIMINARY PROGRAM SUNDAY, September 9, 2012 Session 1: Verification 9:00 Modular Specification and Verification of Delegation with SMT Solvers Ioannis Kassios, Peter Müller 9:30 On Higher-Order Separation Logic for Higher-Order Concurrent Imperative Programs Kasper Svendsen, Lars Birkedal, Matthew Parkinson 10:00 Verifying an Open Compiler from ML to Assembly James T. Perconti, Amal Ahmed 10:30 BREAK Session 2: Monads and More 11:00 Handlers in Action Ohad Kammar, Sam Lindley, Nicolas Oury 11:30 Contract Monitoring as an Effect Zachary Owens 12:00 HOPE for a Type-Theoretic Understanding of Zero-Knowledge Noam Zeilberger 12:30 LUNCH Session 3: Types and Effects 2:00 Koka: A Language with Row-Polymorphic Effect Inference Daan Leijen 2:30 Effects for Funargs Jeremy Siek, Michael Vitousek, Jonathan Turner 3:00 Generative Names and Dependent Types Andrew Pitts 3:30 BREAK Session 4: Logical Relations and Parametricity 4:00 Logical Relations for Fine-Grained Concurrency Aaron Turon, Jacob Thamsborg, Amal Ahmed, Lars Birkedal, Derek Dreyer 4:30 Logical Relations for a Manifest Calculus, Fixed Taro Sekiyama, Atsushi Igarashi 5:00 Proof-Relevant Logical Relations Nick Benton, Martin Hofmann, Andrew Kennedy, Vivek Nigam 5:30 Two Theories of Information Hiding Uday Reddy