Characterizing complexity classes by higher type primitive recursive definitions
- 22 June 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 100 (1) , 45-66
- https://doi.org/10.1016/0304-3975(92)90363-k
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Characterizing complexity classes by general recursive definitions in higher typesPublished by Springer Nature ,2005
- Algebras of feasible functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raisingThe Journal of Symbolic Logic, 1982
- LCF considered as a programming languageTheoretical Computer Science, 1977