Higher order interpretation for higher order complexity
We design an interpretation-based theory of higher-order functions that is well-suited for the complexity analysis of a standard higher- order functional language a` la ml. We manage to express the interpretation of a given program in terms of a least fixpoint and we show that when restricted to functions bounded by higher-order polynomials, they characterize exactly classes of tractable functions known as Basic Feasible Functions at any order.
2008 ◽
Vol 18
(5-6)
◽
pp. 865-911
◽
2001 ◽
Vol 12
(02)
◽
pp. 125-170
◽
Keyword(s):
1995 ◽
Vol 5
(1)
◽
pp. 1-35
◽
Keyword(s):