Published: 5th May 2010|
|Preface Patrick Baillot|
|On Decidable Growth-Rate Properties of Imperative Programs Amir M. Ben-Amram||1|
|Observation of implicit complexity by non confluence Guillaume Bonfante||15|
|Church => Scott = Ptime: an application of resource sensitive realizability Aloïs Brunel and Kazushige Terui||31|
|General Ramified Recurrence is Sound for Polynomial Time Ugo Dal Lago, Simone Martini and Margherita Zorzi||47|
|Safe Recursion on Notation into a Light Logic by Levels Luca Roversi and Luca Vercelli||63|
This volume contains the proceedings of the International Workshop on Developments in Implicit Computational complExity (DICE 2010), which took place on March 27-28 2010 in Paphos, Cyprus, as a satellite event of the Joint European Conference on Theory and Practice of Software, ETAPS 2010.
Implicit Computational Complexity aims at studying computational complexity without referring to external measuring conditions or particular machine models, but instead by considering restrictions on programming languages or logical principles implying complexity properties. The aim of this workshop was to bring together researchers working on implicit computational complexity, from its logical and semantical aspects to those related to the static analysis of programs, so as to foster their interaction and to give newcomers an overview of the current trends in this area.
We had two invited talks, by:
The program committee was composed of:
In response to the call for papers we received 5 full paper submissions, which were all of high quality, and 7 proposals of short presentations. The program committee selected 4 articles for publication in the proceedings and 12 contributions for presentation at the workshop. Besides these contributed papers, the present proceedings also contain the invited article by Amir Ben-Amram.
The workshop turned out to be a lively and stimulating scientific event, and there were several interesting discussions. We would like to thank the authors of the submitted papers, the invited speakers, the members of the program committee, and their subreviewers for their work. We also want to acknowledge the help of George A. Papadopoulos, Anna Philippou and the whole Organizing Committee of ETAPS 2010, as well as the financial support of École Normale Supérieure de Lyon and of project ANR-08-BLANC-0211-01 "COMPLICE".
Finally, we would like to thank the Editorial Board of EPTCS, and Rob van Glabbeek for publishing these proceedings and for his help during the preparation.
DICE 2010 program chair.