Higher-order interpretations for higher-order complexity

Emmanuel Hainry (1) , Romain Péchoux (1)

1 CARTE - Theoretical adverse computations, and safety

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 à 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.

Mots clés: Basic Feasible Functionals; higher-order interpretation; higher-order programs

Domaines: Complexité [cs.CC]

Emmanuel Hainry, Romain Péchoux. Higher-order interpretations for higher-order complexity. LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Geoff Sutcliffe, May 2017, Maun, Botswana. pp.269-285. ⟨hal-01529170v2⟩