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

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 18, Issue 1; no. 1
Main Authors:	Hainry, Emmanuel, Kapron, Bruce M., Marion, Jean-Yves, Péchoux, Romain
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 24.02.2022 Logical Methods in Computer Science e.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!