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

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.
No file

Dates and versions

hal-02499348 , version 1 (05-03-2020)

Identifiers

  • HAL Id : hal-02499348 , version 1

Cite

Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain Péchoux. Tiered complexity at higher order. MLA'2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France. ⟨hal-02499348⟩
31 View
0 Download

Share

Gmail Facebook X LinkedIn More