Published: 1st January 2012|
|Preface Jean-Yves Marion|
|Implicit complexity for coinductive data: a characterization of corecurrence Daniel Leivant and Ramyaa Ramyaa||1|
|Sublogarithmic uniform Boolean proof nets Clément Aubert||15|
|Provably Total Functions of Arithmetic with Basic Terms Evgeny Makarov||28|
|A type system for PSPACE derived from light linear logic Lucien Capdevielle||33|
This volume contains the proceedings of the Second International Workshop on Developments in Implicit Computational complExity (DICE 2011), which took place on April 2-3 2011 in Saarbruecken, Germany, as a satellite event of the Joint European Conference on Theory and Practice of Software, ETAPS 2011.
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 semantics 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.
The first DICE workshop was held in 2010 at ETAPS and published in EPTCS, volume 23.We have three invited speakers :
We accepted 12 papers: 6 full papers and 6 short papers. The program committee selected 4 articles for publication in the proceedings. DICE workshop received funds from 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.