![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
2nd DICE 2011: Saarbrücken, Germany
- Jean-Yves Marion:
Proceedings Second Workshop on Developments in Implicit Computational Complexity, Saarbrücken, DICE 2011, Germany, April 2nd and 3rd, 2011. EPTCS 75, 2011 - 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
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.