A tier-based typed programming language characterizing Feasible Functionals

DOI10.1145/3373718.3394768OpenAlexW3028608028MaRDI QIDQ5145661

Jean-Yves Marion, Romain Péchoux, Emmanuel Hainry, Bruce M. Kapron

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11605

zbMATH Keywords

BFFcomplexitytype systemfeasible functionalstype-2tieringimplicit computational

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (3)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ Unnamed Item

This page was built for publication: A tier-based typed programming language characterizing Feasible Functionals