Skip to Main content Skip to Navigation
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 metadatas
Contributor : Romain Péchoux <>
Submitted on : Thursday, March 5, 2020 - 10:58:11 AM
Last modification on : Tuesday, May 5, 2020 - 5:02:15 PM


  • HAL Id : hal-02499348, version 1



Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain Péchoux. Tiered complexity at higher order. MLA 2019 (Mathematical Logic and its Applications), Mar 2019, Nancy, France. ⟨hal-02499348⟩



Record views