Login / Signup
DICE
2011
2011
2011
Keyphrases
Publications
2011
Evgeny Makarov
Provably Total Functions of Arithmetic with Basic Terms
DICE
(2011)
Lucien Capedevielle
A type system for PSPACE derived from light linear logic
DICE
(2011)
Clément Aubert
Sublogarithmic uniform Boolean proof nets
DICE
(2011)
Daniel Leivant
,
Ramyaa Ramyaa
Implicit complexity for coinductive data: a characterization of corecurrence
DICE
(2011)
volume 75, 2011
Proceedings Second Workshop on Developments in Implicit Computational Complexity, Saarbrücken, DICE 2011, Germany, April 2nd and 3rd, 2011.
DICE
75 (2011)
2010
Aloïs Brunel
,
Kazushige Terui
Church => Scott = Ptime: an application of resource sensitive realizability
DICE
(2010)
Guillaume Bonfante
Observation of implicit complexity by non confluence
DICE
(2010)
Amir M. Ben-Amram
On Decidable Growth-Rate Properties of Imperative Programs
DICE
(2010)
Luca Roversi
,
Luca Vercelli
Safe Recursion on Notation into a Light Logic by Levels
DICE
(2010)
Ugo Dal Lago
,
Simone Martini
,
Margherita Zorzi
General Ramified Recurrence is Sound for Polynomial Time
DICE
(2010)
volume 23, 2010
Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010.
DICE
23 (2010)