nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A combination framework for complexity
|
Avanzini, Martin |
|
2016 |
248 |
C |
p. 22-55 34 p. |
artikel |
2 |
A semantic account of strong normalization in linear logic
|
de Carvalho, Daniel |
|
2016 |
248 |
C |
p. 104-129 26 p. |
artikel |
3 |
A type assignment for λ-calculus complete both for FPTIME and strong normalization
|
De Benedetti, Erika |
|
2016 |
248 |
C |
p. 195-214 20 p. |
artikel |
4 |
Bounded Combinatory Logic and lower complexity
|
Redmond, Brian F. |
|
2016 |
248 |
C |
p. 215-226 12 p. |
artikel |
5 |
Computation by interaction for space-bounded functional programming
|
Dal Lago, Ugo |
|
2016 |
248 |
C |
p. 150-194 45 p. |
artikel |
6 |
Editorial Board
|
|
|
2016 |
248 |
C |
p. IFC- 1 p. |
artikel |
7 |
Editorial Board
|
|
|
2016 |
248 |
C |
p. i- 1 p. |
artikel |
8 |
Higher-order interpretations and program complexity
|
Baillot, Patrick |
|
2016 |
248 |
C |
p. 56-81 26 p. |
artikel |
9 |
Logarithmic space and permutations
|
Aubert, Clément |
|
2016 |
248 |
C |
p. 2-21 20 p. |
artikel |
10 |
Preface
|
Ronchi Della Rocca, Simona |
|
2016 |
248 |
C |
p. 1- 1 p. |
artikel |
11 |
The role of polymorphism in the characterisation of complexity by soft types
|
Chrząszcz, Jacek |
|
2016 |
248 |
C |
p. 130-149 20 p. |
artikel |
12 |
Two function algebras defining functions in NC k boolean circuits
|
Bonfante, Guillaume |
|
2016 |
248 |
C |
p. 82-103 22 p. |
artikel |