---------------------------------------------------------------------- CALL FOR PARTICIPATION
HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks and contributed talks on work in progress. ------------ Registration ------------ Web site: https://regmaster3.com/2013conf/ICFP13/register.php This is the registration site for ICFP 2013 and all the affiliated workshops including HOPE 2013. ---------------- Workshop Program ---------------- We received 20 high-quality submissions for talk proposals this year, from which the program committee decided to accept 10 for presentation at the workshop. The talks will be video-recorded, and the recordings will be made available here after the workshop. Also this year, the workshop will feature a special session in memory of John Reynolds. The session will include talks from Olivier Danvy, Robert Harper, Peter O'Hearn, and Uday Reddy, with a mixture of scientific and personal reflections on John's life and work. This special session is sponsored in part by a generous donation from Microsoft Research. Session 1: Concurrent Program Logics 9:00 Impredicative Concurrent Abstract Predicates Kasper Svendsen and Lars Birkedal 9:30 Subjective Concurrent Protocol Logic Aleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, and German Andres Delbianco 10:00 Protocols for Protocols: Using Modal Separation Logic to Prove Extrinsic Properties of Secure Communication David Swasey, Derek Dreyer, Deepak Garg, Robert Harper, and Aaron Turon 10:30 Coffee Break Session 2: Semantics 11:00 A Kripke Logical Relation for Affine Functions: The Story of a Free Theorem in the Presence of Non-termination Phillip Mates and Amal Ahmed 11:30 Deconstructing General References via Game Semantics Andrzej Murawski and Nikos Tzevelekos 12:00 Linking Isn't Substitution Jeremy Siek 12:30 Lunch (NOTE: only one hour for lunch) Session 3: Special Session in Memory of John Reynolds 1:30 Olivier Danvy 2:00 Robert Harper 2:30 Peter O'Hearn 3:00 Uday Reddy 3:30 Coffee Break Session 4: Types and Verification 4:00 Refinement Types and Algebraic Effects Danel Ahman 4:30 Adventures in Knot-Tying while Verifying a Thread Library in Coq Adam Chlipala 5:00 The Ins and Outs of Iteration in Mezzo Armael Gueneau, Francois Pottier, and Jonathan Protzenko 5:30 Attacking the Imperative Relationship Update Problem with Almost Everywhere Heap Invariants Devin Coughlin and Bor-Yuh Evan Chang --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale)
_______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell