EPTCS 75 - DICE 2011
Jean-Yves Marion (Ed.): Proceedings Second Workshop on Developments in Implicit Computational Complexity. 2011 EPTCS 75 [ contents ]- Daniel Leivant, Ramyaa Ramyaa: Implicit complexity for coinductive data: a characterization of corecurrence. ... 1-14
- Clément Aubert: Sublogarithmic uniform Boolean proof nets. ... 15-27
- Evgeny Makarov: Provably Total Functions of Arithmetic with Basic Terms. ... 28-32
- Lucien Capedevielle: A type system for PSPACE derived from light linear logic. ... 33-46
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team