A tier-based typed programming language characterizing Feasible Functionals

The class of Basic Feasible Functionals BFF$_2$ 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 complexi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 18, Issue 1; H. 1
Hauptverfasser:	Hainry, Emmanuel, Kapron, Bruce M., Marion, Jean-Yves, Péchoux, Romain
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 24.02.2022 Logical Methods in Computer Science e.V
Schlagworte:	Computation and Language Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!