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

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 21, Issue 4
Main Authors:	Baillot, Patrick, Lago, Ugo Dal, Kop, Cynthia, Vale, Deivid
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 05.11.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!