Higher-order interpretations for higher-order complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Higher-order interpretations for higher-order complexity

Abstract

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.
Fichier principal
Vignette du fichier
lpar.pdf (455.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01529170 , version 1 (30-05-2017)
hal-01529170 , version 2 (30-05-2017)

Identifiers

  • HAL Id : hal-01529170 , version 2

Cite

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⟩
178 View
79 Download

Share

Gmail Facebook X LinkedIn More