A tier-based typed programming language characterizing Feasible Functionals

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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Logical methods in computer science Ročník 18, Issue 1; číslo 1
Hlavní autoři:	Hainry, Emmanuel, Kapron, Bruce M., Marion, Jean-Yves, Péchoux, Romain
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 24.02.2022 Logical Methods in Computer Science e.V
Témata:	Computation and Language Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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 overly constrain the expressive power of the language.
ISSN:	1860-5974 1860-5974
DOI:	10.46298/lmcs-18(1:33)2022