nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A type-based complexity analysis of Object Oriented programs
|
Hainry, Emmanuel |
|
2018 |
261 |
P1 |
p. 78-115 |
artikel |
2 |
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
|
Baillot, Patrick |
|
2018 |
261 |
P1 |
p. 55-77 |
artikel |
3 |
Complexity bounds for container functors and comonads
|
Orchard, Dominic |
|
2018 |
261 |
P1 |
p. 144-158 |
artikel |
4 |
Editorial Board
|
|
|
2018 |
261 |
P1 |
p. ii |
artikel |
5 |
From Jinja bytecode to term rewriting: A complexity reflecting transformation
|
Moser, Georg |
|
2018 |
261 |
P1 |
p. 116-143 |
artikel |
6 |
On sharing, memoization, and polynomial time
|
Avanzini, Martin |
|
2018 |
261 |
P1 |
p. 3-22 |
artikel |
7 |
Paths-based criteria and application to linear logic subsystems characterizing polynomial time
|
Perrinel, Matthieu |
|
2018 |
261 |
P1 |
p. 23-54 |
artikel |
8 |
Special issue – Developments in implicit computational complexity, 2014 and 2015
|
Gaboardi, Marco |
|
2018 |
261 |
P1 |
p. 1-2 |
artikel |