Sciweavers

ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...