On the Computational Complexity of Type 2 Functionals

Authors:
Elena Pezzoli
Affiliations:
-
Venue:
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Year:
1997

Citing 0
Cited 4

Theories with self-application and computational complexity

Information and Computation
On characterizations of the basic feasible functionals, Part I

Journal of Functional Programming
A proof-theoretic characterization of the basic feasible functionals

Theoretical Computer Science
Feasible functions over co-inductive data

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.04

Visualization

Abstract