Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Theory of Higher Order Interpretations and Application to Basic Feasible Functions

Emmanuel Hainry 1 Romain Péchoux 1
1 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional language. We develop a theory of higher order functions that is well-suited for the complexity analysis of this programming language. The interpretation domain is a complete lattice and, consequently, we express program interpretation in terms of a least fixpoint. As an application, by bounding interpretations by higher order polynomials, we characterize Basic Feasible Functions at any order.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-02499206
Contributor : Romain Péchoux <>
Submitted on : Thursday, March 5, 2020 - 10:14:50 AM
Last modification on : Saturday, March 7, 2020 - 1:15:38 AM
Long-term archiving on: : Saturday, June 6, 2020 - 1:15:10 PM

File

journal.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Emmanuel Hainry, Romain Péchoux. Theory of Higher Order Interpretations and Application to Basic Feasible Functions. 2020. ⟨hal-02499206⟩

Share

Metrics

Record views

64

Files downloads

59