A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations

The class of type-two basic feasible functionals ($\mathtt{BFF}_2$) is the analogue of $\mathtt{FP}$ (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments. $\mathtt{BFF}_2$ can be defined through Oracle Turing machines with runnin...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 21, Issue 4
Hlavní autoři:	Baillot, Patrick, Lago, Ugo Dal, Kop, Cynthia, Vale, Deivid
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 05.11.2025
Témata:	Computer Science Basic Feasible Functions Higher-Order Term Rewriting Tuple Interpretation Implicit Computational Complexity Higher-Order Term Rewriting Tuple Interpretation Basic Feasible Functions Implicit Computational Complexity
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!