Article Dans Une Revue Logical Methods in Computer Science Année : 2022

A tier-based typed programming language characterizing Feasible Functionals

Jean-Yves Marion

Résumé

The class of Basic Feasible Functionals BFF2 is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF2 based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the size of the program) of the type inference algorithm contrasts with the intractability of the aforementioned methods and does not overly constrain the expressive power of the language.
Fichier principal
Vignette du fichier
hkmplmcs.pdf (502.32 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03722168 , version 1 (13-07-2022)

Identifiants

Citer

Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion, Romain Péchoux. A tier-based typed programming language characterizing Feasible Functionals. Logical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩. ⟨hal-03722168⟩
101 Consultations
78 Téléchargements

Partager

More