[TYPES/announce] Developments in Implicit Computational complExity - DICE 2015 - Call for participation

[Marco Gaboardi (Staff)]

CALL FOR PARTICIPATION
DICE 2015 colocated with FOPARA 2015
Sixth workshop on Developments in Implicit Computational complExity
11-12 April 2015, London, UK
Affiliated to ETAPS
http://dice15.computing.dundee.ac.uk

DICE is a thematic workshop in the field of Implicit Computational Complexity,
where researchers in the area can meet and discuss their most recent results.

DICE 2015 will be colocated with FOPARA. The colocation will be an
occasion for strengthen the interactions between the community working
on Implicit Computational Complexity and the one working more broadly on
resource analysis.

**Registration**

Via the ETAPS Registration website
http://www.etaps.org/index.php/2015/registration

Normal-rate registration is until Tuesday, 10 March 2015.

**Invited Speakers DICE & FOPARA**

Deepak Garg - MPI-SWS

Kevin Hammond - University of St Andrews

Simona Ronchi Della Rocca - University of Torino

Jakob Grue Simonsen - DIKU

**Talks DICE & FOPARA**

May-Happen-in-Parallel Analysis with Condition Synchronization,
Elvira Albert, Antonio E. Flores Montoya and Samir Genaim.

A Dependent Type System for Energy Consumption Analysis,
Bernard van Gastel, Rody Kersten and Marko van Eekelen.

Implicit computational complexity in Object Oriented Programs,
Emmanuel Hainry and Romain Péchoux.

Higher-Order Complexity Analysis: Harnessing First-Order Tools
Martin Avanzini, Ugo Dal Lago and Georg Moser

Higher order interpretations for Basic Feasible Functions,
Emmanuel Hainry and Romain Péchoux.

Complexity bounds from abstract categorical models,
Dominic Orchard.

Extensional filters reveal algorithms,
Guillaume Bonfante, Jean-Yves Moyen and Pierre Boudes.

An algorithmic complete programming language for a large class of algorithms computable in polynomial time,
Pierre Valarcher and Yoann Marquer.

An in-between “implicit” and “explicit” complexity: Automata,
Clément Aubert.

Towards a Complexity-through-Realizability Theory
Thomas Seiller.

The probabilistic class PP,
Reinhard Kahle and Isabel Oitavem.

Implicit Computational Complexity of Subrecursive Cryptographic Reductions,
Patrick Baillot, Gilles Barthe and Ugo Dal Lago.

On Robinson style simplifications to the traditional bounded recursion on notation scheme,
Jostein Aanderaa.



The University of Dundee is a registered Scottish Charity, No: SC015096