Tiered complexity at higher order - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Tiered complexity at higher order

Jean-Yves Marion


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.
Fichier principal
Vignette du fichier
paper 9.pdf (265.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02499318 , version 1 (06-03-2020)


  • 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⟩
98 View
47 Download


Gmail Facebook X LinkedIn More