A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations

DOI10.46298/LMCS-21(4:19)2025MaRDI QIDQ6858434zbMATH OpenFDO

Authors Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale

Publication date 13 February 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

implicit computational complexityhigher-order term rewritingbasic feasible functionstuple interpretation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Functionals in proof theory (03F10)

This page was built for publication: A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858434)