A tier-based typed programming language characterizing Feasible Functionals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

A tier-based typed programming language characterizing Feasible Functionals

Jean-Yves Marion

Abstract

The class of Basic Feasible Functionals BFF 2 is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF 2 based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the size of the program) of the type inference algorithm contrasts with the intractability of the aforementioned methods and does not restrain strongly the expressive power of the language.
Fichier principal
Vignette du fichier
bff-lics.pdf (587.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02881308 , version 1 (25-06-2020)

Identifiers

Cite

Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain Péchoux. A tier-based typed programming language characterizing Feasible Functionals. LICS '20 - 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩. ⟨hal-02881308⟩
117 View
320 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More