Download PDFOpen PDF in browser

Higher order interpretation for higher order complexity

17 pagesPublished: May 4, 2017

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

Keyphrases: basic feasible functionals, Higher-order complexity, interpretations

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 269--285

Links:
BibTeX entry
@inproceedings{LPAR-21:Higher_order_interpretation_for,
  author    = {Emmanuel Hainry and Romain P\textbackslash{}'echoux},
  title     = {Higher order interpretation for higher order complexity},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  pages     = {269--285},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/7F},
  doi       = {10.29007/1tkw}}
Download PDFOpen PDF in browser