ECOOP 2015
Sun 5 - Fri 10 July 2015 Prague, Czech Republic
Thu 9 Jul 2015 14:00 - 14:30 at Bohemia - Type Systems Chair(s): Peter Müller

In a distributed system, local access is much faster than remote access. As a help to programmers, some languages require every access to be local. A program in those languages can access remote data via first a shift of the place of computation and then a local access. To enforce this discipline, researchers have presented type systems that determine whether every access is local and every place shift is appropriate. However, those type systems fall short of handling a common programming pattern that we call place-oblivious objects. Such objects safely access other objects without knowledge of their place. In response, we present the first type system for place-oblivious objects along with an efficient inference algorithm and a proof that inference is P-complete. Our example language extends the Abadi-Cardelli object calculus with place shift and existential types, and our implementation has inferred types for some microbenchmarks.

Thu 9 Jul
Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

13:30 - 15:00: Type SystemsResearch Track at Bohemia
Chair(s): Peter MüllerETH Zurich
13:30 - 14:00
Research Track
Yuheng LongIowa State University, Yu David LiuState University of New York (SUNY) Binghamton, Hridesh RajanIowa State University
14:00 - 14:30
Research Track
Riyaz HaqueUniversity of California, Los Angeles (UCLA), Jens PalsbergUniversity of California, Los Angeles
14:30 - 15:00
Research Track
Johannes KloosMPI-SWS, Rupak MajumdarMPI-SWS, Viktor VafeiadisMPI-SWS, Germany