Skip to Main content Skip to Navigation
New interface
Conference papers

Tiered complexity at higher order

Emmanuel Hainry 1 Bruce Kapron 2 Jean-Yves Marion 3 Romain Péchoux 1 
1 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
3 CARBONE - Carbone
LORIA - FM - Department of Formal Methods
Abstract : A characterization of the class of Basic Feasible Functionals (BFF) is provided in terms of typable and terminating imperative programs with oracles. The type system is a tier-based type system and type inference can be done in polynomial time.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Friday, March 6, 2020 - 11:41:10 AM
Last modification on : Sunday, June 26, 2022 - 2:47:42 AM
Long-term archiving on: : Sunday, June 7, 2020 - 1:42:30 PM


paper 9.pdf
Files produced by the author(s)


  • HAL Id : hal-02499318, version 1



Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain Péchoux. Tiered complexity at higher order. DICE-FOPARA 2019 - Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis, Apr 2019, Praha, Czech Republic. ⟨hal-02499318⟩



Record views


Files downloads