Higher-order interpretations for higher-order complexity - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Higher-order interpretations for higher-order complexity

Résumé

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 (459.28 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01529170 , version 1

Citer

Emmanuel Hainry, Romain Péchoux. Higher-order interpretations for higher-order complexity. LPAR, Geoff Sutcliffe, May 2017, Maun, Botswana. pp.17. ⟨hal-01529170v1⟩
179 Consultations
80 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More