============================================================ *** CALL FOR PARTICIPATION ***
LOLA 2010 Syntax and Semantics of Low Level Languages Friday 9th July 2010, Edinburgh, UK A LICS 2010-affiliated workshop at FLoC 2010 http://lola.pps.jussieu.fr/ ============================================================ IMPORTANT DEADLINES: * early registration deadline: 17 May 2010 * standard registration: 18 May 2010 - 30 June 2010 * late registration: after 30 June 2010 Registration, accomodation, and travel/visa information for all FLoC conferences and workshops is on the FLoC 2010 web pages: http://www.floc-conference.org/ WORKSHOP PROGRAMME: INVITED TALKS: * Gérard Berry (INRIA, Collège de France). What could be the right balance between abstract and fine-grain computational properties? * Dan Ghica (University of Birmingham). Geometry of Synthesis: Semantics-directed hardware compilation. * Alex Simpson (LFCS, University of Edinburgh). Linear types for continuations. CONTRIBUTED TALKS: * Magnus O. Myreen & Michael J. C. Gordon. Machine code: architecture-independent formal verification and proof-producing compilation. * Ugo Dal Lago On the Role of Interaction in Implicit Computational Complexity. * Nick Benton & Chung-Kil Hur. Step-Indexing: The Good, the Bad and the Ugly. * Guilhem Jaber & Nicolas Tabareau. Krivine realizability for compiler correctness. * Shin-ya Katsumata & Rasmus Mogelberg. Fullness of monadic translation by TT-lifting. * Rasmus Mogelberg & Sam Staton. Full abstraction in a metalanguage for state. * Antoine Madet & Roberto Amadio & Patrick Baillot. An Affine-Intuitionistic System of Types and Effects: Confluence and Termination. * Nathaniel Charlton & Bernhard Reus. A deeper understanding of the deep frame axiom. ALL THIS, PLUS: a thrilling panel discussion! DESCRIPTION OF THE WORKSHOP: It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in the various aspects of the relationship between logic and low level languages and programs. LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants. PROGRAMME COMMITTEE: * Amal Ahmed (Indiana University) * Nick Benton (MSR Cambridge, co-chair) * Lars Birkedal (IT University of Copenhagen) * Dan Ghica (University of Birmingham) * Paul-Andre Mellies (CNRS & University Paris Diderot, co-chair) * François Pottier (INRIA Rocquencourt) * Ulrich Schoepp (LMU Munich) * Hayo Thielecke (University of Birmingham) _______________________________________________ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs