A tier-based typed programming language characterizing Feasible Functionals

DOI10.1145/3373718.3394768MaRDI QIDQ5145661zbMATH OpenOpenAlexFDO

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

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, https://hal.inria.fr/hal-02881308/file/bff-lics.pdf

zbMATH Keywords

BFFcomplexitytype systemfeasible functionalstype-2tieringimplicit computational

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• A tier-based typed programming language characterizing feasible functionals
• On characterizations of the basic feasible functionals. I
• Complete and tractable machine-independent characterizations of second-order polytime
• scientific article; zbMATH DE number 176200

Cited in

(7)

• High-level modelling for typed functional programming
• An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
• A tier-based typed programming language characterizing feasible functionals
• Complete and tractable machine-independent characterizations of second-order polytime
• On basic feasible functionals and the interpretation method
• \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
• scientific article; zbMATH DE number 4002073 (Why is no real title available?)

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

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